Exam Details
| Subject | Parallel Algorithms | |
| 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 | December, 2016 | |
| City, State | new delhi, |
Question Paper
1. Discuss the parameters, on the basis of which Flynn's taxonomy is defined. Discuss all four categories of parallel computers, covered under Flynn's taxonomy.
2. Explain the following:
Data parallel approach
Model for serial computation
3. What do you understand by static scheduling How is static scheduling on UMA multiprocessors performed?
4. Give the salient features of any two of the following parallel programming languages:
FORTRAN 90
SEQUENT C
nCUBE C
5. Explain the 2-D Mesh SIMD model and UMA multiprocessor model in detail.
6. Discuss any two of the following in detail
Fast Fourier Transform
Discrete Fourier Transform
Inverse Discrete Fourier Transform
7. Explain Bitonic sort with a suitable example. Prove that its complexity is O(log2n).
8. Write the algorithms for any two of the following:
Enumeration sort
Odd-even transposition sort
Quick sort
9. Explain Manber and Ladner's algorithm. Give suitable examples.
10. Differentiate between any two of the following:
Branch and Bound Algorithm and Parallel Branch and Bound Algorithm
Alpha Beta Search and Parallel Alpha-Beta Search
All Pairs Shortest Path Algorithm and Single Source Shortest Path Algorithm
2. Explain the following:
Data parallel approach
Model for serial computation
3. What do you understand by static scheduling How is static scheduling on UMA multiprocessors performed?
4. Give the salient features of any two of the following parallel programming languages:
FORTRAN 90
SEQUENT C
nCUBE C
5. Explain the 2-D Mesh SIMD model and UMA multiprocessor model in detail.
6. Discuss any two of the following in detail
Fast Fourier Transform
Discrete Fourier Transform
Inverse Discrete Fourier Transform
7. Explain Bitonic sort with a suitable example. Prove that its complexity is O(log2n).
8. Write the algorithms for any two of the following:
Enumeration sort
Odd-even transposition sort
Quick sort
9. Explain Manber and Ladner's algorithm. Give suitable examples.
10. Differentiate between any two of the following:
Branch and Bound Algorithm and Parallel Branch and Bound Algorithm
Alpha Beta Search and Parallel Alpha-Beta Search
All Pairs Shortest Path Algorithm and Single Source Shortest Path Algorithm
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