Data Structures Interview Questions
Questions Answers Views Company eMail

What is binary tree?

BMC,

13 18001

What are the parts of root node?

BMC, JCE, TCS,

7 13931

What is B+ tree?

BMC, CMC, Satyam, TCS,

6 28738

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

ABC,

1 6026

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,

5 17059

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

Microsoft, TCS,

13 16302

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?

4 15049

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.

3 4797

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 ?

4 12643

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.

3 5369

what is binary tree?

BMC,

12 16472

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

Citrix,

12 18720

wt is a datastructure

CybAge,

8 13210

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

Amazon, Microsoft, Star Technologies, Sun Microsystems, Wipro,

33 51333

what is atmost complete binary tree?

6 14330


Post New Data Structures Questions

Un-Answered Questions { Data Structures }

What exactly is data?

502


Which is the parent class of linkedlist class?

425


Is duplicate allowed in hashmap?

605


Can you override methods of arraylist?

478


What is the complexity of adding an element to the heap?

458






How does sort function work?

477


What are the major data structures used in the network data model?

637


What is the use of data structure in real life?

483


Explain the expression trees?

566


How to create your own data structure in java?

475


What is meant by ordered and sorted in collections?

522


Can you list out the areas in which data structures are applied extensively?

600


Define binary tree insertion.

564


What is a multidimensional array?

516


What is array simple?

481