Data Structures PRL Quiz 1.

Read the paper following paper to answer the quiz below.

Dutta, S., Chowdhury, A., Debnath, I., Sarkar, R., Dey, H., & Dutta, A. (2020). THE ROLE OF DATA STRUCTURES IN DIFFERENT FIELDS OF COMPUTER-SCIENCE: A REVIEW. Journal of Mathematical Sciences & Computational Mathematics, 1(3), 363-373.

Question 1: What is the primary purpose of data structures in computer science?

To organize and store data efficiently in a computer system.

To reduce the physical size of the computer hardware.

To increase the processing speed of the processor.

To enhance the graphical interface of computer programs.

Question 2: What are the two main categories of data structures mentioned in the paper?

Static and Dynamic Data Structures.

Simple and Complex Data Structures.

Primitive and Non-Primitive Data Structures.

Linear and Non-Linear Data Structures.

Question 3: How are arrays described in the context of data structures?

As graphical structures used primarily for user interface design.

As complex, non-linear structures that arrange data in a hierarchical manner.

As simple, linear data structures that organize data in a sequential, contiguous memory space.

As dynamic structures that can change size during program execution.

Question 4: What is a significant characteristic of linear data structures as mentioned in the paper?

They are less efficient in terms of memory usage compared to non-linear data structures.

They are constructed as a continuous arrangement of data elements in memory.

They primarily focus on hierarchical relationships between data elements.

They are mainly used for advanced graphics and visualization tasks.

Question 5: What is the principle of operation for a stack in data structures?

First In First Out (FIFO)

Last In First Out (LIFO)

Question 6: Which of the following best describes the operation of a circular queue?

Insertion and deletion can be done at both ends.

Insertion and deletion are performed only at the front end.

Insertion at the rear end and deletion at the front end.

Insertion and deletion are performed only at the rear end.

Question 7: Which of the following is a common application of queues in operating systems?

To parse arithmetic expressions.

To manage the unassigned memories.

To implement a backtracking mechanism.

To store interrupts.

Question 8. In a linked list, what does each node typically consist of?

Data, next, and previous parts.

Both data and next parts.

Question 9. What is the primary advantage of using tree data structures in computer systems?

To simplify arithmetic computation.

To reduce data storage requirements

To organize data objects based on hierarchical relationships.

To enhance linear data processing speed.

Question 10. What is a graph data structure mainly used for in computer science?

For data storage on physical drives.

To implement arithmetic operations.

To represent relationships between entities.

To enhance the performance of linear data structures.

Question 11. What graph-based approach is used for efficient complex timetable scheduling?

Applying a stack-based algorithm for period allocation

Utilizing a binary tree for scheduling.

Using a bipartite graph to match professors to subjects.

Implementing a circular queue for class allocation.

Question 12. Which algorithm is crucial in applications such as Google Maps for finding the shortest path between two cities?

Optimal Graph Colouring algorithm

Breadth-First Search (BFS)

Depth-First Search (DFS)

Shortest Path algorithm