Computer Science Data Structure Questions 4 HSST Exam

Following are the questions from DS based on Arrays and Linked List .

1. The memory address of the first element of an array is called

a. floor address

b. foundation address

c. first address

d. base address

---

2. 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

---

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

a. linear arrays

b. linked lists

c. both of above

d. none of above

---

4. Which of the following is not the required condition for binary search algorithm?

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

---

5. Which of the following is not a limitation of binary search algorithm?

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 500.

More Questions >>