Exam Details
| Subject | Design and Analysis of Algorithm | |
| Paper | ||
| Exam / Course | B.Tech In Computer Science And Engineering (BTCSVI) | |
| Department | School of Engineering & Technology (SOET) | |
| Organization | indira gandhi national open university | |
| Position | ||
| Exam Date | June, 2015 | |
| City, State | new delhi, |
Question Paper
Prove that where and
Define Omega notation. Explain the terms involved in it. Give examples.
State and prove Master theorem.
With an example, explain merge sort.
What is heap sort Explain with an example.
Write deletion algorithm for binary search.
State and explain Knuth-Morris-Pratt matching algorithm.
4. In how many ways may the following chain of matrices be multiplied?
A x B x C x D
x x x x
Find the number of multiplications required in each case.
Write an algorithm of greedy knapsack and also analyze its time complexity.
Construct a Huffman code algorithm using greedy method.
6. Using Kruskal's algorithm, find the minimal spanning tree of
<img src='./qimages/15494-6.jpg'>
Explain the classes of NP-Hard and NP-Complete.
Explain the Hamiltonian cycles with a neat diagram.
Write a short note on Dynamic Programming.
Write down the steps for approximate coloring, with an example.
Write down the steps for verifying matrix multiplication.
What is Miller-Rabin test? Explain it.
10.(a) What are the applications of cryptography?
What is knapsack problem? Explain.
Define Omega notation. Explain the terms involved in it. Give examples.
State and prove Master theorem.
With an example, explain merge sort.
What is heap sort Explain with an example.
Write deletion algorithm for binary search.
State and explain Knuth-Morris-Pratt matching algorithm.
4. In how many ways may the following chain of matrices be multiplied?
A x B x C x D
x x x x
Find the number of multiplications required in each case.
Write an algorithm of greedy knapsack and also analyze its time complexity.
Construct a Huffman code algorithm using greedy method.
6. Using Kruskal's algorithm, find the minimal spanning tree of
<img src='./qimages/15494-6.jpg'>
Explain the classes of NP-Hard and NP-Complete.
Explain the Hamiltonian cycles with a neat diagram.
Write a short note on Dynamic Programming.
Write down the steps for approximate coloring, with an example.
Write down the steps for verifying matrix multiplication.
What is Miller-Rabin test? Explain it.
10.(a) What are the applications of cryptography?
What is knapsack problem? Explain.
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 Computer Architecture
- Artificial Intelligence
- Computer Architecture
- Computer Networks
- Computer Organisations
- Cryptography And Network Security
- Data Structure
- Data Warehousing And Mining
- Database Management System
- Design and Analysis of Algorithm
- Digital Image Processing
- Discrete Maths Structure
- E-Business
- Formal Language And Automata
- Logic Design
- Microprocessor
- Mobile Computing
- Object Oriented Programming
- Operating Systems
- Parallel Algorithms
- Pattern Recognition
- Principles of Programming Lang.
- Real Time Systems
- Software Engineering
- Software Quality Engineering
- Software Reusability
- System Programming And Compiler Design
- Theory Of Computation
- Unix Internals And Shell Programming
- Web Technology