DSAA Question bank for IAE 1 2016

Question bank:

  1. find time complexity of given snippet.
  2. what are notations of time complexity.
  3. recursion v/s induction
  4. find time complexity of following recursive function
  5. push() or pop() function implementation of stack
  6. applications of stack/ queue/ linked list
  7. algorithm/ construct expression tree for given expression
  8. RB tree properties
  9. construct BST/ RB tree for given data
  10. queue using linked list implementation (insertion/ deletion)
  11. dequeue
  12. tree terminologies
Advertisements

3 thoughts on “DSAA Question bank for IAE 1 2016

  1. sir,it’s recursion v/s induction or recursion v/s iteration.
    since, induction and recursion are almost same and you have given us difference between recursion and iteration in notes.

    Like

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s