/* */ Click to Join Live Class with Shankar sir Call 9798158723

# Basic 0f DSA MCQ

Q1.How many cases are there, which are used to compare various data structure's execution time in a relative manner?
1. 2
2. 3
3. 4
4. 5

Explanations :There are three cases which are usually used to compare various data structure's execution time in a relative manner : Worst Case ,Average Case and Best Case.
Q2.Which case of data structure operation takes maximum time?
1. Worst Case
2. Average Case
3. Best Case
4. None of the above

Explanations :This is the scenario where a particular data structure operation takes maximum time it can take.
Q3.In Average case, if operation takes ƒ(n) time in execution, then m operations will take?
1. ƒ(n)
2. f(m)
3. mf(n)
4. nf(m)

Explanations : If an operation takes ƒ(n) time in execution, then m operations will take mƒ(n) time.
Q4.Which characteristics shows that running time or the execution time of operations of data structure must be as small as possible?
1. Completeness
2. Correctness
3. Time Complexity
4. Space Complexity

Explanations :Time Complexity : Running time or the execution time of operations of data structure must be as small as possible.
Q5.Data items that cannot be divided are called as?
1. Group Items
2. Attribute and Entity
3. Elementary Items
4. File items

Explanations :Data items that cannot be divided are called as Elementary Items.
Q6.Which of the following analysis known as empirical analysis of an algorithm?
1. A Posterior Analysis
2. A Priori Analysis
3. A Feasibility Analysis
4. A Independent Analysis

Explanations : This is an empirical analysis of an algorithm. The selected algorithm is implemented using programming language. This is then executed on target computer machine. In this analysis, actual statistics like running time and space required, are collected.
Q7.O(1) means computing time is __________________
1. Constant
3. Linear
4. Cubic

Explanations :O(1) means computing time is Constant.
Q8.Which data structure allows deleting data elements from front and inserting at rear?
1. Stacks
2. Queues
3. Deques
4. Binary search tree

Explanations : Queues data structure allows deleting data elements from front and inserting at rear.
Q9.In an array representation of binary tree the right child of root will be at location of?
1. 2
2. 3
3. 4
4. 6