Data Structures and Algorithms Quiz

Which of the following best describes an abstract data type (ADT)?

• A physical representation of data in memory.

• A logical description of data and allowed operations.

• A method for organizing databases.

• A set of specific programming languages.

What is the primary reason for separating public and private parts in an ADT?

• To improve user access speed.

• To ensure security and implementation independence.

• To enhance memory efficiency.

• To simplify error handling.

Which data structure should be used for maintaining a hierarchy, such as an organizational chart?

• Linked List

• Stack

• Tree

• Graph

In a priority queue, elements are processed based on:

• The order in which they arrive.

• A custom or natural priority.

• The data type of elements.

• Their memory addresses.

Which of the following operations is not typically associated with stacks?

• Push

• Pop

• Dequeue

• Peek

A recursive function must always include:

• A loop structure.

• An infinite call stack.

• A base case.

• Global variables.

What happens if a recursive function lacks a base case?

• The function terminates prematurely.

• Infinite recursion occurs.

• The function produces random results.

• An immediate syntax error arises.

Which algorithm design paradigm is used to solve problems by breaking them into overlapping subproblems and reusing results?

• Divide and Conquer

• Greedy Algorithms

• Dynamic Programming

• Backtracking

Which linked list type allows navigation in both forward and backward directions?

• Singly Linked List

• Circular Linked List

• Doubly Linked List

• Skip List

In which scenario is a stack used during program execution?

• Storing and retrieving URLs in a web browser.

• Managing memory during function calls.

• Sorting large datasets.

• Searching files in a directory.