Introduction to Programming

Back

Course informations

Study program level Undergraduate
Study program Computer Science
Study program direction Software Engineering
Course year 1.
Course semester I
Course status Core
ECTS 9
Lectures (h) 15
Excercises (h) 60
Seminars (h) -

Course objectives

The student must understand the concept of algorithm and computer as a executor (related to the subject "Algorithms and Data Structures"). Present some ways of writing algorithms: formal and informal. Pseudo-code. To enable a student to develop a simple algorithm and test it in a logical sense. Through the C# programming language, introduce the student into basic concepts: data types and declarations, program flow control commands (loops and bending commands), algorithm written in the pseudo code to be encoded and tested on a computer. Compare elementary C# language elements with the language C. Introduce a student with functions, recursive call functions, data structures. Introduce the student to basic file management functions.

Course outcomes

  • Become familiar with the MS Visual Studio Development Tool: Create a project / solution, add elements to the project, and add a reference project; translation; debugging.
  • Classify types of projects that can be created using MS Visual Studio and compare them to different Windows applications on the computer (form-based, console applications, Windows services, web applications)
  • Identify the problem from the real world and formulate an algorithm for solving it.
  • Test algorithm in logical sense.
  • Using the basic elements of C# programming language to develop an application that solves a simple problem.

Course content

MS Visual Studio Development Tool. Basic types of projects - creating, translating, executing, debugging. Algorithm - basic properties: finality, determination and usage area. Writing algorithms with formal and informal methods. SDL language and block diagram; pseudo-code. Basic program in C# language. Basic language elements of C#: namespace, startup programs, loops and bending commands, call functions. Library functions. Recursion and data structures. Working with files. Text print on screen.
Skip to content