1) Which of the following is not considered while calculating time complexity? a) Arithmetic & logical operators b) Read and Write operators c) Assignment and return d) Declaring variables 2) In linear time complexity :  a) Time required increases with increase in input value b) Time required decreases with increase in input value c) Time remains constant with increase in input value d) Time required increases with constant in input value 3) Which of following is an example of non-linear data structure ? a) Linked list b) Tree c) Queue d) Array 4) Which notation indicates maximum time or worse case of an algorithm? a) Big - Omega notation b) Big - O notation c) Big – Theta d) None of the above 5) Which of the following is the formula to calculate address in 2D array in row major system? a) B + W * [ N * (I - Lr) + (J - Lc) ] b) B + W * [ N * (I + Lr) + (J + Lc) ] c) B - W * [ N * (I - Lc) - (J - Lr) ] d) B - W * [ N * (I + Lc) + (J + Lr) ] 6) Stack follows which of the following principle ? a) LILO b) FIFO c) LIFO d) None of the above 7) What is / are the conditions to check that the queue is empty? a) Front = 0 or front < rear b) Rear = 0 or rear >front c) Front = -1 or front > rear   d) Only Rear = n-1 8) Which of the following is true ? a) Every Perfect binary tree is a Complete binary tree b) Every Complete binary tree is a Full binary tree  c) Every Full binary tree is a Perfect binary tree d) None 9) What is the traverse order for preorder traversal ? a) Left, Root, Right b) Root, Left, Right c) Left, Right, Root d) Root, Right, Left 10) In a B- Tree, every internal node (nodes other then root node) will have : a) Max (m-1) keys & max [(m/2) -1] children b) Max (m) keys & max (m-1) children c) Max [(m/2) -1] keys & max (m-1) children d) Max (m-1) keys & max (m) children 11) Calculate the time complexity of the following code : a)  8 b) 7 c) 28 d) 22 12) Find the address of B [1700]. a) 2500 b) 7000 c) 200 d) 1800 13) What is the condition for Big- Omega Notation? a) f(n) <= c.g(n) b) f(n) >= c.g(n) c) c1.g(n) <= f(n) <= c2.g(n) d) none 14) Inorder : DGBAHEICF  Post order : GDBHIEFCA -> Which is the root node of a tree? a) F b) G c) D d) A 15) What is the formula to find balance factor ? a) height(mid subtree) - height(top subtree) b) height (right subtree) - height (left subtree) c) height (left subtree) - height (right subtree) d) height(top subtree) - height(mid subtree)

DSA - Quiz

Odštampaj
Ugradi

Tabela

Vizuelni stil

Postavke

Promeni šablon

Vrati automatski sačuvano: ?