CS301 Quiz 1 Set 2

Q1. Consider the following expression: P= A*B+C-D In the above expression “-” is a _________ operator.

1. Binary
2. Logical
3. Technical
4. Unary

Correct answer: Binary

Q2. Consider the linked list having data [6, 72, 35, 65, 25] stored in it. While current pointer is pointing to memory location having 35 stored in it. What will be the resultant linked list after calling add(18) function on the given linked list.

1. 6, 72, 18, 35, 65, 25
2. 6, 72, 35, 18, 65, 25
3. 6, 18 ,72, 35, 65, 25
4. 6, 72, 35, 65, 25, 18

Correct answer: 6, 72, 35, 18, 65, 25

Q3. Consider the linked list implementation of a stack. Which of the following node is considered as Top of the stack?

1. Any node
2. First node
3. Middle node
4. Last node

Correct answer: First node

Q4. In singly linked list a node consists of two parts:

1. Two objects
2. Two pointers
3. Object and pointer
4. Object and structure

Correct answer: Object and pointer

Q5. Which of the following function don’t belongs to the stack class?

1. crash()
2. top()
3. push()
4. pop()

Correct answer: crash()

Q6. A software solution is said to be efficient if it solves the problem _________________ .

1. by consuming more hardware resources.
2. by using some extra resources.
3. within its resource constraints.
4. within no time.

Correct answer: within its resource constraints.

Q7. Consider we have performed the following operations on a stack of size 5. Push(10); Push(20); Push(30); Pop(); Pop(); Push(40); Push(50); Pop(); After the completion of all operations, the number of element present on stack are _____.

1. 3
2. 2
3. 4
4. 1

Correct answer: 2

Q8. The usage of the class of a data structure causes the code of the program

1. Lengthy
2. Complicated
3. Simplifies
4. Difficult

Correct answer: Simplifies

Q9. _______ is a collection of elements arranged in a linear order.

1. Binary Search Tree
2. AVL Tree
3. Stack
4. Heap

Correct answer: Stack

Q10. In singly linked list a node comprises of ___________ field/s.

1. One
2. Four
3. Three
4. Two

Correct answer: Two