Practice MCQ Data Structure

Page 1 of 50, Total 57 results. | Shuffle Order | Flagged | Next Page
6233 Linked lists are best suited
Options:A)for relatively permanent collections of data b.for the size of the structure and the data in the structure are constantly changing c.for both of above situation d.for none of above situation

Show Answer
Loading Facebook Comment system, Please wait...
Loading Facebook Comment system, Please wait...
6234 If the values of a variable in one module is indirectly changed by another module, this situation is called
Options:A)internal change b.inter-module change c.side effect d.side-module update

Show Answer
Loading Facebook Comment system, Please wait...
Loading Facebook Comment system, Please wait...
6235 In linear search algorithm the Worst case occurs when
Options:A)The item is somewhere in the middle of the array b.The item is not in the array at all c.The item is the last element in the array d.The item is the last element in the array or is not there at all

Show Answer
Loading Facebook Comment system, Please wait...
Loading Facebook Comment system, Please wait...
6251 Each data item in a record may be a group item composed of sub-items; those items which are indecomposable are called
Options:a. elementary items b. atoms c. scalars d. all of above

Show Answer
Loading Facebook Comment system, Please wait...
Loading Facebook Comment system, Please wait...
6252 Which of the following is two way list?
Options:a. grounded header list b. circular header list c. linked list with header and trailer nodes d. List traversed in two directions

Show Answer
Loading Facebook Comment system, Please wait...
Loading Facebook Comment system, Please wait...
6253 When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return
Options:a. FAEKCDBHG b. FAEKCDHGB c. EAFKHDCBG d. FEAKDCHBG

Show Answer
Loading Facebook Comment system, Please wait...
Loading Facebook Comment system, Please wait...
6254 The memory address of the first element of an array is called
Options:a. floor address b. foundation address c. first address d. base address

Show Answer
Loading Facebook Comment system, Please wait...
Loading Facebook Comment system, Please wait...
6255 The difference between linear array and a record is
Options:a. An array is suitable for homogeneous data but the data items in a record may have different data type b. In a record, there may not be a natural ordering in opposed to linear array. c. A record form a hierarchical structure but a linear array does not d. All of above

Show Answer
Loading Facebook Comment system, Please wait...
Loading Facebook Comment system, Please wait...
6256 Which of the following name does not relate to stacks?
Options:a. FIFO lists b. LIFO list c. Piles d. Push-down lists

Show Answer
Loading Facebook Comment system, Please wait...
Loading Facebook Comment system, Please wait...
6257 Which of the following data structures are indexed structures?
Options:a. linear arrays b. linked lists c. both of above d. none of above

Show Answer
Loading Facebook Comment system, Please wait...
Loading Facebook Comment system, Please wait...
6258 The term PUSH and POP is related to the
Options:a. array b. lists c. stacks d. all of above

Show Answer
Loading Facebook Comment system, Please wait...
Loading Facebook Comment system, Please wait...
6259 The memory address of fifth element of an array can be calculated by the formula
Options:a. LOC(Array[5]=Base(Array)+w(5-lower bound), where w is the number of words per memory cell for the array b. LOC(Array[5])=Base(Array[5])+(5-lower bound), where w is the number of words per memory cell for the array c. LOC(Array[5])=Base(Array[4])+(5-Upper bound), where w is the number of words per memory cell for the array d. None of above

Show Answer
Loading Facebook Comment system, Please wait...
Loading Facebook Comment system, Please wait...
6260 Two dimensional arrays are also called
Options:a. tables arrays b. matrix arrays c. both of above d. none of above

Show Answer
Loading Facebook Comment system, Please wait...
Loading Facebook Comment system, Please wait...
6261 When new data are to be inserted into a data structure, but there is no available space; this situation is usually called
Options:a. underflow b. overflow c. housefull d. saturated

Show Answer
Loading Facebook Comment system, Please wait...
Loading Facebook Comment system, Please wait...
6262 The situation when in a linked list START=NULL is
Options:a. underflow b. overflow c. housefull d. saturated

Show Answer
Loading Facebook Comment system, Please wait...
Loading Facebook Comment system, Please wait...
6263 A variable P is called pointer if
Options:a. P contains the address of an element in DATA. b. P points to the address of first element in DATA c. P can store only memory addresses d. P contain the DATA and the address of DATA

Show Answer
Loading Facebook Comment system, Please wait...
Loading Facebook Comment system, Please wait...
6264 Which of the following data structure can't store the non-homogeneous data elements?
Options:a. Arrays b. Records c. Pointers d. None

Show Answer
Loading Facebook Comment system, Please wait...
Loading Facebook Comment system, Please wait...
6265 Which of the following data structure store the homogeneous data elements?
Options:a. Arrays b. Records c. Pointers d. None

Show Answer
Loading Facebook Comment system, Please wait...
Loading Facebook Comment system, Please wait...
6266 Which of the following is not a limitation of binary search algorithm?
Options:a. must use a sorted array b. requirement of sorted array is expensive when a lot of insertion and deletions are needed c. there must be a mechanism to access middle element directly d. binary search algorithm is not efficient when the data elements are more than 1000.

Show Answer
Loading Facebook Comment system, Please wait...
Loading Facebook Comment system, Please wait...
6267 Binary search algorithm can not be applied to
Options:a. sorted linked list b. sorted binary trees c. sorted linear array d. pointer array

Show Answer
Loading Facebook Comment system, Please wait...
Loading Facebook Comment system, Please wait...
6268 A data structure where elements can be added or removed at either end but not in the middle
Options:a. Linked lists b. Stacks c. Queues d. Deque

Show Answer
Loading Facebook Comment system, Please wait...
Loading Facebook Comment system, Please wait...
6269 Which of the following is not the required condition for binary search algorithm?
Options:a. The list must be sorted b. there should be the direct access to the middle element in any sublist c. There must be mechanism to delete and/or insert elements in list d. none of above

Show Answer
Loading Facebook Comment system, Please wait...
Loading Facebook Comment system, Please wait...
6270 Two main measures for the efficiency of an algorithm are
Options:a. Processor and memory b. Complexity and capacity c. Time and space d. Data and space  

Show Answer
Loading Facebook Comment system, Please wait...
Loading Facebook Comment system, Please wait...
6271 The time factor when determining the efficiency of algorithm is measured by
Options:a. Counting microseconds b. Counting the number of key operations c. Counting the number of statements d. Counting the kilobytes of algorithm  

Show Answer
Loading Facebook Comment system, Please wait...
Loading Facebook Comment system, Please wait...
6272 The space factor when determining the efficiency of algorithm is measured by
Options: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  

Show Answer
Loading Facebook Comment system, Please wait...
Loading Facebook Comment system, Please wait...
6273 Which of the following case does not exist in complexity theory
Options:a. Best case b. Worst case c. Average case d. Null case  

Show Answer
Loading Facebook Comment system, Please wait...
Loading Facebook Comment system, Please wait...
6274 The Average case occur in linear search algorithm
Options:a. When Item is somewhere in the middle of the array b. When Item is not in the array at all c. When Item is the last element in the array d. When Item is the last element in the array or is not there at all  

Show Answer
Loading Facebook Comment system, Please wait...
Loading Facebook Comment system, Please wait...
6275 The complexity of the average case of an algorithm is
Options:a. Much more complicated to analyze than that of worst case b. Much more simpler to analyze than that of worst case c. Sometimes more complicated and some other times simpler than that of worst case d. None or above  

Show Answer
Loading Facebook Comment system, Please wait...
Loading Facebook Comment system, Please wait...
6276 The complexity of linear search algorithm is
Options:a. O(n) b. O(log n) c. O(n2) d. O(n log n)  

Show Answer
Loading Facebook Comment system, Please wait...
Loading Facebook Comment system, Please wait...
6277 The complexity of Binary search algorithm is
Options:a. O(n) b. O(log ) c. O(n2) d. O(n log n)  

Show Answer
Loading Facebook Comment system, Please wait...
Loading Facebook Comment system, Please wait...
6278 The complexity of Bubble sort algorithm is
Options:a. O(n) b. O(log n) c. O(n2) d. O(n log n)  

Show Answer
Loading Facebook Comment system, Please wait...
Loading Facebook Comment system, Please wait...
6279 The complexity of merge sort algorithm is
Options:a. O(n) b. O(log n) c. O(n2) d. O(n log n)  

Show Answer
Loading Facebook Comment system, Please wait...
Loading Facebook Comment system, Please wait...
6280 Which of the following data structure is not linear data structure?
Options:a. Arrays b. Linked lists c. Both of above d. None of above  

Show Answer
Loading Facebook Comment system, Please wait...
Loading Facebook Comment system, Please wait...
6281 Which of the following data structure is linear data structure?
Options:a. Trees b. Graphs c. Arrays d. None of above  

Show Answer
Loading Facebook Comment system, Please wait...
Loading Facebook Comment system, Please wait...
6282 The operation of processing each element in the list is known as
Options:a. Sorting b. Merging c. Inserting d. Traversal  

Show Answer
Loading Facebook Comment system, Please wait...
Loading Facebook Comment system, Please wait...
6283 Finding the location of the element with a given value is:
Options:a. Traversal b. Search c. Sort d. None of above  

Show Answer
Loading Facebook Comment system, Please wait...
Loading Facebook Comment system, Please wait...
6284 Arrays are best data structures
Options:a. for relatively permanent collections of data b. for the size of the structure and the data in the structure are constantly changing c. for both of above situation d. for none of above situation  

Show Answer
Loading Facebook Comment system, Please wait...
Loading Facebook Comment system, Please wait...
6285 Linked lists are best suited
Options:a. for relatively permanent collections of data b. for the size of the structure and the data in the structure are constantly changing c. for both of above situation d. for none of above situation  

Show Answer
Loading Facebook Comment system, Please wait...
Loading Facebook Comment system, Please wait...
6286 Each array declaration need not give, implicitly or explicitly, the information about
Options:a. the name of array b. the data type of array c. the first data from the set to be stored d. the index set of the array  

Show Answer
Loading Facebook Comment system, Please wait...
Loading Facebook Comment system, Please wait...
6287 The elements of an array are stored successively in memory cells because
Options:a. by this way computer can keep track only the address of the first element and the addresses of other elements can be calculated b. the architecture of computer memory does not allow arrays to store other than serially c. both of above d. none of above

Show Answer
Loading Facebook Comment system, Please wait...
Loading Facebook Comment system, Please wait...
6288 The memory address of the first element of an array is called
Options:a. floor address b. foundation address c. first address d. base address  

Show Answer
Loading Facebook Comment system, Please wait...
Loading Facebook Comment system, Please wait...
6289 The memory address of fifth element of an array can be calculated by the formula
Options:a. LOC(Array[5]=Base(Array)+w(5-lower bound), where w is the number of words per memory cell for the array b. LOC(Array[5])=Base(Array[5])+(5-lower bound), where w is the number of words per memory cell for the array c. LOC(Array[5])=Base(Array[4])+(5-Upper bound), where w is the number of words per memory cell for the array d. None of above  

Show Answer
Loading Facebook Comment system, Please wait...
Loading Facebook Comment system, Please wait...
6290 Which of the following data structures are indexed structures?
Options:a. linear arrays b. linked lists c. both of above d. none of above  

Show Answer
Loading Facebook Comment system, Please wait...
Loading Facebook Comment system, Please wait...
6294 Two dimensional arrays are also called
Options:a. tables arrays b. matrix arrays c. both of above d. none of above  

Show Answer
Loading Facebook Comment system, Please wait...
Loading Facebook Comment system, Please wait...
6296 Which of the following data structure cant store the non-homogeneous data elements?
Options:a. Arrays b. Records c. Pointers d. None  

Show Answer
Loading Facebook Comment system, Please wait...
Loading Facebook Comment system, Please wait...
6297 Which of the following data structure store the homogeneous data elements?
Options:a. Arrays b. Records c. Pointers d. None  

Show Answer
Loading Facebook Comment system, Please wait...
Loading Facebook Comment system, Please wait...
6298 Each data item in a record may be a group item composed of sub-items; those items which are indecomposable are called
Options:a. elementary items b. atoms c. scalars d. all of above  

Show Answer
Loading Facebook Comment system, Please wait...
Loading Facebook Comment system, Please wait...
6299 The difference between linear array and a record is
Options:a. An array is suitable for homogeneous data but hte data items in a record may have different data type b. In a record, there may not be a natural ordering in opposed to linear array. c. A record form a hierarchical structure but a lienear array does not d. All of above  

Show Answer
Loading Facebook Comment system, Please wait...
Loading Facebook Comment system, Please wait...
6300 Which of the following statement is false?
Options:a. Arrays are dense lists and static data structure b. data elements in linked list need not be stored in adjecent space in memory c. pointers store the next data element of a list d. linked lists are collection of the nodes that contain information part and next pointer  

Show Answer
Loading Facebook Comment system, Please wait...
Loading Facebook Comment system, Please wait...
6301 Binary search algorithm can not be applied to
Options:a. sorted linked list b. sorted binary trees c. sorted linear array d. pointer array  

Show Answer
Loading Facebook Comment system, Please wait...
Loading Facebook Comment system, Please wait...
www.000webhost.com