Algorithms and basics of programming

Syllabus

Classes (Fall semester)

• Timetable

Requirements

• maximum number of absences: 3
• students must arrive in time, late arrival (more than 20 minutes) means absence from class
• students must not miss more than 3 classes in the semester.
• 1 midterm test just for self-check (no effect on the final grade)
• 1 end-term test, its result is the base of the grade
• at least 60% is needed to pass
• the only one retake test covers the whole semester and its result overwrites previous results

Material of lessons

• Slides (latest version: 18/08/2024)
• Lecture note is available in the e-Learning system
• Pseudocode examples e-Learning system
• Thoughts about University life
• Pseudocode interpreter
• Sample Test

Readings

• Narasimha Karumanchi: Data Structures and Algorithmic Thinking with Python (CareerMonk, 2017)
• Peter Wentworth, Jeffrey Elkner, Allen B. Downey and Chris Meyers: How to Think Like a Computer Scientist: Learning with Python 3 (online, 2012).
• CodeWarrior: Principles of Programming (Metrowerks, 1995)

Visit information

Updated: 08/09/2024