Interview Questions on Data Structure:

1. A procedure that calls itself is called

A. illegal call B. reverse polish
C. Recursive D. none of the above

2. What data structure can be used to check if a syntax has balanced paranthesis ?
A. Queue B. Tree C. List D. Stack

3. Index of arrays in C programming language starts from

A. 0B. 1 C. either 0 or 1 D. undefined

4. Project scheduling is an example of

A. greedy programming B. dynamic programming
C. divide and conquerD. none of the above.

5. Which of the following uses FIFO method

A . Queue B . Stack C . Hash Table D . Binary Search Tree
6. How many swaps are required to sort the given array using bubble sort - { 2, 5, 1, 3, 4}
A. 4 B. 5 C. 6 D. 7

7. Which of the following is not possible with an array in C programming language

A. Declaration B. Definition C. Dynamic Allocation D. Array of strings

8. Heap is an example of
A. complete binary tree B. spanning tree C. sparse tree D. binary search tree

9. Shell sort uses

A. insertion sort B. merge sort C. selection sort D. quick sort

10. A data structure where elements can be added or removed at either end but not in the middle
A. Linked lists B. Stacks C. Queues D. Deque

11. Stack is also called as

A. Last in first out B. First in last out
C. Last in last out D. First in first out

12. To represent hierarchical relationship between elements, Which data structure is suitable?
A. Dequeue B. Priority C. Tree D. Graph

13. Which of the following data structure is linear type?

A. Graph B. Trees C. Binary tree D. Stack
14. Inserting an item into the stack when stack is not full is called . Operation and deletion of
item form the stack, when stack is not empty is called ..operation.
A. push, pop B. pop, push C. insert, delete D. delete, insert

15. Finding the location of the element with a given value is:
A.Traversal B. Search C. Sort D. None of above

16. The operation of processing each element in the list is known as

A.Sorting B.Merging C.Inserting D.Traversal

17. Linked list are not suitable data structure of which one of the following problems ?
A. Insertion sort B. Binary search C. Radix sort D. Polynomial manipulation

18. Which of the following name does not relate to stacks?

A. FIFO lists B. LIFO list C. Piles D. Push-down lists

19. Which of the following algorithm design technique is used in the quick sort algorithm?
A. Dynamic programming B. Backtracking
C. Divide and conquer D. Greedy method

20. Given two sorted lists of size m and n respectively.The number of comparisons needed in the worst
case by the merge sort algorithm will be?
A. mn B. max(m,n) C. min(m,n) D. m+n-1

21. The following sequence of operation is performed on stack :

push(1),push(2),pop,push(1),push(2),pop,pop,pop,push(2),pop. The sequence of popped out
values are ?
A. 2,2,1,1,2 B. 2,2,1,2,2 C. 2,1,2,2,1 D. 2,1,2,2,2

22. What is the result of the following operation Top (Push (S, X))
A. X B. Null C. S D. none of these

23. Operations on a data structure may be .....

A. creation B. Destruction C. Selection D. all of the above.

24. A singly linked list is also called as ........

A. linked list B. one way chain C. two way chain D. right link.

25. The list that requires two pointer variables FIRST and LAST is called ........
A. Circular list B. Header list C. One way list D. Two way list

26. The list which has its own pointer is called ........
A. pointer list B. self pointer C. free pool D. own pointer
27. A ............. is a header list where the last node points back to the header node.
A. rounded header list B. circular header list
C. common header list D. forward header list

28. The disadvantage in using a circular linked list is .......

A. it is possible to get into infinite loop B. last node points to fist node.
C. time consuming D. requires more memory space.

29. Which of the following data structures are indexed structures?

A. linear arrays B. linked lists C. both of above D. none of above

30. The situation when in a linked list START=NULL is

A. Underflow B. Overflow C. Housefull D. Saturated

31. Term Data Structure refers to _________ and interrelationship between them.
A. Coding Standards B. Programming Language Statement
C. Organization of data element D. None of these

32. Data is nothing but ____________.

A. None of these B. Bunch of Information
C. Programming Statement D. Piece of Information

33. Single and non-decomposable data is called ______________.

A. Textual Data B. Numeric Data
C. Composite Data D. Atomic Data

34. In what kind of storage we can easily insert,delete,concatenate and rearrange substrings ?
A. Array B.Linked List C.Stack D.Queue

35. Two main measures for the efficiency of an algorithm are

A. Processor and memory B. Complexity and capacity
C. Time and space D. Data and space

36. Which of the following case does not exist in complexity theory
A. Best case
B. Worst case
C. Average case
D. Null case

37. The time factor when determining the efficiency of algorithm is measured by
A. Counting microseconds
B. Counting the number of key operations
C. Counting the number of statements
 D. Counting the kilobytes of algorithm

38. Which of the following is not a logical data structure?

A. Tree B. List C. Stack D. Chain

39. Items can be removed from the both end of

A. Stack B. Queue C. Tree D. Deque

40. The most Advanced form of ROM is?

A. PROM B. RAM C. Cache memory D. EEPROM