CS301P Quiz 1 Set 2

CS301P - Quiz No.1

Date: 24 April 2026

Q1. Which method of Node class returns the value of node in a Linked list?

1. get()
2. tail()
3. start()
4. back()

Correct answer: get()

Q2. What does the following method do for a given linked list class? void traverse(List list) { Node* savedCurrentNode = list.currentNode; list.currentNode = list.headNode; for(int i = 1; list.next(); i++) {cout << "\n Element " << i << " " << list.get(); } list. currentNode = savedCurrentNode; }

1. Displaying the values of nodes
2. Updating the values of nodes
3. Adding new nodes
4. Deleting nodes

Correct answer: Displaying the values of nodes

Q3. Nodes in the linked list are accessed in _________ order:

1. Random
2. Descending
3. Sequential
4. Non-linear

Correct answer: Sequential

Q4. Which of the following is used to navigate from one node to another node in the linked list?

1. Object field of node
2. Null pointer
3. None of the given options
4. Next part of node

Correct answer: Next part of node

Q5. Which of the following statement declares an array ‘x’ with 6 integers?

1. int [6] x;
2. int x = 6;
3. float x[6];
4. int x[6];

Correct answer: int x[6];

Generated With VU Toolkit Made with ♥ by Paradoxical