DATA STRUCTURES EXAMINATION QUESTIONS AND
CORRECT ANSWER WITH EXPLANATION GRADED A+
STUDY GUIDE SOUTHERN NEW HAMPSHIRE UNIVERSITY
1. Data structures are used to:
A. Organize and store data
B. Draw images
C. Compile programs
D. Browse internet
Answer: A
Rationale: They manage data efficiently.
2. An algorithm is:
A. Step-by-step procedure
B. Hardware device
C. Operating system
D. File type
Answer: A
Rationale: Logical sequence of steps.
3. Time complexity measures:
A. Running time of algorithm
B. Screen size
C. File size
D. Memory type
Answer: A
Rationale: Efficiency of execution.
4. Space complexity measures:
A. Memory usage
B. Speed only
C. Output quality
D. File name
Answer: A
Rationale: Memory required.
5. Big O notation describes:
A. Algorithm growth rate
, B. File format
C. Screen resolution
D. Hardware type
Answer: A
Rationale: Performance analysis.
6. Array is:
A. Collection of same type elements
B. Mixed data collection
C. Single value
D. Function
Answer: A
Rationale: Homogeneous structure.
7. Array index starts from:
A. 0
B. 1
C. -1
D. 10
Answer: A
Rationale: Zero-based indexing.
8. Linked list is:
A. Dynamic data structure
B. Static array
C. Sorting algorithm
D. File system
Answer: A
Rationale: Node-based structure.
9. Each node in linked list contains:
A. Data and pointer
B. Only data
C. Only pointer
D. Only index
Answer: A
Rationale: Structure of node.
10. Singly linked list has:
A. One pointer
, B. Two pointers
C. No pointer
D. Three pointers
Answer: A
Rationale: Points to next node.
11. Doubly linked list has:
A. Two pointers
B. One pointer
C. No pointer
D. Three pointers
Answer: A
Rationale: Next and previous links.
12. Circular linked list:
A. Last node connects to first
B. No connection
C. Random links
D. Only one node
Answer: A
Rationale: Forms a loop.
13. Stack follows:
A. LIFO
B. FIFO
C. Random order
D. No order
Answer: A
Rationale: Last In First Out.
14. Queue follows:
A. FIFO
B. LIFO
C. Random order
D. No order
Answer: A
Rationale: First In First Out.
15. Push operation is used in:
A. Stack insertion
CORRECT ANSWER WITH EXPLANATION GRADED A+
STUDY GUIDE SOUTHERN NEW HAMPSHIRE UNIVERSITY
1. Data structures are used to:
A. Organize and store data
B. Draw images
C. Compile programs
D. Browse internet
Answer: A
Rationale: They manage data efficiently.
2. An algorithm is:
A. Step-by-step procedure
B. Hardware device
C. Operating system
D. File type
Answer: A
Rationale: Logical sequence of steps.
3. Time complexity measures:
A. Running time of algorithm
B. Screen size
C. File size
D. Memory type
Answer: A
Rationale: Efficiency of execution.
4. Space complexity measures:
A. Memory usage
B. Speed only
C. Output quality
D. File name
Answer: A
Rationale: Memory required.
5. Big O notation describes:
A. Algorithm growth rate
, B. File format
C. Screen resolution
D. Hardware type
Answer: A
Rationale: Performance analysis.
6. Array is:
A. Collection of same type elements
B. Mixed data collection
C. Single value
D. Function
Answer: A
Rationale: Homogeneous structure.
7. Array index starts from:
A. 0
B. 1
C. -1
D. 10
Answer: A
Rationale: Zero-based indexing.
8. Linked list is:
A. Dynamic data structure
B. Static array
C. Sorting algorithm
D. File system
Answer: A
Rationale: Node-based structure.
9. Each node in linked list contains:
A. Data and pointer
B. Only data
C. Only pointer
D. Only index
Answer: A
Rationale: Structure of node.
10. Singly linked list has:
A. One pointer
, B. Two pointers
C. No pointer
D. Three pointers
Answer: A
Rationale: Points to next node.
11. Doubly linked list has:
A. Two pointers
B. One pointer
C. No pointer
D. Three pointers
Answer: A
Rationale: Next and previous links.
12. Circular linked list:
A. Last node connects to first
B. No connection
C. Random links
D. Only one node
Answer: A
Rationale: Forms a loop.
13. Stack follows:
A. LIFO
B. FIFO
C. Random order
D. No order
Answer: A
Rationale: Last In First Out.
14. Queue follows:
A. FIFO
B. LIFO
C. Random order
D. No order
Answer: A
Rationale: First In First Out.
15. Push operation is used in:
A. Stack insertion
