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

_____ allocation is a disk-based version of linked list.

  1. Chained

  2. Non-chained

  3. Clustered

  4. None of these
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

Chained allocation is a method where each block contains a pointer to the next block in the file, effectively functioning like a linked list stored on the disk.

Multiple choice

An array element is accessed by using

  1. the dot operator

  2. a member name

  3. an index number

  4. a FIFO method
Reveal answer Fill a bubble to check yourself
C Correct answer
Explanation

Array elements are accessed by their position in the array, which is specified using an index number enclosed in square brackets. The index starts at 0 for the first element.

Multiple choice

When a multi-dimensional array is accessed, each array index is

  1. separated by commas

  2. surrounded by brackets and separated by commas

  3. surrounded by brackets

  4. separated by commas and surrounded by brackets
Reveal answer Fill a bubble to check yourself
C Correct answer
Explanation

In multi-dimensional arrays, each dimension's index is enclosed in its own set of square brackets (e.g., array[i][j]).

Multiple choice

In a linked list

  1. each link contains a pointer to the next link

  2. an array of pointers points to the link

  3. no link contains data

  4. the links are stored in an array
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

A linked list is a linear data structure where elements are not stored in contiguous memory locations. Each element (node) contains data and a pointer (or reference) to the next node in the sequence.

Multiple choice

Which of the following places the common data elements in order from smallest to largest?

  1. Character, file, record, field, database

  2. Character, record, field, database, file

  3. Character, field, record, file, database

  4. Bit, byte, character, record, field, file, database,

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

Data hierarchy in computing progresses from the smallest unit of storage to the largest. A character is a single unit, which forms a field, multiple fields form a record, multiple records form a file, and a collection of files forms a database.

Multiple choice

Which of the following places the common data elements in order from smallest to largest?

  1. Character, file, record, field, database

  2. Character, record, field, database, file

  3. Character, field, record, file, database

  4. Bit, byte, character, record, field, file, database,

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

The standard hierarchy of data organization from smallest to largest is: Character (or bit/byte), Field, Record, File, and Database. This represents the logical structure of data storage.

Multiple choice

To solve consistency problem ___ algorithm is used.

  1. write through

  2. write before

  3. write after

  4. none of these
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

Write-through is a caching strategy where data is written to the cache and the underlying storage simultaneously, ensuring consistency between the two.

Multiple choice

Which structure is more amenable for searching?

  1. Binary tree

  2. Singular linked list

  3. Double linked list

  4. Array
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

Binary trees, specifically balanced ones, allow for O(log n) search time, which is significantly faster than the O(n) linear search required for linked lists or unsorted arrays.

Multiple choice

What does multilevel indexing use?

  1. It uses a binary search tree.

  2. It uses binary search.

  3. Both (1) and (2)

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

In binary search tree, it goes according to the root element. If item to be searched is less than root, then it seaches to the left of root otherwise to the right.