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.

https://doi.org/10.15864/jmscm.1310

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

A

To increase the processing speed of the processor.

B

To organize and store data efficiently in a computer system.

C

To reduce the physical size of the computer hardware.

D

To enhance the graphical interface of computer programs.

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

A

Primitive and Non-Primitive Data Structures.

B

Static and Dynamic Data Structures.

C

Simple and Complex Data Structures.

D

Linear and Non-Linear Data Structures.

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

A

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

B

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

C

As graphical structures used primarily for user interface design.

D

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?

A

They primarily focus on hierarchical relationships between data elements.

B

They are mainly used for advanced graphics and visualization tasks.

C

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

D

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

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

A

Sequential Access

B

Last In First Out (LIFO)

C

First In First Out (FIFO)

D

Random Access

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

A

Insertion and deletion are performed only at the front end.

B

Insertion and deletion are performed only at the rear end.

C

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

D

Insertion and deletion can be done at both ends.

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

A

To manage the unassigned memories.

B

To parse arithmetic expressions.

C

To implement a backtracking mechanism.

D

To store interrupts.

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

A

Data, next, and previous parts.

B

Only next part.

C

Only data part.

D

Both data and next parts.

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

A

To organize data objects based on hierarchical relationships.

B

To simplify arithmetic computation.

C

To enhance linear data processing speed.

D

To reduce data storage requirements

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

A

To implement arithmetic operations.

B

To enhance the performance of linear data structures.

C

To represent relationships between entities.

D

For data storage on physical drives.

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

A

Using a bipartite graph to match professors to subjects.

B

Utilizing a binary tree for scheduling.

C

Applying a stack-based algorithm for period allocation

D

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?

A

Breadth-First Search (BFS)

B

Optimal Graph Colouring algorithm

C

Shortest Path algorithm

D

Depth-First Search (DFS)