Follow Our FB Page << CircleMedia.in >> for Daily Laughter. We Post Funny, Viral, Comedy Videos, Memes, Vines...

Data Structures Interview Questions

What is binary tree?

BMC,

15085

What are the parts of root node?

BMC, JCE, TCS,

12010

What is B+ tree?

BMC, CMC, Satyam, TCS,

26988

sir plz. send me a bunch of questions related to this topic which may help me in campus selection

ABC,

5367

1) Program A and B are analyzed and found to have worst- case running times no greater than 150nlog2n and n2 respectively.Answer the folloWing questions if possible.. i) which program has the better guarantee on the running time,for larger values of n(n>10000) ? ii) which program has the better guarantee on the running time,for small values of n(n<100) ? iii) which program will run faster on average for n =1000 2) wRite a program to compute the number of collisions required in a long random sequence of insertions using linear probing ,quadratic probing and double hashing 3) what is the optimal way to compute A1 A2 A3 A4 A5 A6 where the dimensions of the matrices are A1:10*20 A2 : 20 * 1 A3 : 1 * 40 A4 : 40*5 A5 : 5 * 30 A6 : 30 X 15

KPIT,

13487

create an singly linked lists and reverse the lists by interchanging the links and not the data?

13277

Q#1: An algorithm is made up of 2 modules M1 and M2.If order of M1 is F(n) and order of M2 is g (n) then what is the order of the algorithm. Q # 2 : How many binary trees are possible with 3 nodes? with 4 nodes?

13456

Q # 1 : in which graph algorithm do we start finding vertices that should be first in the topological order and then apploy the fact that every vertex must come before its successors in the topolgical order.

3685

Let the G be a graph with 100 vertices numbered 1 to 100 Two vertices i and j are adjecnt if | i-j| =8 or | i-j| =12. The Number of connected components in G is ?

10988

I am given a sequential algorithm that does a routine search on an unordered list. N = 20. The probability that the value x does NOT appear in the list is exactly 60%, and the probability that x DOES appear is 40%. The 3 questions that I could not get were: A) What is the avg number of element comparisons performed when n = 20 and x does NOT appear in the List. (my answer was 20, is this correct?) B) What is the avg number of element comparisons peformed when n = 20 and x DOES appear in the list? C) What is the avg number of element comparisons performed when n = 20. This should be a single number answer they said.

4638

what is binary tree?

BMC,

13316

How can one find a cycle in the linked list? IF found how to recognize the cycle and delete that cycle?

15621

wt is a datastructure

11418

Convert following infix expression to the prefix expression. a - b + c * (d / e - (f + g))

42037

what is atmost complete binary tree?

12657

Un-Answered Questions { Data Structures }

Which is better than array and linked list?

146

How do we find duplicate elements in an array?

173

How to show internal storage representation of data structure in RDBM?

179

What is the difference between b tree and binary search tree?

159

What is difference between hashmap and arraylist?

148

What does a bubble chart show?

111

182

Explain the difference between a list and array.

184

Define general trees?

186

in tree construction which is the suitable efficient data structure? (Array, linked list, stack, queue)

245

What method removes the value from the top of a stack?

176

Explain the principle of quicksort. What is its complexity?

206

Why you need a data structure?

208

Define a set?

184

State the demerits of linked representation of binary trees?

174