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 | June, 2015 | |
| City, State | new delhi, |
Question Paper
1. Choose the correct answer from the four given alternatives:
A sorting algorithm based on binary component requires at least how many comparisons?
[log n
[log
[log 2n
[log
Which sorting algorithm proceeds on the idea of keeping the first part of the list?
Bubble sort
Insertion sort
Quick sort
Selection sort
The average number of comparisons in bubble sort is
n^2
n(n
n(n
For less amount of data, which one of the following sorting techniques is suitable?
Insertion sort
Heap sort
Selection sort
Bubble sort
The average run time of quick sort is
O(n log2
O(n(log2
O(n log
Which one of the following methods is most efficient, if the successor value of k is kept prime to each other?
Selection sort
Bucket sort
Shell sort
Heap sort
In binary search, the worst case time complexity is
O(log
O(n log
O(n log
O(n log 2n)
What is selection sort Differentiate between selection sort and insertion sort.
What do you understand by analysis of an algorithm? Write an algorithm for deleting duplicate numbers from a linear array.
Write and explain the binary search method. Give an example for contiguous versions.
Explain all the stages of Program Development Life Cycle.
Write an algorithm using merge sort that finds time complexity to sort elements T(n log2 n).
Write an algorithm to sort numbers using bubble sort.
Draw a flow chart to arrange N-numbers in ascending and descending order.
What is complexity Write the types of complexity and explain Big-Oh and Big-Omega notations.
How do you explain analyzing algorithm? Briefly explain the steps needed to create and test the program.
Write pseudo code for selection sort.
Differentiate between straight sequential search and binary search technique with suitable examples.
Describe in brief the garbage collection and compaction.
8. Write short notes on any four of the following:
Recursive Algorithm
Bucket Sort
Insertion Sort
Quick Sort
Design of Flow Chart
Test a Program
A sorting algorithm based on binary component requires at least how many comparisons?
[log n
[log
[log 2n
[log
Which sorting algorithm proceeds on the idea of keeping the first part of the list?
Bubble sort
Insertion sort
Quick sort
Selection sort
The average number of comparisons in bubble sort is
n^2
n(n
n(n
For less amount of data, which one of the following sorting techniques is suitable?
Insertion sort
Heap sort
Selection sort
Bubble sort
The average run time of quick sort is
O(n log2
O(n(log2
O(n log
Which one of the following methods is most efficient, if the successor value of k is kept prime to each other?
Selection sort
Bucket sort
Shell sort
Heap sort
In binary search, the worst case time complexity is
O(log
O(n log
O(n log
O(n log 2n)
What is selection sort Differentiate between selection sort and insertion sort.
What do you understand by analysis of an algorithm? Write an algorithm for deleting duplicate numbers from a linear array.
Write and explain the binary search method. Give an example for contiguous versions.
Explain all the stages of Program Development Life Cycle.
Write an algorithm using merge sort that finds time complexity to sort elements T(n log2 n).
Write an algorithm to sort numbers using bubble sort.
Draw a flow chart to arrange N-numbers in ascending and descending order.
What is complexity Write the types of complexity and explain Big-Oh and Big-Omega notations.
How do you explain analyzing algorithm? Briefly explain the steps needed to create and test the program.
Write pseudo code for selection sort.
Differentiate between straight sequential search and binary search technique with suitable examples.
Describe in brief the garbage collection and compaction.
8. Write short notes on any four of the following:
Recursive Algorithm
Bucket Sort
Insertion Sort
Quick Sort
Design of Flow Chart
Test a Program
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