Đề Thi FE CSD201 - SU26 - FE - RE

[adminadmin is verified member.]

Học kỳ

SU2026

Thời Gian

9/8/26

Loại tài liệu

FE

CSD201 SU26 FE RE

CSD201 SU26 FE RE Questions​

This document contains a set of multiple-choice questions from a CSD201 exam. The questions cover fundamental data structures such as singly and doubly linked lists, time complexities of node insertion, operations on linked lists, and the applicability of binary search algorithms.

CSD201 SU26 FE RE Questions​

Câu 1
Select the statement that is most correct.
Basically, the complexity of inserting new element before a given node in the middle of a singly linked lists is
A. O(n^2)
B. O(1)
C. O(log n)
D. O

Câu 2
Select the statement that is most correct.
Suppose we are considering a doubly linked list which has at least 2 nodes. What does the java code snippet below do?
Node f = tail.prev; // prev is a link to predecessor node
Node q = new Node(x);
q.prev = f; q.next = tail;
f.next = q; tail.prev = q;
A. It creates new node with value x at the middle of the list.
B. It inserts new node with value x after the last node.
C. It replaces the last node with new node with value x.
D. It inserts new node with value x before the last node.

Câu 3
Select the statement that is most correct.
Basically, the complexity of inserting a node after a given node in a singly linked lists is
A. O
B. O(1)
C. O(log n)
D. O(n^2)

Câu 4
Consider the fun() method in a singly linked list below:
void fun()
{ if (isEmpty()) return;
if (head == tail)
head = tail = null;
else head = head.next;
}
Specify the correct statement about the fun() method in the code above (choose the most suitable one).
A. It removes the last element of the list
B. It removes the first element of the list
C. It removes the second element of the list
D. It returns the first element of the list

Câu 5
Binary search algorithm cannot be applied to
A. sorted linear array
B. sorted singly linked list
C. Binary search tree