DATA STRUCTURE TCS FOR FT

 

                                                                        DATA STRUCTURE TCS FOR FT

 

1. Stack is also called as

   a.First in First out

   b.First in last out

   c.last in last out

   d.last in First out

Ans:- last in First out

 

2. Any node is the path from the root to the node is called

   a.Ancestor node

   b.Successor node

   c.Internal node

   d.None of the above

Ans:- Ancestor node

 

3. Which of the following is not the type of queue?

   a.priority queue

   b.circular queue

   c.single ended queue

   d.ordinary queue

Ans:- single ended queue

 

4. A graph is a collection of node called -----and line segment called arcs or ------that connect pair of nodes.

   a.vertices, path

   b.vertices, edges

   c.graph node, edges

   d.edges, vertices

Ans:- vertices, edges

 

5. In----search start at the beginning of the list and check every element in the list.

   a.Binary search

   b.Hash search

   c.Linear search

   d.Binary tree search

Ans:- Linear search

 

6. In the -----traversal we process all of a vertex's descendants before we move to an adjacent vertex.

   a.Depth limited

   b.with first

   c.Breadth first

   d.Depth first

Ans:- Depth first

 

7. To represent hierarchical relationship between element which data structure is suitable?

   a.Graph

   b.Tree

   c.dequeue

   d.priority

Ans:- Tree

 

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

   a.Stack

   b.Graph

   c.Trees

   d.Binary Tree

Ans:- stack

 

9. Which of the following data structure can't store the nonhomogeneous data element

   a.Array

   b.stack

   c.Records

   d.None of the above

Ans:- Array

 

10. A binary search tree whose left sub tree and right sub tree differ in the height by at most 1 unit is called------

    a.Leema Tree

    b.Red black Tree

    c.AVL Tree

    d.None of the above

Ans:- AVL Tree

 

11. -------is a pile in which item's are added at one end and removed from the others.

    a.List

    b.Queue

    c.stack

    d.Array

Ans:- Queue

 

12. Which of the following is non-linear data structure?

    a.Trees

    b.stack

    c.string

    d.All of the above

Ans:- Trees

 

13. ------is not the operation that can't be performed on queue.

    a.Traversal

    b.Insertion

    c.Deletion

    d.Retrieval

Ans:- Traversal

 

14. Whis is/are the application(s) of stack

    a.function call

    b.large number arithmetic

    c.Evaluation of arithmetic expression

    d.All of the above

Ans:- All of the above

 

15. Which of the following data structure are indexed structure?

    a.stack

    b.Linked list

    c.Linear search

    d.None of the above

Ans:- Linear search

 

16. Linear array are also called------

    a.one-dimensional array

    b.vertical array

    c.Horizontal array

    d.All of the above

Ans:- one-dimensional array

 

17. A------does not keep track of address of every element in the list.

    a.stack

    b.Queue

    c.string

    d.linear array

Ans:- linear array

 

18. The complexity of linear search algorithm is

    a.o(n)

    b.o(log n)

    c.o(n2)

    d.o(n log n)

Ans:- o(n)

 

19. The complexity of Binary search algorithm is

    a.o(n)

    b.o(log n)

    c.o(n2)

    d.o(n log n)

Ans:- o(log n)

 

20. The complexity of Bubble sort algorithm is

    a.o(n)

    b.o(log n)

    c.o(n2)

    d.o(n log n)

Ans:- o(n2)

 

21. The complexity of Merge sort algorithm is

    a.o(n)

    b.o(log n)

    c.o(n2)

    d.o(n log n)

Ans:- o(n log n)

 

22. The space factor when determining the efficiency of algorithm is measured by

    a.counting the maximum memory needed by the algorithm

    b.counting the minimum memory needed by the algorithm

    c.counting the average memory needed by the algorithm

    d.counting the maximum disk space needed by the algorithm

Ans:- counting the maximum memory needed by the algorithm

 

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

    a.traversal

    b.Insertion

    c.merging

    d.sorting

Ans:- Traversal

 

24. Binary tree with threads are called as-----

    a.special tree

    b.pointer tree

    c.Threaded tree

    d.None of the above

Ans:- Threaded tree

 

25. In binary tree nodes with no successor are called----

    a.End nodes

    b.Final nodes

    c.Last node

    d.Terminal nodes

Ans:- Terminal nodes

 

26. Every node N in a binary tree texcept the root has a unique parent called the---- of N

    a.predecessor

    b.Antecedents

    c.precursor

    d.None of the above

Ans:- predecessor

 

27. The in ordertraversal of tree will yield a sorted listing of element of tree in-----

    a.merging

    b.AVL trees

    c.Binary trees

    d.Binary search trees

Ans:- Binary search trees

 

28. A Binary whose every node has either zero or two children is called-----

    a.Extended binary tree

    b.complete binary tree

    c.Binary search tree

    d.Disjoint tree

Ans:- Extended binary tree

 

29. The post order traversal of a binary tree is DEBFCA . find out the pre order traversal

    a.ABFCDA

    b.ADBFEC

    c.ABDECF

    d.ABDCEF

Ans:- ABDECF

 

30. Three standards waysof traversing a binary tree t with root R------

    a.prefix, infix, postfix

    b.pre-process, in-process, post-process

    c.pre-Traversal, in-traversal, post-Traversal

    d.pre-order, in-order, post-order

Ans:-  pre-order, in-order, post-order

 

31. A technique for direct search is

    a.Hashing

    b.Tree search

    c.Binary search

    d.Linear search

Ans:- Hashing

 

32. If a node having two children is deleted from a binary tree . It is replaced by its

    a.preorder predecessor

    b.In order predecessor

    c.In order successor

    d.preorder successor

Ans:- In order successor

 

33 . A full binary tree with n leaves contains

     a.n-1 nodes

     b.log2 n nodes

     c.2n^2-1 nodes

     d.2^n nodes

Ans:- 2n-1 nodes

 

34. The smallest element of an array's index is called it's

    a.extraction

    b.range

    c.lower bound

    d.upper bound

Ans:- lower bound

 

35. The data structure required for Breadth First. Traversal on a graph is

    a.Queue

    b.stack

    c.array

    d.None of the above

Ans:- stack

 

36. The data structure required to evaluate a post fix expression is

    a.queue

    b.stack

    c.linked list

    d.All of the above

Ans:- stack

 

37. Which of the following sorting method would be most suitable for sorting a list which is almost sorted.

    a.Insertion sort

    b.selection sort

    c.Quick sort

    d.Bubble sort

Ans:- Bubble sort

 

38. The process of accessing data stored in a serial access memory is similar to manipulation data on a

    a.heap

    b.Quick

    c.stack

    d.None of the above

Ans:- stack

 

39. The postfix form of A*B+C/D is

    a.ABCD+/*

    b.AB*CD/+

    c.*AB/CD+

    d.A*BC+/D

Ans:- AB*CD/+

 

40. A linear collection of data elements where the linear node is given by means of pointer is called

    a.Linked list

    b.node list

    c.primitive list

    d.None of these

Ans:- Linked list

 

41. Representation of data structure in memory is known as

    a.storage structure

    b.File structure

    c.abstract data structure

    d.None of the above

Ans:- abstract data structure

 

42. The goal of hashing is to be produce a search that takes

    a.o(1) time

    b.o(n^2) time

    c.o(log n) time

    d.o(n log n) time

Ans:- o(1) time

 

43. The complexity of multiplying two matrices of order m*n and n*p is

    a.np

    b.mn+p

    c.mn

    d.mnp

Ans:- mnp

 

44. For an undirected graph with n vertices and e edges , the sum of the degree of each vertex is equal to

    a.2n

    b.2e

    c.(e^2+1)

    d.(2n-1)/2

Ans:- 2e

 

45. Which data structure allows deleting daa element from an insertion at rear?

    a.stack

    b.queue

    c.Dequeu

    d.Binary search tree

Ans:- Queue

 

46. Which data structure is used in breadth first search of a graph to hold nodes?

    a.Array 

    b.Tree

    c.stack

    d.Queue

Ans:- Queue

 

 

47. Whioch data structure is used in Depth First search of a graph to hold nodes?

    a.Array

    b.Tree

    c.stack

    d.Queue

Ans:- stack

 

48. Which of the following data structure is non linear type?

    a.Graph

    b.stack

    c.List

    d.None of the above

Ans:- Graph

 

49. When new data are to be inserted into a data structure , but there is not available space this suitation is usually called------

    a.overflow

    b.underflow

    c.housefull

    d.memory full

Ans:- overflow

 

50. A data structure whwre element can be added or removed at either end but not in middle is called------

    a.stack

    b.queue

    c.Dequeue

    d.Linked list

Ans:- Dequeue

 

51. The use of pointers to refer elements of a data structure in which element are logically adjacent

    a.stack

    b.Queue

    c.pointer

    d.Linked Allocation

Ans:- Linked Allocation

 

52. ------is the method used by card sorter?

    a.Quick

    b.Heap

    c.Insertion

    d.Radix sort

Ans:- Radix sort

 

53. Which of the following conditions check available free space in avail list?

    a.Avail=Top

    b.Null=Avail

    c.Avail=Null

    d.Avail=max stack

Ans:- Avail=Null

 

54. ------is a directed tree in which outdegree of each node is less than or equal to two

    a.Binary tree

    b.Dinary tree

    c.unary tree

    d.none of the above

Ans:- Binary tree

 

55. The operation that combines the element is of A and B in a single sorted list C with n=r+s element is called-------

    a.sharing

    b.merging

    c.Inserting

    d.None of the above

Ans:- merging

 

56. Which of the following is an internal sorting?

    a.2-way merge sort

    b.Tape sort

    c.merge sort

    d.Tree sort

Ans:- Tree sort

 

57. Which of the following is an external sorting?

    a.merge sort

    b.Tree sort

    c.Bubble sort

    d.Insertion sort

Ans:- merge sort

 

58. -------is the term used to insert an element into stack?

    a.push

    b.pull

    c.pop

    d.All of the above

Ans:- push

 

59. -------is the term used to delete an element from the stack?

    a.push

    b.pull

    c.pop

    d.All of the above

Ans:- pop

 

60. Before insertion into stack one must check the condition-------

    a.over flow

    b.under flow

    c.maximum element

    d.Existing element

Ans:- over flow

 

61. Deletion in the linked stack takes place by deleting-----list

    a.Beginning of the list

    b.End of the list

    c.middle of the list

    d.Node pointed by the start process

Ans:- Node pointed by the start process

 

62. The value of REAR is increased by 1 when

    a.An element is merged in a queue

    b.An element is added in a queue

    c.An element is traversed in a queue

    d.An element is deleted in a queue

Ans:- An element is added in a queue

 

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

    a.merging

    b.traversal

    c.Insertion

    d.sorting

Ans:- traversal

 

64. sequential representation of binary tree uses----

    a.Array with pointer

    b.single linear array

    c.Two dimensional array

    d.Three dimensional array

Ans:- Array with pointer

 

65. Which of the following sorting algorithm does not have a worst case running time of o(n^2)

    a.Insertion sort

    b.Quick sort

    c.Bubble sort

    d.merge sort

Ans:- merge sort

 

66. In a circular linked list

    a.There is no beginning and no end

    b.component are arranged hierarchically

    c.Forward and Backward traversal with in the list is premitted.

    d.component are all linked together in a some sequential manner

Ans:- There is no beginning and no end

 

67. The quick sort algorithm exploit----design technique.

    a.overflow

    b.Backtracking

    c.Dynamic programming

    d.Divide and conquer

Ans:- Divide and conquer

 

68. The data structure required to check whether an expression contains balanced paranthesis is

    a.stack

    b.Queue

    c.tree

    d.Array

Ans:- stack

 

69. Which data structure would you most likely see in a non recursion implementation of a recursive algorithm?

    a.Trees

    b.Linked list

    c.stack

    d.Queue

Ans:- stacks

 

70. The number of leaf node in a complete binary tree of depth d is

    a.2^d

    b.2^d-1+1

    c.2^d+1+1

    d.2^d+1

Ans:- 2^d

 

71. The preorder and postorder traversal of a binary tree generates the same output the tree can have mximum

    a.one node

    b.two node

    c.three node

    d.Any number of nodes

Ans:- one node

 

72. An adjacent matrix represent of a graph cannot contain information of

    a.nodes

    b.edges

    c.parallel edges

    d.direction of edges

Ans:- paralel edges

 

73. ----- is not the operation that can be performed on queue

    a.traversal

    b.Retrieval

    c.deletion

    d.Insertion

Ans:- Traversal

 

74. A linear list in which the last node point to the first node is-----

    a.singly linked list

    b.doubly linked list

    c.circular linked list

    d.None of the above

Ans:- circular linked list

 

75. A linear list in which the pointer points only to the successive node is------

    a.singly linked list

    b.circular linked list

    c.doubly linked list

    d.None of the above

Ans:- singly linked list

 

76. Llink is the pointer pointing to the -------

    a.head node

    b.last node

    c.successor node

    d.predecessor node

Ans:- predecessor node

 

77. A doubly linked list has ----- pointer with each node

    a.0

    b.1

    c.2

    d.3

Ans:- 2

 

78. A linear list in which each node has point to the predecessor and successors node is called-----

    a.single linked list

    b.linear linked list

    c.doubly linked list

    d.None of the above

Ans:- doubly linked list

 

79. RLINK is the pointer pointing to the ------

    a.Last node

    b.head node

    c.successor node

    d.predecessor node

Ans:- successor node

 

80. In a linked list , insertion can be done as

    a.beginning

    b.middle

    c.end

    d.All of the above

Ans:- All of the above