SylabUZ

Generate PDF for this page

Fundamentals of computer science - course description

General information
Course name Fundamentals of computer science
Course ID 11.3-WE-BizElP-PodsInform-Er
Faculty Faculty of Computer Science, Electrical Engineering and Automatics
Field of study E-business
Education profile practical
Level of studies First-cycle Erasmus programme
Beginning semester winter term 2019/2020
Course information
Semester 1
ECTS credits to win 4
Course type obligatory
Teaching language english
Author of syllabus
  • prof. dr hab. inż. Andrzej Obuchowicz
Classes forms
The class form Hours per semester (full-time) Hours per week (full-time) Hours per semester (part-time) Hours per week (part-time) Form of assignment
Lecture 30 2 - - Exam
Laboratory 15 1 - - Credit with grade

Aim of the course

Introduction to data organization and their computer representation.

Algorithmics and data structures fundamental terms introduction.

Developing elementary programming skills in a given structural language.

Prerequisites

no entry requirements

Scope

Data organization and their computer representation.

Foundation of algorithmics: algorithmic problem, algorithm, and its properties, control structures and block schemes. Algorithmic correctness and complexity, algorithmic complexity classes of problems, unsolvable problems, chosen algorithmic problems solving, chosen data structures (LIFO, FIFO, lists, Binary Search Trees, etc.).

Elements of structural programming, data  types, control instructions and operators, recursion functions, tables, preprocessor and pointers, dynamic memory allocation, complex data types, files and input/output functions.

Teaching methods

Conventional lecture, laboratory exercices

Learning outcomes and methods of theirs verification

Outcome description Outcome symbols Methods of verification The class form

Assignment conditions

Lecture – to receive a positive note of a written test.

Laboratory  – to receive positive notes from all laboratory exercises which are carried out in the semester.

Recommended reading

  1. Cormen T. H., Leiserson C. E., Rivest R. L.: Introduction to Algorithms, MIT Press, 3rd edition, 2009
  2. Neapolitan R., Naimipour K.: “Foundations of Algorithms Using C++ Pseudocode,” 3rd Edtion, Jones and Bartlett Publishers, Inc., 2008.
  3. Kernighan B.W., Ritchie D.M.: The C Programming Language. Prentice Hall, New Jersey, 1988.
  4. Summit S.: C Programming FAQs: Frequently Asked Questions, Addison-Wesley, 1996.
  5. Chalk B.S., Carter A., Hind R.: Computer Organisation and Architecture, Red Globe Press, 2003.

Further reading

  1. Aho A. V., Hopcroft J. E., Ullman J.D.: Data Structures and Algorithms, Pearson 1983.
  2. Harris S., Ross J.: Begining algorithms, Wrox, 2005.

Notes


Modified by prof. dr hab. inż. Andrzej Obuchowicz (last modification: 09-12-2019 10:25)