Design and analysis of algorithm MCQs which is very useful for Computer Science students.
These MCQs are Based on the basic concept of an algorithm.
Table of Contents
Algorithm
An algorithm is the step-step by step instruction to solve any problem. It prepares a rough written to show the steps involved in the program.
Algorithm Life cycle steps
- Problem definition
- Requirement (Condition)
- Logic/Design
- Develop algorithm(Expres)
- Validation ( prove Correctness)
- Analysis
- Implementation
- Testing and debugging
Need for analysis (why)
- To determine restore consumption(Time +space+cost)
- Performance comparison to find an effective solution algorithm
Q.1 Father of algorithm?
- Md Musa Alkhwarjmi
- Donald Ervin Knuth
- John Tukey
- None
Q.2 Which of the following is true about apostriori analysis.
- It gives exact value in real unit
- It is difficult to carry out
- It is easy to carry out
- Both A & B
Q.3 Algorithm can be represented.
- Flowchart
- Syntax
- Both A & B
- None
Q.4 Which of the following analyses is a platform-independent.
- Apostriori analysis
- Apriori Analysis
- Both
- None
Q.5 Which of the following notation is used to major tight-bound.
- Big oh
- Theta
- Big Omega
- None
Q.6 Which of the following notation is used to major proper upper bound?
- Little oh
- Big Omega
- Litle omega
- None
Q.7 Big Omega follow the property of symmetric?
- True
- False
Q.8 Big oh follow property of Transitive property?
- True
- False
Q.9 100n.logn=Big oh O(n.logn).
- True
- False
Q.10 root logn = Big oh O(log logn)
- True
- False
Q.11 What is the correct Time complexity of T(n)=T(n-1)+d, where n>1
- Big oh(n)
- Theta(n)
- nlog
- None
Q.12 Which of the following options is correct?
for(i=1;i<n;i=i+2)
- O(n)
- nlog
- nlogn
- None
Q.13 Which notation describes the best-case time complexity of an algorithm?
- Big oh
- Theta
- Big Omega
- None
Q.14 Numer of steps of an algorithm.
- 10
- 100
- Finite
- Infinite
Q.15 Which of the following analyses is known as a theoretical analysis of an algorithm?
- A Posterior Analysis
- A Priori Analysis
- Both A & B
- An Independent analysis
Q.16 O(1) Means
- Constant
- Linear
- Cubic
- None
Q.17 A Priory algorithm analysis does not include ?
- Time complexity
- Space complexity
- Program complexity
- None
Q.18 Highest run time complexity is?
- Prime number
- Fibonacci series
- Tower of Hanoi
- None
Q.19 Which of the following cases does not exist in complexity theory
- Best case
- Worst case
- Average case
- Null case
Q.20 Space complexity of an algorithm is the maximum amount of ——– required by it during execution of a program/
- Time
- Operation
- Memory space
- None
Some Important Link
| Official Telegram | Click Here |
| Telegram For CSE MCQs | Click Here |
| You Tube | Click Here |
| Download CSE/IT GATE Syllabus | Click Here |
| Download CSE/IT GATE Question Bank | Click Here |
Multiple Choice Questions For Computer Science
| S.NO | Subjects |
| 1 | Basic Computer |
| 2 | IT System (Diploma) |
| 3 | C Programming |
| 4 | C++ Programming |
| 5 | Java Programming |
| 6 | Data Structure |
| 7 | Computer Organization & Architecture |
| 8 | Operating System |
| 9 | Digital Electronics |
| 10 | Data Base Management System |
| 11 | System Maintenance |
| 12 | Data Communication & Networking |
| 13 | Internet & Web Technology |
| 14 | Software Engineering |
| 15 | Computer Graphics |
| 16 | Multimedia |
| 17 | System Software |
| 18 | Management |
| 19 | Visual Basic |
| 20 | Artificial Intelligence |
| 21 | BCECE LE English |