DR.
BABASAHEB AMBEDKAR OPEN UNIVERSITY
ASSIGNMENT_II
Paper Title: Data Structure and Algorithms
Paper Code: MCA-101
TOTAL MARKS: 30
Q.1 Give answers in 800 or 1000 words of the questions given below (Any One). 10*1=[10]
1. Explain Queue Data Structure in Detail.
2. Define the tree. Explain Binary Tree with its operation in detail.
Q.2 Give answers in 500 words of the questions given below (Any Two). 5*2=[10]
1. Define a string. Explain String function with example.
2. Explain Pointers in detail.
3. What is the use of sorting? List out of different types of sorting and explain selection sort in
detail.
4. What is the use of Searching? List out of different types of Searching and explain sequential
search in detail.
Q. 3 Do as Directed. 1*10=[10]
1. Differentiate between hard ware and software.
2. Explain about comments.
3. Define variable with example.
4. Difference between For Loop and While Loop.
5. Define a structure with syntax and example.
6. What is data structure? Mention two major categories of data structures?
7. Define stack overflow and stack underflow.
8. What is Collision?
9. What is Hash Search?
10. Define a cyclic and acyclic graph.