MSc Computer Science

The Department of Computer Science and Engineering was established in the University in 2010. The department offers degree programs at doctoral, masters and bachelor levels. The M.Sc. programs in Computer Science offer advanced curricula that bridges core computing concepts with emerging technologies. Designed for students with a strong foundation in computer science, the program covers key areas such as algorithms, artificial intelligence, machine learning, data science, cybersecurity, and cloud computing. With a blend of theoretical knowledge and hands-on research, students develop critical problem-solving and analytical skills. The program prepares graduates for careers in research, academia, and industry, equipping them to tackle complex computational challenges and contribute to technological advancements. Both of our MSc programs focus on advanced theoretical and practical knowledge in science comprising coursework, and research projects leading to thesis/dissertation.

Specialization Options: Students admitted into any of the Masters programs will be provided the option to follow the general track or to opt to have specialization either in AI & ML or in Advanced Networks & Systems) before the beginning of the first semester

Eligibility

One-Year Programme

A candidate must have passed Bachelor's degree in Computer Science or a closely related discipline* with Mathematics as a subject either at the Bachelor’s level or at the 10+2 (12th class) level under 10+2+4 pattern from a recognized institution or an examination recognized by the University as its equivalent with a minimum of 55% marks (or an equivalent grade).

*Indicative List of Closely Related Disciplines:

Computer Science and Engineering/ Computer Engineering/ Computer Applications/ Information Technology

Two-Year Programme

A candidate must have passed a 3 or 4 year Bachelor's degree with Mathematics as a subject either at the Bachelor’s level or at the 10+2 (12th class) level from a recognized institution or an examination recognized by the University as its equivalent with a minimum of 55% marks (or an equivalent grade).

Seat Matrix

Total Seats (For 1 Year and 2 Year Program) : 40

India: 20

Remaining SAARC Countries
+ Other Countries: 20

SAU Entrance Test: 10

Direct Mode: 10

Entrance Test: 10

Direct Mode: 10

 

Note: Vacant seats in one category will be transferred to another category.

Format of the Entrance Test Paper

  • The duration of the Entrance Test will be 2 hours.
  • The question paper will consist of 70 multiple choice questions.
  • There will be no negative marking.
  • Calculators will not be allowed. However, Log Tables may be used.

Syllabus for Entrance Test

  • Set Theory and Algebra: Sets, Relations, Functions, Groups, Partial Orders, Lattice, Boolean Algebra.
  • Combinatorics: Permutations, Combinations, Counting, Summation, Binomial Theorem, Exponential Series.
  • Matrix: Basic Concepts, Types of Matrices, Determinants, Transpose, Inverse and Rank of a Matrix, Matrix Algebra, Systems of Linear Equations.
  • Calculus: Limit, Continuity and Differentiability, Mean Value Theorems, Theorems of Integral Calculus, Evaluation of Definite and Improper Integrals, Partial Derivatives, Total Derivatives, Maxima and Minima.
  • Ordinary Differential Equations: First Order First Degree Equations, Variable Separable Method, Homogeneous Equations, Exact Equations, Integrating Factors, Linear Equations.
  • Vector Analysis: Addition, Subtraction, Dot Product and Cross Products of Vectors.
  • Programming in C: Elements of C, Identifiers, Data Types, Control Structures, Array, Structure, Union, Strings, Pointers, Functions, Parameter Passing to Functions, Recursion, File Handling.
  • Data Structures & Algorithms: Elementary Concepts of List, Stack, Queue, Tree and Graph, Space and Time Complexity Analysis, Sorting Techniques: Bubble Sort, Insertion Sort, Selection Sort, Merge Sort, Quick Sort, etc., Searching Techniques: Linear and Binary Search.
  • Database Management System: Basic Concepts, Attributes, Entity and Relationships, ER Diagram, Database Decomposition and Normalization, Database Constraints, Relational Algebra, SQL.
  • Digital Logic and Computer Architecture: Number System, Data Representation, Compliments, Computer Arithmetic, Logic Gates, Combinational and Sequential Circuits, Computer Organization, Instruction Formats and Addressing Modes, Memory Organization and I/O Interfaces.
  • Computer Networks: Introduction to computer networks, transmission media, transmission modes, network types: LAN, MAN, and WAN, network topologies, basic concept of MAC and IP Address, reference models: OSI & TCP/IP.

Operating System (OS): Overview of OS, functionalities and characteristics of OS, process and process states, threads, CPU scheduling and algorithms, memory management, memory allocation strategies, virtual memory concepts, paging and segmentation.

For a sample test paper, click here.

MSc Computer Science

The Department of Computer Science and Engineering was established in the University in 2010. The department offers degree programs at doctoral, masters and bachelor levels. The M.Sc. programs in Computer Science offer advanced curricula that bridges core computing concepts with emerging technologies. Designed for students with a strong foundation in computer science, the program covers key areas such as algorithms, artificial intelligence, machine learning, data science, cybersecurity, and cloud computing. With a blend of theoretical knowledge and hands-on research, students develop critical problem-solving and analytical skills. The program prepares graduates for careers in research, academia, and industry, equipping them to tackle complex computational challenges and contribute to technological advancements. Both of our MSc programs focus on advanced theoretical and practical knowledge in science comprising coursework, and research projects leading to thesis/dissertation.

Scopes for Specialization: Students admitted into any of the Masters programs will be provided the option to follow the general track or to opt to have specialization either in AI & ML or in Advanced Networks & Systems) before the beginning of the first semester

Eligibility

A candidate must have passed a 3 or 4 year Bachelor's degree with Mathematics as a subject either at the Bachelor’s level or at the 10+2 (12th class) level from a recognized institution or an examination recognized by the University as its equivalent with a minimum of 55% marks (or an equivalent grade).

Seat Matrix

Total Seats (For 1 Year and 2 Year Program) : 20

India: 10

Remaining SAARC Countries
+ Other Countries: 10

SAU Entrance Test: 5

Direct Mode: 5

Entrance Test: 5

Direct Mode: 5

Format of the Entrance Test Paper

  • The duration of the Entrance Test will be 2 hours.
  • The question paper will consist of 70 multiple choice questions.
  • There will be no negative marking.
  • Calculators will not be allowed. However, Log Tables may be used.

Syllabus for Entrance Test

  • Set Theory and Algebra: Sets, Relations, Functions, Groups, Partial Orders, Lattice, Boolean Algebra.
  • Combinatorics: Permutations, Combinations, Counting, Summation, Binomial Theorem, Exponential Series.
  • Matrix: Basic Concepts, Types of Matrices, Determinants, Transpose, Inverse and Rank of a Matrix, Matrix Algebra, Systems of Linear Equations.
  • Calculus: Limit, Continuity and Differentiability, Mean Value Theorems, Theorems of Integral Calculus, Evaluation of Definite and Improper Integrals, Partial Derivatives, Total Derivatives, Maxima and Minima.
  • Ordinary Differential Equations: First Order First Degree Equations, Variable Separable Method, Homogeneous Equations, Exact Equations, Integrating Factors, Linear Equations.
  • Vector Analysis: Addition, Subtraction, Dot Product and Cross Products of Vectors.
  • Programming in C: Elements of C, Identifiers, Data Types, Control Structures, Array, Structure, Union, Strings, Pointers, Functions, Parameter Passing to Functions, Recursion, File Handling.
  • Data Structures & Algorithms: Elementary Concepts of List, Stack, Queue, Tree and Graph, Space and Time Complexity Analysis, Sorting Techniques: Bubble Sort, Insertion Sort, Selection Sort, Merge Sort, Quick Sort, etc., Searching Techniques: Linear and Binary Search.
  • Database Management System: Basic Concepts, Attributes, Entity and Relationships, ER Diagram, Database Decomposition and Normalization, Database Constraints, Relational Algebra, SQL.
  • Digital Logic and Computer Architecture: Number System, Data Representation, Compliments, Computer Arithmetic, Logic Gates, Combinational and Sequential Circuits, Computer Organization, Instruction Formats and Addressing Modes, Memory Organization and I/O Interfaces.
  • Computer Networks: Introduction to computer networks, transmission media, transmission modes, network types: LAN, MAN, and WAN, network topologies, basic concept of MAC and IP Address, reference models: OSI & TCP/IP.

Operating System (OS): Overview of OS, functionalities and characteristics of OS, process and process states, threads, CPU scheduling and algorithms, memory management, memory allocation strategies, virtual memory concepts, paging and segmentation.

For a sample test paper, click here.

© 2025 Copyright. All rights reserved.

Admissions Open 2025 | Apply Now