CS-301 Final Term Exams Preparation Virtual University
00:00
Question # 1
We can build a heap in ________ time.
Question # 2
Suppose we are sorting an array of eight integers using quick sort, and we have just finished the first
partitioning with the array looking like this:
2 5 1 7 9 12 11 10
Which statement is correct?
Question # 3
Binary Search is an algorithm of searching, used with the ______ data
Question # 4
In a min heap , preculateDown procedure will move smaller value______ and bigger value______.
Question # 5
Consider te following array
23 15 5 12 40 10 7
After the first pass of a particular algorithm, the array looks like
15 12 23 10 7 40
Name the algorithm used
Question # 6
Which of the following statement statement is true about dummy node of threaded binary type?
Question # 7
Binary Search is an algorithm of searching ,used with the ____ data .
Question # 8
A queen is a data structure where elements are,
Question # 9
it will be efficient to place stack elements at the start of the list because insertion and removal take
_______time.
Home
News
Colleges
Courses
Admission
Lectures
Online Test
Past Papers
Date Sheets
Results
Study Abroad
Jobs
Tutors
More
Apps
