Tuesday, January 24, 2023

Dr. A.P.J. Abdul Kalam University MTECH I SEM (CTA) Programming System [MTCTA102] Dec 2020 Question Paper

Dr. A.P.J. Abdul Kalam University

Master of Technology

First Semester Main Examination, Dec-2020

Programming System [MTCTA102]

Time: 3:00 Hrs Max Marks 70

Note : Attempt any five questions out of eight.

All questions carry equal marks.

Q.1 Explain Hashing procedure. Give four advantages of a chained hash table

over open addressing.

Q.2 What are the different tree traversal techniques? Write a non-recursive

algorithm for in order tree traversal?

Q.3 What are the different ways to represent linked list in memory? Explain by

giving proper examples. Also write the advantages and disadvantages of

each type?

Q.4 Explain Branch and bound techniques in details?

Q.5 Write an algorithm for optimal solution of Knapsack problem using dynamic

programming technique?

Q.6 Explain in detail about Approximation algorithm for NP Hard problem with


Q.7 What is Dynamic programming? Explain briefly.

Q.8 Discuss the classes P, NP, NP complete and NP hard with example? How

can we show that the problem is NP complete?

Scanned Copies:

Share This
Previous Post
Next Post

B.E Civil Engineer Graduated from Government College of Engineering Tirunelveli in the year 2016. She has developed this website for the welfare of students community not only for students under Anna University Chennai, but for all universities located in India. That's why her website is named as www.IndianUniversityQuestionPapers.com . If you don't find any study materials that you are looking for, you may intimate her through contact page of this website to know her so that it will be useful for providing them as early as possible. You can also share your own study materials and it can be published in this website after verification and reviewing. Thank you!


Pen down your valuable important comments below

Search Everything Here