Vikrant University Gwalior
Program Name: Bachelor of Computer Applications (BCA)
Branch & Semester: Computer Applications, Semester II
Subject Name & Subject Code: Data Structures, BCAP1205
Total: 150 Questions
Section - A
[Short Questions / MCQs - Total 90 Questions, 18 per Unit]
Unit I
1. Define abstract data types with an example.
2. Explain the classification of data structures.
3. What is the difference between linear and non-linear data structures?
4. Describe the memory representation of an array.
5. Explain the concept of linked lists.
6. What is the difference between a doubly and singly linked list?
7. Write the C code for inserting an element in an array.
8. What are the advantages of using linked lists over arrays?
9. Define circular linked lists.
10. What is the cost estimation of data structures?
... (Additional questions continue)
Unit II
1. Define a stack and list its applications.
2. Write the algorithm for converting an infix expression to postfix using a stack.
Vikrant University Gwalior
3. What is recursion? Give an example.
4. Describe the difference between circular and linear queues.
5. What is a priority queue?
6. Write the algorithm to evaluate a postfix expression.
7. What is queue simulation? Provide one example.
8. Define a multiple stack with an example.
9. Explain the implementation of a queue using arrays.
10. Discuss the concept of stack overflow and underflow.
... (Additional questions continue)
... (Content for Units III-V in similar format)
Section - B
[Semi-Long Questions - Total 45 Questions, 9 per Unit]
Unit I
1. Write a detailed note on memory representation of linked lists.
2. Explain the concept of polynomial manipulation using linked lists.
3. Discuss different implementations of a circular linked list.
4. Write a program to reverse a singly linked list.
5. Explain the concept of data abstraction in data structures.
... (Additional questions)
... (Content for Units II-V in similar format)
Vikrant University Gwalior
Section - C
[Long Questions - Total 15 Questions, 3 per Unit]
Unit I
1. Write and explain the algorithm for implementing a linked list in memory.
2. Explain the classification of data structures in detail with examples.
3. Discuss arrays in detail, including their operations and implementation.
... (Content for Units II-V in similar format)
