Meg CS Model - Exit - Exams D
Meg CS Model - Exit - Exams D
Faculty of Informatics
Department of Computer Science
Model Exit Exam II CODE MG-002
SENE, 2015
Name _________________________ Time allotted: 1:40 Hrs
ID.No._________________________
Model Exit Exam Computer Science
S.N Theme Course Title Credit Hrs. Number of Questions
Software Engineering 3 6
1 Theme 1. System Development Web Programming 6 9
Database Systems 6 12
Total 3 15 27
Computer Programming 6 6
Theme 2. Programming and Object Oriented Programming 3 6
2
Algorithms
Design and Analysis of Algorithms 3 6
Data Structure and Algorithms 3 7
Total 4 15 25
Data Communication and Computer
3 6
Theme 3. Computer Networking
3
Networking and Security Computer Security 3 6
Network and System Administration 3 6
Total 3 9 18
Theme 4. Intelligent
4 Introduction to Artificial Intelligence 3 6
Systems
1 3 6
Theme 5. Computer Operating System 3 6
5 Architecture and Operating Computer organization and
Systems 3 6
architecture
Total 2 6 12
Formal Language and Complexity
Theme 6. Compiler and 3 6
6 Theory
Complexity
Compiler Design 3 6
2 6 12
Grand total 12 51 100
Instruction: Read the questions and choose the right answer from the given alternatives and
write the letter of your choice on the space provided at the separate answer sheet. (1 point
each)
Software Engineering
1. Which of the following is not a step of requirement engineering
A. Requirement Elicitation
B. Requirement Analysis
C. Requirement Design
D. Requirement Documentation
2|Page
A. Decrease levels of abstraction during design
B. Support reuse and enhancement
C. Performance may decrease
D. Hard to maintain
5. The document which produced during requirement specification is called
A. SRS
B. Software requirement specification
C. System requirement specification
D. All
6. Which one of the following requirements is not nonfunctional requirement
A. Performance
B. Cultural and political
C. Security
D. taking user input
3|Page
Web Programming
7. Internet service that allows individuals and organizations to make their website
accessible is __.
A. WWW
B. FTP
C. Web hosting
D. Data Center
8. A generic protocol that supports client requesting a document from the server and server
returning the requested documents is called___________.
A. DNS
B. TCP
C. HTTP
D. Telnet
9. How can you make a bulleted list?
A. <list>
B. <dl>
C. <ol>
D. <ul>
10. What is the correct HTML for making a drop-down list?
A. <select>
B. <input type="dropdown">
C. <input type="list">
D. <list>
11. What is the correct HTML for making a text area?
A. <input type="textarea">
B. <input type="textbox">
C. <textarea>
D. <input text="textbox">
12. What is the correct HTML for creating a hyperlink?
A. <a href="http://www.AdU.edu">adms</a>
B. <a name="http://www. AdU .edu"> admas.edu</a>
C. <a>http://www. AdU .edu</a>
D. <a url="http://www. AdU .edu">admas .edu</a>
13. A method used in PHP to encrypt data for security?
A. get()
B. md5()
C. post()
D. array()
14. Which function can be used to retrieve the values of the database
A. mysqli_connect()
B. mysqli_num_rows()
C. mysqli_fetech_assoc()
D. mysqli_query
15. How can we create new file in PHP
A. fopen()
B. fread()
C. fwrite()
D. fappend()
Database systems
16. Which of the following is not a level of data abstraction?
A. Physical Level
B. Logical Level
C. View Level
D. Critical Level
17. Which of the following provides the ability to query information from the
database and insert tuples into, delete tuples from, and modify tuples in the
database?
A. DML(Data Manipulation Language)
C. Query
D. Relational Schema
A. A Table
B. A Field
C. A Row
D. A Column
E. Foreign key
B. ALTER TABLE
C. MODIFY TRIGGER
D. ALTER TRIGGER
D. BCNF
A. Union
B. Project
C. Set Difference
D. Cartesian Product
22. What does ACID stand for in the context of DBMS transactions?
B. Read-Read conflict
D. Write-Read conflict
B. Query tree
C. Transaction management
D. Serializability
A. serial schedules
B. serializable schedules
C. recoverable schedules
27. Which type of lock still allows other transactions to have read-only access
to the locked resource?
A. two-phased lock
B. exclusive lock
C. explicit lock
D. shared lock
Computer Programming
28. Which of the following are not legal function declarations?
A. int ave3(int a, int b, int c);
B. int 3ave(int a, int b, intc);
A. Class Methods
B. Static Methods
C. Instance Methods
D. Interface Methods
39. Which concept of Java is achieved by combining methods and attribute into a class?
A. Encapsulation
B. Inheritance
C. Polymorphism
D. Abstraction
Computer Security
65. In the CIA Triad, which one of the following is not involved?
A. Availability
B. Confidentiality
C. Authenticity
D. Integrity
66. Which of the following is a type of malware that disguises itself as a legitimate program
to trick the user into downloading and installing it?
A. Trojan
A. Supervised learning
B. Unsupervised learning
C. Semi-supervised learning
D. Innate learning
Operating System
83. From items lists below, which one is the address generated by CPU?
A. physical address
B. logical address
C. absolute address
D. Static address
84. From the list blew, which algorithm is defined in Time quantum?
A. shortest job scheduling algorithm
B. priority scheduling algorithm
C. round robin scheduling algorithm
D. multilevel queue scheduling algorithm
85. From the Scheduling Algorithms Listed Below, Which scheduling algorithm allocates
the CPU first to the process that requests the CPU first?
A. round robin scheduling algorithm
B. first-come, first-served scheduling
C. shortest job scheduling
D. priority scheduling
86. In a system, there are several processes running in parallel. These processes are
accessing the same data set and the outcome of the execution depends on the particular
order in which the access takes place. What describes this situation best?
A. Race condition
B. Starvation
C. Deadlock
D. Synchronization
87. What is critical section?
A. A portion of code that manipulate shared resources/ variables
B. A portion of code that spends much time on CPU
C. A portion of code that must execute in parallel
D. A portion of code that is neither in the entry not exit sections.
88. During the course of execution, a process may create several new processes, The
creating process is called a _____
A. New Process
B. Child process
A. All sets of strings from ={a,b} that ends with substring abb.
B. All sets of strings from ={a,b} that starts with substring ab and ends with b.
C. All sets of strings from ={a,b} that starts with substring abb
D. All sets of strings from ={a,b} that starts with substring ab and ends with
bb
92. The regular expression representation for the language which is accepted by the DFA on
question number above
A. a(a+b)* B. ab(a+b)*b C. a(a+b)*bb D. abb(a+b)*b
93. From the list of alternatives below, Identify the one which is different?
A. Left linear grammar C. Right Linear Grammar
Compiler Design
95. What is a compiler?
A. system program that converts source code to target code.
B. system program that converts machine language to high-level language
C. system program that writes instructions to for compilation
D. system program that converts low-level language to high-level language
96. Which of the following is Not a phase of compiler design?
A. Semantic analysis
B. Intermediate code generator
C. Code generator
D. Interpreter
97. What is the output of lexical analyzer?
A. Machine code
B. Parse tree
C. Stream of tokens
D. Intermediate code
98. A process of replacing a variable name by choices on the right-hand side of grammar
rules is:
A. Derivation
B. Flow graph
C. Ambiguity
D. Precedence
99. From the following list which one is not primary tasks of code generator?
A. Register allocation
B. instruction selection
C. Variables declaration
D. instruction ordering
100. From the alternative listed below, which one does NOT represent a target code?
A. Three address code
B. Absolute machine code
C. Assembly language
D. Byte Code
Name _________________________
ID.No._________________________
Section _________________
Answer Sheet
1. 2. 3. 4. 5.
6. 7. 8. 9. 10.
11. 12. 13. 14. 15.
16. 17. 18. 19. 20.
21. 22. 23. 24. 25.
26. 27. 28. 29. 30.
31. 32. 33. 34. 35.
36. 37. 38. 39. 40.
41. 42. 43. 44. 45.
46. 47. 48. 49. 50.
51. 52. 53. 54. 55.
56. 57. 58. 59. 60.
61. 62. 63. 64. 65.
66. 67. 68. 69. 70.
71. 72. 73. 74. 75.
76. 77. 78. 79. 80.
81. 82. 83. 84. 85.
86. 87. 88. 89. 90.
91. 92. 93. 94. 95.
96. 97. 98. 99. 100.
GOOD LUCK!