Exam Details
| Subject | data structure and algorithm | |
| Paper | ||
| Exam / Course | msccs | |
| Department | ||
| Organization | Vardhaman Mahaveer Open University | |
| Position | ||
| Exam Date | December, 2017 | |
| City, State | rajasthan, kota |
Question Paper
MSCCS-07/MSCCS-201/MCA-201
December Examination 2017
MSCCS-Final/MCA-IInd Year Examination
Data Structure and Algorithm
Paper MSCCS-07/MSCCS-201/MCA-201
Time 3 Hours Max. Marks 100
Note: The question paper is divided into three sections B and C. Write answers as per given instructions.
Section A 10 × 2 20
(Very Short Answer Questions)
Note: Answer all questions. As per the nature of the question delimit your answer in one word, one sentence or maximum upto 30 words. Each question carries 2 marks.
Define Graph.
List the Applications of Queue Data Structure.
What is Algorithm?
Which algorithm is used to find all the shortest path in a Graph?
What do you mean by Recursion?
What is spanning tree?
List the uses of Dictionary.
597
MSCCS-07/MSCCS-201/MCA-201 400 3 (P.T.O.)
MSCCS-07/MSCCS-201/MCA-201 400 3 (Contd.)
597
(viii) What is NP-complete problem.
State cook Lenin Theorem.
What is Priority Queue?
Section B 4 × 10 40
(Short Answer Questions)
Note: Answer any four questions. Each answer should not
exceed 200 words. Each question carries 10 marks.
What is 2-D array? Write a program algorithm to add the
elements of two 2-D array. Also explain the algorithm.
What is Linked List? Discuss the advantages of Linked Lists
over array.
Write short note on Circular Queue.
Evaluate the following postfix notation of expression
32, 12,
What short note on tree.
Explain the basic concept of NP-Hard and NP-Complete
problem.
Describe travelling salesman problem with suitable example.
Explain Planarity Detection Technique of a Graph with
example.
MSCCS-07/MSCCS-201/MCA-201 400 3
597
Section C 2 × 20 40
(Long Answer Questions)
Note: Answer any two questions. You have to delimit your each
answer maximum upto 500 words. Each question carries
20 marks.
10) What is Stack Data Structure? Describe the applications of
stack with suitable example.
11) Give the comparative description of Prims and Kruskal
algorithm with example.
12) What is strongly connected components? Give an algorithm
to find strongly connected components with suitable example.
13) What do you mean by sorting? Explain any two sorting
algorithm and also compare them.
December Examination 2017
MSCCS-Final/MCA-IInd Year Examination
Data Structure and Algorithm
Paper MSCCS-07/MSCCS-201/MCA-201
Time 3 Hours Max. Marks 100
Note: The question paper is divided into three sections B and C. Write answers as per given instructions.
Section A 10 × 2 20
(Very Short Answer Questions)
Note: Answer all questions. As per the nature of the question delimit your answer in one word, one sentence or maximum upto 30 words. Each question carries 2 marks.
Define Graph.
List the Applications of Queue Data Structure.
What is Algorithm?
Which algorithm is used to find all the shortest path in a Graph?
What do you mean by Recursion?
What is spanning tree?
List the uses of Dictionary.
597
MSCCS-07/MSCCS-201/MCA-201 400 3 (P.T.O.)
MSCCS-07/MSCCS-201/MCA-201 400 3 (Contd.)
597
(viii) What is NP-complete problem.
State cook Lenin Theorem.
What is Priority Queue?
Section B 4 × 10 40
(Short Answer Questions)
Note: Answer any four questions. Each answer should not
exceed 200 words. Each question carries 10 marks.
What is 2-D array? Write a program algorithm to add the
elements of two 2-D array. Also explain the algorithm.
What is Linked List? Discuss the advantages of Linked Lists
over array.
Write short note on Circular Queue.
Evaluate the following postfix notation of expression
32, 12,
What short note on tree.
Explain the basic concept of NP-Hard and NP-Complete
problem.
Describe travelling salesman problem with suitable example.
Explain Planarity Detection Technique of a Graph with
example.
MSCCS-07/MSCCS-201/MCA-201 400 3
597
Section C 2 × 20 40
(Long Answer Questions)
Note: Answer any two questions. You have to delimit your each
answer maximum upto 500 words. Each question carries
20 marks.
10) What is Stack Data Structure? Describe the applications of
stack with suitable example.
11) Give the comparative description of Prims and Kruskal
algorithm with example.
12) What is strongly connected components? Give an algorithm
to find strongly connected components with suitable example.
13) What do you mean by sorting? Explain any two sorting
algorithm and also compare them.
Other Question Papers
Subjects
- computer architecture and micro processors
- data communication and networks
- data structure and algorithm
- operating system
- software engineering