AU M.Sc. Computer Science: seats, eligibility and PGAT syllabus
All Allahabad University courses PG courses
M.Sc. Computer Science at Allahabad University has 30 seats for 2026-27. Admission is through PGAT-I of PGAT 2026, test code 17.
Allahabad admission 2027Coming soon
Allahabad has not released its 2027 admission prospectus yet. The official notification is expected soon, and this page will carry the 2027 seats and fees the day it is out.
- CUET UG 2027: CUET UG 2027 Registration Expected in First Week of January
- CUET PG 2027: no registration date is announced yet; the NTA notification is expected soon.
Below is how 2026-27 went: seats, fees, eligibility and tests of the last cycle. It is the latest official base to plan for 2027.
M.Sc. Computer Science seats 2026-27, college-wise
| Campus or college | Seats |
|---|---|
| University of Allahabad main campus | 30 |
| Total | 30 |
Computer Science has its own paper in two sections: Mathematics, which is compulsory, and Physics or Computer Science. Merit uses the standardised score out of 300.
15% of the seats are reserved for SC, 7.5% for ST, 27% for OBC and 10% for EWS candidates; 5% are for persons with disabilities. Reservation rules.
M.Sc. Computer Science eligibility
B.Sc. (three-year) or B.Sc. (Honours) with Computer Science, Computer Maintenance, Computer Application or Information Technology as a subject at least up to B.Sc. Part II.
PGAT 2026 syllabus for M.Sc. Computer Science
- BASIC ELECTRONICS:
- Boolean Algebra: Decimal, Binary, Octal and Hexadecimal Numbers and their interconversion, Boolean Expressions, Truth tale representation, SOP and POS forms, Theorems of Boolean Algebra and their use in simplification of Boolean Expressions, Karnaugh map method and its use in simplification of logic expressions.
- Logic Gates and Logic Families: Basic logic gates, Elementary idea of commonly used logic families, Working of Standard TTL logic gates, , Implementing Logic circuit using Basic/Universal logic gates.
- Combinational Circuits and their Implementation: Adder, Subtractor, Parity Generator, Encoder, Decoder, Multiplexer and De-multiplexer Circuits, Combinational circuit design using multiplexer.
- Sequential Circuits and their Implementation: Characteristics & Excitation table of RS, JK, T and D Flip flop, Clocked and Edge triggered Flip flops; Ripple counters and Synchronous counters; Binary, BCD and modulo counters, Shift Registers.
- COMPUTER FUNDAMENTALS:
- Generation of Computers: Functional Block Diagram of a Computer; Types of Computer, Hardware and Software, Components of a system: memory, CPU, I/O, Basic I/O methods, Generations of Computer, Generation of Programming languages, Language Translators - Compiler, Interpreter & Assembler, Hardware and Software, Application vs System Software, Operating System and its functions. Single user, multi-user, time-shared system.
- Computer Memory: Concept of sequential and random storage, RAM, ROM, EPROM, Auxiliary storage devices, Magnetic and optical discs. Cache memory, virtual memory.
- I/O Devices and Interfacing: Serial and parallel communication, Interfacing, Types of buses, I/O devices- keyboard, mouse, light pen, touch screen, VDU, LCD, dot matrix, laser and ink jet printers, plotters.
- COMPUTER ARCHITECTURE AND ORGANIZATION:
- Data Representation, Signed numbers, fixed and floating point numbers, binary number addition, subtraction, multiplication and division, Is and 2s complement method.
- Basic Computer Organization: CPU, Registers, ALU, System Buses, Memory organization and interleaving, memory hierarchy, Memory mapped and standard I/O, Programmed I/O, Interrupt driven I/O and DMA.
- Microprocessor Architecture: 8085 microprocessor architecture, pin diagram, Interrupts, Instructions, Addressing modes.
- PROGRAMMING IN C:
- Flowchart representation, algorithm, Stages in Program development; Low, middle and high level languages; Languages translators; Syntax and logical errors.
- Features of C Language: Variables, Data types, Operator, storage classes, Expressions, Library functions, C pre-processor, Control flow, arrays; structures; I/O operations, functions, macros, files and pointers.
- DATA STRUCTURE:
- Data structures, Representation and Implementation, Complexity calculation of algorithms, Linearity and Non-linearity of data structures.
- Linear Data Structures: Arrays, Ordered lists and their representations, List operations-Insertion, Deletion, Traversal; Stacks, Queues, Priority Queues, Linked lists, Doubly linked lists, Sparse matrix, representation Non-Linear data Structure: Binary Trees and their representation, Binary Tree traversals, Threaded Binary tress, Height balancing and AVL tree, union and find algorithms, Decision tree, Graphs and their representations, Graph search, Graph traversal, Connected Components and spanning trees, Shortest path.
- Searching and Sorting: Sequential search Binary search, Hashing, Chaining and symbol tables, Collision processing, Indexed search techniques, Bubble, Insertion, Quick, Radix and Heap Sort COMPUTER NETWORKS:
- Channel capacity, Baud & bit rate; Maximum data rate of a channel; MUX:TDM, FDM; Synchronous & asynchronous transmission; Data Transmission modes The electrical Interface: Attenuation & distortion sources, Signal types, Signal propagation delay, Transmission media-Wired & wireless, comparison of different transmission media, Concepts of modulation- AM, FM, PM, Digital signal modulation vs Analog signal modulation, Baseband & Broadband transmission.
- Data Networks: Circuit switching, Message Switching & Packet switching; Virtual circuit vs circuit switching; Network topology; Linear, Circular, Star, Tree & Graph, Ethernet, Token ring, Token bus & FDDI, ATM, Role of ATM in inter-networks; Network Protocol basics; Error control & link management; data link control protocols bit oriented & character oriented protocols; OSI model TCP/IP.
- Error detection & correction: Asynchronous data error detection; Data correction using parity, Erjor detection for synchronous transmission; Cheksum error detection; Hamming code, CRC.
- Network components: Switches, Hubs, Concentrators, Modem, Network interface card, Repeaters, Bridges, Routes and Gateways.
Test pattern
150 multiple choice questions for 300 marks in two hours, with no negative marking. The first 50 questions (2 marks each) are on general awareness, English, Hindi, reasoning and mental ability. The other 100 are on the two final-year subjects of graduation, 50 on each at 4 marks; the score in this subject is the common part plus its own 50 questions.
5% of the marks is cut for each gap year after graduation, up to 15%.
More PG courses at Allahabad University
M.Sc. BotanyM.Sc. ChemistryM.Sc. PhysicsM.Sc. Zoology
Questions about M.Sc. Computer Science
How many seats are there in M.Sc. Computer Science at Allahabad University?
30 seats for 2026-27: University of Allahabad main campus 30.
What is the eligibility for M.Sc. Computer Science at Allahabad University?
B.Sc. (three-year) or B.Sc. (Honours) with Computer Science, Computer Maintenance, Computer Application or Information Technology as a subject at least up to B.Sc. Part II.
Is M.Sc. Computer Science admission through CUET PG?
No. It is through PGAT-I of the university's own Post Graduate Admission Test (PGAT 2026), test code 17.
M.Sc. Computer Science at other Central Universities
13 Central Universities offer M.Sc. Computer Science, with 402 seats counted between them. Compare seats, fee and entrance of all 13
CUSB 45 seatsHNBGU 45 seatsCUO 38 seatsBHU 37 seatsGGV 35 seatsCUTN 31 seatsCUK 30 seatsCURAJ 30 seatsSAU 30 seatsAUS 20 seatsVBU 16 seatsDU
All M.Sc. coursesComputer Science and ITCourses through CUET (PG)B.Sc. Computer ScienceM.Tech. Computer ScienceCourse Finder
NAAC A
NAAC A+
NAAC A++
NAAC A++
NAAC A++
NAAC A++
NAAC A+
NAAC A+
