Amity · CSE601

Data Structures & Algorithms flashcards

Revision cards from the CSE601 SLM and Live Class 1–2 focus — filter by module and track what you know.

LMR priorities Open PDF
0 cards in view Seen 0 / 0 Known 0 Still learning 0
Live Class 1 transcriptLive Class 2 transcriptStudy PDF (SLM)
1 / 1

LMR — important topics

Last-minute revision priorities from the SLM outline:

  1. 1.1.1 Stack — overflow/underflow + push/pop pseudocode — teacher called these very important.
  2. 1.1.2 Evaluation of Postfix Expression — infix↔postfix / postfix↔prefix — “very important from the exam standpoint”.
  3. 1.2.1 Algorithm and Characteristics — “what is an algorithm + characteristics” — teacher said this is the exam ask.
  4. 2.1.1 Basic Terminology and Applications — “there’s always a question… how you can find out the height of the tree.”.
  5. 2.1.2 Binary Trees — binary-tree properties + pre/in/postorder (not level-order).
  6. 2.2.1 Terminology, Representations, Traversals — graph types + matrix vs list representation rules.