11/3/22, 12:54 AM Midterm Exam: Attempt review

Home / My courses / UGRD-ITE6201-2212S / Midterm Examination / Midterm Exam

Started on Thursday, 3 November 2022, 12:46 AM

State Finished
Completed on Thursday, 3 November 2022, 12:53 AM
Time taken 6 mins 18 secs
Grade 50.00 out of 50.00 (100%)

Question 1
Correct

Mark 1.00 out of 1.00

A _______ queue acts like a queue in that you dequeue an item by removing it from the front.

Select one:
a. INTERNAL

b. PRIORITY

c. DIRECT

Your answer is correct.

Question 2
Correct

Mark 1.00 out of 1.00

A sorting algorithm is said to be _________ if two objects with equal keys appear in the same order in sorted output as they appear in the input
unsorted array.

Select one:
a. STABLE

b. UNSTABLE

c. AT REST

Your answer is correct.

semestralexam.amaes.com/2212/mod/quiz/review.php?attempt=49943&cmid=4754 1/18
11/3/22, 12:54 AM Midterm Exam: Attempt review

Question 3

Correct

Mark 1.00 out of 1.00

A RADIX is a specific tree based data structure in which all the nodes of tree are in a specific order.

Select one:
a. TRUE

b. FALSE

c. NO,it must be HEAP

Your answer is correct.

Question 4
Correct

Mark 1.00 out of 1.00

A binary tree is either empty or consists of a node called the root together with two binary trees called the left subtree and the right subtree.

Select one:
a. FALSE

b. BOTH A AND B

c. TRUE

Your answer is correct.

Question 5
Correct

Mark 1.00 out of 1.00

_______ memory is used to store local variables and function call while heap memory is used to store objects in Java.

Select one:
a. SORT

b. STACK

c. RADIX

Your answer is correct.

semestralexam.amaes.com/2212/mod/quiz/review.php?attempt=49943&cmid=4754 2/18
11/3/22, 12:54 AM Midterm Exam: Attempt review

Question 6

Correct

Mark 1.00 out of 1.00

___________ is a linear data structure in which the operations are performed based on FIFO (First In First Out) principle and the last position is
connected back to the first position to make a circle.

Select one:
a. CIRCULAR QUEUE

b. LONG QUEUE

c. SPIRAL QUEUE

Your answer is correct.

Question 7
Correct

Mark 1.00 out of 1.00

A ____________is an example of a linear data structure, or more abstractly a sequential collection.

Select one:
a. SORT

b. ALGORITHM

c. QUEUE

Your answer is correct.

Question 8
Correct

Mark 1.00 out of 1.00

Which is the slowest sorting algorithm?

Select one:
a. QUICKSORT

b. SLOWSORT

c. HEAP SORT

Your answer is correct.

semestralexam.amaes.com/2212/mod/quiz/review.php?attempt=49943&cmid=4754 3/18
11/3/22, 12:54 AM Midterm Exam: Attempt review

Question 9

Correct

Mark 1.00 out of 1.00

_________ is a linear data structure which follows a particular order in which the operations are performed.

Select one:
a. FUNCTION

b. STACK

c. SEARCH

Your answer is correct.

Question 10
Correct

Mark 1.00 out of 1.00

Heap is called a ___________.

Select one:
a. TORIAL HEAP

b. MAX HEAP

c. MIN HEAP

Your answer is correct.

Question 11
Correct

Mark 1.00 out of 1.00

In _________sorting data is stored outside memory (like on disk) and only loaded into memory in small chunks.

Select one:
a. INTERNAL

b. ZERO

c. EXTERNAL

Your answer is correct.

semestralexam.amaes.com/2212/mod/quiz/review.php?attempt=49943&cmid=4754 4/18
11/3/22, 12:54 AM Midterm Exam: Attempt review

Question 12

Correct

Mark 1.00 out of 1.00

AVL tree is also a BST but it can rebalance itself.

Select one:
a. NONE OF THE ABOVE

b. TRUE

c. FALSE

Your answer is correct.

Question 13
Correct

Mark 1.00 out of 1.00

This transformation consists of replacing every null subtree of the original tree with “special nodes.” The nodes from the original tree are then
internal nodes , while the “special nodes” are external nodes.

Select one:
a. EXTENDED BINARY TREE

b. STABLE BINARY TREE

c. FULL BINARY TREE

Your answer is correct.

Question 14
Correct

Mark 1.00 out of 1.00

_____________ have less memory consumption as compared to linear queue because while doing insertion after deletion operation it allocate
an extra space the first remaining vacant but in circular queue the first is used as it comes immediate after the last.

Select one:
a. CIRCULAR QUEUE

b. BUBBLE QUEUE

c. NULL QUEUE

Your answer is correct.

semestralexam.amaes.com/2212/mod/quiz/review.php?attempt=49943&cmid=4754 5/18
11/3/22, 12:54 AM Midterm Exam: Attempt review

Question 15

Correct

Mark 1.00 out of 1.00

A binary search tree (BST), also known as an ordered ________.

Select one:
a. DATA TREE

b. BINARY

c. BINARY TREE

Your answer is correct.

Question 16
Correct

Mark 1.00 out of 1.00

_________Algorithm is used to arrange N elements in ascending order, and for that, you have to begin with 0th element and compare it with
the first element.

Select one:
a. BUBBLE SORT

b. RADIX SORT

c. HEAP SORT

Your answer is correct.

Question 17
Correct

Mark 1.00 out of 1.00

The ______ is a straightforward process of sorting values. In this method, to sort the data in ascending order, the 0thelement is compared with
all other elements.

Select one:
a. SELECTION SORT

b. HEAP SORT

c. BUBBLE SORT

Your answer is correct.

semestralexam.amaes.com/2212/mod/quiz/review.php?attempt=49943&cmid=4754 6/18
11/3/22, 12:54 AM Midterm Exam: Attempt review

Question 18

Correct

Mark 1.00 out of 1.00

A ___________ is a tree with some extra leaf nodes at depth n+1, all toward the left.

Select one:
a. COMPLETE BINARY TREE

b. FULL BINARY TREE

c. PERFECT BINARY TREE

Your answer is correct.

Question 19
Correct

Mark 1.00 out of 1.00

A _____________is a binary tree in which every level, except possibly the last, is completely filled, and all nodes are as far left as possible.

Select one:
a. FULL BINARY TREE

b. COMPLETE BINARY TREE

c. BINARY SEARCH TREE

Your answer is correct.

Question 20
Correct

Mark 1.00 out of 1.00

Means to insert an item into the back of the queue.

Select one:
a. DEQUEUE

b. QUEUE

c. ENQUEUE

Your answer is correct.

semestralexam.amaes.com/2212/mod/quiz/review.php?attempt=49943&cmid=4754 7/18
11/3/22, 12:54 AM Midterm Exam: Attempt review

Question 21

Correct

Mark 1.00 out of 1.00

In a _____ skewed, most of the nodes have the leftchild without corresponding right child.

Select one:
a. RIGHT

b. LEFT

c. ZERO

Your answer is correct.

Question 22
Correct

Mark 1.00 out of 1.00

The following are synonym of QUEUE.EXCEPT ONE.

Select one:
a. string

b. range

c. massive

Your answer is correct.

Question 23
Correct

Mark 1.00 out of 1.00

________is any process of arranging items systematically, and has two common, yet distinct meanings: ordering: arranging items in a sequence
ordered by some criterion; categorizing: grouping items with similar properties.

Select one:
a. EXTRACTING

b. SORTING

c. LOOPING

Your answer is correct.

semestralexam.amaes.com/2212/mod/quiz/review.php?attempt=49943&cmid=4754 8/18
11/3/22, 12:54 AM Midterm Exam: Attempt review

Question 24

Correct

Mark 1.00 out of 1.00

__________ is a common operation in many applications, and efficient algorithms to perform it have been developed.

Select one:
a. SORTING

b. STACK

c. FUNCTION

Your answer is correct.

Question 25
Correct

Mark 1.00 out of 1.00

A binary tree is a finite set of nodes that is either empty or consist a root node and two disjoint binary trees called the left subtree and the
right subtree.

Select one:
a. FALSE

b. TRUE

c. NEITHER TRUE OR FALSE

Your answer is correct.

Question 26
Correct

Mark 1.00 out of 1.00

_________sorting means sorting without any extra space requirement.

Select one:
a. IN PLACE

b. PLACE

c. OUTPLACE

Your answer is correct.

semestralexam.amaes.com/2212/mod/quiz/review.php?attempt=49943&cmid=4754 9/18
11/3/22, 12:54 AM Midterm Exam: Attempt review

Question 27

Correct

Mark 1.00 out of 1.00

A General tree can't be empty but a Binary tree can be empty.

Select one:
a. YES

b. NONE OF THE ABOVE

c. NO

Your answer is correct.

Question 28
Correct

Mark 1.00 out of 1.00

The maximum value in a Binary Search Tree can be found by ?

Select one:
a. START AT THE ROOT NODE

b. START AT THE LEFT SUB TREE

c. START AT THE RIGHT SUB TREE

Your answer is correct.

Question 29
Correct

Mark 1.00 out of 1.00

_________A sorting algorithm used for numbers.

Select one:
a. HEAP

b. MERGE

c. RADIX

Your answer is correct.

semestralexam.amaes.com/2212/mod/quiz/review.php?attempt=49943&cmid=4754 10/18
11/3/22, 12:54 AM Midterm Exam: Attempt review

Question 30

Correct

Mark 1.00 out of 1.00

Sorting is the process of arranging objects in a certain sequence or order according to specific rules.

Select one:
a. FALSE

b. NONE OF THE ABOVE

c. TRUE

Your answer is correct.

Question 31
Correct

Mark 1.00 out of 1.00

Binary Search Tree, is a node-based binary tree data structure which has the following properties: The left subtree of a node contains only
nodes with keys lesser than the node's key. The right subtree of a node contains only nodes with keys greater than the node's key.

Select one:
a. NULL

b. FALSE

c. TRUE

Your answer is correct.

Question 32
Correct

Mark 1.00 out of 1.00

A ___________ is a specific tree based data structure in which all the nodes of tree are in a specific order.

Select one:
a. HEAP

b. RADIX

c. QUICKSORT

Your answer is correct.

semestralexam.amaes.com/2212/mod/quiz/review.php?attempt=49943&cmid=4754 11/18
11/3/22, 12:54 AM Midterm Exam: Attempt review

Question 33

Correct

Mark 1.00 out of 1.00

Merge sort is more efficient and works faster than quick sort in case of larger array size or datasets.

Select one:
a. FALSE

b. TRUE

c. NO,BECAUSE MERGE SORT IS SLOWER THAN QUICKSORT

Your answer is correct.

Question 34
Correct

Mark 1.00 out of 1.00

The following are other terms of Binary search tree. EXCEPT ONE.

Select one:
a. half interval search

b. search loop

c. binary chop

Your answer is correct.

Question 35
Correct

Mark 1.00 out of 1.00

A ____________ is a tree in which every node other than the leaves has two children.

Select one:
a. BINARY SEARCH TREE

b. FULL BINARY TREE

c. COMPLETE BINARY TREE

Your answer is correct.

semestralexam.amaes.com/2212/mod/quiz/review.php?attempt=49943&cmid=4754 12/18
11/3/22, 12:54 AM Midterm Exam: Attempt review

Question 36

Correct

Mark 1.00 out of 1.00

DEQUEUE IS ALSO CALLED ?

Select one:
a. DOUBLY ENDED QUEUE

b. CIRCULAR QUEUE

c. DEQUENT QUEUE

Your answer is correct.

Question 37
Correct

Mark 1.00 out of 1.00

A binary tree where the left child contains only nodes with values less than the parent node, and where the right child only contains nodes
with values greater than or equal to the parent.

Select one:
a. NO

b. NONE OF THE ABOVE

c. YES

Your answer is correct.

Question 38
Correct

Mark 1.00 out of 1.00

The _________ is slightly faster than the heap sort for larger sets, but it requires twice the memory of the heap sort because of the second
array.

Select one:
a. BUBBLESORT

b. QUICKSORT

c. MERGE SORT

Your answer is correct.

semestralexam.amaes.com/2212/mod/quiz/review.php?attempt=49943&cmid=4754 13/18
11/3/22, 12:54 AM Midterm Exam: Attempt review

Question 39

Correct

Mark 1.00 out of 1.00

___________ is another sorting technique and has an algorithm that has a reasonably proficient space-time complexity - O(n log n) and is quite
trivial to apply.

Select one:
a. HEAP SORT

b. MERGE SORT

c. BUBBLE SORT

Your answer is correct.

Question 40
Correct

Mark 1.00 out of 1.00

QuickSort is an___________ algorithm because we do swapping of elements according to pivot's position (without considering their original
positions).

Select one:
a. STABLE

b. NULL

c. UNSTABLE

Your answer is correct.

Question 41
Correct

Mark 1.00 out of 1.00

A Binary Tree is labeled if every node is assigned a label and a Binary Tree is __________ if nodes are not assigned any label.

Select one:
a. STATIONARY

b. UNLABELED

c. LABELED

Your answer is correct.

semestralexam.amaes.com/2212/mod/quiz/review.php?attempt=49943&cmid=4754 14/18
11/3/22, 12:54 AM Midterm Exam: Attempt review

Question 42

Correct

Mark 1.00 out of 1.00

This is the Best Sorting Algorithm That the time complexity of Quicksort is O(n log n) in the best case, O(n log n) in the average case, and
O(n^2) in the worst case.

Select one:
a. RADIX

b. HEAP

c. QUICKSORT

Your answer is correct.

Question 43
Correct

Mark 1.00 out of 1.00

The ________ sort is a combination of searching and sorting.

Select one:
a. BUBBLE

b. HANDLE

c. SELECTION 

Your answer is correct.

Question 44
Correct

Mark 1.00 out of 1.00

How many leaves are there in a full binary tree?

Select one:
a. CONTAINS 3N-1

b. CONTAINS N-1

c. CONTAINS 2N-1

Your answer is correct.

semestralexam.amaes.com/2212/mod/quiz/review.php?attempt=49943&cmid=4754 15/18
11/3/22, 12:54 AM Midterm Exam: Attempt review

Question 45

Correct

Mark 1.00 out of 1.00

A ________ is a complete binary tree in which the value in each internal node is greater than or equal to the values in the children of that node.

Select one:
a. MAX HEAP

b. MAX LOOP

c. MAX SORT

Your answer is correct.

Question 46
Correct

Mark 1.00 out of 1.00

A ___________ queue is typically implemented using Heap data structure.

Select one:
a. NULL

b. PRIORITY

c. DIRECT

Your answer is correct.

Question 47
Correct

Mark 1.00 out of 1.00

The acronym FIFO stands for ?

Select one:
a. FIRST AND FIRST OUT

b. FIRST IN AND FIRST OUT

c. FIRST IN FIRST OUT

Your answer is correct.

semestralexam.amaes.com/2212/mod/quiz/review.php?attempt=49943&cmid=4754 16/18
11/3/22, 12:54 AM Midterm Exam: Attempt review

Question 48

Correct

Mark 1.00 out of 1.00

A binary tree is considered full if every node has exactly 0 or 2 children. A binary tree is considered incomplete if every level is full except the
last, and all nodes are pushed as far left as possible.

Select one:
a. YES

b. NO

c. NULL

Your answer is correct.

Question 49
Correct

Mark 1.00 out of 1.00

Bubble Sort is based on the idea of repeatedly comparing pairs of ________ELEMENTS swapping their positions if they exist in the wrong
order.

Select one:
a. ADJACENT

b. FORMAL

c. CONNECTED

Your answer is correct.

Question 50
Correct

Mark 1.00 out of 1.00

A binary _______ is a complete binary tree which satisfies the heap ordering property.

Select one:
a. HEAP

b. CROSS

c. LEAF

Your answer is correct.

semestralexam.amaes.com/2212/mod/quiz/review.php?attempt=49943&cmid=4754 17/18
11/3/22, 12:54 AM Midterm Exam: Attempt review

◄ Prelim Lab Exam

Jump to...

Midterm Lab Exam ►

semestralexam.amaes.com/2212/mod/quiz/review.php?attempt=49943&cmid=4754 18/18