Syllabus C++

1. GENERAL INFORMATION ABOUT THE COURSE

Course Code

AOP

Major

5B070400 Computer Systems and Software Engineering

Credits

4

Year, semester

1 year, Autumn semester

Subject category

Basic

Language of Delivery:

English

Prerequisites:

-

Post requisites

Programming technologies

Instructor

Akbayan Bekarystankyzy, Khaimuldin N.G. Khaimuldin A.G.

Room 409

2. GOALS AND OBJECTIVES OF THE COURSE

Upon completion of this course, you should know

• basics of algorithms and it’s construction,

• the fundamentals of C++ language,

• variables, structures, loops in C++,

• functions, pointers, data structures, arrays,

• module programming,

• STL containers, Standard libraries

• testing and debugging a program

3. COURSE DESCRIPTION

The course is designed to give basic knowledge of programming language (C++). Students are taught the basic algorithms in C++. Also the course contains structures if/else and loops. Arrays, functions and pointers are the main topics. Students will write programs on procedure-oriented language. Searching, sorting and other algorithms will be covered.

4. LEARNING OUTCOMES

Students successfully completing this course will be able to

1. Produce

• Algorithms on C++ language

• Linear, branching and cycle structures

• C++ Functions

2. Use

• Procedural-oriented programming skills

3. Knowledgeably Discuss

• Algorithms

4. Hold Positions

On completing this course, successful students will be able to write algorithms C++ language.

The course also teaches to use effective programming strategies. This course will not only prepare students for future classes, but will also help them keep their programming skills up to date once they leave the classroom.

5. ACADEMIC POLICY

Students are not allowed to miss classes, use cell phones during classes and browse the social networks. There are no late workshops for students who missed lecture or laboratory class. Instructor may change course outline at any time during the course. Students may come to see Tutor only at Office Hours time or by appointment. Cheating will not be tolerated. Within the context of this course, cheating is defined as giving or receiving assistance on quizzes or exams. Students caught cheating will be dismissed from class immediately and receive a "0" on the exam or quiz.

6. LITERATURE

Required Textbook:

1. C++ How to program (H. M. Deitel).

Abbreviation

Meaning

TSIS

Teacher-supervised independent work

SIS

Students’ independent work

PD

Defense of the practice

P

Practices

Week

Lecture

Materials

Lectures (1 hour)

Lab classes (2 hour)

TSIS

(1 hour)

SIS

(5 hours)

1

Introduction to programming languages and algorithms.

Levels of programming languages. Compiler vs Interpreter. C/C++ language history.

[1]

PD1

Reading

2

Programming structures and variables.

Variables, types, sizes, ranges. Linear and branching structures. Switch structure. Nested if/else structure.

[1]

PD2

Reading

3

Loops in C++.

For, while, do-while loop structures.

[1]

PD3

Theoretical test

Reading

4

Arrays.

Arrays, two-dimensional arrays. Arrays of characters, C-style strings. Arrays and loops. Passing arrays to functions.

[1]

PD4

Defense of practical tasks.

Reading

5

Functions.

Functions. Return type of functions. Arrays with functions. Local and global variables. Recursive functions.

[1]

PD5

Reading

6

Algorithms.

Algorithms in general. Searching and sorting algorithms. Big-O notation.

[1]

PD6

Theoretical test

Reading

7

Pointers.

Pointers to variables. Pointers to arrays. Reference and pointers.

[1]

PD7

Defense of practical tasks.

Reading

8

Pointers part-2.

Pointers and strings. Pointers to functions.

[1]

PD8

Midterm exam

Reading

9

Data structures.

Structure. Variables and functions in structures.

[1]

PD9

Reading

10

Strings.

String class functions.

[1]

PD10

Theoretical test

Reading

11

Modular programming.

Header files. Implementation files. Division of declaration and implementation.

[1]

PD11

Defense of practical tasks.

Reading

12

File processing.

Files and Streams. Reading and writing to files. Using files to store permanent data.

[1]

PD12

Reading

13

STL containers.

Sequence containers, associative containers, container adapters.

[1]

PD13

Theoretical test

Reading

14

Standard libraries.

Functions and classes of iostream, cmath, cstdlib and other standard libraries. //cctype cstring string?

[1]

PD14

Defense of practical tasks.

Reading

15

Testing of program.

Debugging and testing of program. Stepping and breakpoints. Watching variables and call stack.

[1]

End-term exam

Reading