Exam Details
| Subject | Algorithms and Logic Design | |
| Paper | ||
| Exam / Course | Diploma -VIEP-Computer Science and Engineering(DCSVI)/Advanced Level O Certificate Course In Cse (ACCSVI) B.Tech. Computer Science And Engineering (BT | |
| Department | School of Engineering & Technology (SOET) | |
| Organization | indira gandhi national open university | |
| Position | ||
| Exam Date | December, 2015 | |
| City, State | new delhi, |
Question Paper
1. Choose the correct answer from the given four alternatives:
The average number of comparisons in sequential search is
n(n 2
n(n 2
In the worst case time complexity of binary search is
O(n log
O(log
O(log
O(log n
The number of interchanges needed in Insertion Sort method is on an average
n(n 2
2
2
n(n
The runtime efficiency of Quick Sort in the worst case situation is
O(log
O(n log
O(log 2n)
In which sort the storage complexity is not best?
Heap Sort
Bucket Sort
Merge Sort
QuickSort
Which one of the following methods is most efficient, if the successor value of k is kept prime to each other?
Bucket Sort
Shell Sort
Merge Sort
Heap Sort
The average number of comparisons in Bubble Sort is
n(n
n(n
Illustrate with an example the components and design of a flow chart.
What do you understand by the term algorithm? Explain the necessary steps for the development of an algorithm.
What is pseudocode? Explain and discuss the use of pseudocode.
What is a recursive algorithm? Explain with the help of an example.
What do you understand by sorting technique Write an algorithm for Quick Sort and explain it.
Differentiate between straight sequential search and binary search technique with examples.
Write the divide and conquer approach for binary search and calculate its average time complexity.
Differentiate between Insertion Sort and Selection Sort with examples.
How do you validate an algorithm Explain the steps needed to test a program.
Write and explain all the stages of Program Development Life Cycle.
What is a complexity? Write the types of complexity and also explain Big-oh and Big-omega notations.
Write an algorithm for Merge Sort. Sort the following values as per your algorithm:
3
8. Write short notes on any four of the following
Bubble Sort
Shell Sort
Merge Sort
Fibonacci Search
Analyze Algorithm
Sequential Search
The average number of comparisons in sequential search is
n(n 2
n(n 2
In the worst case time complexity of binary search is
O(n log
O(log
O(log
O(log n
The number of interchanges needed in Insertion Sort method is on an average
n(n 2
2
2
n(n
The runtime efficiency of Quick Sort in the worst case situation is
O(log
O(n log
O(log 2n)
In which sort the storage complexity is not best?
Heap Sort
Bucket Sort
Merge Sort
QuickSort
Which one of the following methods is most efficient, if the successor value of k is kept prime to each other?
Bucket Sort
Shell Sort
Merge Sort
Heap Sort
The average number of comparisons in Bubble Sort is
n(n
n(n
Illustrate with an example the components and design of a flow chart.
What do you understand by the term algorithm? Explain the necessary steps for the development of an algorithm.
What is pseudocode? Explain and discuss the use of pseudocode.
What is a recursive algorithm? Explain with the help of an example.
What do you understand by sorting technique Write an algorithm for Quick Sort and explain it.
Differentiate between straight sequential search and binary search technique with examples.
Write the divide and conquer approach for binary search and calculate its average time complexity.
Differentiate between Insertion Sort and Selection Sort with examples.
How do you validate an algorithm Explain the steps needed to test a program.
Write and explain all the stages of Program Development Life Cycle.
What is a complexity? Write the types of complexity and also explain Big-oh and Big-omega notations.
Write an algorithm for Merge Sort. Sort the following values as per your algorithm:
3
8. Write short notes on any four of the following
Bubble Sort
Shell Sort
Merge Sort
Fibonacci Search
Analyze Algorithm
Sequential Search
Other Question Papers
Departments
- Centre for Corporate Education, Training & Consultancy (CCETC)
- Centre for Corporate Education, Training & Consultancy (CCETC)
- National Centre for Disability Studies (NCDS)
- School of Agriculture (SOA)
- School of Computer and Information Sciences (SOCIS)
- School of Continuing Education (SOCE)
- School of Education (SOE)
- School of Engineering & Technology (SOET)
- School of Extension and Development Studies (SOEDS)
- School of Foreign Languages (SOFL)
- School of Gender Development Studies(SOGDS)
- School of Health Science (SOHS)
- School of Humanities (SOH)
- School of Interdisciplinary and Trans-Disciplinary Studies (SOITDS)
- School of Journalism and New Media Studies (SOJNMS)
- School of Law (SOL)
- School of Management Studies (SOMS)
- School of Performing Arts and Visual Arts (SOPVA)
- School of Performing Arts and Visual Arts(SOPVA)
- School of Sciences (SOS)
- School of Social Sciences (SOSS)
- School of Social Work (SOSW)
- School of Tourism & Hospitality Service Sectoral SOMS (SOTHSM)
- School of Tourism &Hospitality Service Sectoral SOMS (SOTHSSM)
- School of Translation Studies and Training (SOTST)
- School of Vocational Education and Training (SOVET)
- Staff Training & Research in Distance Education (STRIDE)
Subjects
- Advanced ComputerArchitecture
- Algorithms and Logic Design
- Artificial Intelligence
- Basics of Networking
- Bio-Informatics
- C P r o g r a m m i n g
- Computer Architecture
- Computer Networks
- Computer Organisations
- Computer Organization
- Cryptography And Network Security
- Data Modelling And Uml
- Data Structures
- Data Warehousing And Mining
- Database Management System
- Design And Analysis Of Algorithm
- Digital Image Processing
- Discrete Maths Structure
- Distributed Database
- E-Business
- Elective-Computer Networks
- Embedded System
- Formal Languages And Automata
- Fuzzy Systems
- Java Basic and Object Modeling Design
- Logic Design
- Microprocessor
- Mobile Computing
- Neural Network
- Numerical Methods and Computation
- Object Modeling And Design
- Object Oriented Design And Programming
- Object Oriented Programming
- Operating System
- Operating Systems
- Parallel Algorithms
- Pattern Recognition
- PC Assembly and Maintenance
- Principles of Communication Engineering
- Principles Of Programming Languages
- Real Time Systems
- Software Engineering
- Software Project Management (Spm)
- Software Quality Engineering
- Software Reusability
- System Analysis and Design
- System Programming And Compiler Design
- Theory Of Computation
- Unix Internals And Shell Programming
- Visual Basic Programming
- Web Technology