Online Exam Preparation
MCQs Library
Browse subject-wise multiple choice questions, review answers quickly, and start a test from the same section.
Questions
| Code | Question | Option A | Option B | Option C | Option D | Answer |
|---|---|---|---|---|---|---|
| CS502 |
Np-Complete Problem Are Those For Which Algorithms Are Known But No One Knows For Sure Whether Efficient Solutions Might Exist
|
Efficient
|
No Efficient
|
Ordinary
|
None
|
B |
| CS502 |
One Example Of In Place But Not Stable Algorithm Is
|
Merger Sort
|
Quick Sort
|
Continuation Sort
|
Bubble Sort
|
B |
| CS502 |
One Of The Clever Aspects Of __________ Is That They Can Be Stored In Arrays Without Using Any Pointers
|
Lists
|
Bst Trees
|
Heaps
|
None
|
C |
| CS502 |
One Of The Clever Aspects Of Heaps Is That They Can Be Stored In Arrays Without Using Any ___________
|
Pointers
|
Constants
|
Variables
|
Functions
|
A |
| CS502 |
Plane-Sweep Algorithm The Inner While-Loop Execute More Than N Times Over The Entire Course Of The Algorithm
|
Can
|
Cannot
|
Na
|
Na
|
B |
| CS502 |
Quick Sort Is
|
Stable And In Place
|
Not Stable But In Place
|
Stable And Not In Place
|
Some Time In Place And Snd Some Time Stable
|
B |
| CS502 |
Quick Sort Is ___________
|
Stable & In Place
|
Not Stable But In Place
|
Stable But Not In Place
|
Some Time Stable & Some Times In Place
|
C |
| CS502 |
Quick Sort Is Based On Divide And Conquer Paradigm; We Divide The Problem On Base Of Pivot Element And
|
There Is Explicit Combine Process As Well To Conquer The Solutin
|
No Work Is Needed To Combine The Sub-Arrays The Array Is Already Sorted
|
Merging The Subarrays
|
None Of Above
|
A |
| CS502 |
Random Access Machine Or Ram Is A/An
|
Mathematical Model
|
Machine Build By Al-Khwarizmi
|
Mechanical Machine
|
Electronics Machine
|
A |
| CS502 |
Relational Databases Allow You To Navigate The Data In Direction That Is Appropriate Using The Primary Foreign Key Structure?
|
Forward
|
One
|
Backward
|
Any
|
D |
| CS502 |
Scan The Array. Whenever Two Consecutive Items Are Found That Are Out Of Order Swap Them. Repeat Until All Consecutive Items Are In Order. It Is Called ___________
|
Insertion Sort
|
Bubble Sort
|
Selection Sort
|
None
|
B |
| CS502 |
Shortest Path Problems Can Be Solved Efficiently By Modeling The Road Map As A Graph
|
True
|
False
|
Na
|
Na
|
A |
| CS502 |
Shortest Path Problems Can Be Solved Efficiently By Modeling The Road Map As A Graph
|
True
|
False
|
Na
|
Na
|
A |
| CS502 |
Sieve Technique Applies To Problems Where We Are Interested In Finding A Single Item From A Larger Set Of __________
|
N Items
|
Phases
|
Pointers
|
Constant
|
A |
| CS502 |
Sieve Technique Can Be Applied To Selection Problem?
|
True
|
False
|
Na
|
Na
|
A |
| CS502 |
Slow Sorting Algorithms Run In
|
O(N^2)
|
O(N)
|
O( Log N)
|
O(N Log N)
|
A |
| CS502 |
Sorting Is One Of The Few Problems Where Provable __________ Bonds Exits On How Fast We Can Sort
|
Lower
|
Upper
|
Average
|
Log N
|
A |
| CS502 |
Sorting Takes Time
|
O(N)
|
O(N^2)
|
O(N Log N)
|
None
|
C |
| CS502 |
Suppose That A Graph G = (V E) Is Implemented Using Adjacency Lists. What Is The Complexity Of A Breadth-First Traversal Of G?
|
O(|V |^2)
|
O(|V | |E|)
|
O(|V |^2|E|)
|
O(|V | + |E|)
|
B |
| CS502 |
Suppose The Amount Of Data Recorded In An Organization Is Doubled Every Year This Is Called?
|
Linear
|
Quadratic
|
Exponential
|
Logarithmic
|
C |