[ CIS313 | CIS | UO | News ]

Here, you will see listing of text chapters covered in the first half of the term and subject to testing on the coming midterm. Indicated subsections should guide you in your study, but will not limit the material tested. The examples in the text or studied in class only illustrate the concepts taught, understanding of which will be tested.

• Algorithm Analysis (Chapter 5).
  All subsections will be tested, you should pay attention especially to
  • General Big-Oh Rules (5.4),
  • The Logarithm (5.5),
  • Algorithm Analysis and Limitations,
  • Examples.

• Data Structures (Chapter 6).
  All subseections with the exception of 6.8

• Recursion (Chapter 7).
  All subsections except for 7.6 and 7.7, with emphasis on the background material.
  • Mathematical induction (section 7.2),
  • Basic Recursion (section 7.3),
  • Divide and Conquer (section 7.5).

• Stacks and Compilers (Chapter 11), all sections.

• File Compression (Section 12.1) and Josephus Problem (Section 13.1).

• Stacks and Queues (Chapter 15) and Linked Lists (Chapter 16).

• Trees (Chapter 17) (an important introductory chapter, hence listed separately)

.