Latviešu Krievu Angļu Vācu Franču
Statuss(Neaktīvs) Izdruka Arhīvs(0) Studiju plāns Vecais plāns Kursu katalogs Vēsture

Course title Basics of Programming I
Course code DatZ2054
Credit points (ECTS) 3
Total Hours in Course 81
Number of hours for lectures 16
Number of hours for seminars and practical classes 16
Independent study hours 49
Date of course confirmation 20/04/2011
Responsible Unit Institute of Computer Systems and Data Science
 
Course developers
Mg. paed., Olga Čivžele

There is no prerequisite knowledge required for this course
 
Course abstract
Students get acquainted with the basic principles of designing algorithms, rules of programming and with basic programming principles. Students acquire initial programming skills. The foundation for further studies in this field is being created.
Learning outcomes and their assessment
• Knowledge about algorithms designing and using, program structure, types of operators, subprograms, labels, records, files and basics of graphics programming.
• Skills in designing flowcharts and programs, as well as in program debugging. • Competence in program code analysis and designing simple programs.
Compulsory reading
1. Balode A. Programmēšanas pamati: valoda Turbo Pascal. Rīga: Zvaigzne ABC, 2009. 232 lpp. ISBN: 978-9934-0-0561-9.
2. Kuzmina L., Kuzmins J. PASCAL valoda skolēniem un skolotājiem. Lielvārde: Lielvārds, 2001. 96 lpp. ISBN: 9789984111803.
3. Kopitovs J., Ivanova S. Datu struktūras un algoritmi: Mācību grāmata. 3. labotais izd. Rīga: Transporta un sakaru institūts, 2005. 95 lpp. 4. Vēzis V. Programmēšanas valoda PASCAL piemēros. [Tiešsaiste] http://www.liis.lv/pascal/pascal.htm (sk. internetā 05.04.2011.)
Further reading
1. Programmēšanas pamati PASCAL vidē būvniecības specialitātes studentiem. [Tiešsaiste] http://www.bf.rtu.lv/documents/edu/pascal_basic.pdf (sk. internetā 05.04.2011.)
2. Вирт Н. Алгоритмы и структуры данных. ДМК Пресс. 2010. ISBN: 978-5-94074-584-6. 3. Cormen T.H., Leiserson C.E., Rivest R.L., Stein C. Introduction to Algorithms. Third Edition. Cambridge, MA; London: The MIT Press, 2009. 1292 p. ISBN: 978-0-262-03384-8.