DATA STRUCTURE 1.

The finite set of instructions which if followed to accomplish a particular task is __________ a) Generalization b) Algorithm c) Definiteness d) Infiniteness 2. The term which refers to the kind of data is __________ a) Function b) Structure c) Union d) Datatype 3. The term referring to a set of elements is ________ a) Data object b) Pascal c) object d) structure

12. Combining the records in two different sorted file is known as ________. a) sorting b) merging c) traversing d) inserting 13. The _______ loop uses a condition to control the loop. a) repeat while b) increment c) repeat for d) repeat statement 14. A _____ array is a list of a finite number of homogeneous data elements. a) linear b) binary c) single d) multi-dimensional

4. The set of domain,a designated domain, a set of functions and a set of axioms is _________ a) Attach b) Data base c) Add d) Remove 5. The ________ refers to a single unit of values. a) dataitem b) dataobject c) groupitems d) elementaryitems 6. The number K in A[K] is called _________ a) superscript b)subscript c)variable d) constant

15. Two dimensional arrays are called _______ in mathematics. a) arrays b) matrices c) tables d) rows and column 16. The ________ refers to the operation of adding another element to the collection of data elements in the memory. a) deleting b) pointing c) inserting d) traversing 17. Accessing and processing is frequently called _______ a) inserting b) linearing c) Visiting d) appointing

7. The variable which can have only the true or false is called ____ 18.The number of elements is called the ________ of the array. a) integer b) logical c) real d) character 8. Removing a record from the structure is called ______ a) inserting b) pausing c) traversing d) deleting 9. A _______ is something that has certain attributes a) entity b) field c) record d) files 10. A ______ is the collection of record. a) field b) file c) data d) item 11. In ______ records, all the records contain the same data items with the same amount of space assigned to each data item a) Fixed-length b) variable-length c) primary d) quantitative 20. Finding the location of the record with a given key value is called _______ a) sorting b) positioning c) searching d) operating a) length b) index c)bucket d) address 19. The largest index in the linear array is called _________ a) lowerbound b) upperbound c) baseaddress d) dataelements

21. Comparing the name with the name in the middle of the list is ______ a) linear b) 2 way c) bucket d) binary

33.The points that always refers to the last element in the queue is _________ a) Rear b) Front c) Stack d) Top

22. A ________ is a finite step-by-step list of well defined 34.If and only if there is no element in the queue then ________ instruction to solve a problem. a) algorithm b) logarithm c) iteration d) searching 23. A consecutive set of memory location is ________ a) Integer b) Order list c) Array d) Retrieves 24. An array is a set of pairs, values and _________ a) store b) retrieve c) index d) array 25. The matrix that has many zero entries is _______ 37.If ABC**/DE*+AC*-,then its infix is _______ a) Zero b) Diagonal c) Square d) Sparse 26. A stack is an orderedlist in which all insertions and deletions are made at one end called ________ a) top b) add c) rear d) front a). A/B**C+D*E-A*C b) AB/**C+D*E-A*C c) A/B**+CDE*-A*C d) ABC/*D*E-A*C 38.The elements of the list are stored in one dimensional array called _________ a) Link b) Node c) Array d) Data 39.Each item in a node is called _______ a)Link b) Field c) Data d) Node 40.A field contains either a link or ________ a) Dataitem b) Datafield c) Node d) Data 41.An elegant solution of data movement in sequential representations is achieved by using _________ representations. a) Doubly linked b) Linked c) Sequential d) Random 42.A collection of data and link is _______ a)Data b) Node c) Field d) Array 43.Associated with each data item in a linked representation is a pointer to next item.This pointer is refered to as ________ a)Link b) Field c) Data d) Node 44. The _________ function is a function with two arguments each of which can be assigned any non-negative integer a) Front!= rear b) Front=rear c) Front=rear!=0 d) Front=rear=1 35.If e is an expression with operators and operands,the conventional way of writing e is called _______ a. Prefix b) Infix c) Postfix d) Expression 36. If A*B/C,then its postfix is ________ a) *AB/C b) AB*C/ c) ABC* d) /ABC*

27. A _______ is an ordered list in which all insertions takesplace at one end and deletions takes place at other end. a) stack b) queue c) ordered list d) linear 28.In queue all insertions takes place at one end called ________ a) Add b) Front c) Rear d) top 29. In queue all deletions takes place at one end called _________ a) Stack b) Rear c) Top d) Front 30.Stacks are refered to as ________ a) Rear b) LIFO c) FIFO d) Front 31.Queues are refered to as _______ a) Rear b) LIFO c) FIFO d) Front 32.top=top-1 is the delete procedure used in _________ a) Queue b) Addq c) Stack d) Deleteq

a) Ackermann b) divide-and conquer c) recursion d) factorial 45. A _______ is a linear list in which element can be added or removed at either end but not in the middle. a) queue b) dequeue c) stack d) linearqueue 46. A ______ is a collection of elements such that each element has been assigned a priority. a) queue b) lineararray c )priority queue d) linearindexing

56. Each record having linked list. a) 3 b) 4 c) 2 d) 5.

fields in

57. The method is to insert a record into a sequence of ordered records is . a)Insertion b) Heap c) Quick d) Merge. 58. In unused memory cells, the list which has its own pointer is called _______ a) memory allocation b) listpool c) link d)freepool

59. The operating system of a computer periodically 47. The _____ is the term used to insert an element into a collect all the deleted space onto the free storage list is stack called ________ a) top b) pop c) front d) push 48. The _____ field hold pointers to the neighboring element in the queue. a) link b) front c) data d) stack 49.Towers of Hanoi is an example for _____ procedure. a) factorial b) recursive c) fibonacci d) priority 50. The ______ field of the nodes hold the elements of the stack a) TOP b) LINK c) STACK d)INFO 51.In queue the checking of _______ condition everytime an insertion is made. a) overflow b) underflow c) insert d) delete a) garbage collection b) overflow c) underflow d) memory 60. A ________ header list is a header list where the last node contains null pointer. a) headed b) grounded c) first d) front 61.A _______ header list is a header list where the last node points back to the header node. a) grounded b) queue c) circular d) stack 62. When the free storage list is empty in a data structure the situation is called ______ a) underflow b) garbage c) memory d)overflow

63. When LINK[START] = null in a grounded header list, 52.An element of ______ priority is processed before any the list is _________ element of low priority. a) empty b) full c) overflow d) circular a) increase b) high c) decrease d) increment 64. The term _______ refers to a linear collection of data items. a) link b) list c) array d) processing 65. The storing and processing data organized into lists is called ______ a) data processing b) listing c) collection d) information 66. One of the disadvantage of array is relatively expensive to _______ elements in an array. a) insert and delete b) address c) point d) block

53. A file forms a collection of .

_______

a)Fields b)Records c)Keys d)array 54. Each having one or more fields.

a) Keys b) files c) records d) array. 55. To search an ordered sequential file is known as a) linear b) binary c) Fibonacci d) sequential.

67.The pointer of the last node contains a special value called _______ pointer a) node b) null c) array d) denselist 68.The list in linked list is maintained in _________ a) link b) array c) memory d) list 69.The average case running time in the sorted list is proportional to _______ a) n2/2 b) 2/n c) 2/n 3 d) n/2

80. From an array with element , find the smallest element in the list in increasing order is in ______ sorting. a) selection b) insertion c) quick d) heap 81.The operation that combines the elements into a single sorted list with elements is called _____ a) sort b) merge c) search d) index 82.Alphabetizing a large list of names is done using ______ sorting

a) quick b) heap c) radix d) merge 70. A binary search algorithm cannot be applied to a _______ linked list , since there is no way of indexing , the 83.The operation of inserting , deleting and updating is middle element in the list known as ______ a) sorted b) memory c) unsorted d) garbaging 71.The free storage list will also be called the ______ list. a) START b) AVAIL c) INFO d) LINK 72. The nodes with no successors are called ______ a) root b) tree c) level d) terminal node a) data item b) data object c) dataset d) data modification 84. The maintenance of two tables in memory is involved in ________ a) chaining b) collision c) modification d) probing 85.Quick sort is an algorithm of ________ type. a) recursion b) divide-and conquer c) factorial d) Fibonacci 86.The worst case in quick sort algorithm occurs when the ______ is already sorted. a) numbers b) alphabets c) list d)mixedmode 87.The time required to execute the bubble sort algorithm is proportional to _______ in the number of input items(n). a) n b) n3 c) n4 d) n2 76. Quick sort is used to arrange the records in order. a) Ascending b) Descending c)Increase d) decrease. 77. The sorting process having a vertex represent a key comparison and the branches are known as _______ a) vertex b) comparison c) decision d) heap 78. Any algorithm which sorts by comparison only must have a worst case computing time is ______ a) O(n log 3n) b) O(n log 2n) c) O(n) d) O(n2) 79. The operation of rearranging the contents of a list in increasing order is known as ______ a) searching b) infiniteness c) effectiveness d) sorting 88.An extremely efficient searching algorithm which is sorted in increasing numerical order us known as ________ a) binary search b) linear search c) data search d) sorting

73. The terminal node is called a ______ a) leaf b) edge c) path d) branch 74. A path , ending in a leaf is called a _______ a) pathing b) branch c) leaflet d) number 75. The trees are said to be ________ if they are similar and if they have the same contents at corresponding nodes. a) linked b) root c) copies d) complete tree

89. The operation of finding the location of a given item in a collection of items is known as _________ a) key b) searching c) sorting d) list 90. In the sorting process, the slow sorting is _______. a) heap b) quick c) bubble d) selection sort 91.The ________ sorting is very slow when number is large.

a) Quick b) heap c) selection d) insertion 92.Merging algorithm can be run in ______ a) linear time b) worst case c) best case d) average case 93.A new record is added and suppose the memory location address is already occupied ,the situation is called ________ a) chaining b) colision c) probing d) hashing 94.The efficiency of a hash function depends mainly on _______ a) quadratic b) probing c) load factor d) openaddressing 95.The main disadvantage of linear probing is that records tend to _______ a) table b) address c) linearprobe d) cluster

104. If characters are packed into a tape, then a tape would hold a little over Characters a)23*10^5 b)23*10^6 c)24*10^6 d)24*10^5 105. A time taken to position the read/write heads to the correct cylinder. a)sector b) latency c) Transmission d)seek. 106. A track. is the smallest addressable segment of a

a) sector b) cylinder c)blocks d)Tracks. 107. The area that can be read from the or written onto by a single stationary head is called . a) cylinder b) sectors c) Tracks d) blocks. 108. The primary objective of file organization is .

a) Record retrieval& update b)update c) Record 96. In hashing , ________ method uses prime numbers to retrieval d)Record. minimize the number of collisions. a) division b) hashing c) midsquare d) folding 109. A combination of key values specified for retrieval is known as 97.The average case of, complexity of selection sort algorithm is _______ a) O(n3) b)O(n2) c)nlogn d) 2nlog 98.The field is called a ________ key it its values uniquely determine the records in file. a) foreign b) field c) primary d) sort 99. In complexity of radix sort, the best case is _____ a) O( log n) b) O(log 2n) c) O(n) d) O(n log n) 112. The 100. The radix sort requires _______ memory location. a) 2 *n b) n c) depends on number d) depends on radix 101. The tape is wound around a . a)data b)keys c)Query d)fields. 110. The mode of retrieval may be either real time or . a) Transaction b) Batched c) Master d) record 111. The file represents the file status after the previous updates. a) Transaction b) Master c) Real d) Batched. file holds all update request.

a) Transaction b) master c) real d) batched. 113. The physical sequence of records is ordered on some keys, called the Key. a) Foreign b) Primary c) Physical d) decision. is a collection of indexes. a) Key b) Directory c) Index d) Fields. 115. The index consists of a .

a) spool b) disk c) surface d) tape. 102. The number of bits that can be written/ inch of track is referred to as a) Tape capacity b) tape density c) tracks d) surface. 103.A tape drive consists of a)1 b) 3c) 4d) 2 Spindles.

114. A

a) Surface index b) cylinder index c) surface d) cylinder.

116. The indexing.

key is used in cylinder-surface a) Foreign b) Primary c) Decision d) Physical.

117. ISAM stands for a) b) c) d)

Indexed sequential Access Method Indexed sequential Array Method Internal Sector Array Method Internal Sector Access Method. 118. A is a tree of degree in which the branching can be done at any level. a) Trie b) Key c) Data d) fields. 119. The trie contains a) 2 b) 3c) 1 d) 4. 120. File organization are classified into types. a)4 b) 3 c)5 d) 2 121. In organization, records are stored at random locations on disks. a) Sequential b) Random c) Linked d) Direct Addressing. 122. In direct addressing, the disk space is divided into . a) Records b) keys c) nodes d) fields. 123. The space efficiency of direct Accessing depends on the density. a)complex b)identifier c) Direct d) Access 124. Linked organizations differ from organization. a) random b) Sequential c)direct addressing d)slots. 125 The right sector of the track under the read/write head is time. a) sector b) latency c) transmission d) tracks types of nodes.

3. a 13. a 23. c 33. a 43. a 4. b 14.a 24. c 34.b 44. a 5. a 15. b 25. d 35. b 45. b 6. b 16. c 26. a 36. b 46. c 7. a 17. c 27. b 37. a 47.d 8. ad 18. a 28. c 38. d 48.a 9. a 19. b 29. d 39. b 49. b 10. b 20. c 30.b 40. a 50. d

51. a 52.b 53. b 54. c c 55. b 56. a 57. a 58. d 59. a 60. b 101. a 102.b 103. d 104. b 105. d 106. a 107. c 108. a 109. c 110. b

61. c 71. b 81. b 91. d 62.d 72. d 82. c 92. a 63. a 73. a 83. d 93. b 64. b 74. b 84.a 94. 65. a 66. a 67. b 68. c 69. d 70. a 75. c 76. a 77. c 78. b 79.d 80.a 85. b 86. c 87. d 88. a 89. b 90. c 95. d 96. a 97. b 98. c 99. d 100. a

111. b 121. b 112.a 122. c 113. b 123. b 114. b 124. a 115. b 125. b 116. a 117. a 118. a 119. a 120. c

1. b 2. d

11. a 21. d 31. c 41. b 12. b 22. a 32. c 42. b