ITEC33

Question 1

A linear data structure which follows order in which the operations are performed. Order may be LIFO or FILO

Answer 1

Stack

Question 2

Storing an element on the stack

Answer 2

push()

Question 3

removing an element from the stack

Answer 3

pop()

Question 4

get the top data element of the stack without removing it

Answer 4

peek()

Question 5

check if stack is full

Answer 5

isFull()

Question 6

check if stack is empty

Answer 6

isEmpty()

Question 7

the way to write arithmetic expression

Answer 7

notation

Question 8

3 different notation

Answer 8

Infix Notation
Prefix (polish) notation
Postfix (Reverse-polish) notation

Question 9

An abstract data structure. It follows FIFO methodology

Answer 9

Queue

Question 10

add an item to the queue

Answer 10

enqueue()

Question 11

remove an item to the queue

Answer 11

dequeue()

Question 12

a sequential search is made over all items one by one

Answer 12

linear search

Question 13

every item is checked and if a match is found, then the particular item is returned

Answer 13

linear search

Question 14

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

Answer 14

binary search

Question 15

this search algorithm works in the principle of divide and conquer

Answer 15

binary search

Question 16

is an improved variant of binary search

Answer 16

interpolation search

Question 17

the data collection should be in a sorted form and equally distributed

Answer 17

interpolation search

Question 18

refers to arranging data in a particular format

Answer 18

sorting

Question 19

specifies the way to arrange data in a numerical or lexicographical order

Answer 19

sorting

Question 20

this sorting algorithm is comparison-based algorithm in which each pair of adjacent element is compared and the elements are swapped if they are not in order

Answer 20

bubble sort

Question 21

is an in-place comparison-based sorting algorithm where a sub-list is maintained which is always sorted

Answer 21

insertion sort

Question 22

the smallest element from the unsorted array is swapped with the leftmost element and that element becomes a part of the sorted array

Answer 22

selection sort

Question 23

sorting technique based on divide and conquer technique.

Answer 23

merge sort

Question 24

sorting that divides the array into equal halves and then combines them in a sorted manner

Answer 24

merge sort

Question 25

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

Answer 25

quick sort

Question 26

is a highly efficient sorting algorithm and is based on insertion sort algorithm

Answer 26

shell sort