Академический Документы
Профессиональный Документы
Культура Документы
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.