Uttaranchal University

Question Bank
Course: BCA
Name of faculty: Ms. Pooja Gupta
Subject: Data Structure Using C (BCA-201)
Q1: define data structure. Define the classification of data structure.
Q2: differentiate between linear and non linear data structure.
Q3: define the basic overview of all data structure.
Q4: what do you mean by Time and Space complexity and now to represent
these complexities?
Q5: what is time-space trade off?
Q6: what do you mean by algorithm?
Q7: what do you mean by Array? Classify it?
Q8: write an algorithm to merge two arrays stored in ascending order?
Q9: define static memory allocation and dynamic memory allocation?
Q10: WAP to generate the Fibonacci series.
Q11: WAP to implement push and pop function using array.
Q12: WAP to implement the linked stack.
Q13: why stack is called a LIFO data structure?
Q14: list the application of stack in computer?
Q15: Write an algorithm to convert an infix expression into a postfix
expression.
Q16: Write an algorithm to convert an infix expression into a prefix
expression.
Q17: evaluate the expression 5 62+*12 4/- in tabular form showing stack
after each step.

Q18: Define the application of stack in computers?

Q19: Define recursion and types of recursion
Q20: define the principle of recursion?
Q21: what are the advantages and disadvantages of recursion?
Q22: What is queue? Explain all types of queue?
Q23: define insert and delete operations performed by linear queue?
Q24: how does a linear queue different from circular queue?
Q25: why an operation to check queue overflow is not implemented on linked
queue?
Q26: What a linked list? Explain all types of linked list with diagrams?
Q27: write an algorithm to insert a node at the first position in the linear
linked list.
Q28: write an algorithm to delete a node at the first position in the linear
linked list.
Q29: write an algorithm to delete the last node in the linear linked list.
Q30: Write an algorithm to create and traverse a doubly linked list.
Q31: Write an algorithm to delete the first node in a doubly linked list.
Q32: write an algorithm to insert a new node at the first position of a doubly
linked list.
Q33: write an algorithm to show insertion, deletion and display of a circular
queue.
Q34: What are trees? Explain different types of trees.
Q35: explain Binary tree with example.
Q36: explain binary search tree with its properties and example
Q37: what is threaded binary tree?
Q38: What is a graph? Explain different types of graph.
Q39: write an algorithm for DFS graph traversal.

Q40: write an algorithm for BFS graph traversal.

Q41: WAP to insert, delete & traverse in single linked list
Q42: WAP to create and display a doubly linked list
Q43: WAP to show push and pop operations on Stack with array
Q44: WAP to show push and pop operations on Stack with pointers
Q45: WAP to perform insert, delete, display operations on linear queue with
array
Q46: WAP to perform insert, delete, display operations on linear queue with
pointers
Q47: WAP to perform insert, display operations on circular queue with array
Q48: WAP to perform delete, display operations on dqueue with array
Q49: WAP to perform insert, delete, display operations on dqueue with
pointers
Q50: WAP to perform insert operations in priority queue