Fundamentals of Computer Systems Data Structures Quiz

What is a linear data structure?

• B. Data elements are arranged sequentially

• D. Data elements are fixed in size

• C. Data elements are randomly updated

• A. Data elements are not placed sequentially

Which of the following is an example of a non-linear data structure?

• D. Stacks

• B. Lists

• A. Arrays

• C. Trees

What is the basic operation of an array to add an element at a given index?

• C. Deletion

• B. Insertion

• A. Traverse

• D. Search

Why are arrays useful?

• D. All of the above

• C. To sort and search values easily

• B. To store multiple values in a single variable

• A. To process single value quickly

What is the length of a linear array calculated using the formula Length = UB - LB + 1?

• A. Largest index - Smallest index

• B. Smallest index - Largest index

• C. Largest index + Smallest index

• D. Largest index * Smallest index

What is the term used to insert an element into a stack?

• A. Push

• D. Pull

• C. Peek

• B. Pop

How is a stack represented by default?

• A. Linked list

• B. Queue

• C. Circular array

• D. Linear array

What mechanism do queues follow?

• A. Last In, First Out (LIFO)

• D. Last In, Last Out (LILO)

• B. First In, First Out (FIFO)

• C. Random In, Random Out (RIRO)

What is the total number of elements in a queue calculated as?

• C. REAR - FRONT + 1

• A. REAR - FRONT

• B. REAR + FRONT

• D. REAR * FRONT

How is a queue represented by default?

• D. Stack

• C. Linear array

• B. Circular array

• A. Linked list