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 classification of computer introduction to the information age physics

At Pushdown automata is __________ if there is at most one transition applicable to each configuration.

  1. Deterministic

  2. None-deterministic

  3. Finite

  4. None-finite
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

At pushdown automata is deterministic if there is at most one transition applicable to each configuration.

In automata theory, a deterministic pushdown automaton (DPDA or DPA) is a variation of the push down automata. The class of deterministic pushdown automata accepts the deterministic context free languages, a proper subset of context free languages.

 A deterministic pushdown automaton has at most one legal transition for the same combination of input symbol, state, and top stack symbol. 

A pushdown automaton (PDA) is a finite state machine which has an additional stack storage. The transitions a machine makes are based not only on the input and current state, but also on the stack.


Multiple choice business mathematics and statistics introduction to index number introduction to index numbers index numbers applied statistics

In multilevel indexes, primary index created for its first level is classified as

  1. zero level of multilevel index.

  2. third level of multilevel index.

  3. second level of multilevel index.

  4. first level of multilevel index.
Reveal answer Fill a bubble to check yourself
C Correct answer
Explanation

In multilevel indexes, primary index is created for its first level  is classified as second level of multilevel index.

Multiple choice

What is a recursive function?

  1. A function that calls itself

  2. A function that uses nested for-loops

  3. A function that does not produce an output

  4. A function that takes multiple inputs
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

A recursive function is defined by its ability to call itself during execution to solve smaller instances of the same problem. This process continues until a base case is reached.

Multiple choice

How does a linked list differ from an array?

  1. The size is dynamically allocated

  2. The size is static

  3. It is last-in-first-out

  4. It is first-in-first-out
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

Arrays have a fixed size defined at creation, whereas linked lists can grow or shrink dynamically by allocating and deallocating memory for individual nodes as needed.

Multiple choice

Which data structure is first-in-first-out?

  1. Stack

  2. Queue

  3. Linked list

  4. Binary tree
Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

A queue follows the First-In-First-Out (FIFO) principle, where the first element added is the first one to be removed. This is analogous to a line of people waiting for service.

Multiple choice

Which data structure is last-in-first-out?

  1. Stack

  2. Queue

  3. Linked list

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

A stack follows the Last-In-First-Out (LIFO) principle, where the most recently added element is the first one to be removed. This is analogous to a stack of plates.