Computer Knowledge

Data Structures and Algorithms

1,256 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 is/are the properties of sequential file organisation?

  1. A pointer points to the next record in order.

  2. Indexes are required to represent stored records.

  3. A tree structure is used to represent multi level index.

  4. If the order is lost, the file has to be re-organised.

  5. Only 1 and 4.
Reveal answer Fill a bubble to check yourself
E Correct answer
Explanation

Both are the properties of sequential access.

Multiple choice

The inorder traversal of which data structure is always in sorted order?

  1. AVL tree

  2. Min-max heap

  3. Binary search tree

  4. Unrooted binary tree

  5. Random binary tree
Reveal answer Fill a bubble to check yourself
C Correct answer
Explanation

A binary search tree (BST), sometimes also called an ordered or sorted binary tree, is a node-based binary tree data structure.The major advantage of binary search trees over other data structures is that the related sorting algorithms and search algorithms such as inorder traversal can be very efficient.

Multiple choice

Which kind of errors are corrected by Minimum Hamming Distance Method?

  1. Semantic errors

  2. Syntactic errors

  3. Algorithmic errors

  4. Transcription errors
Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

The Minimum Hamming Distance Method is an error detection and correction technique used in digital communication and coding theory. It is specifically designed to detect and correct bit-level errors that occur during data transmission, which are classified as syntactic errors rather than semantic or algorithmic mistakes.

Multiple choice

Which of the following optimisations avoids a test at every iteration?

  1. Loop ramming

  2. Loop unrolling

  3. Both (1) and (2)

  4. Either (1) or (2)
Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

Loop unrolling replicates the loop body multiple times within a single iteration, thereby reducing the number of loop control instructions executed. By processing multiple elements per iteration, the branch prediction overhead and loop condition testing are minimized, significantly improving performance for computationally intensive loops.

Multiple choice

Which of the following is not a true statement?

  1. A binary search tree is represented by the linked list using pointers.

  2. In linked list representation of binary tree, the left pointer points to the data field of the next node.

  3. A binary search tree should have data field in the linked list representation.

  4. Doubly linked list can be used to represent the binary search tree.

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

All of the above are the true statements.

Multiple choice

Which of the following is/are not a true statement(s)?

  1. A binary search tree may be empty.

  2. In a binary search tree, the left and right subtree of the root are also binary search trees.

  3. A binary search tree can be represented using linked list.

  4. A binary search tree can be represented using a array.

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

All of the above are the true statements.

Multiple choice

What is the mean of shape property of a heap data structure?

  1. It means that the node, which is the smallest of all its children, is called min heap.

  2. It means that the node, which is the largest of all its children, is called max heap.

  3. It means that the heap is a completely or nearly complete binary tree.

  4. Both (2) and (3)

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

This is called Shape property of a heap.

Multiple choice

Which of the following is a false statement?

  1. A data structure is a logical representation of a particular data.

  2. Stack and queue are linear data structures.

  3. A heap is called a binary tree.

  4. Data structures also have merging operation.

  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.

Multiple choice

Structure programming codes include

  1. sequencing

  2. arrangement of objects

  3. iteration

  4. both (1) and (3)
Reveal answer Fill a bubble to check yourself
D Correct answer
Explanation

Structured programming is built on three fundamental control structures: sequence (executing steps in order), selection (making decisions with if-then-else), and iteration (looping with while or for). These structures form the basis for writing organized, maintainable code without goto statements.