Saturday, January 25, 2014

KSOU, Algorithm Analysis and Design, M.Sc. (I.T.) 1st sem Examination, June/July 2010 Question Paper

KSOU, Karnataka State Open University old, model, previous and latest years question papers >> Algorithm Analysis and Design, M.Sc. (I.T.) Examination, June/July 2010 Question Paper:

Are you searching for old, previous years and latest question papers of KSOU, Karnataka State Open University ? You can find here in this blog, even sample and model question papers of KSOU, Karnataka State Open University and various universities in India. Have a look at this post that contains the latest year 2010 for KSOU, Karnataka State Open University question paper conducted in the month June/July, for the M.Sc. (I.T.) Examination 2010. This question paper is useful for those students who are preparing for Algorithm Analysis and Design for M.Sc. (I.T.) Examination. Part A consists of 10 Questions carrying a total marks 25 and Part B has 8 questions out of which, you should answer 5 questions carrying 10 marks each. Use the question paper for your upcoming exams to score high marks.

KSOU, Karnataka State Open University
I Semester M.Sc. (I.T.) Examination, June/July 2010
Algorithm Analysis and Design
(Freshers)
Time : 3 Hours
Maximum Marks : 75

PART – A
I. Answer all questions : (10 × 2 + 5×1 = 25)

1) What is an Algorithm ?
2) What is Abstract Data type ?
3) What are finite automata ?
4) What is a pointer ?
5) What is a linked list ?
6) What is data dictionary ?
7) What is a set ?
8) What is Dynamic Programming ?
9) What is Sorting ?
10) What is Backtracking ?
11) Define the following :
a) External sorting
b) RBT
c) Heap
d) KMP
e) Mapping

PART – B
II. Answer any five questions : (5×10=50)

1. How will you define an algorithm ? Describe the criteria that an algorithm must satisfy.
2. Which data structure makes of a LIFO list ? Explain.
3. What is ADT ? Explain.
4. Describe the various notations used to define the efficiency of an algorithm.
5. Explain the KMP algorithm for string matching.
6. Discuss the Traveling Salesman Problem.
7. What is a heap ? Explain Heap sort.
8. What are the basic operations which can be performed on strings ?

Duraimani

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!