Data Structures & Algorithms(Computer ) Questions and Answers

Question 1. A variable P is called pointer if
  1.    P points to the address of first element in DATA
  2.    P can store only memory addresses
  3.    P contain the DATA and the address of DATA
  4.    P contains the address of an element in DATA.
Explanation:-
Answer: Option D. -> P contains the address of an element in DATA.
Answer: (d)
Question 2. When new data are to be inserted into a data structure, but there is no available space; this situation is usually called
  1.    Housefull
  2.    Saturated
  3.    Underflow
  4.    Overflow
Explanation:-
Answer: Option D. -> Overflow
Answer: (d)
Question 3. The following name does not relate to stacks
  1.    FIFO lists
  2.    LIFO list
  3.    Piles
  4.    Push-down lists
Explanation:-
Answer: Option A. -> FIFO lists
Answer: (a)
Question 4. The following data structure store the homogeneous data elements
  1.    Arrays
  2.    Records
  3.    Pointers
  4.    None of the above
Explanation:-
Answer: Option B. -> Records
Answer: (b)
Question 5. The space factor when determining the efficiency of algorithm is measured by
  1.    Counting the maximum memory needed by the algorithm
  2.    Counting the minimum memory needed by the algorithm
  3.    Counting the average memory needed by the algorithm
  4.    Counting the maximum disk space needed by the algorithm
Explanation:-
Answer: Option A. -> Counting the maximum memory needed by the algorithm
Answer: (a)
Question 6. Two main measures for the efficiency of an algorithm are
  1.    Time and space
  2.    Processor and memory
  3.    Complexity and capacity
  4.    Data and space
Explanation:-
Answer: Option A. -> Time and space
Answer: (a)
Question 7. A data structure where elements can be added or removed at either end but not in the middle is referred as
  1.    Linked lists
  2.    Stacks
  3.    Queues
  4.    Deque
Explanation:-
Answer: Option D. -> Deque
Answer: (d)
Question 8. The following is two-way list
  1.    Grounded header list
  2.    Circular header list
  3.    Linked list with header and trailer nodes
  4.    None of above
Explanation:-
Answer: Option D. -> None of above
Answer: (d)
Question 9. Which of the following data structure is linear data structure?
  1.    Trees
  2.    Graphs
  3.    Arrays
  4.    None of the above
Explanation:-
Answer: Option C. -> Arrays
Answer: (c)
Question 10. The following data structure can’t store the non-homogeneous data elements
  1.    Arrays
  2.    Records
  3.    Pointers
  4.    None of the above
Explanation:-
Answer: Option A. -> Arrays
Answer: (a)
© Lakshya_Education.com, All Right Reserved.
Contact Us services