PRELIM

Question 1

Collection of raw facts.

Answer 1

Data

Question 2

Representation of the
logical relationship existing between
individual elements of data.

Answer 2

Data structure

Question 3

Basic structures directly operated upon
by machine instructions.

Answer 3

Primitive Data Structure

Question 4

Primitive Data Structure Examples

Answer 4

Integer, Floating-point
number, Character constants, String
constants, Pointers, etc.

Question 5

Initializing or declaring a new
data structure (e.g., creating an integer
or a float).

Answer 5

. Create

Question 5

More sophisticated structures derived
from primitive data structures.

Answer 5

Non-Primitive Data Structure

Question 6

Accessing or retrieving a
specific element from the structure (e.g.,
selecting a particular value stored in an
integer variable).

Answer 6

Selection

Question 6

Modifying the value of an
existing element (e.g., changing the
value of a variable).

Answer 6

Updating

Question 7

Removing a data
element or deallocating the memory
used by the data structure (e.g., deleting
or clearing a variable).

Answer 7

Destroy/Delete

Question 8

Accessing each element in
the data structure exactly once to
process it (e.g., going through a list or
array to print its elements).

Answer 8

Traverse

Question 9

Combining two data structures
into one, often while maintaining a
specific order (e.g., merging two sorted
arrays into one sorted array).

Answer 9

Insert

Question 10

Finding the location of a
specific element in the structure (e.g.,
searching for a value in an array or a
node in a tree).

Answer 10

Search

Question 11

Arranging elements in a particular
order, such as ascending or descending
(e.g., sorting an array of integers).

Answer 11

Sort

Question 12

Combining two data structures
into one, often while maintaining a
specific order (e.g., merging two sorted
arrays into one sorted array).

Answer 12

Merge

Question 13

Operations on
Primitive Data Structures

Answer 13

Create:
Selection
Updating
Destroy/Delete

Question 14

Operations on
Non-Primitive Data Structures

Answer 14

Create
Traverse
Insert
Delete
Search
Sort:
Merge
Destroy/Delete

Question 15

A linear array with one row or
column.

Answer 15

One-dimensional array

Question 15

A set of finite homogeneous
elements (same data items).

Answer 15

Array

Question 16

A matrix-like array with rows and
columns.

Answer 16

Two-dimensional array

Question 17

Arrays with multiple subscripts.

Answer 17

Multi-dimensional array

Question 18

A linear data structure where the
operations are performed in LIFO (Last In, First Out) order.

Answer 18

Stack

Question 19

Adds a new item to
the top of the stack

Answer 19

push(item)

Question 20

Removes the top item
from the stack.

Answer 20

pop()

Question 21

Returns the top item
without removing it.

Answer 21

peek()

Question 22

Tests whether the stack is empty.

Answer 22

isEmpty()

Question 23

Returns the number of items in the stack.

Answer 23

size()

Question 24

Can be implemented using arrays (static) or pointers (dynamic).

Answer 24

Implementation

Question 25

Insertion occurs at the rear, and deletion occurs at the front.

Answer 25

Simple Queue

Question 25

is an ordered collection of items where an item is inserted at the rear and an existing item is removed at the front (FIFO - First In, First Out).

Answer 25

Queue

Question 26

The last node connects back to the first node, forming a circle.

Answer 26

Circular Queue

Question 27

Items are inserted and removed based on priority

Answer 27

Priority Queue

Question 28

Insertion and deletion can happen at both ends.

Answer 28

Dequeue

Question 29

Adds a new item at the rear of the queue

Answer 29

enqueue(item)

Question 30

Removes an item from the front.

Answer 30

dequeue()

Question 31

Tests whether the queue is empty

Answer 31

isEmpty()

Question 32

Returns the number of items in the queue.

Answer 32

size()

Question 32

collection of variable number of data items called nodes

Answer 32

Linked Lists

Question 33

Each node points to the next node.

Answer 33

Single Linked List

Question 34

Each node points to both the next and the previous node.

Answer 34

Doubly Linked List

Question 35

The last node points back to the first node.

Answer 35

Circular Linked List

Question 36

A hierarchical data structure consisting of nodes connected by edges.

Answer 36

Tree

Question 37

A tree in which each internal node can have a maximum of two child nodes.

Answer 37

Binary Tree

Question 37

All leaf nodes are at the same level.

Answer 37

Complete Binary Tree

Question 37

is a non-linear data structure consisting of vertices (nodes) and edges (connections between nodes).

Answer 37

Graph

Question 38

Edges have direction.

Answer 38

Directed Graph

Question 38

Edges do not have direction.

Answer 38

Undirected Graph

Question 39

Edges have weights.

Answer 39

Weighted Graph

Question 40

No multiple edges or loops.

Answer 40

Simple Graph

Question 41

There is a path between any two vertices.

Answer 41

Connected Graph

Question 42

Some vertices are not connected.

Answer 42

Non-connected Graph

Question 43

A collection of nodes, where each node contains two parts: the information and a link to the next node.

Answer 43

Lists

Question 44

An operator precedes the two operands

Answer 44

Prefix Expression

Question 44

An operator is between two operands

Answer 44

Infix Expression

Question 44

An operator follows the two operands

Answer 44

Postfix Expression