Exam Details
| Subject | data structures and algorithms | |
| Paper | ||
| Exam / Course | m.sc. computer science | |
| Department | ||
| Organization | alagappa university | |
| Position | ||
| Exam Date | November, 2017 | |
| City, State | tamil nadu, karaikudi |
Question Paper
M.Sc. DEGREE EXAMINATION, NOVEMBER 2017
First Semester
Computer Science
DATA STRUCTURES ALGORITHMS
(CBCS 2014 onwards)
Time 3 Hours Maximum 75 Marks
Part A (10 x 2 20)
Answer all questions.
1. What is data structure?
2. Define binary tree.
3. What is binary search?
4. Define sorting.
5. What is job sequencing?
6. What are called optimal merge patterns?
7. What is optimal binary search tree?
8. List the merits of reliability design.
9. What are the techniques used in binary tree?
10. State the importance of knapsack problem.
Sub. Code
4MCE1C2
AFF-4947
2
Ws3
Part B x 5 25)
Answer all questions.
11. Write short note on stack.
Or
Discuss about priority queues.
12. Discuss about general method of divide and
conquer.
Or
Describe about selection algorithm.
13. Write short notes on tree vertex splitting.
Or
Discuss about minimum cost spanning trees.
14. Explain about single source shortest path general
weight.
Or
Discuss about flow shop scheduling.
15. Explain about connected components and spanning
trees.
Or
Make a note on 8 queen's problem with an example.
Part C x 10 30)
Answer any three questions.
16. Discuss in detail about trees with necessary structures.
17. Explain briefly about merge sort algorithm with suitable
examples.
AFF-4947
3
Ws3
18. Describe about knapsack problem with necessary
examples.
19. Explain briefly about traveling salesperson problem.
20. Discuss in detail about Hamiltonian cycles.
————————
First Semester
Computer Science
DATA STRUCTURES ALGORITHMS
(CBCS 2014 onwards)
Time 3 Hours Maximum 75 Marks
Part A (10 x 2 20)
Answer all questions.
1. What is data structure?
2. Define binary tree.
3. What is binary search?
4. Define sorting.
5. What is job sequencing?
6. What are called optimal merge patterns?
7. What is optimal binary search tree?
8. List the merits of reliability design.
9. What are the techniques used in binary tree?
10. State the importance of knapsack problem.
Sub. Code
4MCE1C2
AFF-4947
2
Ws3
Part B x 5 25)
Answer all questions.
11. Write short note on stack.
Or
Discuss about priority queues.
12. Discuss about general method of divide and
conquer.
Or
Describe about selection algorithm.
13. Write short notes on tree vertex splitting.
Or
Discuss about minimum cost spanning trees.
14. Explain about single source shortest path general
weight.
Or
Discuss about flow shop scheduling.
15. Explain about connected components and spanning
trees.
Or
Make a note on 8 queen's problem with an example.
Part C x 10 30)
Answer any three questions.
16. Discuss in detail about trees with necessary structures.
17. Explain briefly about merge sort algorithm with suitable
examples.
AFF-4947
3
Ws3
18. Describe about knapsack problem with necessary
examples.
19. Explain briefly about traveling salesperson problem.
20. Discuss in detail about Hamiltonian cycles.
————————
Other Question Papers
Subjects
- .net technology
- advanced database systems
- advanced java programming
- advanced operating systems
- applied mathematics for computer science
- cloud computing
- communication and employability skills
- compiler design
- computer communication networks
- computer system architecture
- cryptography and network security
- data communication networks
- data mining and data warehousing
- data mining and warehousing
- data structures and algorithms
- elective : cloud computing
- elective – computer graphics
- elective – relational database management
- elective — digital image processing
- elective — mobile computing
- elective — object oriented analysis and design
- elective — software engineering
- elective — wap and xml
- elective i — software project management
- elective iii — soft computing
- elective: multimedia system
- elective: soft computing
- internet and java programming
- multimedia and its applications (elective – ii)
- network security
- operating system
- principles of compiler design
- programming in php
- web technology