Skip to content

CSE2135 - Data Structure

Introduction and Preliminaries

Term 161

  • Q1(a) [5]: Define data structure. Shortly explain data structure operations.
  • Q1(b) [7]: Define algorithms time-space tradeoff. Explain first pattern matching algorithm with example.
  • Q1(c) [2]: Define floor and ceiling function with example.

Term 171

  • Q1(a) [1+2]: Define data structure. Explain data structure operations.
  • Q1(b) [3]: Define algorithms complexity and time-space tradeoff.

Term 181

  • Q1(a) [1+2]: Define data structure? Distinguish between static and dynamic data structure.
  • Q1(b) [1+3]: What do you understand by time complexity? Define \(\Omega\) notation, \(\Theta\) notation and \(O\) notation.
  • Q1(c) [3]: What do you understand by time space trade-off?

Term 191

  • Q1(a) [4]: Define data structure. Briefly explain data structure operations.
  • Q1(b) [4]: Explain algorithm complexity and Time-space tradeoff.
  • Q1(c) [2]: What is asymptotic notation?

Term 201

  • Q1(a) [1+2]: Define data structure. Describe in brief the basic operation of data structure.
  • Q1(d) [2+3]: What are the linear and nonlinear data structures? Show the transformation of the following infix expression into postfix expression by applying stack: 5 * (6 + 2) - 12 / 4.

Term 211

  • Q1(a) [1+3]: Define data structures. List and explain the different operations that can be carried on arrays.
  • Q1(c) [1x4]: Define the following term in brief: (i) Time complexity; (ii) Space complexity; (iii) Big O notation; (iv) Asymptotic notation.
  • Q1(d) [1+2]: Define recursive function. What are the essential conditions to be satisfied by a recursive function?