Scribd
Upload
38 views5 pages

Updated Structure Data AMAQuiz 1

The document discusses sorting algorithms and data structures. It contains 10 multiple choice questions about topics like binary trees, sorting algorithms like merge sort and quicksort, stable and unstable sorting, queues like circular queues, and stacks. Each question is followed by feedback indicating if the answer selected is correct or not.

Uploaded by

Gieo Rosal
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
Download as docx, pdf, or txt
38 views5 pages

Updated Structure Data AMAQuiz 1

The document discusses sorting algorithms and data structures. It contains 10 multiple choice questions about topics like binary trees, sorting algorithms like merge sort and quicksort, stable and unstable sorting, queues like circular queues, and stacks. Each question is followed by feedback indicating if the answer selected is correct or not.

Uploaded by

Gieo Rosal
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1/ 5

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

Select one:
a.
NO
b.
YES
c.
NONE OF THE ABOVE

Feedback

Your answer is correct.

Question 2
Correct
Mark 1.00 out of 1.00
Flag question

Question text

_____________ 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.
NULL QUEUE
b.
CIRCULAR QUEUE
c.
BUBBLE QUEUE

Feedback

Your answer is correct.

Question 3
Correct
Mark 1.00 out of 1.00
Flag question

Question text
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

Feedback

Your answer is correct.

Question 4
Correct
Mark 1.00 out of 1.00
Flag question

Question text

________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.
LOOPING
c.
SORTING

Feedback

Your answer is correct.

Question 5
Correct
Mark 1.00 out of 1.00
Flag question

Question text
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

Feedback

Your answer is correct.

Question 6
Correct
Mark 1.00 out of 1.00
Flag question

Question text

__________ is a common operation in many applications, and efficient algorithms to perform


it have been developed.

Select one:
a.
FUNCTION
b.
STACK
c.
SORTING

Feedback

Your answer is correct.

Question 7
Correct
Mark 1.00 out of 1.00
Flag question

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

Select one:
a.
BINARY TREE
b.
BINARY
c.
DATA TREE

Feedback

Your answer is correct.

Question 8
Correct
Mark 1.00 out of 1.00
Flag question

Question text

DEQUEUE IS ALSO CALLED ?

Select one:
a.
CIRCULAR QUEUE
b.
DOUBLY ENDED QUEUE
c.
DEQUENT QUEUE

Feedback

Your answer is correct.

Question 9
Correct
Mark 1.00 out of 1.00
Flag question

Question text

The ________ sort is a combination of searching and sorting.


Select one:
a.
BUBBLE
b.
SELECTION
c.
HANDLE

Feedback

Your answer is correct.

Question 10
Correct
Mark 1.00 out of 1.00
Flag question

Question text

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

Select one:
a.
SEARCH
b.
FUNCTION
c.
STACK

Feedback

Your answer is correct.

You might also like