Data Structure and Algorithms (DSA) MCQs with answers Page - 41

Here, you will find a collection of MCQ questions on Data Structure and Algorithms (DSA). Go through these questions to enhance your preparation for upcoming examinations and interviews.

To check the correct answer, simply click the View Answer button provided for each question.

Have your own questions to contribute? Click the button below to share your MCQs with others!

+ Add Question

A

Admin • 833.24K Points
Coach

Q. Which of the following data structure is not linear data structure?

  • (A) arrays
  • (B) linked lists
  • (C) both of the above
  • (D) none of the above

A

Admin • 833.24K Points
Coach

Q. Inserting an item into the stack when stack is not full is called …………. Operation and deletion of item form the stack, when stack is not empty is called ………..operation.

  • (A) push, pop
  • (B) pop, push
  • (C) insert, delete
  • (D) delete, insert

A

Admin • 833.24K Points
Coach

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

Admin • 833.24K Points
Coach

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

A

Admin • 833.24K Points
Coach

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

A

Admin • 833.24K Points
Coach

Q. Finding the location of the element with a given value is:

  • (A) traversal
  • (B) search
  • (C) sort
  • (D) none of above

A

Admin • 833.24K Points
Coach

Q. The operation of processing each element in the list is known as

  • (A) sorting
  • (B) merging
  • (C) inserting
  • (D) traversal

A

Admin • 833.24K Points
Coach

Q. 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 situatio

A

Admin • 833.24K Points
Coach

Q. Which of the following statement is true?i) Using singly linked lists and circular list, it is not possible to traverse the list backwards.ii) To find the predecessor, it is required to traverse the list from the first node in case of singly linked list.

  • (A) i-only
  • (B) ii-only
  • (C) both i and ii
  • (D) none of the above

A

Admin • 833.24K Points
Coach

Q. What will be the value of top, if there is a size of stack STACK_SIZE is 5

  • (A) 5
  • (B) 6
  • (C) 4
  • (D) none of the above

Add MCQ in this Category

If you want to share an MCQ question in this category, it's a great idea! It will be helpful for many other students using this website.

Share Your MCQ