Computer Knowledge

Data Structures and Algorithms

1,518 Questions

Data Structures and Algorithms form the core of computer science, focusing on arrays, linked lists, trees, and sorting mechanisms. These concepts are essential for solving complex computational problems efficiently. Test takers preparing for technical and administrative IT exams will find these questions highly relevant.

Array OperationsLinked List ApplicationsSorting AlgorithmsTree Data StructuresMultilevel IndexingAlgorithm Time Complexity

Data Structures and Algorithms Questions

Multiple choice

What will be the output of the program? TreeSet map = new TreeSet(); map.add("one"); map.add("two"); map.add("three"); map.add("four"); map.add("one"); Iterator it = map.iterator(); while (it.hasNext() ) { System.out.print( it.next() + " " ); }

  1. one two three four

  2. four three two one

  3. four one three two

  4. one two three four one
Reveal answer Fill a bubble to check yourself
C Correct answer
Explanation

TreeSet assures no duplicate entries; also, when it is accessed it will return elements in natural order, which typically means alphabetical.

Multiple choice

Which of the following statements is/are not true?

  1. Quick sort uses a pivot element to sort the array.

  2. Heap sort is a stable sort.

  3. Merge sort is a stable sort.

  4. Both (2) and (3)

  5. None of the above
Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

This is a wrong statement as heap sort does not preserve the order of values while sorting, hence it is an unstable sort.

Multiple choice

Which of the following data structures has an application named 'Backtracking'?

  1. Stack

  2. Queue

  3. Tree

  4. Array

  5. None of the above
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

Yes, backtracking is an application of stack data structure. In backtracking, we use one point from source to destination to reach and choosing the path according to stack and if we get a wrong path, then we pop the last path from the stack and then return back to the last point and then again choose the right path.

Multiple choice

Which of the following is a precondition of the binary search?

  1. Binary search is not efficient for large data values like 1000 records.

  2. Array should be either in ascending or descending sorted order.

  3. Mid element should be already defined in the given array.

  4. Both (1) and (2)

  5. None of the above
Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

This is the statement for binary search precondition.

Multiple choice

Which of the following is not related to stack data structure?

  1. LIFO

  2. Push and pop

  3. Front and rear

  4. Both (1) and (3)

  5. None of these
Reveal answer Fill a bubble to check yourself
C Correct answer
Explanation

These terms are not related to the stack data structure . Front and rear are the terms related to queue data structure, in which all the insertion are performed only at one end, called rear and all the deletion are performed at one end, called front end.

Multiple choice

Which of the following statements is false?

  1. Array is a collection of homogeneous elements.

  2. Quick sort is based on the divide and conquer method.

  3. Array is an index based data structure.

  4. The worst case complexity of quick sort is O(n^2).

  5. None of the above
Reveal answer Fill a bubble to check yourself
E Correct answer
Explanation

This is the correct choice as all the above statements are true.

Multiple choice

Which of the following statements is/are true?

  1. Static data structures have a fixed size.

  2. Insertion/deletion occurs fast in static data structure.

  3. Stack is a dynamic data structure.

  4. All of the above

  5. Only (1) and (3) are true.
Reveal answer Fill a bubble to check yourself
E Correct answer
Explanation

Yes, both the options are true.

Multiple choice

Which of the following is a true statement?

  1. Specialisation determines the top-down approach in the database.

  2. Generalisation defines the bottom-up approach in the database.

  3. In the network model if the database, there may be multiple paths possible to communicate the entities.

  4. All of the above

  5. Only (1) and (3)

Reveal answer Fill a bubble to check yourself
D Correct answer
Explanation

Yes, all of the above are the true statements in the database concept.

Multiple choice

Which of the following is not a true statement?

  1. A queue is defined as an ordered list.

  2. A queue can be implemented by the array.

  3. The element is deleted from the from end of the queue.

  4. A queue is a FIFO (First In First Out Data Structure).

  5. None of the above
Reveal answer Fill a bubble to check yourself
E Correct answer
Explanation

Yes, all of the above are the true statements.