Computer Science - Sophomore
Course # COMP 2006
Credits 6
Pre-requisites and Co-requisites: None
Course Description
Database Management Systems (DBMS) is a core undergraduate course that introduces students to the principles, design, and practical use of modern database systems. The course covers relational database concepts, data modeling, normalization, and Structured Query Language (SQL), with a strong emphasis on hands-on experience using PostgreSQL as the primary database management system. Students learn how to design efficient database schemas, implement constraints, write complex queries, and manage data integrity through transactions. Advanced topics such as indexing, query optimization, concurrency control, security, and backup concepts are also introduced. Through theory lectures, laboratory sessions, and guided tutorials, students develop both conceptual understanding and practical skills required to build reliable, scalable, and maintainable database-backed applications.
Course Learning Outcomes
Upon completion of this course, students will be able to:
- Explain fundamental database management system concepts, including data models, database architecture, and the role of DBMS in modern software systems.
- Design relational database schemas using ER modeling and normalization techniques to ensure data integrity, consistency, and minimal redundancy.
- Implement databases in PostgreSQL by creating tables, constraints, relationships, and performing complete CRUD operations using SQL.
- Write and optimize SQL queries involving joins, subqueries, aggregations, and views to retrieve and manipulate data efficiently.
- Apply transaction management, indexing, and basic security mechanisms to maintain data consistency, performance, and controlled access in multi-user database environments.
Course Assessments and Grading
|
Item |
Weight |
|
Midterm Exam |
25% |
|
Laboratory Assignments |
25% |
|
Final Project |
30% |
|
Final Exam |
15% |
| Participation & Tutorials |
5% |
Course # COMP 2021
Credits 6
Pre-requisites and Co-requisites: Physics II
Course Description
Digital Logic Design is a technological subject which is intended to make students familiar with different types of designs as sequential logic circuits, combinational logic circuits, trouble shooting of various digital systems, study of various digital systems. It is an introductory electronics course covering Basic Electron Theory, Resistors, Analog and Digital Wave forms, Number systems, Conversions, Logic Gates, Boolean Algebra, Combination Circuit Design, Flip-Flops, Shift Registers and Counters. After reading this course students would have complete understanding about the low-level architecture of any digital system of diverse areas like computer systems, embedded systems, telephony, data processing system, radar, navigation, military systems, medical instruments, process controls etc.
Course Learning Outcomes
Upon completion of this course, students will be able to:
- Identifying and manipulating various number systems and codes.
- Analyze and discuss the principles of logic gates, combinational circuits, and Boolean Algebra.
- Apply Karnaugh maps to simplify Boolean expressions effectively.
- Design a range of combinational circuits, including comparators, adders, detectors, and others.
- Explain the principles and functions of encoders, decoders, multiplexers, and demultiplexers.
- Apply the operations of latches, flip-flops, synchronous and asynchronous counters, clocks, and shift registers in practical scenarios.
- Analyze memory architecture and perform basic memory operations.
- Examine the working of a basic computer processor, including its essential components and operations.
Course Assessments and Grading
|
Item |
Weight |
|
Class participation and attendance |
10% |
|
Quiz activities (4) |
15% |
|
02 Assignments (Project based on Electronic Work Bench Tool) |
15% |
|
Mid exam in two Parts
|
30% |
|
Final exam in two Parts
|
30% |
Course # COMP 2041
Credits 6
Pre-requisites and Co-requisites: Computer programming skill in any programming language, such as C, C++, Java, Python, etc.
This course examines the design, analysis, and implementation of data structures and algorithms to solve engineering problems using computer programming languages. It focuses on Elementary data structures, (including arrays, stacks, queues, and lists), advanced data structures (including trees and graphs) and the algorithms used to manipulate these structures.
Course Learning Outcomes.
Upon completion of the course, the students should be able to:
- Explain the concept of data structures, and understand different data structures and algorithms
- Analyze space and time complexity of different data structures
- Explain the suitability of different data structures for different problems
- Explain different algorithms to solve different problems
- Implement different data structures using computer programing languages
Course Assessments and Grading
|
Item |
Weight |
|
Attendance & Activities |
10% |
|
Assignments/Presentations (3-5 assignments) |
15% |
|
Quizzes (5 or 6 quizzes) |
25% |
|
Midterm exam Paper (Paper + Project) |
20% |
|
Final exam Paper (Project + Exam) |
30% |
Course # DMNS 2011
Credits 6
Pre-requisites and Co-requisites: Calculus I
Course Description
This course, Linear Algebra, provides students with a comprehensive introduction to the concepts and techniques of linear algebra. The course covers topics such as matrices, systems of linear equations, vector spaces, linear transformations, eigenvalues, eigenvectors, orthogonality, and least squares. The course is taught using a combination of lectures, examples, and hands-on problem-solving. By the end of the course, students will have a solid understanding of the fundamental concepts of linear algebra and will be able to apply these concepts to a wide range of problems.
Course Learning Outcomes
Upon completion of the course, students will be able to:
- Interpret systems of linear equations in several variables to understand the behavior of the solution in a three or higher-dimensional plane.
- Develop algorithmic techniques to compute the inverse of high dimensional matrices.
- Critically analyze and construct mathematical arguments related to elementary facts in abstract vector spaces.
- Combine methods of matrix algebra to compose the change in basis matrix with respect to two bases of a vector space.
- Use the characteristic polynomial to discriminate between diagonalizable and non-diagonalizable matrices using their spectra (eigenvectors and eigenvalues).
- Analyze numerical data, mathematical notions, and identify patterns to formulate and validate reasoning in economics and other applied science.
Course Assessments and Grading
|
Item |
Weight |
|
7 Homework |
10% |
|
5 Quizzes |
15% |
|
Project |
15% |
|
Group Project |
10% |
|
Midterm Exam |
20% |
|
Final exam |
30% |
Course # HUSS 2099
Credits 2
Course # HUSS 2082
Credits 0
Pre-requisites and Co-requisites: None
Course description
The purpose of physical education is to strengthen health and develop the physical and mental abilities of students. Physical exercises and sports games are the way to a powerful and functional body, clear mind and strong spirit. The course is both practical and theoretical, it covers basic concepts of anatomy and physiology as well as health and safety requirements.
Course learning outcomes
Upon completion of the course, students should be able to:
- Perform a range of physical activities
- Understand health and safety requirements for a range of physical activities
- Describe the role and progress of sport in Central Asia
- Choose an appropriate physical activities programme for their age and gender
- Identify tiredness and its symptoms to control the body during athletic exercises
- Describe the technique of running for a long and a short distance and jumping
- Accomplish running for a short and a long distance and jumping according to all necessary norms
- Describe the rules of a range of sports games
Course Assessments and Grading
|
Controlling exercises and testing |
Normative |
|||||
|
Boys |
Girls |
|||||
|
5 |
4 |
3 |
5 |
4 |
3 |
|
|
Running – 60m (minutes and seconds ) |
8,6 |
9,4 |
10,2 |
9,6 |
10,2 |
10,6 |
|
Running – 100m (minutes and seconds) |
14.0 |
14.2 |
14.6 |
16.0 |
16.3 |
17.0 |
|
ABS – 30 seconds |
25 |
23 |
21 |
23 |
21 |
18 |
|
Long distance running – 1000m |
3.50 |
4.00 |
4.10 |
4.30 |
4.40 |
4.50 |
|
Long distance running – 2000m |
|
|
|
10.3 |
12.1 |
13.10 |
|
Long distance running – 3000m |
14.0 |
16.00 |
17.00 |
|
|
|
|
Push up on the cross bar (турник) |
20 |
17 |
15 |
|
|
|
|
Jumping with running (m,sm) |
4.45 |
4.20 |
3.70 |
3.60 |
3.35 |
3.10 |
|
Jumping from the stand position(m,sm) |
2.20 |
2.00 |
1.90 |
2.00 |
1.90 |
1.60 |
The course will be graded with PASS/FAIL.
Course # COOP 2001
Credits 2