Computer Science - Sophomore
Course # COMP 3082
Credits 6
Course Description
Database Management Systems is a course that introduces the fundamental concepts and principles of designing, implementing, and querying relational databases. The course covers topics such as data models, relational algebra, SQL, normalization, indexing, transactions, concurrency control, recovery, and security. The course also provides hands-on experience with PostgreSQL, a popular open-source database management system. By the end of the course, students will be able to design and implement database applications using SQL and PostgreSQL, as well as understand the underlying theory and techniques of database management systems.
Course Learning Outcomes
Upon completion of this course, students will be able to:
- Explain the basic concepts and principles of database management systems, such as data models, relational algebra, SQL, normalization, indexing, transactions, concurrency control, recovery, and security.
- Apply the relational model and SQL to design, create, query, and manipulate relational databases.
- Use PostgreSQL, a popular open-source database management system, to implement and test database applications.
- Compare and contrast different data models, such as hierarchical, network, object-oriented, and semi-structured data models.
- Analyze the functional dependencies and normal forms of a relational schema and perform normalization and denormalization techniques.
- Evaluate the performance of different indexing and query processing strategies and optimize SQL queries using query plans and execution statistics.
- Learn and apply the concepts and mechanisms of transaction management, such as ACID properties, serializability, locking protocols, deadlock detection and prevention, and recovery techniques.
- Identify the security threats and challenges in database systems and apply appropriate security measures, such as authentication, authorization, encryption, and auditing.
Course Assessments and Grading
Item |
Weight |
Mid Term exam |
15 % |
Final exam |
20 % |
Quizzes |
20 % |
Problem Sets |
20 % |
Reading Overview Quiz |
5 % |
Project |
20 % |
Course # COMP 2021
Credits 6
Prerequisites: 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:
- Demonstrate proficiency in 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 · Objective Part: Online · Subjective Part: Paper based |
30% |
Final exam in two Parts · Objective Part: Online · Subjective Part: Paper based |
30% |
Course # COMP 2041
Credits 6
Prerequisites: Programming I
Course Description
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 the completion of this course, 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 (5 assignments) |
25% |
Quizzes (5 quizzes) |
15% |
Midterm exam Paper |
20% |
Final exam Paper (Project + Exam) |
30% |
Course # DMNS 2011
Credits 6
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.
Learning Outcomes
Upon the completion of this course, students should 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 |
Homework |
10% |
Project |
15% |
Quizzes |
20% |
Class Participation |
5% |
Midterm Exam |
20% |
Final exam |
30% |
Course # HUSS 2099
Credits 2
TBA
Course # HUSS 1080
Credits 0
Course description
Physical education strengthens health and develops students' physical and mental abilities. Physical exercises and sports games are the way to a powerful and functional body, clear mind and strong spirit. The course is practical and theoretical, covering basic concepts of anatomy and physiology and health and safety requirements.
Course learning outcomes
Upon completion of this course, students will 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
- chose an appropriate physical activities program 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
- participate in a range of sports games according to their rules and techniques
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.