Department of Computer Science

Ph.D. (Computer Science)

Minimum residency requirement for Ph.D: 2 years after confirmation (3 years including course work duration)

Course Description:-


The Master of Computer Science (M. Sc.) Program is a Two Years (Four Semester) course open to graduates in Mathematical Science and allied disciplines. The program gives adequate emphasis on Theory and Systems in Computer Science and is a unique program of its kind with different specializations.






Eligibility & other Details:-

Minimum Eligibility:

After 12 years’ schooling a 3/4 years Bachelor’s degree in computer science + post-graduate education leading to M.Tech/MCA/M.Sc degree in computer science with at least 55% marks or an equivalent grade. Candidates who have obtained integrated Bachelor’s and Master’s degrees will be eligible provided they have at least 5 years of university/Institution education leading to a master’s degree after completing 12 years’ of schooling. Degrees from Government recognized Universities/ Institutions will only be acceptable.

Admission procedure: Through an entrance test and an Interview.

Format of the Entrance Test question paper and course:

Entrance test (70 marks): The 03 hours entrance test will contain multiple choice questions. Each question will have four options and out of these four options, one option will be correct.
There will be no negative marking.
The exam will have multiple-choice questions from the following two parts:

Part A: would comprise 30 questions of one mark each. This part will test the basic intelligence of the candidate, language, quantitative skills and knowledge in Mathematics and Computer Science of under-graduate level education. All questions will be compulsory. Part A will have multiple-choice questions from the following areas of under-graduate level:

Discrete Mathematics: Sets, Relations, Functions, Boolean Algebra, Propositional logic, First order Predicate Logic

Combinatorics: Permutations, Combinations, counting, summation, recurrence relations

Probability and Statistics: Conditional probability, Mean, Median, Mode, Standard deviation, variance, covariance, Random variable, distributions (uniform, normal, exponential, Poisson, Binomial).

Calculus and Ordinary Differential Equations: Limit, Continuity & differentiability, Mean value theorems, theorems of integral calculus, evaluation of definite and improper integrals, partial derivatives, total derivatives, maxima and minima, Differential equations of first order and their solutions, linear differential equations with constant coefficients, homogenous linear differential equations.

Geometry and Vector Analysis: Rectangular Cartesian co-ordinates, equations of a line, mid-point, intersections etc., equations of a circle, distance formulae, pair of straight lines, parabola, ellipse and hyperbola, simple geometric transformations such as translation, rotation, scaling, Scalar and Vector quantities their representation, Addition and subtraction of vectors, Scalar and vector product of two vectors, Scalar triple product, Vector triple product.

Matrices and Determinants: Algebra of Matrices, Determinants, Systems of linear equations, Eigen Values and Eigen Vectors.

Programming in C: Elements of C, Identifiers, Data Types, Control Structures, Iteration, Structured Data Types: Array, Structure, Union, Strings, Pointers, Functions, Parameter Passing to Functions, Recursion.

Digital Logic Design: Number System, Data Representation and Computer Arithmetic, Logic Gates, Combinational and Sequential Circuits.

Part B: would comprise 40 questions of one mark each. This part will extensively test the knowledge of the candidate in the subject of Computer Science. Questions in this part will be framed at the level of M.Tech/MCA/ M.Sc education. All questions will be compulsory. The Part B will have multiple-choice questions from the following areas of post-graduate level:

Data & File Structures: Arrays, Linked Lists, Doubly Linked Lists, Circularly Linked Lists, Queues, Priority Queues, Stacks, Postfix, Prefix Representation and Evaluation, Trees, Binary Search Trees, Heaps, Graphs, Records, Sequential Direct, Indexed Sequential, Relative Files, Inverted Lists, Multilist, Hashing, AVL Trees, B-Tree, B+ Tree.

Design & Analysis of Algorithms: Asymptotic notation, Asymptotic analysis (best, worst, average cases) of time and space, Sorting, Searching, Recursion, Graph (Spanning tree, connected component, shortest path), Divide-and-Conquer, Greedy Approach, Dynamic programming, Basic concepts of complexity classes –P, NP, NP-hard, NP-complete.

Operating Systems: Processes, Threads, Inter-process communication, Concurrency, Synchronization (semaphores, critical regions, mutual exclusion), Deadlock handling (Bankers algorithm), CPU scheduling, Memory management and virtual memory (paging and segmentation), File Systems, I/O systems, Protection and security, UNIX and Windows, Basic UNIX commands, shell variables and programming.

Computer Networks: Local Area Networks (LAN), Metropolitan Area Networks (MAN), Wide Area Networks (WAN), OSI model, TCP/IP model, Encoding and Modulation, Multiplexing, Switching, Transmission media, Flow control, Error detection and correction, Multiple access protocols, IPv4, IPv6, Routing algorithms, Multicasting, Congestion control, QoS, TCP/UDP, Application layer protocols (icmp, dns, smtp, pop, ftp, http).

Software Engineering: System Development Life Cycle (Steps, Water Fall Model, Prototypes, Spiral model), Software Metrics(Software Project Management),Software Design(System Design, Detailed Design, Function Oriented Design, Object Oriented Design, User Interface Design, Design level metrics), Coding and testing (testing level metrics, software quality and reliability).

Database Management System: ER-model, Relational model (relational algebra, tuple and domain calculus), Database design (integrity constraints, normal forms), Structured Query Language, Transactions and concurrency control, Distributed Databases.

Computer Architecture and Organization: Subsystems of a Computer, Instructions Formats, Assembly Programming, Information Representation, Computer Arithmetic, Processor Datapath Design, Control Unit Design, Pipelining, Memory Organization, I/O Organization, Interrupts and DMA, Parallelism.

Interview: Candidates upto four times the number of seats will be short-listed for interview on the basis of their performance in entrance test subject to a minimum cut off. Candidates from outside India will be interviewed through Skype. Interview will carry 30 marks. Final merit-list will be drawn by adding the entrance test and interview marks.

In each subject, 50% seats offered will be reserved for Indian students and other 50% for students from all other SAARC countries taken together. Two merit lists will be made: one for Indian students and other combined merit list of candidates from all other SAARC countries. Seats will be offered based upon these two merit lists.

Previous Year Question Papers:-


Tuition fee at SAU is highly subsidized. Following is the fee structure payable by students coming from SAARC countries :

  1. Admission Fee (Non-Refundable)US $ 100(one time)
  2. Tuition Fee US $ 440 (per semester)
  3. Security Deposit (Refundable)US $ 100(one time)

Related links:-

^ Back to Top