Back to Subject

Unit 2 - Practice Quiz

CSE205 50 Questions
0 Correct 0 Wrong 50 Left
0/50

1 What are the two main components of a node in a singly linked list?

A. Head and Tail
B. Value and Reference Count
C. Data and Index
D. Data and Next Pointer

2 Which of the following best describes the memory allocation of a linked list?

A. Dynamic and Non-contiguous
B. Static and Non-contiguous
C. Static and Contiguous
D. Dynamic and Contiguous

3 What is the time complexity to access the Nth element in a singly linked list?

A. O(log n)
B. O(n)
C. O(n^2)
D. O(1)

4 Which pointer is required to maintain access to the entire linked list?

A. Head pointer
B. Middle pointer
C. Null pointer
D. Tail pointer

5 In C, which function is commonly used to dynamically allocate memory for a new node?

A. malloc()
B. new()
C. create()
D. alloc()

6 What is the value of the 'next' pointer in the last node of a grounded singly linked list?

A. NULL
B. Address of the Head
C. Garbage value
D. Address of the previous node

7 Which of the following is a disadvantage of a singly linked list compared to an array?

A. Expensive insertion at the beginning
B. Fixed size
C. Cannot expand dynamically
D. Memory wastage due to pointers

8 In a self-referential structure definition for a node, what is the data type of the pointer member?

A. char*
B. int*
C. void*
D. struct node*

9 What condition indicates that a singly linked list is empty?

A. head->data == 0
B. head == NULL
C. head == tail
D. head->next == NULL

10 What is the time complexity for inserting a node at the beginning of a singly linked list?

A. O(log n)
B. O(n)
C. O(n log n)
D. O(1)

11 When traversing a singly linked list, what is the condition to stop the loop?

A. ptr->next == NULL
B. ptr->data == NULL
C. ptr == NULL
D. ptr == head

12 Which scenario results in an 'Overflow' condition in a linked list?

A. The list contains a loop
B. The Free Storage Pool (Avail List) is empty
C. The head pointer is lost
D. The list is empty

13 What is the correct order of operations to insert a node 'NEW' between node 'A' and node 'B' (where A->next is B)?

A. A->next = NEW; NEW->next = B;
B. NEW->next = A; A->next = B;
C. B->next = NEW; NEW->next = A;
D. NEW->next = B; A->next = NEW;

14 What is the time complexity of deleting the last node in a singly linked list (without a tail pointer)?

A. O(log n)
B. O(n)
C. O(n^2)
D. O(1)

15 Which function is used to release the memory of a deleted node back to the system?

A. delete()
B. remove()
C. dalloc()
D. free()

16 What is a 'Header Linked List'?

A. A list that contains a special node at the beginning containing metadata
B. A list with two pointers per node
C. A list where the last node points to the head
D. A list sorted in ascending order

17 In a 'Grounded' Header Linked List, what does the last node point to?

A. The First Data Node
B. The Header Node
C. Random Memory
D. NULL

18 In a 'Circular' Header Linked List, what does the last node point to?

A. The Last Node itself
B. The First Data Node
C. The Header Node
D. NULL

19 What is the primary advantage of using a Header node?

A. It simplifies insertion and deletion algorithms by removing special cases for the first node
B. It uses less memory
C. It automatically sorts data
D. It allows binary search

20 What defines a Circular Linked List (without a header)?

A. Nodes are arranged in a circle visually only
B. Head is NULL
C. Last node points to the first node
D. Last node points to NULL

21 What is the loop termination condition when traversing a circular linked list starting from head?

A. ptr == head (after starting)
B. ptr->next == head
C. ptr->next == NULL
D. ptr == NULL

22 Which data structure allows traversal in both forward and backward directions?

A. Circular Singly Linked List
B. Stack
C. Singly Linked List
D. Two-way (Doubly) Linked List

23 How many pointers does a standard node in a Doubly Linked List contain?

A. Zero
B. Two
C. One
D. Three

24 What is the memory overhead of a Doubly Linked List compared to a Singly Linked List?

A. 50% less
B. Same
C. Requires one extra pointer per node
D. Requires double the data space

25 In a Doubly Linked List, to delete a node P (not first/last), which operations are needed?

A. P->prev->next = P->next; P->next->prev = P->prev;
B. head = P->next;
C. P->prev->next = P->prev; P->next->prev = P->next;
D. P->next = NULL; P->prev = NULL;

26 What is the time complexity to delete a node in a Doubly Linked List if the pointer to that node is given?

A. O(log n)
B. O(1)
C. O(n)
D. O(n log n)

27 Which list is best suited for implementing a 'Back' and 'Forward' button in a browser?

A. Doubly Linked List
B. Queue
C. Circular Linked List
D. Singly Linked List

28 In a Circular Doubly Linked List, what does the left (prev) pointer of the first node point to?

A. The first node
B. The second node
C. NULL
D. The last node

29 Which condition indicates 'Underflow' in a linked list?

A. Inserting into a full memory
B. Allocating NULL
C. Deleting from an empty list
D. Traversing past the end

30 If a Singly Linked List is effectively used as a Stack, which end is most efficient for Push and Pop?

A. Push at End, Pop at Start
B. Push at Start, Pop at Start
C. Push at End, Pop at End
D. Push at Start, Pop at End

31 Can Binary Search be effectively applied to a standard Linked List?

A. No, because it's not sorted
B. Yes, with O(n) complexity
C. No, because random access is not allowed
D. Yes, with O(log n) complexity

32 What happens if you free a node without updating the pointers pointing to it?

A. Memory Leak
B. Stack Overflow
C. List becomes circular
D. Dangling Pointer

33 What is the logical structure of a linked list?

A. Grid
B. Non-Linear
C. Linear
D. Hierarchical

34 In a Doubly Linked List, if p points to a node, what is p->next->prev equivalent to (assuming p is not last)?

A. p->next
B. p
C. NULL
D. p->prev

35 Which algorithm is commonly used to detect a cycle (loop) in a linked list?

A. Floyd’s Cycle-Finding Algorithm (Tortoise and Hare)
B. Quick Sort
C. Dijkstra's Algorithm
D. Binary Search

36 To reverse a singly linked list, how many pointers are typically required during the traversal?

A. 4
B. 2
C. 1
D. 3

37 What is a Sentinel node?

A. A dummy node (like a header) used to simplify boundary conditions
B. A node responsible for memory allocation
C. The last node in a list
D. A node with NULL data

38 Which polynomial operation is most efficiently handled by linked lists?

A. Addition of sparse polynomials
B. Roots finding
C. Graphing
D. Evaluation

39 In a Two-way list, inserting a node at the beginning requires changing how many existing pointers (excluding the new node's pointers)?

A. 3
B. 1
C. 0
D. 2

40 What data type is head typically declared as?

A. struct node*
B. void
C. int
D. struct node

41 If ptr is a pointer to a node, how do you access the data of that node in C?

A. ptr->data
B. ptr.data
C. &ptr.data
D. *ptr.data

42 Which operation typically runs faster on a Circular Linked List than a standard Singly Linked List?

A. Binary Search
B. Sorting
C. Finding the Nth node
D. Deleting the first node while maintaining a pointer to the last node

43 Which of the following is NOT a type of linked list?

A. Circular Linked List
B. Singly Linked List
C. Doubly Linked List
D. Indexed Linked List

44 Memory for a linked list node is allocated from which segment?

A. Data Segment
B. Code Segment
C. Heap
D. Stack

45 What is the main disadvantage of a Circular Linked List?

A. Insertion is O(n)
B. Requires double memory
C. Risk of infinite loops during traversal if not handled carefully
D. Cannot traverse backwards

46 To concatenate two singly linked lists (List A and List B) into one, what operation is required?

A. Traverse A to the end and make the last node point to head of B
B. Copy all nodes of B to A
C. Traverse B to end and point to A
D. Make head of A point to head of B

47 How do you represent a Polynomial using a linked list?

A. Array of integers
B. Nodes store coefficient and exponent: [3,2] -> [5,0] -> NULL
C. Nodes store only coefficients
D. Nodes store value of x

48 In a doubly linked list, what does head->prev point to?

A. The second node
B. Random garbage
C. NULL
D. The tail

49 When deleting a node from a linked list, why is a temporary pointer often used?

A. To store the address of the node to be freed so links can be rewired first
B. To allocate new memory
C. To speed up deletion
D. It is required by the C syntax

50 Which complexity best describes sorting a Linked List using Merge Sort?

A. O(n^2)
B. O(n log n)
C. O(n)
D. O(1)
Previous MCQ
Unit 1
Next MCQ
Unit 3