Computer Science - Junior
Course # COMP 3071
Credits 6
Prerequisites and/or Corequisites: Data Structures and Algorithms
Course Description
This course covers advanced theories and state-of-the-art techniques of artificial intelligence. Artificial intelligence (AI) is a research field that studies how to realize the intelligent human behaviors on computers. The AI is to make a computer that can learn, plan, and solve problems autonomously. The topic includes building blocks and components of artificial intelligence, learning about concepts like algorithms, machine learning, and neural networks.
The laboratory focuses on training the students with building models using various artificial intelligence algorithms.
Course Learning Outcomes
Upon the completion of the course, students will be able to:
- Discuss the core concepts and algorithms of advanced AI, machine learning, deep learning, natural language processing, robotics, and so on.
- Apply the basic principles, models, and algorithms of AI to recognize, model, and solve problems in the analysis and design of information systems.
- Critically analyze the structures and algorithms of a selection of techniques related to searching, reasoning, machine learning, and deep learning.
- Evaluate how uncertainty is being tackled in the knowledge representation and reasoning process based on statistical reasoning.
- Communicate clearly and effectively using the technical language of the field correctly in a group.
Course # DMNS 3031
Credits 6
Prerequisites: Calculus-I, Calculus-II
Course Description
This course is an introduction to statistics and probability. It is designed to equip students with understanding of foundations of statistics and probability and focuses on using modern statistical packages in examining relevant applications. The course is a prerequisite for advanced statistics.
Course Learning Outcomes
Upon the completion of this course, students will be able to:
- Define fundamental concepts in statistics such as population, sample, types of data and variables.
- Identify descriptive statistics from inferential statistics.
- Define the role of descriptive statistics and inferential statistics in quantitative analyses.
- Find measure of central tendency and measures of variability for given data sets.
- Create and interpret appropriate visualizations for different types of data using a statistical package such as R, Python etc.
- Apply counting principles, permutations, and combinations to solve problems involving counting and arrangements.
- Define key terms in probability, such as random experiment and event.
- Apply axioms and rules of probability.
- Apply the principles of conditional probability to real world problem.
- Describe types of random variables, probability distributions and their properties.
- Calculate probabilities and expected values for various types of probability distributions such as Binomial, Poisson and Normal distributions.
- Define jointly distribution random variables.
- Explain the joint behavior of multiple random variables using distribution functions.
- Describe the Law of Large Numbers and Central Limit Theorem and how they explain the behavior of sample means in large samples.
- Define entropy, relative entropy and mutual information and their significance in information theory.
- Calculate entropy to analyze the information content of different probability distributions.
Course Assessments and Grading
Item |
Weight |
Homework |
12% |
Quizzes |
15% |
Project |
15% |
Class Participation |
8% |
Midterm Exam |
20% |
Final Exam |
30% |
Course # COMP 3021
Credits 6
Prerequisites and/or Corequisites: Digital Logic and Design
Course Description
This course focuses on the basic architecture of computer systems including fundamental concepts such as components of the processor, interfacing with memory and I/O devices, organization of peripherals, and machine-level operations. The course presents detailed deliberation on various system design considerations along with associated challenges commonly employed in computer architecture such as pipelining, branch prediction, caching, etc., This course provides the students with an understanding of the various levels of abstraction in computer architecture, with emphasis on instruction set level and register transfer level through practical examples using the language MIPS.
Course Learning Outcomes
Upon the completion of this course, students will be able to:
- Describe the key components of the computer system along with their functionalities and limitations
- Explain the internal working of processor underneath the software layer and how decisions made in hardware affect the software/programmer
- Examine Instruction Set Architecture (ISA) designs and associated trade-offs
- Analyze factors effecting CPU performance e.g., pipelining and instruction-level parallelism
- Explain the I/O subsystems and memory modules of the computer
- Evaluate design and optimization decisions across the boundaries of different layers and system components.
Course Assessments and Grading
Item |
Weight |
Quizzes |
25 % |
Midterm |
25 % |
Homeworks/Assignments |
20 % |
Final exam |
30 % |
Course # COMP 3042
Credits 6
Prerequisites and/or Corequisites: Design & Analysis of Algorithms
Course Description
This course introduces mathematical modeling of computational problems. It covers the common algorithms, algorithmic paradigms, design of algorithms used to solve these problems. The course emphasizes the relationship between algorithms and programming and introduces basic performance measures and analysis techniques for these problems. It also covers the time complexity and space complexity of different algorithms to find the best algorithm having less time and space complexity for different problems.
Course Learning Outcomes
Upon the completion of the course, students will be able to:
- Identify the key characteristics of a problem.
- Analyze the suitability of a specific algorithm design technique for a problem.
- Apply different design techniques to design an algorithm.
- Explain different time analysis techniques and notations of algorithms.
- Analyze the time and space complexity of different algorithms.
- Compare different algorithms to select the best solution for a given problem.
Course Assessments and Grading
Item |
Weight |
Attendance & Activities |
10% |
Assignment (5 assignments) |
15% |
Quiz (10 quizzes) |
25% |
Midterm exam (Paper/Project) |
20% |
Final exam (Project) |
30% |
Course # COMP 4075
Credits 6
Prerequisites and/or Corequisites: Programing 1, Linear Algebra
Course Description
Digital Image Processing is a fundamental course that explores the techniques and algorithms used to manipulate, enhance, and analyze digital images. This course covers both theoretical foundations and practical applications of image processing in various fields, including computer vision, medical imaging, remote sensing, and multimedia. Students will learn about image representation, enhancement, restoration, compression, segmentation, feature extraction, and recognition.
Course Learning Outcomes
Upon the completion of this course, students will be able to:
- Understand digital image representation, acquisition, and pixel characteristics.
- Apply techniques like histogram equalization, contrast stretching, and filtering for image enhancement.
- Implement restoration methods to recover degraded images from noise and blurring.
- Employ thresholding, edge detection, and feature extraction for image segmentation and analysis.
- Learn lossless and lossy compression techniques for efficient image storage and transmission.
- Evaluate time and space complexity of algorithms and compare them to select optimal solutions.
- Apply image processing to various fields like medical imaging and computer vision.
- Develop problem-solving skills through hands-on projects and practical exercises.
Course Assessments and Grading
Item |
Weight |
Attendance & Activities |
10% |
Assignment (5 assignments) |
20% |
Quizzes (5 quizzes) |
20% |
Midterm exam (exam + project) |
20% |
Final exam (exam + project) |
30% |
Physical training
Course # HUSS 1080
Credits 0
Pre-requisites and Co-requisites: None
Course description
The purpose of physical education is to strengthen health, develop the physical and mental abilities of students. Physical exercises and sports games is 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 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.