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 |
Suppose We Have Three Items As Shown In The Following Table And Suppose The Capacity Of The Knapsack Is 50 I.E. W = 50. Item Value Weight 1 60 10 2 100 20 3 120 30 The Optimal Solution Is To Pick
|
Items 1 And 2
|
Items 1 And 3
|
Items 2 And 3
|
None Of These
|
D |
| CS502 |
Suppose We Have Two Problems A And B .Problem A Is Polynomial-Time Reducible And Problem B Is Np-Complete. If We Reduce Problem A Into B Then Problem A Becomes Npcomplete
|
True
|
False
|
Na
|
Na
|
A |
| CS502 |
The Analysis Of Selection Algorithm Shows The Total Running Time Is Indeed __________In N
|
Arithmetic
|
Geometric
|
Linear
|
Orthogonal
|
C |
| CS502 |
The Appropriate Big Thita Classification Of The Given Function. F(N) = 4N2 + 97N + 1000 Is
|
?(N)
|
O(2^N)
|
O(N^2)
|
O(N^2Logn)
|
C |
| CS502 |
The Codeword Assigned To Characters By The Huffman Algorithm Have The Property That No Codeword Is The Postfix Of Any Other
|
True
|
False
|
Na
|
Na
|
A |
| CS502 |
The Difference Between Prim S Algorithm And Dijkstra S Algorithm Is That Dijkstra S Algorithm Uses A Same Key
|
True
|
False
|
Na
|
Na
|
B |
| CS502 |
The Difference Between Prim’S Algorithm And Dijkstra’S Algorithm Is That Dijkstra’S Algorithm Uses A Different Key
|
True
|
False
|
Na
|
Na
|
A |
| CS502 |
The Difference Between Prims Algorithm And Dijkstra S Algorithm Is That Dijkstra S Algorithm Uses A Different Key
|
True
|
False
|
Na
|
Na
|
A |
| CS502 |
The Edit Distance Between Food And Money Is
|
At Most Four
|
At Least Four
|
Exact Four
|
Wrong
|
A |
| CS502 |
The Greedy Part Of The Huffman Encoding Algorithm Is To First Find Two Nodes With Character Frequency
|
True
|
False
|
Na
|
Na
|
B |
| CS502 |
The Greedy Part Of The Huffman Encoding Algorithm Is To First Find Two Nodes With Larger Frequency
|
True
|
False
|
Na
|
Na
|
A |
| CS502 |
The Greedy Part Of The Huffman Encoding Algorithm Is To First Find Two Nodes With Smallest Frequency
|
True
|
False
|
Na
|
Na
|
A |
| CS502 |
The Growth Of Master Files And Magnetic Tapes Exploded Around The Mid
|
1960
|
1970
|
1980
|
1990
|
A |
| CS502 |
The Heap Order Property Stated That In A __________ For Every Node X The Key In The Parent Is Smaller Than Or Equal To The Key In X
|
(Max) Heap
|
(Min) Heap
|
Na
|
Na
|
B |
| CS502 |
The Huffman Algorithm Finds A (N) __________ Solution
|
Optimal
|
Non-Optimal
|
Exponential
|
Polynomial
|
A |
| CS502 |
The Huffman Algorithm Finds A Polynomial Solution
|
True
|
False
|
Na
|
Na
|
B |
| CS502 |
The Huffman Algorithm Finds An Exponential Solution
|
True
|
False
|
Na
|
Na
|
A |
| CS502 |
The Huffman Codes Provide A Method Of Encoding Data Inefficiently When Coded Using Ascii Standard
|
True
|
False
|
Na
|
Na
|
B |
| CS502 |
The Input To The Data Warehouse Can Come From Oltp Or Transactional Systems Or Other Third Party Databases
|
True
|
False
|
Na
|
Na
|
A |
| CS502 |
The Knapsack Problem Belongs To The Domain Of __________ Problems
|
Optimization
|
Np Complete
|
Linear Solution
|
Sorting
|
A |