Introduction to Structured Programming

General data

Course ID:	0600-IS1-1PPS
Erasmus code / ISCED:	11.303 Kod klasyfikacyjny przedmiotu składa się z trzech do pięciu cyfr, przy czym trzy pierwsze oznaczają klasyfikację dziedziny wg. Listy kodów dziedzin obowiązującej w programie Socrates/Erasmus, czwarta (dotąd na ogół 0) – ewentualne uszczegółowienie informacji o dyscyplinie, piąta – stopień zaawansowania przedmiotu ustalony na podstawie roku studiów, dla którego przedmiot jest przeznaczony. / (unknown)
Course title:	Introduction to Structured Programming
Name in Polish:	Podstawy programowania strukturalnego
Organizational unit:	(in Polish) Instytut Informatyki.
Course groups:
ECTS credit allocation (and other scores):	(not available) Basic information on ECTS credits allocation principles: the annual hourly workload of the student’s work required to achieve the expected learning outcomes for a given stage is 1500-1800h, corresponding to 60 ECTS; the student’s weekly hourly workload is 45 h; 1 ECTS point corresponds to 25-30 hours of student work needed to achieve the assumed learning outcomes; weekly student workload necessary to achieve the assumed learning outcomes allows to obtain 1.5 ECTS; work required to pass the course, which has been assigned 3 ECTS, constitutes 10% of the semester student load. view allocation of credits
Language:	Polish
Type of course:	obligatory courses
Short description:	Learn the basics and methodology of information processing in computer (representation of information, information processing on machine-level and high-level languages). Learn the methodology of programming in C.
Full description:	Course profile: General Academic Form of study: Full-time studies Course type: Obligatory Year/semester of study: 1 / 1 Prerequisites (sequential system of courses and exams): Lecture: 30 Laboratory classes: 15 Exercise classes: 30 Teaching methods: Lecture, exercises with tests (at least four), tasks solved at the laboratory classes ECTS credits: 7 Balance of student workload: Class attendance: - lecture 30h - exercise classes 30h - laboratory classes 15h Course preparation: - lecture 15h - exercise classes 30h - laboratory classes 15h Literature study: 10h Reports, homeworks: 10h Preparation for tests: 15h Preparation for the exam: 10h Exam duration: 3h Individual consultation with the teacher: 10h Student workload: Direct interaction with the teacher: 88, 4 ECTS Practical exercises: 60, 2 ECTS
Bibliography:	Main literature: B. Kernighan, D. Ritchie. The C Programming Language. Prentice Hall, 1998 N. Wirth, Algorithms + Data Structures = Programs. Prentice-Hall, 1975 Supplementary literature: GCC documentation.
Learning outcomes:	Learning outcomes: Knows the basic computer operations (CPU - Central Processing Unit, registers, memory, machine language and assembler), knows the methods of numerical data representation (fixed-point code, the two's complement, floating point code) and text data in computer memory. X1A_U03, X1A_U06, T1A_U04, T1A_U10 Knows the concept of the problem and the algorithm, knows the methods and tools to formulate algorithms (flowcharts, verbal descriptions), knows the basic programming constructs (expressions, assignment operation, iterative and conditional constructions). X1A_W02, T1A_W03, T1A_W07 Is able to formulate simple algorithms in the form of flowcharts and verbal descriptions. X1A_W02, T1A_W03, T1A_W07 Is able to apply basic types and data structures (scalar, array, structural) and basic programming constructs (operators, expressions, simple and complex instructions, iterative instructions, conditional instructions, instructions for input / output) for the construction of simple programs in a programming C language. X1A_W04, T1A_W03, T1A_W07 Is able to separate the logical and functional fragments of the program in the form of procedures (functions) of C language, can apply the methods of communication between procedures of C language (formal parameters, global variables). X1A_W04, T1A_W03, T1A_W07 Is able to use advanced programming techniques: dynamic memory management, dynamic data structures (variable-length arrays, lists), recursion. X1A_W04, T1A_W03, T1A_W07 Distinguishes between universal knowledge in the field of programming and technical skills depending on the applied technology. Understands the need for improvement in terms of universal knowledge and the need for continuous enhancement of technical skills. X1A_W04, T1A_W03, T1A_W07
Assessment methods and assessment criteria:	Form of assessment: exam. The permissible number of unexcused absences from laboratory/exercise classes is 20% of classes.

This course is not currently offered.

Course descriptions are protected by copyright.
Copyright by University of Bialystok.