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, 2016 | |
| City, State | new delhi, |
Question Paper
No. of Printed Pages: 4 IBICS-029I
DIPLOMA -VIEP -COMPUTER SCIENCE AND
ENGINEERING (DCSVI) I AnVANCED LEVEL
CERTIFICATE COURSE IN COMPUTER
SCIENCE AND ENGINEERING (ACCSVI)
Term-End Examination
00486
June, 2016
BICS-029 ALGORITHMS AND LOGIC DESIGN
Time: 2 hours Maximum Marks: 70
Note: Attempt any five questions. Question number 1 is compulsory which has multiple choice questions. Each question carries equal marks;
1. Choose the correct answer from the given four alternatives: 7 x 2=14
Two main measures for the efficiency of an algorithm are
Processor and memory
Complexity and capacity
Time and space
Data and space
Which of the following case does not exist in complexity theory
Best case
Worst case
Average case
Null case
The complexity of linear search algorithm is
O(log
O(n log
Which of the following is not a linear data structure?
Array
Linked List
Both the above
None of the above
Which of the following sorting algorithms is of divide and conquer type?
Bubble sort
Insertion sort
Quick sort
All the above
An algorithm that calls itself directly or indirectly is known as
Sub algorithm
Recursion
Polish notation
Traversal algorithm
When new data are to be inserted into a data structure but there is no available space, this situation is usually called
Underflow
Overflow
Houseful
Saturated
2. Define algorithm. Explain the characteristics of an algorithm. 7
Write an algorithm and draw a flow chart to find the largest of N numbers. 7
3. Differentiate between priori analysis and posteriori analysis. 7
What are the different mathematical notations used for algorithm analysis? 7
4. Give the partition algorithm for Quicksort. 7
Show that n3 log n is Q(n3). 7
5. Write the non-recursive algorithm for finding the Fibonacci sequence and derive its time complexity. 7
Explain about the Approximation and Randomized algorithm in brief. 7
6. How does merge sort algorithm sort the following sequence of keys in ascending order?
12,22,48,33,56,44,57,76,84,65
Explain with a neat diagram representing sequence of recursion calls. 7
Discuss the time complexity of merge sort. 7
7. Determine the frequency count for all statements in the following two algorithm segments: 10
for i 1 to n do
for j 1 to i do
for k 1 to j do
x
1
while do
i
Explain about the branch and bound in detail.
8. Explain the following:
Program Development Cycle
Bucket Sort
Components of flow chart
Shell Sort
DIPLOMA -VIEP -COMPUTER SCIENCE AND
ENGINEERING (DCSVI) I AnVANCED LEVEL
CERTIFICATE COURSE IN COMPUTER
SCIENCE AND ENGINEERING (ACCSVI)
Term-End Examination
00486
June, 2016
BICS-029 ALGORITHMS AND LOGIC DESIGN
Time: 2 hours Maximum Marks: 70
Note: Attempt any five questions. Question number 1 is compulsory which has multiple choice questions. Each question carries equal marks;
1. Choose the correct answer from the given four alternatives: 7 x 2=14
Two main measures for the efficiency of an algorithm are
Processor and memory
Complexity and capacity
Time and space
Data and space
Which of the following case does not exist in complexity theory
Best case
Worst case
Average case
Null case
The complexity of linear search algorithm is
O(log
O(n log
Which of the following is not a linear data structure?
Array
Linked List
Both the above
None of the above
Which of the following sorting algorithms is of divide and conquer type?
Bubble sort
Insertion sort
Quick sort
All the above
An algorithm that calls itself directly or indirectly is known as
Sub algorithm
Recursion
Polish notation
Traversal algorithm
When new data are to be inserted into a data structure but there is no available space, this situation is usually called
Underflow
Overflow
Houseful
Saturated
2. Define algorithm. Explain the characteristics of an algorithm. 7
Write an algorithm and draw a flow chart to find the largest of N numbers. 7
3. Differentiate between priori analysis and posteriori analysis. 7
What are the different mathematical notations used for algorithm analysis? 7
4. Give the partition algorithm for Quicksort. 7
Show that n3 log n is Q(n3). 7
5. Write the non-recursive algorithm for finding the Fibonacci sequence and derive its time complexity. 7
Explain about the Approximation and Randomized algorithm in brief. 7
6. How does merge sort algorithm sort the following sequence of keys in ascending order?
12,22,48,33,56,44,57,76,84,65
Explain with a neat diagram representing sequence of recursion calls. 7
Discuss the time complexity of merge sort. 7
7. Determine the frequency count for all statements in the following two algorithm segments: 10
for i 1 to n do
for j 1 to i do
for k 1 to j do
x
1
while do
i
Explain about the branch and bound in detail.
8. Explain the following:
Program Development Cycle
Bucket Sort
Components of flow chart
Shell Sort
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