KSOU, Karnataka State Open University old, model, previous and latest years question papers >> Computer Programming , M.Sc. First Semester (I.T.) Examination, June/July 2010 Question Paper:
Are you in need of 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.) First Semester Examination 2010. This question paper is useful for those students who are preparing for Computer Programming 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 2010KSOU, Karnataka State Open University
Computer Programming
(Freshers)
Time : 3 Hours
Maximum Marks : 75
Instruction : Answer all questions from Part A and answer any five questions from Part B.
PART – A (10×2+5×1=25)
1. What is an Algorithm ?
2. What is Flow Chart ?
3. What do you mean by linked list ?
4. What is the significance of pointers in Linked list ?
5. Explain the concept of Nested Structure.
6. What is complexity ?
7. What do you mean by enumerated constants ?
8. Explain the use of malloc(), calloc(), free() functions.
9. What is linear data structure ?
10. What is a stack ?
11. Define the following :
a) Queue
b) Graph
c) Tree
d) Recursion
e) Loop.
PART – B
Answer any five : (5×10=50)
1. Explain various types of Symbol uses in Flow Chart.
2. Explain the various types of Data types used in C language. Write a program to Read a name and display the same.
3. Write a program in C for finding the product of matrices.
4. Write a program to sort number in ascending order using Bubble sort.
5. What do you understand by Primitive and Simple Structures ? Give examples also.
6. Explain traversing using Depth First Search and Breadth First Search.
7. What do you mean by B-Tree ? Explain B-Tree Deletion.
8. What do you understand by Indexed Sequential file organization ?
0 comments:
Pen down your valuable important comments below