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 |
Al-Khwarizmi Died ___________ C.E.
|
Around 900
|
Around 840
|
Around 740
|
Around 700
|
B |
| CS502 |
Al-Khwarizmi’S Work Was Written In A Book Titled Al Kitab Almukhatasar Fi Hisab Al-Jabr Wa’L-Muqabalah (The Compendious Book On Calculation By Completion And Balancing)__________
|
True
|
False
|
Na
|
Na
|
A |
| CS502 |
Although It Requires More Complicated Data Structures Prims Algorithm For A Minimum Spanning Tree Is Better Than Kruskals When The Graph Has A Large Number Of Vertices
|
True
|
False
|
Na
|
Na
|
A |
| CS502 |
Although It Requires More Complicated Data Structures Prims Algorithm For A Minimum Spanning Tree Is Better Than Kruskals When The Graph Has A Large Number Of Vertices
|
True
|
False
|
Na
|
Na
|
A |
| CS502 |
Although It Requires More Complicated Data Structures Prims Algorithm For A Minimum Spanning Tree Is Better Than Kruskals When The Graph Has A Large Number Of Vertices
|
True
|
False
|
Na
|
Na
|
A |
| CS502 |
An ___________ Is Thus A Sequence Of Computational Steps That
Transform The Input Into Output
|
Data Structure
|
Data Process
|
Algorithm
|
Program
|
C |
| CS502 |
An In Place Sorting Algorithm Is One That Uses Arrays For Storage
|
Two Dimensional Arrays
|
More Than One Array
|
No Additional Array
|
None Of The Above
|
C |
| CS502 |
An Optimization Problem Is One In Which You Want To Find
|
Not A Solution
|
An Algorithm
|
Good Solution
|
The Best Solution
|
D |
| CS502 |
Analysis Of Selection Algorithm Ends Up With
|
T(N)
|
T(1 / 1 + N)
|
T(N / 2)
|
T((N / 2) + N)
|
D |
| CS502 |
Analysis Of Selection Sort Ends Up With
|
T(N)
|
T(1/1+N)
|
T(N/2)
|
T((N/2) +N)
|
A |
| CS502 |
Analyzig Algorithms In Terms Of The Amount Of Computational Resources That The Algorithm Requires. These Resources Include Mostly __________
|
Running Time
|
Memory
|
Running Time And Memory
|
None
|
C |
| CS502 |
Ancient Roman Politicians Followed An Important Principle Of Good Algorithm Design Known As Divide And Conquer Strategy
|
True
|
False
|
Na
|
Na
|
A |
| CS502 |
Assume That A[1..I - 1] Have Already Been Sorted. Insert A[I] Into Its Proper Position In This Sub Array. Create This Position By Shifting All Larger Elements To The Right
|
Selection Sort
|
Bubble Sort
|
Merge Sort
|
Insertion Sort
|
D |
| CS502 |
Assume That A[1..I - 1] Have Already Been Sorted. Insert A[I] Into Its Proper Position In This Sub Array. Create This Position By Shifting All Larger Elements To The Right.It Is Called ___________
|
Bubble Sort
|
Selection Sort
|
Merge Sort
|
None
|
D |
| CS502 |
Back Edge Is ___________
|
(U V) Where V Is An Ancestor Of U In The Tree
|
(U V) Where U Is An Ancestor Of V In The Tree
|
(U V) Where V Is Predecessor Of U In The Tree
|
None Of The Given
|
A |
| CS502 |
Bellman-Ford Allows Negative Weights Edges And Negative Cost Cycles
|
True
|
False
|
Na
|
Na
|
B |
| CS502 |
Best And Worst Case Times Of An Algorithm May Be Same
|
True
|
False
|
Na
|
Na
|
A |
| CS502 |
Brute-Force Algorithm Is Defined As It Is A Very General Problemsolving
Technique That Consists Of Systematically Enumerating All Possible Candidates For The Solution And Checking Whether Each Candidate Satisfies The Problems Statement
|
True
|
False
|
Na
|
Na
|
A |
| CS502 |
Can An Adjacency Matrix For A Directed Graph Ever Not Be Square In Shape?
|
True
|
False
|
Na
|
Na
|
A |
| CS502 |
Central Tendency Of A Set Is Useful When The Distribution Of Values Is __________
|
Skewed
|
Not Skewed
|
Highly Skewed
|
Straight
|
C |