lmms-lab/CSBench_MCQ · Datasets at Hugging Face

ID int64 1 1.96k	Split stringclasses 1 value	Domain stringclasses 4 values	SubDomain stringclasses 24 values	Format stringclasses 1 value	Tag stringclasses 2 values	Language stringclasses 1 value	Question stringlengths 15 717	A stringlengths 1 292	B stringlengths 1 232	C stringlengths 1 217	D stringlengths 1 192	Answer stringclasses 4 values	Explanation stringlengths 21 1.43k ⌀
1	Test	Data Structure and Algorithm	Overview	Multiple-choice	Knowledge	English	The three fundamental elements of data structure include ( ).	Logical structure, storage structure, operations on data	Logical structure, algorithm design, program implementation	Data types, data storage, data manipulation	Data Definition, Data Implementation, Data Manipulation	A	null
2	Test	Data Structure and Algorithm	Overview	Multiple-choice	Knowledge	English	Data in computer science refers to ( ):	The carriers of information, a set consisting of numbers, characters, and all symbols that can be processed by a computer, which describe the attributes of objective entities.	Limited to numbers and characters	The result of information processing	Variables and functions in computer programs	A	null
3	Test	Data Structure and Algorithm	Overview	Multiple-choice	Knowledge	English	What is the definition of a data item in a data structure?	The indivisible smallest unit that constitutes a data element.	A step in the data processing process	A subset of data elements	a field in the database	A	null
4	Test	Data Structure and Algorithm	Overview	Multiple-choice	Knowledge	English	What does a data object refer to in a data structure?	A collection of data elements with the same properties is a subset of the data.	The primary data sources processed in computer programs	The main body of data storage	Basic Components of a Database Management System	A	null
5	Test	Data Structure and Algorithm	Overview	Multiple-choice	Knowledge	English	What categories are typically included in data types?	Structural type, atomic type, abstract data type	Atomic types, numeric types, character types	Boolean type, composite type, interface type	Character type, numeric type, enumeration type	C	null
6	Test	Data Structure and Algorithm	Overview	Multiple-choice	Knowledge	English	What is the relationship between logical structure and storage structure in data structures?	Mutually independent, not affecting each other.	The logical structure affects the storage structure, but the storage structure does not affect the logical structure.	The storage structure affects the logical structure, but the logical structure does not affect the storage structure.	Inseparable, the design of an algorithm depends on the logical structure, while the implementation relies on the storage structure.	D	null
7	Test	Data Structure and Algorithm	Overview	Multiple-choice	Knowledge	English	What are the main types of data storage structures?	Sequential storage, linked storage, indexed storage, hash storage.	Linear storage, tree storage, graph storage, network storage	Static storage, dynamic storage, direct storage, indirect storage	Random Access, Sequential Access, Direct Access, Indirect Access	A	null
8	Test	Data Structure and Algorithm	Overview	Multiple-choice	Knowledge	English	What are the main operations applied to data?	Definition and Implementation of Operations	Types and scope of operations	Frequency and efficiency of operations	Methods and tools of operation	A	null
9	Test	Data Structure and Algorithm	Overview	Multiple-choice	Knowledge	English	When storing data, what is typically required to be stored?	Only the value of the data element	The values of data elements and the relationships between data elements.	The type and size of data elements	The physical address of data and the method of storage	B	null
10	Test	Data Structure and Algorithm	Overview	Multiple-choice	Knowledge	English	In the design of linked storage, the correct description regarding the storage space of nodes and the addresses of storage units within nodes is:	The storage space of each different node and the addresses of storage units within the node must be contiguous.	The storage space of different nodes can be discontinuous, but the addresses of storage units within a node must be continuous.	The storage space for each distinct node must be contiguous, but the addresses of storage units within a node can be non-contiguous.	The storage spaces of different nodes and the addresses of storage units within the nodes can be discontinuous.	B	null
11	Test	Data Structure and Algorithm	Overview	Multiple-choice	Knowledge	English	Algorithms in computer science are typically defined as what?	Description of the steps to solve a specific problem, including a finite sequence of instructions, each instruction comprising one or more operations.	The execution order of computer programs	Methods and Techniques of Data Processing	The process and standards of software development	A	null
12	Test	Data Structure and Algorithm	Overview	Multiple-choice	Knowledge	English	When analyzing the space complexity of an algorithm, if the space occupied by the input data is only related to the problem itself, how should it be considered?	Analyze the total amount of space occupied by the entire program.	Only consider the space occupied by the input data.	Analyze the auxiliary space excluding the input and the program itself.	Consider the space dynamically allocated during the execution of the algorithm.	C	null
13	Test	Data Structure and Algorithm	Overview	Multiple-choice	Knowledge	English	What are the main components of a program?	Data Structures and User Interface	Code and Documentation	Data Structures and Algorithms	Functions and Variables	C	null
14	Test	Data Structure and Algorithm	Overview	Multiple-choice	Knowledge	English	What is the definition of an algorithm in computer science?	Methods for solving problems	Set of computer instructions	A description of the steps to solve a specific problem, which is a finite sequence of instructions.	A functional module in a programming language	C	null
15	Test	Data Structure and Algorithm	Overview	Multiple-choice	Knowledge	English	How is the time complexity of an algorithm defined?	The maximum storage space required for algorithm execution	The number of times a basic operation is repeated in an algorithm is a function f(n) of the problem size n, representing the growth rate of the algorithm's execution time as the problem size n increases.	The number of steps required for an algorithm to complete a task	The ratio of the time required for algorithm execution to the length of input data.	B	null
16	Test	Data Structure and Algorithm	Overview	Multiple-choice	Knowledge	English	What aspects does data operation include?	Implementation of operations only, i.e., specific operational steps.	Only include the definition of the operation, that is, to indicate the function of the operation.	Including the definition and implementation of operations, where the definition is for the logical structure and the implementation is for the storage structure.	Only includes data computation and analysis.	C	null
17	Test	Data Structure and Algorithm	Overview	Multiple-choice	Knowledge	English	How is the efficiency of an algorithm and the requirement for low storage defined?	Efficiency refers to the conciseness of the algorithm's writing, and storage requirement indicates the amount of space occupied after the algorithm is completed.	Efficiency refers to the time it takes for an algorithm to execute, while storage requirement refers to the maximum storage space needed during the execution of the algorithm. Both are related to the size of the problem.	Efficiency refers to the execution speed of the algorithm, and storage requirement refers to the memory space used by the algorithm code	Efficiency refers to the ability of an algorithm to solve problems, while storage requirement indicates the size of memory occupied by the algorithm.	B	null
18	Test	Data Structure and Algorithm	Overview	Multiple-choice	Knowledge	English	What is a data type?	Intermediate results generated during the data processing process	A collective term for a set of values and a group of operations defined on this set.	The format used for data storage	Variable types in a specific programming language	B	null
19	Test	Data Structure and Algorithm	Overview	Multiple-choice	Knowledge	English	Among the following data structures, ( ) is a non-linear data structure.	Tree	string	Queue	Stack	A	null
20	Test	Data Structure and Algorithm	Overview	Multiple-choice	Knowledge	English	The following term unrelated to the data storage structure is()	Circular Queue	Linked list	Hash table	Stack	D	null
21	Test	Data Structure and Algorithm	Overview	Multiple-choice	Knowledge	English	The correct statement about data structures is ().	The logical structure of data is independent of its storage structure.	The storage structure of data is independent of its logical structure.	The logical structure of data uniquely determines its storage structure.	The data structure is determined solely by its logical structure and storage structure.	A	null
22	Test	Data Structure and Algorithm	Overview	Multiple-choice	Knowledge	English	When storing data, it is common not only to store the values of each data element, but also to store ().	Data manipulation methods	The type of data elements	The relationship between data elements	Data Access Methods	C	null
23	Test	Data Structure and Algorithm	Overview	Multiple-choice	Knowledge	English	In the design of linked storage, the address of the storage cell within a node ()	uniformly continuous	Definitely discontinuous	not necessarily continuous	Partially continuous, partially discontinuous	A	null
24	Test	Data Structure and Algorithm	Overview	Multiple-choice	Reasoning	English	The time complexity of a certain algorithm is O(n^2), indicating that the algorithm's ( )	The problem size is n^2.	Execution time equals n^2.	The execution time is directly proportional to n^2.	The problem size is directly proportional to n^2.	C	The time complexity is O(n^2), which means the time complexity T(n) satisfies T(n) ≤ cn^2 (where c is a proportionality constant), that is, T(n) = O(n^2). The time complexity T(n) is a function of the problem size n, and the problem size remains n, not n^2.
25	Test	Data Structure and Algorithm	Overview	Multiple-choice	Reasoning	English	The time complexity of the following algorithm is ( ). void fun(int n){ int i=1; while(i<=n) i=i*2; }	O(n)	O(n^2)	O(nlog₂n)	O(log2n)	D	Identify the basic operation i=i2, with the number of executions denoted as t, then 2^t≤n, which implies t≤log2n, hence the time complexity T(n)=O(log2n). A more intuitive approach: calculate the number of times the basic operation i=i2 is executed (doubling the main variable with each execution), where the condition can be understood as 2^t=n, that is, t=log2n, thus T(n)=O(log2n).
26	Test	Data Structure and Algorithm	Overview	Multiple-choice	Reasoning	English	The following algorithm has a time complexity of (). void fun(int n){ int i=0; while(iii<-n) i++; }	O(n)	O(nlog₂n)	O(∛n)	O(√n)	C	The basic operation is i++, with the number of executions denoted as t, satisfying ttt ≤ n, which is t^3 ≤ n. Therefore, t ≤ ∛n, and thus T(n) = O(∛n).
27	Test	Data Structure and Algorithm	Overview	Multiple-choice	Reasoning	English	Among the following statements, the incorrect one is (). Ⅰ. An algorithm working in place means that it does not require any additional auxiliary space. Ⅱ. For the same size n, an algorithm with complexity O(n) is always better in terms of time than an algorithm with complexity O(2^n). Ⅲ. Time complexity refers to an upper bound estimate of the execution time of an algorithm in the worst-case scenario. Ⅳ. For the same algorithm, the higher the level of the implementation language, the lower the execution efficiency.	Ⅰ	Ⅰ, Ⅱ	Ⅰ, Ⅳ	Ⅲ	A	Ⅰ. An in-place algorithm refers to an algorithm that requires a constant amount of auxiliary space. Ⅱ. This item assesses the understanding of algorithm efficiency, where time complexity refers to asymptotic time complexity. Do not arbitrarily assign a special value to n; an algorithm with a time complexity of O(n) is necessarily superior to one with a time complexity of O(2^n). Ⅲ. Time complexity always considers the worst-case time complexity to ensure that the running time of the algorithm will not exceed it. Ⅳ. This is a direct quote from the textbook by Wei-Min Yan. This issue has been discussed in forums for many years. For such efficiency issues at the language level, it is advised not to use specific example programs to explain their merits or demerits. Here, it is considered that this conclusion is correct.
28	Test	Data Structure and Algorithm	Linear List	Multiple-choice	Knowledge	English	What is a linear list?	A collection of data elements of different data types	A sequence where data elements are automatically sorted by key values.	A finite sequence of n data elements with the same data type.	A random collection of data elements	C	null
29	Test	Data Structure and Algorithm	Linear List	Multiple-choice	Knowledge	English	Which of the following descriptions about linear lists is correct?	Each element has multiple direct predecessors and successors.	The first element and the last element are the same.	Except for the first element, each element has exactly one immediate predecessor.	Elements in a linear list can be accessed randomly.	C	null
30	Test	Data Structure and Algorithm	Linear List	Multiple-choice	Knowledge	English	Which characteristic of a linear list is independent of its storage structure?	There exists a unique first element.	Each element has only one immediate predecessor.	Sequential storage structure uses a sequential list.	The linked storage structure uses a linked list.	A	null
31	Test	Data Structure and Algorithm	Linear List	Multiple-choice	Knowledge	English	Which of the following statements about the basic operations of linear lists is incorrect?	The ListInsert operation is used to insert an element at a specified position in the list L.	The ListDelete operation is used to delete the i-th element from list L and return the value of that element.	The LocateElem operation is used to find an element with a specified value in the list L.	The Empty operation is used to return the length of the linear list L.	D	null
32	Test	Data Structure and Algorithm	Linear List	Multiple-choice	Knowledge	English	Which operation in the operations of a sequential list usually does not have a time complexity of O(1)?	ListInsert	GetElem	PrintList	Empty	C	null
33	Test	Data Structure and Algorithm	Linear List	Multiple-choice	Knowledge	English	Which of the following statements about sequential lists is incorrect?	Random access capability, which allows for quickly locating any element.	High storage density, with each node also storing a pointer to the next node.	Easily scalable, no need to copy data during dynamic allocation.	Insertion and deletion operations require moving a large number of elements, resulting in higher time complexity.	B	null
34	Test	Data Structure and Algorithm	Linear List	Multiple-choice	Knowledge	English	Which of the following statements about initializing a sequential list in a static implementation is incorrect?	After initialization, the length of the sequential list is set to 0.	The maximum length of a sequential list is fixed.	The initialization function not need to allocate memory space.	Sequential lists use arrays to store data elements.	C	null
35	Test	Data Structure and Algorithm	Linear List	Multiple-choice	Knowledge	English	Which of the following descriptions is incorrect when the IncreaseSize function is called in the dynamic implementation of a sequential list?	The IncreaseSize function is used to increase the capacity of a sequential list.	New storage space is allocated through malloc.	The original data needs to be copied to a new storage space.	The increased new space size is directly added to the length property.	D	null
36	Test	Data Structure and Algorithm	Linear List	Multiple-choice	Knowledge	English	In the GetElem function of a sequential list, how to correctly retrieve the value of the i-th element?	Return L.data[i+1]	Return L.data[i-1]	Directly return L.data[i].	Calculate the average value of L.data[i].	B	null
37	Test	Data Structure and Algorithm	Linear List	Multiple-choice	Knowledge	English	Each element in a singly linked list typically contains which parts?	Data element and pointer to the next element	Data Element Only	Data element and a pointer to the previous element	Data element and two pointers respectively pointing to the previous and next elements.	A	null
38	Test	Data Structure and Algorithm	Linear List	Multiple-choice	Knowledge	English	How to determine if a singly linked list without a head node is empty?	Check if there are data elements in the linked list.	Check if the head pointer is NULL.	Check if the next pointer of each node is null.	Check if the length of the linked list is 0.	B	null
39	Test	Data Structure and Algorithm	Linear List	Multiple-choice	Knowledge	English	How to determine if a singly linked list with a head node is empty?	Check if the next pointer of the head node is NULL.	Check if the head node is NULL.	Check if there are data elements in the linked list.	Check if the length of the linked list is 0.	A	null
40	Test	Data Structure and Algorithm	Linear List	Multiple-choice	Knowledge	English	What are the correct steps to perform the ListInsert insertion operation in a singly linked list with a head node?	Directly insert the new node at the end of the linked list.	Insert the new node before the found node.	First, delete the i-th node, then insert a new node.	After finding the (i-1)th node, insert a new node after it.	D	null
41	Test	Data Structure and Algorithm	Linear List	Multiple-choice	Knowledge	English	In a singly linked list without a head node, how should one properly handle the case of inserting an element at the first position when executing the ListInsert operation?	Directly insert the new node at the end of the linked list.	Create a new node and update the head pointer to point to this new node.	Delete the original first node, then insert a new node.	Insert a new node after the original first node.	B	null
42	Test	Data Structure and Algorithm	Linear List	Multiple-choice	Knowledge	English	How does the InsertPriorNode function of a singly linked list correctly insert a new element e before node p?	Insert the new element e at the beginning of the linked list.	First, insert the new node after node p, then swap the data between p and the new node.	Delete the node before the p node, then insert a new node.	Insert a new node directly before the p node.	B	null
43	Test	Data Structure and Algorithm	Linear List	Multiple-choice	Knowledge	English	How does the LocateElem function correctly find an element with a given key value e in a singly linked list?	Return the first node of the linked list.	Return the last node with the value e.	Return the last node of the linked list.	Start searching from the first node, return the pointer to the node if found, otherwise return NULL.	D	null
44	Test	Data Structure and Algorithm	Linear List	Multiple-choice	Knowledge	English	How is the Length function used to calculate the length of a singly linked list?	Calculate the total number of nodes including the head node.	Only calculate the head node	Count the number of nodes in a linked list starting from the end in reverse order.	Starting from the first data node, sequentially count the number of nodes, excluding the head node.	D	null
45	Test	Data Structure and Algorithm	Linear List	Multiple-choice	Knowledge	English	How is a new node inserted into the linked list in the List_HeadInsert function that creates a singly linked list using the head insertion method?	A new node is inserted at the end of the linked list.	A new node is inserted at the beginning of the linked list.	A new node is inserted into the middle of the linked list.	New nodes are randomly inserted at any position in the linked list.	B	null
46	Test	Data Structure and Algorithm	Linear List	Multiple-choice	Knowledge	English	How are the nodes rearranged in the Inverse algorithm for reversing a linked list?	Move each node from the end of the linked list to the beginning of a new linked list one by one.	Insert each node at the end of the new linked list.	Remove each node from the original linked list and insert it at the head of a new linked list.	Maintain the node order unchanged, only modify the head node of the linked list.	C	null
47	Test	Data Structure and Algorithm	Linear List	Multiple-choice	Knowledge	English	How does the InsertNextDNode function correctly insert node s after node p in a doubly linked list?	Insert the node s at the beginning of the linked list.	Insert node s before node p.	Insert node s at the end of the linked list.	Insert node s after node p and update the corresponding pointers.	D	null
48	Test	Data Structure and Algorithm	Linear List	Multiple-choice	Knowledge	English	How does the DeletNextDNode function correctly delete the successor node of node p in a doubly linked list?	Directly delete the p node	Delete the successor node of the p node and update the corresponding pointers.	Delete the head node of a linked list	Delete all nodes in the linked list	B	null
49	Test	Data Structure and Algorithm	Linear List	Multiple-choice	Knowledge	English	What is the correct description of the traversal operation in a doubly linked list?	Traversal can only be performed starting from the head node and moving backwards.	Traversal can only be performed in reverse starting from the tail node.	Traversal can start from any node, moving forwards or backwards.	During traversal, only data nodes can be accessed; the head and tail nodes cannot be accessed.	C	null
50	Test	Data Structure and Algorithm	Linear List	Multiple-choice	Knowledge	English	Which of the following descriptions is correct regarding a circular singly linked list?	The pointer of the last node in a circular singly linked list points to NULL.	A circular singly linked list cannot determine if it is empty.	All the next pointers of the nodes in a circular singly linked list point to the head node.	The pointer of the last node in a circular singly linked list points to the head node.	D	null
51	Test	Data Structure and Algorithm	Linear List	Multiple-choice	Knowledge	English	Which of the following descriptions is correct about a circular doubly linked list?	The prior pointer of the head node in a circular doubly linked list points to NULL.	A circular doubly linked list cannot determine if it is empty.	All the next pointers of the nodes in a circular doubly linked list point to the head node.	The prior pointer of the head node in a circular doubly linked list points to the tail node, and the next pointer of the tail node points to the head node.	D	null
52	Test	Data Structure and Algorithm	Linear List	Multiple-choice	Knowledge	English	The following () is a linear list.	A set consisting of n real numbers	A sequence composed of 100 characters	Adjacency list	All sequences composed of integers	B	null
53	Test	Data Structure and Algorithm	Linear List	Multiple-choice	Knowledge	English	In a linear list, each element, except for the first one, ().	There is only one unique predecessor element.	There is only one unique successor element.	There are multiple precursor elements.	There are multiple successor elements.	A	null
54	Test	Data Structure and Algorithm	Linear List	Multiple-choice	Knowledge	English	The following ( ) is advantage of sequential storage structure.	High storage density	Insertion operations are convenient.	The delete operation is convenient.	Conveniently applied to the storage representation of various logical structures.	A	null
55	Test	Data Structure and Algorithm	Linear List	Multiple-choice	Knowledge	English	For a sequential list, the time complexity of accessing the element at the ith position and inserting an element at the ith position is ().	O(n), O(n)	O(n), O(1)	O(1), O(n)	O(1), O(1)	C	null
56	Test	Data Structure and Algorithm	Linear List	Multiple-choice	Knowledge	English	For a linear list that requires both relatively fast insertion and deletion, and a storage structure that reflects the logical relationships between data, one should use ( ).	Sequential storage method	Linked storage method	Hashing storage method	All of the above are possible.	B	null
57	Test	Data Structure and Algorithm	Linear List	Multiple-choice	Knowledge	English	In a singly linked list, the purpose of adding a head node is to ().	Ensure that the singly linked list has at least one node.	Indicate the position of the first node in the linked list.	Convenient implementation of operations	To explanation a singly linked list is a linear list with linked storage.	C	null
58	Test	Data Structure and Algorithm	Linear List	Multiple-choice	Knowledge	English	One of the advantages of a doubly linked list over a singly linked list is ().	Insertion and deletion operations are more convenient.	Random access can be performed.	The header pointer or tail pointer can be omitted.	More flexible in accessing adjacent nodes before and after.	D	null
59	Test	Data Structure and Algorithm	Linear List	Multiple-choice	Knowledge	English	The condition for a double circular linked list L with a head node to be empty is ().	L->prior == L && L->next == NULL	L->prior == NULL && L->next == NULL	L->prior == NULL && L->next == L	L->prior == L && L->next == L	D	null
60	Test	Data Structure and Algorithm	Linear List	Multiple-choice	Knowledge	English	The most common operations on a linked list are inserting nodes at the end and deleting nodes, for which using ( ) is the most time-efficient.	Circular doubly linked list with a head node	Singly linked list	Singly circular linked list with tail pointer	Singly linked list	A	null
61	Test	Data Structure and Algorithm	Linear List	Multiple-choice	Knowledge	English	The most common operations on a linked list are inserting an element after the last element and deleting the first element, in which case using a () is the most time-efficient.	Singly circular linked list without a head node	Doubly linked list	A singly circular linked list without a head node but with a tail pointer.	Singly linked list	C	null
62	Test	Data Structure and Algorithm	Linear List	Multiple-choice	Reasoning	English	In the array representation of a linear list with n elements, the operations with a time complexity of O(1) are () Ⅰ. Accessing the ith (1≤i≤n) node and finding the immediate predecessor of the ith (2≤i≤n) node. Ⅱ. Inserting a new node after the last node. Ⅲ. Deleting the first node. Ⅳ. Sequentially outputting the values of these n elements.	Ⅰ	Ⅱ,Ⅲ	Ⅰ,Ⅱ	Ⅰ,Ⅱ,Ⅲ	C	Ⅰ Analysis omitted; Ⅱ In the last position, inserting a new node does not require moving elements, and the time complexity is O(1); Ⅲ In this case, the nodes following the deleted node need to be moved forward sequentially, and the time complexity is O(n); Ⅳ In this case, it is necessary to move n-i nodes backward, and the time complexity is O(n).
63	Test	Data Structure and Algorithm	Linear List	Multiple-choice	Reasoning	English	Assuming a linear list has n elements, strictly speaking, the following operations are more efficient when implemented on a sequential list than on a linked list: Ⅰ. Output the value of the i-th (1≤i≤n) element Ⅱ. Swap the values of the 3rd and 4th elements Ⅲ. Sequentially output the values of these n elements	Ⅰ	Ⅰ,Ⅲ	Ⅰ,Ⅱ	Ⅱ,Ⅲ	C	For II, an array list only requires 3 swap operations: for a linked list, it is necessary to find the predecessors of the two nodes separately, and after the 4th node is disconnected, it needs to be inserted after the 2nd node, which is less efficient. For III, each element must be accessed sequentially, so the time complexity is the same.
64	Test	Data Structure and Algorithm	Linear List	Multiple-choice	Reasoning	English	Regarding the descriptions of the sequential storage structure and the linked storage structure of linear lists, the correct one is ( ). Ⅰ. The sequential storage structure of a linear list is superior to its linked storage structure. Ⅱ. The linked storage structure can represent various logical structures more conveniently than the sequential storage structure. Ⅲ. If insert and delete operations are frequently used, the sequential storage structure is more superior to the linked storage structure. Ⅳ. Both sequential storage structure and linked storage structure can perform sequential access.	Ⅰ,Ⅱ,Ⅲ	Ⅱ,Ⅳ	Ⅱ,Ⅲ	Ⅲ,Ⅳ	B	The two storage structures have different applicable scenarios, and it cannot be simply stated which one is better or worse, Ⅰ is incorrect. Linked storage uses pointers to represent logical structures, and since the setting of pointers is arbitrary, it can conveniently represent various logical structures: Sequential storage can only use physical adjacency to represent logical structures, Ⅱ is correct. In sequential storage, inserting and deleting nodes requires moving a large number of elements, which is less efficient, and the description in Ⅲ is just the opposite. Sequential storage structure can perform both random access and sequential access, while linked structure can only perform sequential access, Ⅳ is correct.
65	Test	Data Structure and Algorithm	Linear List	Multiple-choice	Reasoning	English	For a linear list with sequential storage, the operation with a time complexity of O(1) should be ().	Sort n elements in ascending order.	Remove the i-th (1≤i≤n) element.	Change the value of the i-th element (1≤i≤n)	Insert a new element after the i-th (1≤i≤n) element.	C	The time complexity for sorting n elements is at least O(n) (when initially ordered), and typically O(nlog2n) or O(n^2). Options B and D are clearly incorrect. Sequential lists support random access by index.
66	Test	Data Structure and Algorithm	Linear List	Multiple-choice	Reasoning	English	Among the following statements about linear lists, the correct one(s) is (are) (). Ⅰ. Sequential storage can only be used for storing linear structures. Ⅱ. The time to retrieve the i-th element of a linear list depends on the value of i. Ⅲ. Static linked lists require the allocation of a large contiguous space, and insertion and deletion do not require moving elements. Ⅳ. Inserting a new node into an ordered singly linked list of length n while maintaining order has a time complexity of O(n). Ⅴ. If a singly linked list is used to represent a queue, a circular linked list with a rear pointer should be used.	Ⅰ,Ⅱ	Ⅰ,Ⅲ,Ⅳ,Ⅴ	Ⅳ,Ⅴ	Ⅲ,Ⅳ,Ⅴ	D	Sequential storage is also suitable for graphs and trees, Ⅰ incorrect. When a linear list adopts sequential storage, Ⅱ incorrect. Ⅲ is a characteristic of static linked lists. An ordered singly linked list can only search for the insertion position sequentially, with a time complexity of O(n), Ⅳ correct. A queue needs to delete elements at the head and insert elements at the tail, and it is more convenient to use a circular linked list with a tail pointer, where both insertion and deletion have a time complexity of O(1), Ⅴ correct.
67	Test	Data Structure and Algorithm	Linear List	Multiple-choice	Reasoning	English	Assuming there are 2n elements in the linear list, () is more efficient to implement on a singly linked list than on a sequential list.	Remove all elements with the value of x.	Insert a new element after the last element.	Output the first k elements in order.	Swap the value of the ith element with the value of the (2n-i-1)th element for i=0,…,n-1.	A	For A, the time complexity is O(n) on both singly linked lists and arrays, but the latter requires moving many elements, so the implementation is more efficient on singly linked lists. For B and D, arrays are more efficient. There is no difference for C.
68	Test	Data Structure and Algorithm	Linear List	Multiple-choice	Reasoning	English	The following statements about linear lists are correct ( ).	Performing the operation of deleting the last element from a singly linked list with a head pointer and a tail pointer is independent of the length of the list.	In a linear list, each element has a direct predecessor and a direct successor.	To facilitate the insertion and deletion of data, a doubly linked list can be used to store the data.	The time to retrieve the i-th element from a linear list is related to the size of i.	C	A doubly linked list can conveniently access its predecessors and successors, making data deletion and insertion relatively easy. Option A is clearly incorrect. Option B does not satisfy the requirements for the first and last elements in the list. Option D does not consider the case of sequential storage.
69	Test	Data Structure and Algorithm	Linear List	Multiple-choice	Reasoning	English	The operation to insert a node q before the node pointed to by p in a doubly linked list is ().	p->prior = q; q->next = p; p->prior->next = q; q->prior = p->prior;	q->prior = p->prior; p->prior->next = q; q->next = p; p->prior = g->next;	q->next = p; p->next = q; q->prior->next = q; q->next = p;	p->prior->next = q; q->next = p; q->prior = p->prior; p->prior = q;	D	To insert node q before p, the next field of the node preceding p can be set to point to q, the next field of q can be set to point to p, the prior field of q can be set to point to the node preceding p, and the prior field of p can be set to point to q. Only D meets the condition.
70	Test	Data Structure and Algorithm	Linear List	Multiple-choice	Reasoning	English	Assuming there are only four operations for a linear list with n (n>1) elements: delete the first element; delete the last element; insert a new element before the first element; append a new element after the last element, the best data structure to use is ().	A circular singly linked list with only a tail pointer and no head pointer.	A non-circular doubly linked list with only a tail pointer and no head pointer.	A circular doubly linked list with only a head pointer and no tail pointer.	A circular singly linked list with both head and tail pointers.	C	For A, when deleting the tail node p, it is necessary to find the node before p, with a time complexity of O(n). For B, when deleting the head node p, it is necessary to locate the p node. Here, the head node pointer is not directly provided, and the time complexity of finding the p node through the prior pointer of the tail node is O(n). For D, when deleting the tail node p, it is necessary to find the node before *p, with a time complexity of O(n). For C, the time complexity of executing these four algorithms is O(1).
71	Test	Data Structure and Algorithm	Linear List	Multiple-choice	Reasoning	English	A linear list is stored using a circular singly linked list with a head node, and the head pointer is head. When head->next->next=head is true, the possible length of the linear list is ().	0	1	2	May be 0 or 1	D	For an empty circular singly linked list, we have head->next==head, which leads to the reasoning that head->next->next==head->next==head. For a circular singly linked list containing one element, the next field of the head node (indicated by the head pointer) points to the unique element node, and the next field of this element node points back to the head node, thus we also have head->next->next=head. Therefore, the correct choice is D.
72	Test	Data Structure and Algorithm	Stack, Queue, and Array	Multiple-choice	Knowledge	English	How many different permutations of elements are there when n distinct elements are pushed onto a stack and then popped off?	n!	Catalan number C(n, 2n)/(n+1)	2^n	C(n, n)	B	null
73	Test	Data Structure and Algorithm	Stack, Queue, and Array	Multiple-choice	Knowledge	English	What are the types of storage methods for a stack?	Sequential storage only	Chain storage only	Sequential storage and linked storage	Distributed Storage	C	null
74	Test	Data Structure and Algorithm	Stack, Queue, and Array	Multiple-choice	Knowledge	English	Which of the following descriptions about sequential stacks is correct?	The stack empty condition is S.top == 0.	The stack full condition is S.top < MaxSize.	The length of the stack is S.top.	The stack is empty when S.top == -1, the stack is full when S.top == MaxSize-1, and the length of the stack is S.top+1.	D	null
75	Test	Data Structure and Algorithm	Stack, Queue, and Array	Multiple-choice	Knowledge	English	What is a potential issue that a sequential stack might encounter?	Stack Overflow	Stack underflow	Data loss	The stack can be expanded.	A	null
76	Test	Data Structure and Algorithm	Stack, Queue, and Array	Multiple-choice	Knowledge	English	What is the main purpose of the GetTop operation in a sequential stack?	Initialize the stack	Check if the stack is empty.	Return the value of the top element of the stack without removing it.	Push an element onto the stack.	C	null
77	Test	Data Structure and Algorithm	Stack, Queue, and Array	Multiple-choice	Knowledge	English	When two sequential stacks share the same one-dimensional array space, how are their stack bottoms and stack tops set?	Two stacks with the same bottom end, extending in opposite directions from the top.	Two stacks with tops at the same end and bottoms extending in opposite directions.	The bottom and top of the stack are at the same end.	Two stacks with bottoms at opposite ends and tops extending towards the middle.	D	null
78	Test	Data Structure and Algorithm	Stack, Queue, and Array	Multiple-choice	Knowledge	English	What characteristics distinguish a linked stack from a sequential stack?	Stack overflow will not occur, facilitating the shared storage space among multiple stacks.	Can only store a finite number of elements	Low storage space utilization	Requires more time for data access.	A	null
79	Test	Data Structure and Algorithm	Stack, Queue, and Array	Multiple-choice	Knowledge	English	What is the main difference between a stack and a queue?	Their storage structures are different.	Their modes of operation are different.	They handle different types of data.	Their application scenarios are completely different.	B	null
80	Test	Data Structure and Algorithm	Stack, Queue, and Array	Multiple-choice	Knowledge	English	What can the operational characteristics of a queue be summarized as?	Last In, First Out (LIFO)	Random Access	First In, First Out (FIFO)	Operations are only allowed at one end.	C	null
81	Test	Data Structure and Algorithm	Stack, Queue, and Array	Multiple-choice	Knowledge	English	In a sequentially stored queue, how are the front pointer and the rear pointer oriented?	front and rear both point to the front element of the queue.	front and rear both point to the last element of the queue.	front points to the front element of the queue, rear points to the rear element of the queue.	front points to the front element of the queue, rear points to the position after the rear element of the queue.	D	null
82	Test	Data Structure and Algorithm	Stack, Queue, and Array	Multiple-choice	Knowledge	English	What is the correct description of the EnQueue operation for a circular queue?	Directly add elements to the end of the queue without checking if the queue is full.	Check the queue empty condition, then add the element.	Check if the queue is full, then add the element to the rear of the queue.	First, remove the element at the head of the queue, then add an element to the tail of the queue.	C	null
83	Test	Data Structure and Algorithm	Stack, Queue, and Array	Multiple-choice	Knowledge	English	What is the correct description of the DeQueue operation for a circular queue?	Directly remove the element at the end of the queue.	Remove the element at the head of the queue without checking if the queue is empty.	Check if the queue is full, then remove the element at the head of the queue.	Check the queue empty condition, then remove the element at the head of the queue.	D	null
84	Test	Data Structure and Algorithm	Stack, Queue, and Array	Multiple-choice	Knowledge	English	What is the correct description of the isEmpty operation for checking if a circular queue is empty?	Check if the tail pointer is 0.	The equality of the front and rear pointers indicates that the queue is empty.	Check if the head pointer is 0.	The head and tail pointers not being equal indicates that the queue is not empty.	B	null
85	Test	Data Structure and Algorithm	Stack, Queue, and Array	Multiple-choice	Knowledge	English	What is the condition for a linked queue to be empty?	The head pointer Q.front and the tail pointer Q.rear both point to NULL.	The head pointer Q.front points to NULL, while the tail pointer Q.rear is not NULL.	The tail pointer Q.rear points to NULL, while the head pointer Q.front is not NULL.	The head pointer and the tail pointer both point to the same non-NULL node.	A	null
86	Test	Data Structure and Algorithm	Stack, Queue, and Array	Multiple-choice	Knowledge	English	How is a linked queue typically designed?	As a singly linked list without a head node	As a singly linked list with a head node	As a doubly linked list	As a circular linked list	B	null
87	Test	Data Structure and Algorithm	Stack, Queue, and Array	Multiple-choice	Knowledge	English	How is the EnQueue operation for a linked queue implemented?	Directly add elements to the front of the queue.	Check the queue empty condition, then add the element.	Create a new node and add it to the end of the queue.	First, remove the element at the head of the queue, then add an element to the tail of the queue.	C	null
88	Test	Data Structure and Algorithm	Stack, Queue, and Array	Multiple-choice	Knowledge	English	How is the DeQueue operation of a linked queue implemented?	Directly remove the element at the end of the queue.	Remove the element at the head of the queue without checking if the queue is empty.	Check if the queue is full, then remove the element at the head of the queue.	Check the queue empty condition, then remove the element at the head of the queue.	D	null
89	Test	Data Structure and Algorithm	Stack, Queue, and Array	Multiple-choice	Knowledge	English	In a linked queue, what might need to be modified when performing a deletion operation?	Head and Tail Pointers	Only the head pointer	Only the tail pointer	Data Structure	A	null
90	Test	Data Structure and Algorithm	Stack, Queue, and Array	Multiple-choice	Knowledge	English	What are the two conditions that must be met for recursive operations?	Increment expression and loop condition	Recursive expression and boundary conditions	Cyclic expression and termination condition	Incremental expression and constraints	B	null
91	Test	Data Structure and Algorithm	Stack, Queue, and Array	Multiple-choice	Knowledge	English	How is a queue used in level-order traversal?	Used to store all the nodes	For storage of leaf nodes only	Enqueue the root node. If the queue is empty, then the traversal is finished. Otherwise, dequeue and visit the first node in the queue. If there are left and right children, enqueue them accordingly.	Used only for storing non-leaf nodes	C	null
92	Test	Data Structure and Algorithm	Stack, Queue, and Array	Multiple-choice	Knowledge	English	When performing a deletion operation on a queue that uses linked storage, what usually needs to be modified?	Only the data content	Only the head pointer	Only the tail pointer	head and tail pointers	D	null
93	Test	Data Structure and Algorithm	Stack, Queue, and Array	Multiple-choice	Knowledge	English	What is the main role of queues in computer systems?	Data Encryption and Decryption	As a buffer and processing resource competition	Data Analysis and Processing	Program Compilation and Debugging	B	null
94	Test	Data Structure and Algorithm	Stack, Queue, and Array	Multiple-choice	Knowledge	English	What is the definition of a compressed matrix?	A matrix that stores all elements	Allocate multiple storage spaces for elements with the same value.	Allocate storage space for elements with the same value, and do not allocate for zero elements.	Allocate storage space only for non-zero elements.	C	null
95	Test	Data Structure and Algorithm	Stack, Queue, and Array	Multiple-choice	Knowledge	English	What is the purpose of using queues in multi-user systems?	Manage user permissions	Monitor user activity	Addressing resource contention issues	Control Data Access	C	null
96	Test	Data Structure and Algorithm	Stack, Queue, and Array	Multiple-choice	Knowledge	English	What is the required length of the table for compressed storage of an n-order symmetric matrix?	n	n(n-1)/2	n^2	n(n+1)/2	D	null
97	Test	Data Structure and Algorithm	Stack, Queue, and Array	Multiple-choice	Knowledge	English	What is a special matrix?	A matrix with many identical elements or zero elements.	Matrix generated by specific rules	Matrix with random elements	Any non-zero matrix	A	null
98	Test	Data Structure and Algorithm	Stack, Queue, and Array	Multiple-choice	Knowledge	English	What is the row-major order formula for calculating the address of a two-dimensional array?	LOC(i,j) = LOC(0,0) + (i+j)*L	LOC(i,j) = LOC(0,0) + (i + n + j) * L	LOC(i,j) = LOC(0,0) + (i + jm) L	LOC(i,j) = LOC(0,0) + (im + j)L	D	null
99	Test	Data Structure and Algorithm	Stack, Queue, and Array	Multiple-choice	Knowledge	English	How does a cross-linked list store a sparse matrix?	Using only singly linked lists	Using only singly linked lists.	Combine row singly linked list with column singly linked list.	Use an array to store all elements.	C	null
100	Test	Data Structure and Algorithm	Stack, Queue, and Array	Multiple-choice	Knowledge	English	What type of data structure is typically stored in a triplestore?	Sparse matrix	Queue	Tree or Forest	Figure	A	null

1

Test

Data Structure and Algorithm

Overview

Multiple-choice

Knowledge

English

The three fundamental elements of data structure include ( ).

Logical structure, storage structure, operations on data

Logical structure, algorithm design, program implementation

Data types, data storage, data manipulation

Data Definition, Data Implementation, Data Manipulation

A

null

2

Test

Data Structure and Algorithm

Overview

Multiple-choice

Knowledge

English

Data in computer science refers to ( ):

The carriers of information, a set consisting of numbers, characters, and all symbols that can be processed by a computer, which describe the attributes of objective entities.

Limited to numbers and characters

The result of information processing

Variables and functions in computer programs

A

null

3

Test

Data Structure and Algorithm

Overview

Multiple-choice

Knowledge

English

What is the definition of a data item in a data structure?

The indivisible smallest unit that constitutes a data element.

A step in the data processing process

A subset of data elements

a field in the database

A

null

4

Test

Data Structure and Algorithm

Overview

Multiple-choice

Knowledge

English

What does a data object refer to in a data structure?

A collection of data elements with the same properties is a subset of the data.

The primary data sources processed in computer programs

The main body of data storage

Basic Components of a Database Management System

A

null

5

Test

Data Structure and Algorithm

Overview

Multiple-choice

Knowledge

English

What categories are typically included in data types?

Structural type, atomic type, abstract data type

Atomic types, numeric types, character types

Boolean type, composite type, interface type

Character type, numeric type, enumeration type

C

null

6

Test

Data Structure and Algorithm

Overview

Multiple-choice

Knowledge

English

What is the relationship between logical structure and storage structure in data structures?

Mutually independent, not affecting each other.

The logical structure affects the storage structure, but the storage structure does not affect the logical structure.

The storage structure affects the logical structure, but the logical structure does not affect the storage structure.

Inseparable, the design of an algorithm depends on the logical structure, while the implementation relies on the storage structure.

D

null

7

Test

Data Structure and Algorithm

Overview

Multiple-choice

Knowledge

English

What are the main types of data storage structures?

Sequential storage, linked storage, indexed storage, hash storage.

Linear storage, tree storage, graph storage, network storage

Static storage, dynamic storage, direct storage, indirect storage

Random Access, Sequential Access, Direct Access, Indirect Access

A

null

8

Test

Data Structure and Algorithm

Overview

Multiple-choice

Knowledge

English

What are the main operations applied to data?

Definition and Implementation of Operations

Types and scope of operations

Frequency and efficiency of operations

Methods and tools of operation

A

null

9

Test

Data Structure and Algorithm

Overview

Multiple-choice

Knowledge

English

When storing data, what is typically required to be stored?

Only the value of the data element

The values of data elements and the relationships between data elements.

The type and size of data elements

The physical address of data and the method of storage

B

null

10

Test

Data Structure and Algorithm

Overview

Multiple-choice

Knowledge

English

In the design of linked storage, the correct description regarding the storage space of nodes and the addresses of storage units within nodes is:

The storage space of each different node and the addresses of storage units within the node must be contiguous.

The storage space of different nodes can be discontinuous, but the addresses of storage units within a node must be continuous.

The storage space for each distinct node must be contiguous, but the addresses of storage units within a node can be non-contiguous.

The storage spaces of different nodes and the addresses of storage units within the nodes can be discontinuous.

B

null

11

Test

Data Structure and Algorithm

Overview

Multiple-choice

Knowledge

English

Algorithms in computer science are typically defined as what?

Description of the steps to solve a specific problem, including a finite sequence of instructions, each instruction comprising one or more operations.

The execution order of computer programs

Methods and Techniques of Data Processing

The process and standards of software development

A

null

12

Test

Data Structure and Algorithm

Overview

Multiple-choice

Knowledge

English

When analyzing the space complexity of an algorithm, if the space occupied by the input data is only related to the problem itself, how should it be considered?

Analyze the total amount of space occupied by the entire program.

Only consider the space occupied by the input data.

Analyze the auxiliary space excluding the input and the program itself.

Consider the space dynamically allocated during the execution of the algorithm.

C

null

13

Test

Data Structure and Algorithm

Overview

Multiple-choice

Knowledge

English

What are the main components of a program?

Data Structures and User Interface

Code and Documentation

Data Structures and Algorithms

Functions and Variables

C

null

14

Test

Data Structure and Algorithm

Overview

Multiple-choice

Knowledge

English

What is the definition of an algorithm in computer science?

Methods for solving problems

Set of computer instructions

A description of the steps to solve a specific problem, which is a finite sequence of instructions.

A functional module in a programming language

C

null

15

Test

Data Structure and Algorithm

Overview

Multiple-choice

Knowledge

English

How is the time complexity of an algorithm defined?

The maximum storage space required for algorithm execution

The number of times a basic operation is repeated in an algorithm is a function f(n) of the problem size n, representing the growth rate of the algorithm's execution time as the problem size n increases.

The number of steps required for an algorithm to complete a task

The ratio of the time required for algorithm execution to the length of input data.

B

null

16

Test

Data Structure and Algorithm

Overview

Multiple-choice

Knowledge

English

What aspects does data operation include?

Implementation of operations only, i.e., specific operational steps.

Only include the definition of the operation, that is, to indicate the function of the operation.

Including the definition and implementation of operations, where the definition is for the logical structure and the implementation is for the storage structure.

Only includes data computation and analysis.

C

null

17

Test

Data Structure and Algorithm

Overview

Multiple-choice

Knowledge

English

How is the efficiency of an algorithm and the requirement for low storage defined?

Efficiency refers to the conciseness of the algorithm's writing, and storage requirement indicates the amount of space occupied after the algorithm is completed.

Efficiency refers to the time it takes for an algorithm to execute, while storage requirement refers to the maximum storage space needed during the execution of the algorithm. Both are related to the size of the problem.

Efficiency refers to the execution speed of the algorithm, and storage requirement refers to the memory space used by the algorithm code

Efficiency refers to the ability of an algorithm to solve problems, while storage requirement indicates the size of memory occupied by the algorithm.

B

null

18

Test

Data Structure and Algorithm

Overview

Multiple-choice

Knowledge

English

What is a data type?

Intermediate results generated during the data processing process

A collective term for a set of values and a group of operations defined on this set.

The format used for data storage

Variable types in a specific programming language

B

null

19

Test

Data Structure and Algorithm

Overview

Multiple-choice

Knowledge

English

Among the following data structures, ( ) is a non-linear data structure.

Tree

string

Queue

Stack

A

null

20

Test

Data Structure and Algorithm

Overview

Multiple-choice

Knowledge

English

The following term unrelated to the data storage structure is()

Circular Queue

Linked list

Hash table

Stack

D

null

21

Test

Data Structure and Algorithm

Overview

Multiple-choice

Knowledge

English

The correct statement about data structures is ().

The logical structure of data is independent of its storage structure.

The storage structure of data is independent of its logical structure.

The logical structure of data uniquely determines its storage structure.

The data structure is determined solely by its logical structure and storage structure.

A

null

22

Test

Data Structure and Algorithm

Overview

Multiple-choice

Knowledge

English

When storing data, it is common not only to store the values of each data element, but also to store ().

Data manipulation methods

The type of data elements

The relationship between data elements

Data Access Methods

C

null

23

Test

Data Structure and Algorithm

Overview

Multiple-choice

Knowledge

English

In the design of linked storage, the address of the storage cell within a node ()

uniformly continuous

Definitely discontinuous

not necessarily continuous

Partially continuous, partially discontinuous

A

null

24

Test

Data Structure and Algorithm

Overview

Multiple-choice

Reasoning

English

The time complexity of a certain algorithm is O(n^2), indicating that the algorithm's ( )

The problem size is n^2.

Execution time equals n^2.

The execution time is directly proportional to n^2.

The problem size is directly proportional to n^2.

C

The time complexity is O(n^2), which means the time complexity T(n) satisfies T(n) ≤ cn^2 (where c is a proportionality constant), that is, T(n) = O(n^2). The time complexity T(n) is a function of the problem size n, and the problem size remains n, not n^2.

25

Test

Data Structure and Algorithm

Overview

Multiple-choice

Reasoning

English

The time complexity of the following algorithm is ( ). void fun(int n){ int i=1; while(i<=n) i=i*2; }

O(n)

O(n^2)

O(nlog₂n)

O(log2n)

D

Identify the basic operation i=i*2, with the number of executions denoted as t, then 2^t≤n, which implies t≤log2n, hence the time complexity T(n)=O(log2n). A more intuitive approach: calculate the number of times the basic operation i=i*2 is executed (doubling the main variable with each execution), where the condition can be understood as 2^t=n, that is, t=log2n, thus T(n)=O(log2n).

26

Test

Data Structure and Algorithm

Overview

Multiple-choice

Reasoning

English

The following algorithm has a time complexity of (). void fun(int n){ int i=0; while(i*i*i<-n) i++; }

O(n)

O(nlog₂n)

O(∛n)

O(√n)

C

The basic operation is i++, with the number of executions denoted as t, satisfying t*t*t ≤ n, which is t^3 ≤ n. Therefore, t ≤ ∛n, and thus T(n) = O(∛n).

27

Test

Data Structure and Algorithm

Overview

Multiple-choice

Reasoning

English

Among the following statements, the incorrect one is (). Ⅰ. An algorithm working in place means that it does not require any additional auxiliary space. Ⅱ. For the same size n, an algorithm with complexity O(n) is always better in terms of time than an algorithm with complexity O(2^n). Ⅲ. Time complexity refers to an upper bound estimate of the execution time of an algorithm in the worst-case scenario. Ⅳ. For the same algorithm, the higher the level of the implementation language, the lower the execution efficiency.

Ⅰ

Ⅰ, Ⅱ

Ⅰ, Ⅳ

Ⅲ

A

Ⅰ. An in-place algorithm refers to an algorithm that requires a constant amount of auxiliary space. Ⅱ. This item assesses the understanding of algorithm efficiency, where time complexity refers to asymptotic time complexity. Do not arbitrarily assign a special value to n; an algorithm with a time complexity of O(n) is necessarily superior to one with a time complexity of O(2^n). Ⅲ. Time complexity always considers the worst-case time complexity to ensure that the running time of the algorithm will not exceed it. Ⅳ. This is a direct quote from the textbook by Wei-Min Yan. This issue has been discussed in forums for many years. For such efficiency issues at the language level, it is advised not to use specific example programs to explain their merits or demerits. Here, it is considered that this conclusion is correct.

28

Test

Data Structure and Algorithm

Linear List

Multiple-choice

Knowledge

English

What is a linear list?

A collection of data elements of different data types

A sequence where data elements are automatically sorted by key values.

A finite sequence of n data elements with the same data type.

A random collection of data elements

C

null

29

Test

Data Structure and Algorithm

Linear List

Multiple-choice

Knowledge

English

Which of the following descriptions about linear lists is correct?

Each element has multiple direct predecessors and successors.

The first element and the last element are the same.

Except for the first element, each element has exactly one immediate predecessor.

Elements in a linear list can be accessed randomly.

C

null

30

Test

Data Structure and Algorithm

Linear List

Multiple-choice

Knowledge

English

Which characteristic of a linear list is independent of its storage structure?

There exists a unique first element.

Each element has only one immediate predecessor.

Sequential storage structure uses a sequential list.

The linked storage structure uses a linked list.

A

null

31

Test

Data Structure and Algorithm

Linear List

Multiple-choice

Knowledge

English

Which of the following statements about the basic operations of linear lists is incorrect?

The ListInsert operation is used to insert an element at a specified position in the list L.

The ListDelete operation is used to delete the i-th element from list L and return the value of that element.

The LocateElem operation is used to find an element with a specified value in the list L.

The Empty operation is used to return the length of the linear list L.

D

null

32

Test

Data Structure and Algorithm

Linear List

Multiple-choice

Knowledge

English

Which operation in the operations of a sequential list usually does not have a time complexity of O(1)?

ListInsert

GetElem

PrintList

Empty

C

null

33

Test

Data Structure and Algorithm

Linear List

Multiple-choice

Knowledge

English

Which of the following statements about sequential lists is incorrect?

Random access capability, which allows for quickly locating any element.

High storage density, with each node also storing a pointer to the next node.

Easily scalable, no need to copy data during dynamic allocation.

Insertion and deletion operations require moving a large number of elements, resulting in higher time complexity.

B

null

34

Test

Data Structure and Algorithm

Linear List

Multiple-choice

Knowledge

English

Which of the following statements about initializing a sequential list in a static implementation is incorrect?

After initialization, the length of the sequential list is set to 0.

The maximum length of a sequential list is fixed.

The initialization function not need to allocate memory space.

Sequential lists use arrays to store data elements.

C

null

35

Test

Data Structure and Algorithm

Linear List

Multiple-choice

Knowledge

English

Which of the following descriptions is incorrect when the IncreaseSize function is called in the dynamic implementation of a sequential list?

The IncreaseSize function is used to increase the capacity of a sequential list.

New storage space is allocated through malloc.

The original data needs to be copied to a new storage space.

The increased new space size is directly added to the length property.

D

null

36

Test

Data Structure and Algorithm

Linear List

Multiple-choice

Knowledge

English

In the GetElem function of a sequential list, how to correctly retrieve the value of the i-th element?

Return L.data[i+1]

Return L.data[i-1]

Directly return L.data[i].

Calculate the average value of L.data[i].

B

null

37

Test

Data Structure and Algorithm

Linear List

Multiple-choice

Knowledge

English

Each element in a singly linked list typically contains which parts?

Data element and pointer to the next element

Data Element Only

Data element and a pointer to the previous element

Data element and two pointers respectively pointing to the previous and next elements.

A

null

38

Test

Data Structure and Algorithm

Linear List

Multiple-choice

Knowledge

English

How to determine if a singly linked list without a head node is empty?

Check if there are data elements in the linked list.

Check if the head pointer is NULL.

Check if the next pointer of each node is null.

Check if the length of the linked list is 0.

B

null

39

Test

Data Structure and Algorithm

Linear List

Multiple-choice

Knowledge

English

How to determine if a singly linked list with a head node is empty?

Check if the next pointer of the head node is NULL.

Check if the head node is NULL.

Check if there are data elements in the linked list.

Check if the length of the linked list is 0.

A

null

40

Test

Data Structure and Algorithm

Linear List

Multiple-choice

Knowledge

English

What are the correct steps to perform the ListInsert insertion operation in a singly linked list with a head node?

Directly insert the new node at the end of the linked list.

Insert the new node before the found node.

First, delete the i-th node, then insert a new node.

After finding the (i-1)th node, insert a new node after it.

D

null

41

Test

Data Structure and Algorithm

Linear List

Multiple-choice

Knowledge

English

In a singly linked list without a head node, how should one properly handle the case of inserting an element at the first position when executing the ListInsert operation?

Directly insert the new node at the end of the linked list.

Create a new node and update the head pointer to point to this new node.

Delete the original first node, then insert a new node.

Insert a new node after the original first node.

B

null

42

Test

Data Structure and Algorithm

Linear List

Multiple-choice

Knowledge

English

How does the InsertPriorNode function of a singly linked list correctly insert a new element e before node p?

Insert the new element e at the beginning of the linked list.

First, insert the new node after node p, then swap the data between p and the new node.

Delete the node before the p node, then insert a new node.

Insert a new node directly before the p node.

B

null

43

Test

Data Structure and Algorithm

Linear List

Multiple-choice

Knowledge

English

How does the LocateElem function correctly find an element with a given key value e in a singly linked list?

Return the first node of the linked list.

Return the last node with the value e.

Return the last node of the linked list.

Start searching from the first node, return the pointer to the node if found, otherwise return NULL.

D

null

44

Test

Data Structure and Algorithm

Linear List

Multiple-choice

Knowledge

English

How is the Length function used to calculate the length of a singly linked list?

Calculate the total number of nodes including the head node.

Only calculate the head node

Count the number of nodes in a linked list starting from the end in reverse order.

Starting from the first data node, sequentially count the number of nodes, excluding the head node.

D

null

45

Test

Data Structure and Algorithm

Linear List

Multiple-choice

Knowledge

English

How is a new node inserted into the linked list in the List_HeadInsert function that creates a singly linked list using the head insertion method?

A new node is inserted at the end of the linked list.

A new node is inserted at the beginning of the linked list.

A new node is inserted into the middle of the linked list.

New nodes are randomly inserted at any position in the linked list.

B

null

46

Test

Data Structure and Algorithm

Linear List

Multiple-choice

Knowledge

English

How are the nodes rearranged in the Inverse algorithm for reversing a linked list?

Move each node from the end of the linked list to the beginning of a new linked list one by one.

Insert each node at the end of the new linked list.

Remove each node from the original linked list and insert it at the head of a new linked list.

Maintain the node order unchanged, only modify the head node of the linked list.

C

null

47

Test

Data Structure and Algorithm

Linear List

Multiple-choice

Knowledge

English

How does the InsertNextDNode function correctly insert node s after node p in a doubly linked list?

Insert the node s at the beginning of the linked list.

Insert node s before node p.

Insert node s at the end of the linked list.

Insert node s after node p and update the corresponding pointers.

D

null

48

Test

Data Structure and Algorithm

Linear List

Multiple-choice

Knowledge

English

How does the DeletNextDNode function correctly delete the successor node of node p in a doubly linked list?

Directly delete the p node

Delete the successor node of the p node and update the corresponding pointers.

Delete the head node of a linked list

Delete all nodes in the linked list

B

null

49

Test

Data Structure and Algorithm

Linear List

Multiple-choice

Knowledge

English

What is the correct description of the traversal operation in a doubly linked list?

Traversal can only be performed starting from the head node and moving backwards.

Traversal can only be performed in reverse starting from the tail node.

Traversal can start from any node, moving forwards or backwards.

During traversal, only data nodes can be accessed; the head and tail nodes cannot be accessed.

C

null

50

Test

Data Structure and Algorithm

Linear List

Multiple-choice

Knowledge

English

Which of the following descriptions is correct regarding a circular singly linked list?

The pointer of the last node in a circular singly linked list points to NULL.

A circular singly linked list cannot determine if it is empty.

All the next pointers of the nodes in a circular singly linked list point to the head node.

The pointer of the last node in a circular singly linked list points to the head node.

D

null

51

Test

Data Structure and Algorithm

Linear List

Multiple-choice

Knowledge

English

Which of the following descriptions is correct about a circular doubly linked list?

The prior pointer of the head node in a circular doubly linked list points to NULL.

A circular doubly linked list cannot determine if it is empty.

All the next pointers of the nodes in a circular doubly linked list point to the head node.

The prior pointer of the head node in a circular doubly linked list points to the tail node, and the next pointer of the tail node points to the head node.

D

null

52

Test

Data Structure and Algorithm

Linear List

Multiple-choice

Knowledge

English

The following () is a linear list.

A set consisting of n real numbers

A sequence composed of 100 characters

Adjacency list

All sequences composed of integers

B

null

53

Test

Data Structure and Algorithm

Linear List

Multiple-choice

Knowledge

English

In a linear list, each element, except for the first one, ().

There is only one unique predecessor element.

There is only one unique successor element.

There are multiple precursor elements.

There are multiple successor elements.

A

null

54

Test

Data Structure and Algorithm

Linear List

Multiple-choice

Knowledge

English

The following ( ) is advantage of sequential storage structure.

High storage density

Insertion operations are convenient.

The delete operation is convenient.

Conveniently applied to the storage representation of various logical structures.

A

null

55

Test

Data Structure and Algorithm

Linear List

Multiple-choice

Knowledge

English

For a sequential list, the time complexity of accessing the element at the ith position and inserting an element at the ith position is ().

O(n), O(n)

O(n), O(1)

O(1), O(n)

O(1), O(1)

C

null

56

Test

Data Structure and Algorithm

Linear List

Multiple-choice

Knowledge

English

For a linear list that requires both relatively fast insertion and deletion, and a storage structure that reflects the logical relationships between data, one should use ( ).

Sequential storage method

Linked storage method

Hashing storage method

All of the above are possible.

B

null

57

Test

Data Structure and Algorithm

Linear List

Multiple-choice

Knowledge

English

In a singly linked list, the purpose of adding a head node is to ().

Ensure that the singly linked list has at least one node.

Indicate the position of the first node in the linked list.

Convenient implementation of operations

To explanation a singly linked list is a linear list with linked storage.

C

null

58

Test

Data Structure and Algorithm

Linear List

Multiple-choice

Knowledge

English

One of the advantages of a doubly linked list over a singly linked list is ().

Insertion and deletion operations are more convenient.

Random access can be performed.

The header pointer or tail pointer can be omitted.

More flexible in accessing adjacent nodes before and after.

D

null

59

Test

Data Structure and Algorithm

Linear List

Multiple-choice

Knowledge

English

The condition for a double circular linked list L with a head node to be empty is ().

L->prior == L && L->next == NULL

L->prior == NULL && L->next == NULL

L->prior == NULL && L->next == L

L->prior == L && L->next == L

D

null

60

Test

Data Structure and Algorithm

Linear List

Multiple-choice

Knowledge

English

The most common operations on a linked list are inserting nodes at the end and deleting nodes, for which using ( ) is the most time-efficient.

Circular doubly linked list with a head node

Singly linked list

Singly circular linked list with tail pointer

Singly linked list

A

null

61

Test

Data Structure and Algorithm

Linear List

Multiple-choice

Knowledge

English

The most common operations on a linked list are inserting an element after the last element and deleting the first element, in which case using a () is the most time-efficient.

Singly circular linked list without a head node

Doubly linked list

A singly circular linked list without a head node but with a tail pointer.

Singly linked list

C

null

62

Test

Data Structure and Algorithm

Linear List

Multiple-choice

Reasoning

English

In the array representation of a linear list with n elements, the operations with a time complexity of O(1) are () Ⅰ. Accessing the ith (1≤i≤n) node and finding the immediate predecessor of the ith (2≤i≤n) node. Ⅱ. Inserting a new node after the last node. Ⅲ. Deleting the first node. Ⅳ. Sequentially outputting the values of these n elements.

Ⅰ

Ⅱ,Ⅲ

Ⅰ,Ⅱ

Ⅰ,Ⅱ,Ⅲ

C

Ⅰ Analysis omitted; Ⅱ In the last position, inserting a new node does not require moving elements, and the time complexity is O(1); Ⅲ In this case, the nodes following the deleted node need to be moved forward sequentially, and the time complexity is O(n); Ⅳ In this case, it is necessary to move n-i nodes backward, and the time complexity is O(n).

63

Test

Data Structure and Algorithm

Linear List

Multiple-choice

Reasoning

English

Assuming a linear list has n elements, strictly speaking, the following operations are more efficient when implemented on a sequential list than on a linked list: Ⅰ. Output the value of the i-th (1≤i≤n) element Ⅱ. Swap the values of the 3rd and 4th elements Ⅲ. Sequentially output the values of these n elements

Ⅰ

Ⅰ,Ⅲ

Ⅰ,Ⅱ

Ⅱ,Ⅲ

C

For II, an array list only requires 3 swap operations: for a linked list, it is necessary to find the predecessors of the two nodes separately, and after the 4th node is disconnected, it needs to be inserted after the 2nd node, which is less efficient. For III, each element must be accessed sequentially, so the time complexity is the same.

64

Test

Data Structure and Algorithm

Linear List

Multiple-choice

Reasoning

English

Regarding the descriptions of the sequential storage structure and the linked storage structure of linear lists, the correct one is ( ). Ⅰ. The sequential storage structure of a linear list is superior to its linked storage structure. Ⅱ. The linked storage structure can represent various logical structures more conveniently than the sequential storage structure. Ⅲ. If insert and delete operations are frequently used, the sequential storage structure is more superior to the linked storage structure. Ⅳ. Both sequential storage structure and linked storage structure can perform sequential access.

Ⅰ,Ⅱ,Ⅲ

Ⅱ,Ⅳ

Ⅱ,Ⅲ

Ⅲ,Ⅳ

B

The two storage structures have different applicable scenarios, and it cannot be simply stated which one is better or worse, Ⅰ is incorrect. Linked storage uses pointers to represent logical structures, and since the setting of pointers is arbitrary, it can conveniently represent various logical structures: Sequential storage can only use physical adjacency to represent logical structures, Ⅱ is correct. In sequential storage, inserting and deleting nodes requires moving a large number of elements, which is less efficient, and the description in Ⅲ is just the opposite. Sequential storage structure can perform both random access and sequential access, while linked structure can only perform sequential access, Ⅳ is correct.

65

Test

Data Structure and Algorithm

Linear List

Multiple-choice

Reasoning

English

For a linear list with sequential storage, the operation with a time complexity of O(1) should be ().

Sort n elements in ascending order.

Remove the i-th (1≤i≤n) element.

Change the value of the i-th element (1≤i≤n)

Insert a new element after the i-th (1≤i≤n) element.

C

The time complexity for sorting n elements is at least O(n) (when initially ordered), and typically O(nlog2n) or O(n^2). Options B and D are clearly incorrect. Sequential lists support random access by index.

66

Test

Data Structure and Algorithm

Linear List

Multiple-choice

Reasoning

English

Among the following statements about linear lists, the correct one(s) is (are) (). Ⅰ. Sequential storage can only be used for storing linear structures. Ⅱ. The time to retrieve the i-th element of a linear list depends on the value of i. Ⅲ. Static linked lists require the allocation of a large contiguous space, and insertion and deletion do not require moving elements. Ⅳ. Inserting a new node into an ordered singly linked list of length n while maintaining order has a time complexity of O(n). Ⅴ. If a singly linked list is used to represent a queue, a circular linked list with a rear pointer should be used.

Ⅰ,Ⅱ

Ⅰ,Ⅲ,Ⅳ,Ⅴ

Ⅳ,Ⅴ

Ⅲ,Ⅳ,Ⅴ

D

Sequential storage is also suitable for graphs and trees, Ⅰ incorrect. When a linear list adopts sequential storage, Ⅱ incorrect. Ⅲ is a characteristic of static linked lists. An ordered singly linked list can only search for the insertion position sequentially, with a time complexity of O(n), Ⅳ correct. A queue needs to delete elements at the head and insert elements at the tail, and it is more convenient to use a circular linked list with a tail pointer, where both insertion and deletion have a time complexity of O(1), Ⅴ correct.

67

Test

Data Structure and Algorithm

Linear List

Multiple-choice

Reasoning

English

Assuming there are 2n elements in the linear list, () is more efficient to implement on a singly linked list than on a sequential list.

Remove all elements with the value of x.

Insert a new element after the last element.

Output the first k elements in order.

Swap the value of the ith element with the value of the (2n-i-1)th element for i=0,…,n-1.

A

For A, the time complexity is O(n) on both singly linked lists and arrays, but the latter requires moving many elements, so the implementation is more efficient on singly linked lists. For B and D, arrays are more efficient. There is no difference for C.

68

Test

Data Structure and Algorithm

Linear List

Multiple-choice

Reasoning

English

The following statements about linear lists are correct ( ).

Performing the operation of deleting the last element from a singly linked list with a head pointer and a tail pointer is independent of the length of the list.

In a linear list, each element has a direct predecessor and a direct successor.

To facilitate the insertion and deletion of data, a doubly linked list can be used to store the data.

The time to retrieve the i-th element from a linear list is related to the size of i.

C

A doubly linked list can conveniently access its predecessors and successors, making data deletion and insertion relatively easy. Option A is clearly incorrect. Option B does not satisfy the requirements for the first and last elements in the list. Option D does not consider the case of sequential storage.

69

Test

Data Structure and Algorithm

Linear List

Multiple-choice

Reasoning

English

The operation to insert a node q before the node pointed to by p in a doubly linked list is ().

p->prior = q; q->next = p; p->prior->next = q; q->prior = p->prior;

q->prior = p->prior; p->prior->next = q; q->next = p; p->prior = g->next;

q->next = p; p->next = q; q->prior->next = q; q->next = p;

p->prior->next = q; q->next = p; q->prior = p->prior; p->prior = q;

D

To insert node q before p, the next field of the node preceding p can be set to point to q, the next field of q can be set to point to p, the prior field of q can be set to point to the node preceding p, and the prior field of p can be set to point to q. Only D meets the condition.

70

Test

Data Structure and Algorithm

Linear List

Multiple-choice

Reasoning

English

Assuming there are only four operations for a linear list with n (n>1) elements: delete the first element; delete the last element; insert a new element before the first element; append a new element after the last element, the best data structure to use is ().

A circular singly linked list with only a tail pointer and no head pointer.

A non-circular doubly linked list with only a tail pointer and no head pointer.

A circular doubly linked list with only a head pointer and no tail pointer.

A circular singly linked list with both head and tail pointers.

C

For A, when deleting the tail node *p, it is necessary to find the node before *p, with a time complexity of O(n). For B, when deleting the head node *p, it is necessary to locate the *p node. Here, the head node pointer is not directly provided, and the time complexity of finding the *p node through the prior pointer of the tail node is O(n). For D, when deleting the tail node *p, it is necessary to find the node before *p, with a time complexity of O(n). For C, the time complexity of executing these four algorithms is O(1).

71

Test

Data Structure and Algorithm

Linear List

Multiple-choice

Reasoning

English

A linear list is stored using a circular singly linked list with a head node, and the head pointer is head. When head->next->next=head is true, the possible length of the linear list is ().

0

1

2

May be 0 or 1

D

For an empty circular singly linked list, we have head->next==head, which leads to the reasoning that head->next->next==head->next==head. For a circular singly linked list containing one element, the next field of the head node (indicated by the head pointer) points to the unique element node, and the next field of this element node points back to the head node, thus we also have head->next->next=head. Therefore, the correct choice is D.

72

Test

Data Structure and Algorithm

Stack, Queue, and Array

Multiple-choice

Knowledge

English

How many different permutations of elements are there when n distinct elements are pushed onto a stack and then popped off?

n!

Catalan number C(n, 2n)/(n+1)

2^n

C(n, n)

B

null

73

Test

Data Structure and Algorithm

Stack, Queue, and Array

Multiple-choice

Knowledge

English

What are the types of storage methods for a stack?

Sequential storage only

Chain storage only

Sequential storage and linked storage

Distributed Storage

C

null

74

Test

Data Structure and Algorithm

Stack, Queue, and Array

Multiple-choice

Knowledge

English

Which of the following descriptions about sequential stacks is correct?

The stack empty condition is S.top == 0.

The stack full condition is S.top < MaxSize.

The length of the stack is S.top.

The stack is empty when S.top == -1, the stack is full when S.top == MaxSize-1, and the length of the stack is S.top+1.

D

null

75

Test

Data Structure and Algorithm

Stack, Queue, and Array

Multiple-choice

Knowledge

English

What is a potential issue that a sequential stack might encounter?

Stack Overflow

Stack underflow

Data loss

The stack can be expanded.

A

null

76

Test

Data Structure and Algorithm

Stack, Queue, and Array

Multiple-choice

Knowledge

English

What is the main purpose of the GetTop operation in a sequential stack?

Initialize the stack

Check if the stack is empty.

Return the value of the top element of the stack without removing it.

Push an element onto the stack.

C

null

77

Test

Data Structure and Algorithm

Stack, Queue, and Array

Multiple-choice

Knowledge

English

When two sequential stacks share the same one-dimensional array space, how are their stack bottoms and stack tops set?

Two stacks with the same bottom end, extending in opposite directions from the top.

Two stacks with tops at the same end and bottoms extending in opposite directions.

The bottom and top of the stack are at the same end.

Two stacks with bottoms at opposite ends and tops extending towards the middle.

D

null

78

Test

Data Structure and Algorithm

Stack, Queue, and Array

Multiple-choice

Knowledge

English

What characteristics distinguish a linked stack from a sequential stack?

Stack overflow will not occur, facilitating the shared storage space among multiple stacks.

Can only store a finite number of elements

Low storage space utilization

Requires more time for data access.

A

null

79

Test

Data Structure and Algorithm

Stack, Queue, and Array

Multiple-choice

Knowledge

English

What is the main difference between a stack and a queue?

Their storage structures are different.

Their modes of operation are different.

They handle different types of data.

Their application scenarios are completely different.

B

null

80

Test

Data Structure and Algorithm

Stack, Queue, and Array

Multiple-choice

Knowledge

English

What can the operational characteristics of a queue be summarized as?

Last In, First Out (LIFO)

Random Access

First In, First Out (FIFO)

Operations are only allowed at one end.

C

null

81

Test

Data Structure and Algorithm

Stack, Queue, and Array

Multiple-choice

Knowledge

English

In a sequentially stored queue, how are the front pointer and the rear pointer oriented?

front and rear both point to the front element of the queue.

front and rear both point to the last element of the queue.

front points to the front element of the queue, rear points to the rear element of the queue.

front points to the front element of the queue, rear points to the position after the rear element of the queue.

D

null

82

Test

Data Structure and Algorithm

Stack, Queue, and Array

Multiple-choice

Knowledge

English

What is the correct description of the EnQueue operation for a circular queue?

Directly add elements to the end of the queue without checking if the queue is full.

Check the queue empty condition, then add the element.

Check if the queue is full, then add the element to the rear of the queue.

First, remove the element at the head of the queue, then add an element to the tail of the queue.

C

null

83

Test

Data Structure and Algorithm

Stack, Queue, and Array

Multiple-choice

Knowledge

English

What is the correct description of the DeQueue operation for a circular queue?

Directly remove the element at the end of the queue.

Remove the element at the head of the queue without checking if the queue is empty.

Check if the queue is full, then remove the element at the head of the queue.

Check the queue empty condition, then remove the element at the head of the queue.

D

null

84

Test

Data Structure and Algorithm

Stack, Queue, and Array

Multiple-choice

Knowledge

English

What is the correct description of the isEmpty operation for checking if a circular queue is empty?

Check if the tail pointer is 0.

The equality of the front and rear pointers indicates that the queue is empty.

Check if the head pointer is 0.

The head and tail pointers not being equal indicates that the queue is not empty.

B

null

85

Test

Data Structure and Algorithm

Stack, Queue, and Array

Multiple-choice

Knowledge

English

What is the condition for a linked queue to be empty?

The head pointer Q.front and the tail pointer Q.rear both point to NULL.

The head pointer Q.front points to NULL, while the tail pointer Q.rear is not NULL.

The tail pointer Q.rear points to NULL, while the head pointer Q.front is not NULL.

The head pointer and the tail pointer both point to the same non-NULL node.

A

null

86

Test

Data Structure and Algorithm

Stack, Queue, and Array

Multiple-choice

Knowledge

English

How is a linked queue typically designed?

As a singly linked list without a head node

As a singly linked list with a head node

As a doubly linked list

As a circular linked list

B

null

87

Test

Data Structure and Algorithm

Stack, Queue, and Array

Multiple-choice

Knowledge

English

How is the EnQueue operation for a linked queue implemented?

Directly add elements to the front of the queue.

Check the queue empty condition, then add the element.

Create a new node and add it to the end of the queue.

First, remove the element at the head of the queue, then add an element to the tail of the queue.

C

null

88

Test

Data Structure and Algorithm

Stack, Queue, and Array

Multiple-choice

Knowledge

English

How is the DeQueue operation of a linked queue implemented?

Directly remove the element at the end of the queue.

Remove the element at the head of the queue without checking if the queue is empty.

Check if the queue is full, then remove the element at the head of the queue.

Check the queue empty condition, then remove the element at the head of the queue.

D

null

89

Test

Data Structure and Algorithm

Stack, Queue, and Array

Multiple-choice

Knowledge

English

In a linked queue, what might need to be modified when performing a deletion operation?

Head and Tail Pointers

Only the head pointer

Only the tail pointer

Data Structure

A

null

90

Test

Data Structure and Algorithm

Stack, Queue, and Array

Multiple-choice

Knowledge

English

What are the two conditions that must be met for recursive operations?

Increment expression and loop condition

Recursive expression and boundary conditions

Cyclic expression and termination condition

Incremental expression and constraints

B

null

91

Test

Data Structure and Algorithm

Stack, Queue, and Array

Multiple-choice

Knowledge

English

How is a queue used in level-order traversal?

Used to store all the nodes

For storage of leaf nodes only

Enqueue the root node. If the queue is empty, then the traversal is finished. Otherwise, dequeue and visit the first node in the queue. If there are left and right children, enqueue them accordingly.

Used only for storing non-leaf nodes

C

null

92

Test

Data Structure and Algorithm

Stack, Queue, and Array

Multiple-choice

Knowledge

English

When performing a deletion operation on a queue that uses linked storage, what usually needs to be modified?

Only the data content

Only the head pointer

Only the tail pointer

head and tail pointers

D

null

93

Test

Data Structure and Algorithm

Stack, Queue, and Array

Multiple-choice

Knowledge

English

What is the main role of queues in computer systems?

Data Encryption and Decryption

As a buffer and processing resource competition

Data Analysis and Processing

Program Compilation and Debugging

B

null

94

Test

Data Structure and Algorithm

Stack, Queue, and Array

Multiple-choice

Knowledge

English

What is the definition of a compressed matrix?

A matrix that stores all elements

Allocate multiple storage spaces for elements with the same value.

Allocate storage space for elements with the same value, and do not allocate for zero elements.

Allocate storage space only for non-zero elements.

C

null

95

Test

Data Structure and Algorithm

Stack, Queue, and Array

Multiple-choice

Knowledge

English

What is the purpose of using queues in multi-user systems?

Manage user permissions

Monitor user activity

Addressing resource contention issues

Control Data Access

C

null

96

Test

Data Structure and Algorithm

Stack, Queue, and Array

Multiple-choice

Knowledge

English

What is the required length of the table for compressed storage of an n-order symmetric matrix?

n

n(n-1)/2

n^2

n(n+1)/2

D

null

97

Test

Data Structure and Algorithm

Stack, Queue, and Array

Multiple-choice

Knowledge

English

What is a special matrix?

A matrix with many identical elements or zero elements.

Matrix generated by specific rules

Matrix with random elements

Any non-zero matrix

A

null

98

Test

Data Structure and Algorithm

Stack, Queue, and Array

Multiple-choice

Knowledge

English

What is the row-major order formula for calculating the address of a two-dimensional array?

LOC(i,j) = LOC(0,0) + (i+j)*L

LOC(i,j) = LOC(0,0) + (i + n + j) * L

LOC(i,j) = LOC(0,0) + (i + j*m) * L

LOC(i,j) = LOC(0,0) + (i*m + j)*L

D

null

99

Test

Data Structure and Algorithm

Stack, Queue, and Array

Multiple-choice

Knowledge

English

How does a cross-linked list store a sparse matrix?

Using only singly linked lists

Using only singly linked lists.

Combine row singly linked list with column singly linked list.

Use an array to store all elements.

C

null

100

Test

Data Structure and Algorithm

Stack, Queue, and Array

Multiple-choice

Knowledge

English

What type of data structure is typically stored in a triplestore?

Sparse matrix

Queue

Tree or Forest

Figure

A

null