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, 2016 | |
| City, State | new delhi, |
Question Paper
No. of Printed Pages: 4 IBICS·029I
DIPLOMA -VIEP -COMPUTER SCIENCE AND
ENGINEERING (DCSVI) I ADVANCED LEVEL
CERTIFICATE COURSE IN COMPUTER
SCIENCE AND ENGINEERING (ACCSVI)
Term·End Examination
uOb83
December, 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: 7x2=14
The time factor when determining the efficiency of an algorithm is measured by
counting microseconds
counting the number of key operations
counting the number of key statements
counting the kilobytes of an algorithm
The complexity of binary search algorithm is
O(log
O(n log
The operation of processing each element in a list is known as
Sorting
Merging
Inserting
Traversal
A data structure where elements can be added or removed at either end but not both is called a
Linked list
Stack
Queue
Deque
The depth of a complete binary tree is
Dn n log2 n
Dn n log2 n
Do log2 n
Do log2n
The worst case occurs in linear search algorithm when the
item is somewhere in the middle of the array
item is not in the array at all
item is the last element in the array
item is the last element in the array or is not there at all
What is the output of the compiler?
Source code
Op-code
Object code
Byte code
2. What are best case, average case and worst case performances? Explain. 7
Compute the time complexity of recursive Fibonacci procedure, where
7
3. Devise a version of merge sort algorithm which performs sorting in place. 7
Suggest refinements to merge sort to make it in place. 7
4. How does quicksort sort the following sequence of keys in ascending order? 7
22,55,33,11,99,77,55,66,54,21,32.
Write the pseudocode for Shell sort. 7
5. Write an algorithm in pseudocode to count the number of lower case letters in a file of text. How many comparisons does it do What is the least number of increments it might do Assume that N is the number of characters in a file. Determine its time complexity using step-count method. 14
6. Explain the performance analysis of an algorithm in detail. 7
Write an algorithm for recursive binary search. 7
7. Devise an algorithm which accepts a number in decimal and produces the equivalent number in binary. 7
Explain clearly about space complexity. 7
8. Write short notes on any four of the following: 4x3 1/2 =14
Bucket Sort
Randomized Algorithm
Validation of Algorithm
Recursion
Binary Search Tree
DIPLOMA -VIEP -COMPUTER SCIENCE AND
ENGINEERING (DCSVI) I ADVANCED LEVEL
CERTIFICATE COURSE IN COMPUTER
SCIENCE AND ENGINEERING (ACCSVI)
Term·End Examination
uOb83
December, 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: 7x2=14
The time factor when determining the efficiency of an algorithm is measured by
counting microseconds
counting the number of key operations
counting the number of key statements
counting the kilobytes of an algorithm
The complexity of binary search algorithm is
O(log
O(n log
The operation of processing each element in a list is known as
Sorting
Merging
Inserting
Traversal
A data structure where elements can be added or removed at either end but not both is called a
Linked list
Stack
Queue
Deque
The depth of a complete binary tree is
Dn n log2 n
Dn n log2 n
Do log2 n
Do log2n
The worst case occurs in linear search algorithm when the
item is somewhere in the middle of the array
item is not in the array at all
item is the last element in the array
item is the last element in the array or is not there at all
What is the output of the compiler?
Source code
Op-code
Object code
Byte code
2. What are best case, average case and worst case performances? Explain. 7
Compute the time complexity of recursive Fibonacci procedure, where
7
3. Devise a version of merge sort algorithm which performs sorting in place. 7
Suggest refinements to merge sort to make it in place. 7
4. How does quicksort sort the following sequence of keys in ascending order? 7
22,55,33,11,99,77,55,66,54,21,32.
Write the pseudocode for Shell sort. 7
5. Write an algorithm in pseudocode to count the number of lower case letters in a file of text. How many comparisons does it do What is the least number of increments it might do Assume that N is the number of characters in a file. Determine its time complexity using step-count method. 14
6. Explain the performance analysis of an algorithm in detail. 7
Write an algorithm for recursive binary search. 7
7. Devise an algorithm which accepts a number in decimal and produces the equivalent number in binary. 7
Explain clearly about space complexity. 7
8. Write short notes on any four of the following: 4x3 1/2 =14
Bucket Sort
Randomized Algorithm
Validation of Algorithm
Recursion
Binary Search Tree
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