ITEC33 (Ma'am Pamintuan)

Question 1

is a linear data structure which follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out).

Answer 1

Stack

Question 2

insertion operation

Answer 2

PUSH

Question 3

removal operation

Answer 3

POP

Question 4

STACK
Pushing (storing) an element on the stack.

Answer 4

push()

Question 5

STACK
Removing (accessing) an element from the stack.

Answer 5

pop()

Question 6

STACK
get the top data element of the stack, without removing it.

Answer 6

peek()

Question 7

STACK
check if stack is full.

Answer 7

isFull()

Question 8

STACK
check if stack is empty

Answer 8

isEmpty()

Question 9

pointer provides top value of the stack without actually removing it.

Answer 9

top

Question 10

The process of putting a new data element onto stack is known as a Push Operation. Push operation involves a series of steps −

Step 1− Checks if the stack is full.
Step 2− If the stack is full, produces an error
and exit.
Step 3− If the stack is not full, incrementstopto
point next empty space.
Step 4− Adds data element to the stack
location, where top is pointing.
Step 5− Returns success.

Answer 10

PUSH OPERATION

Question 11

Accessing the content while removing it from the stack, is known as a Pop Operation. In an array implementation of pop() operation, the data element is not actually removed, insteadtopis decremented to a lower position in the stack to point to the next value. But in linked-list implementation, pop() actually removes data element and deallocates memory space.
Step 1− Checks if the stack is empty.
Step 2− If the stack is empty, produces an error and
exit.
Step 3− If the stack is not empty, accesses the data
element at whichtopis pointing.
Step 4− Decreases the value of top by 1.
Step 5− Returns success.

Answer 11

Pop Operation

Question 12

The way to write arithmetic expression

Answer 12

notation

Question 13

An arithmetic expression can be written in three different but equivalent notations

Answer 13

Infix Notation
Prefix (Polish) Notation
Postfix (Reverse-Polish) Notation

Question 14

where operators are usedin-between operands. It is easy for us humans to read, write, and speak in infix notation but the same does not go well with computing devices.

Answer 14

Infix Notation

Question 15

In this notation, operator isprefixed to operands, i.e. operator is written ahead of operands.

Answer 15

Prefix Notation

Question 16

Prefix notation is also known as

Answer 16

Polish Notation.

Question 17

the operator is written after the operands.

Answer 17

Postfix Notation

Question 18

This notation style is known asReversed Polish Notation.

Answer 18

Postfix Notation

Question 19

Step 1 − scan the expression from left to right
Step 2 − if it is an operand push it to stack
Step 3 − if it is an operator pull operand from stack and perform operation
Step 4 − store the output of step 3, back to stack
Step 5 − scan the expression until all operands are consumed
Step 6 − pop the stack and perform operation

Answer 19

Postfix Evaluation Algorithm

Question 20

Step 1 − scan the expression from right to left
Step 2 − if it is an operand push it to stack
Step 3 − if it is an operator pull operand from stack and perform operation
Step 4 − store the output of step 3, back to stack
Step 5 − scan the expression until all operands are consumed
Step 6 − pop the stack and perform operation

Answer 20

Prefix Evaluation Algorithm

Question 21

is an abstract data structure, somewhat similar to Stacks.

Answer 21

queue

Question 22

follows First-In-First-Out methodology

Answer 22

queue

Question 23

add (store) an item to the queue.

Answer 23

enqueue()

Question 24

remove (access) an item from the queue.

Answer 24

dequeue()

Question 25

Gets the element at the front of the queue without removing it.

Answer 25

peek()

Question 26

Checks if the queue is full.

Answer 26

isfull()

Question 27

Checks if the queue is empty.

Answer 27

isempty()

Question 28

Queues maintain two data pointers,frontandrear. Therefore, its operations are comparatively difficult to implement than that of stacks.
The following steps should be taken to enqueue (insert) data into a queue −
Step 1− Check if the queue is full.
Step 2− If the queue is full, produce overflow error and exit.
Step 3− If the queue is not full, incrementrearpointer to point the next empty space.
Step 4− Add data element to the queue location, where the rear is pointing.
Step 5− return success.

Answer 28

Enqueue Operation

Question 29

Accessing data from the queue is a process of two tasks − access the data wherefrontis pointing and remove the data after access. The following steps are taken to performdequeueoperation −
Step 1− Check if the queue is empty.
Step 2− If the queue is empty, produce underflow error and exit.
Step 3− If the queue is not empty, access the data wherefrontis pointing.
Step 4− Incrementfrontpointer to point to the next available data element.
Step 5− Return success.

Answer 29

Dequeue Operation

Question 30

is a very simple search algorithm.

In this type of search, a sequential search is made over all items one by one.
Every item is checked and if a match is found then that particular item is returned, otherwise the search continues till the end of the data collection.

Answer 30

Linear search

Question 31

is a fast search algorithm with run-time complexity of Ο(log n).

Answer 31

Binary search

Question 32

This search algorithm works on the principle of divide and conquer.

Answer 32

Binary search

Question 33

looks for a particular item by comparing the middle most item of the collection.

Answer 33

Binary search

Question 34

For this algorithm to work properly, the data collection should be in the sorted form.

Answer 34

Binary search

Question 35

is an improved variant of binary search. This search algorithm works on the probing position of the required value. For this algorithm to work properly, the data collection should be in a sorted form and equally distributed.

Answer 35

Interpolation search

Question 36

refers to arranging data in a particular format.

Answer 36

Sorting

Question 37

specifies the way to arrange data in a particular order. Most common orders are in numerical or lexicographical order.

Answer 37

Sorting

Question 38

is a simple sorting algorithm. This sorting algorithm is comparison-based algorithm in which each pair of adjacent elements is compared and the elements are swapped if they are not in order. This algorithm is not suitable for large data sets as its average and worst case complexity are of Ο(n2) wherenis the number of items

Answer 38

Bubble sort

Question 39

This is an in-place comparison-based sorting algorithm. Here, a sub-list is maintained which is always sorted.

Answer 39

Insertion sort

Question 40

is a simple sorting algorithm. This sorting algorithm is an in-place comparison-based algorithm in which the list is divided into two parts, the sorted part at the left end and the unsorted part at the right end. Initially, the sorted part is empty and the unsorted part is the entire list.

Answer 40

Selection sort

Question 41

is a sorting technique based on divide and conquer technique. With worst-case time complexity being Ο(n log n), it is one of the most respected algorithms.

Answer 41

Merge sort

Question 42

is a highly efficient sorting algorithm and is based on partitioning of array of data into smaller arrays.

Answer 42

QUICK SORT

Question 43

This algorithm is quite efficient for large-sized data sets as its average and worst-case complexity are O(nLogn) and O(n2), respectively.

Answer 43

QUICK SORT

Question 44

is a highly efficient sorting algorithm and is based on insertion sort algorithm. This algorithm avoids large shifts as in case of insertion sort, if the smaller value is to the far right and has to be moved to the far left.

Answer 44

Shell sort

Question 45

This algorithm uses insertion sort on a widely spread elements, first to sort them and then sorts the less widely spaced elements. This spacing is termed asinterval.

Answer 45

Shell sort