DATA STRUCTURE EXAM QUESTIONS
AND ANSWERS
C - Correct Answers -1. Which of the following data structure is non linear data
structure?
A.Arrays
B. Linked lists
C.Trees
D.None of above
C - Correct Answers -2. Which of the following data structure is linear data structure?
A.Trees
B. Graphs
C. Arrays
D.none of the above
D - Correct Answers -3. The operation of processing each element in the list is known
as
A.Sorting
B. Merging
C. Inserting
D.Traversal
B - Correct Answers -4. Finding the location of the element with a given value is:
A. Traversal
B. Search
C. Sort
D.None of above
A - Correct Answers -5. Arrays are best data structures
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
B - Correct Answers -6. Linked lists are best suited
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
C - Correct Answers -7. Each array declaration need not give, implicitly or explicitly, the
information about
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
A - Correct Answers -8. The elements of an array are stored successively in memory
cells because
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
D - Correct Answers -9. The memory address of the first element of an array is called
A. floor address
B.foundation address
C. first address
D. base address
A - Correct Answers -10. The memory address of fifth element of an array can be
calculated by the formula
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
A - Correct Answers -11. Which of the following data structures are indexed structures?
A. linear arrays
B. linked lists
C.both of above
D. none of above
C - Correct Answers -12. Which of the following is not the required condition for binary
search algorithm?
A.The list must be sorted
AND ANSWERS
C - Correct Answers -1. Which of the following data structure is non linear data
structure?
A.Arrays
B. Linked lists
C.Trees
D.None of above
C - Correct Answers -2. Which of the following data structure is linear data structure?
A.Trees
B. Graphs
C. Arrays
D.none of the above
D - Correct Answers -3. The operation of processing each element in the list is known
as
A.Sorting
B. Merging
C. Inserting
D.Traversal
B - Correct Answers -4. Finding the location of the element with a given value is:
A. Traversal
B. Search
C. Sort
D.None of above
A - Correct Answers -5. Arrays are best data structures
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
B - Correct Answers -6. Linked lists are best suited
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
C - Correct Answers -7. Each array declaration need not give, implicitly or explicitly, the
information about
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
A - Correct Answers -8. The elements of an array are stored successively in memory
cells because
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
D - Correct Answers -9. The memory address of the first element of an array is called
A. floor address
B.foundation address
C. first address
D. base address
A - Correct Answers -10. The memory address of fifth element of an array can be
calculated by the formula
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
A - Correct Answers -11. Which of the following data structures are indexed structures?
A. linear arrays
B. linked lists
C.both of above
D. none of above
C - Correct Answers -12. Which of the following is not the required condition for binary
search algorithm?
A.The list must be sorted
