MCQ on Computer Science Engineering
41- Which of the following is/are property/properties of a dynamic programming problem?
(A) Optimal substructure
(B) Overlapping subproblems
(C) Greedy approach
(D) Both optimal substructure and overlapping subproblems
42- If a problem can be solved by combining optimal solutions to non-overlapping problems, the strategy is called _____________
(A) Dynamic programming
(B) Greedy
(C) Divide and conquer
(D) Recursion
43- When a top-down approach of dynamic programming is applied to a problem, it usually _____________
(A) Decreases both, the time complexity and the space complexity
(B) Decreases the time complexity and increases the space complexity
(C) Increases the time complexity and decreases the space complexity
(D) Increases both, the time complexity and the space complexity
44- The travelling salesman problem can be solved using _________
(A) A spanning tree
(B) A minimum spanning tree
(C) Bellman-Ford algorithm
(D) DFS traversal
45- Which of the following is not the algorithm to find the minimum spanning tree of the given graph?
(A) Boruvka’s algorithm
(B) Prim’s algorithm
(C) Kruskal’s algorithm
(D) Bellman-Ford algorithm
46- Which of the following is the most commonly used data structure for implementing Dijkstra’s Algorithm?
(A) Max priority queue
(B) Stack
(C) Circular queue
(D) Min priority queue
47- Dijkstra’s Algorithm is the prime example for ___________
(A) Greedy algorithm
(B) Branch and bound
(C) Back tracking
(D) Dynamic programming
48- Breadth First Search is equivalent to which of the traversal in the Binary Trees?
(A) Pre-order Traversal
(B) Post-order Traversal
(C) Level-order Traversal
(D) In-order Traversal
49- When the Breadth First Search of a graph is unique?
(A) When the graph is a Binary Tree
(B) When the graph is a Linked List
(C) When the graph is a n-ary Tree
(D) When the graph is a Ternary Tree
50- What is the objective of the knapsack problem?
(A) To get maximum total value in the knapsack
(B) To get minimum total value in the knapsack
(C) To get maximum weight in the knapsack
(D) To get minimum weight in the knapsack
51- The ability to query data, as well as insert, delete, and alter tuples, is offered by _____________
(A) TCL (Transaction Control Language)
(B) DCL (Data Control Language)
(C) DDL (Data Definition Language)
(D) DML (Data Manipulation Language)
52- Procedural language among the following is __________
(A) Domain relational calculus
(B) Tuple relational calculus
(C) Relational algebra
(D) Query language
53- What does a foreign key combined with a primary key create?
(A) Network model between the tables that connect them
(B) Parent-Child relationship between the tables that connects them
(C) One to many relationship between the tables that connects them
(D) All of the mentioned
54- Which of the following is popular for applications such as storage of log files in a database management system since it offers the best write performance?
(A) RAID level 0
(B) RAID level 1
(C) RAID level 2
(D) RAID level 3
55- Which-one of the following statements about normal forms is FALSE?
(A) BCNF is stricter than 3 NF
(B) Lossless, dependency-preserving decomposition into 3 NF is always possible
(C) Loss less, dependency-preserving decomposition into BCNF is always possible
(D) Any relation with two attributes is BCNF
56- Which forms simplifies and ensures that there are minimal data aggregates and repetitive groups?
(A) 1NF
(B) 2NF
(C) 3NF
(D) All of the mentioned
57- Which forms are based on the concept of functional dependency?
(A) 1NF
(B) 2NF
(C) 3NF
(D) 4NF
58- The file organization which allows us to read records that would satisfy the join condition by using one block read is
(A) Heap file organization
(B) Sequential file organization
(C) Clustering file organization
(D) Hash file organization
59- The highest level in the hierarchy of data organization is called
(A) Data bank
(B) Database
(C) Data file
(D) Data record
60- _____________ states that only valid data will be written to the database.
(A) Consistency
(B) Atomicity
(C) Durability
(D) Isolation
ANSWERS:
41-(D), 42-(C), 43-(B), 44-(B), 45-(D), 46-(D), 47-(A), 48-(C), 49-(B), 50-(A), 51-(D), 52-(C), 53-(A), 54-(B), 55-(C), 56-(C), 57-(C), 58-(C), 59-(B), 60-(A)