Subjects

Your browser does not support JavaScript, or its support is disabled. Some features may not be available.

Programming 1 - NPRG030

Title:	Programování 1
Guaranteed by:	Department of Software and Computer Science Education (32-KSVI)
Faculty:	Faculty of Mathematics and Physics
Actual:	from 2022
Semester:	winter
E-Credits:	5
Hours per week, examination:	winter s.:2/2, C [HT]
Capacity:	unlimited
Min. number of students:	unlimited
4EU+:	no
Virtual mobility / capacity:	no
State of the course:	taught
Language:	Czech, English
Teaching methods:	full-time
Teaching methods:	full-time
Additional information:	https://ksvi.mff.cuni.cz/~holan/

Guarantor:	RNDr. Tomáš Holan, Ph.D. RNDr. Martin Pergel, Ph.D. Adam Dingle, M.Sc.
Class:	Informatika Bc.
Classification:	Informatics > Programming
Co-requisite :	NPRG062
Incompatibility :	NMIN101, NMIN111, NPRX030
Interchangeability :	NPRX030
Is co-requisite for:	NPRG062, NPRG047, NSWI178, NPRG031
Is incompatible with:	NMUG103, NMUG104, NMIN111, NMUM163, NPRM044, NMUE022, NPRM001, NMUE021, NPRX030, NMIN101, NMTD103
Is interchangeable with:	NPRX030, NPRM044, NMTD103, NMIN101, NMIN111

Opinion survey results Examination dates WS schedule Noticeboard

Annotation -

Last update: doc. RNDr. Pavel Töpfer, CSc. (09.10.2017)

A first course about programming and algorithms for first-year students studying computer science and computer science education. The course covers principles of algorithms, basic algorithms, data structures, programming techniques, typical programming environments and practical program design and debugging.

Course completion requirements -

Last update: RNDr. Tomáš Holan, Ph.D. (11.10.2022)

Students will receive a credit for this course by successfully completing the following requirements:

Active participation in the practice sessions in the computer lab. Generally this means that students must complete the assigned programming exercises, either during the lab session or later on at home.

Completion of a semester programming project by the deadline fixed by the instructor.

Passing a written test at the end of the semester.

Due to the nature of the first two requirements, a failed attempt cannot be repeated as is possible for exams. The instructor may establish conditions whereby a student can make up for missing homework assignments or resubmit their semester project after improving deficiencies that were found the first time around.

A student has three chances to pass the written test, normally by the end of the winter exam period. The instructor may choose to allow a student to make one or more of these attempts during the following summer semester.

Cheating on a test or a homework assignment may result in automatically failing the course.

Literature -

Last update: doc. RNDr. Pavel Töpfer, CSc. (25.05.2022)

John V. Guttag, Introduction to Computation and Programming Using Python: With Application to Understanding Data, 2nd ed.,, MIT Press, Cambridge, MA 2016

Allen B. Downey, Think Python: How to Think Like a Computer Scientist, 2nd ed., O'Reilly Media, Sebastopol, CA 2015

Syllabus -

Last update: doc. RNDr. Tomáš Dvořák, CSc. (23.09.2019)

Variables, types, floating-point numbers and inaccuracy problems..

Operators and their precedence.

Assignment, conditional statements and loops..

Program structure: comments, indentation.

List / array operations.

Code decomposition.

Function definitions and calls, parameter passing.

Local identifiers and their scope.

Modularity of programs..

Passing function as an argument to another function.

Using libraries, import, graphics output.

String processing.

Type system in greater detail.

Other structured data types.

Classes and objects. Objects as abstractions of real-world entities.

Derivation of types, inheritance.

Linear linked lists.

Tree data structures.

Debugging, defensive programming.

Unit, regression and integration tests.

Throwing and catching exceptions. Assertions.

Input and output. File processing.