Syllabus for each program is different. We are providing few of the syllabuses. For more information regarding syllabus please visit official website of JMI.
For BA (Mass Media)
Part- A |
General knowledge, Current Affairs & Contemporary National and International Events |
Part-B |
General knowledge & Current Affairs, Literature and Culture, General awareness of Media Hindi Newspapers and Magazines, Radio, Television Programs, Film and Advertisements. |
For M.Tech(Computer Engineering)
Discrete Mathematics: |
Set theory, Relations, Algebraic structures: semigroups, monoids, groups; Counting, Recurrence relations, Generating functions, Propositional logic, Graph theory: connectivity, spanning trees, isomorphism, euler & hamiltonian circuits, planarity and colouring. |
Data Structures and Programming: |
Programming in C & C++, Abstract data types, Stacks, Queues, Linked lists, Trees, BST, Heaps, Basics of Sorting, Searching & Hashing. |
Object Oriented Programming |
Object oriented methodologies, Objects, classes, Inheritance, Polymorphism. |
Algorithms |
Asymptotic notations, Time complexity analyses, Analysis of Sorting and Searching techniques, Ranking of functions, Algorithm design strategies: divide-and-conquer, greedyapproach, dynamic programming; Trees and graphs traversals, Shortest paths, Basic of complexity classes – P, NP, NP-hard, NP-complete. |
Software Engineering |
Software requirement specifications, Software process models, Process life cycle, Metrics &Estimation techniques, Software modelling, Software design, Software coding, Software testing, Software maintenance. |
Digital Logic |
Number systems, Boolean algebra, Design of combinational & sequential circuits, minimizations, Logic functions, Minimization, Design of combinational and sequential circuits, fixed and floating point number representation & arithmetic, Digital system design. |
Computer Organization and Architecture |
Addressing modes, ALU and CPU design, Memories: cache, main memory, secondary storage; I/O interface: mapping, interrupts & DMA technique; Pipelining and parallelism. |
Theory of Computation |
Automata theory, Regular expressions & languages, Context free Grammer & Push-down automata, Pumping lemma, Turing machines, Undecidability. |
Compiler Design |
Lexical analysis, Parsing, Syntax directed translation, Runtime environments, Intermediate and target code generation, Code optimization. |
Operating System |
Processes, Threads, Inter-process communication, Scheduling, Concurrency, Synchronization, Deadlock, Memory management and virtual memory, File systems, I/O systems. |
Database |
Database models, Relational model: algebra & calculus; Database design and normalizations, Transaction management & concurrency control, SQL, File structures: sequential files, indexing, B & B+ trees |
Computer Networks |
ISO/OSI and TCP/IP Layering stack, Network technologies, Framing, Switching, Addressing schemes: IPv4 & IPv6, Routing techniques, Congestion and Flow control, TCP/UDP, Application layer protocols, Basics of wireless networks, Mathematics of cryptography, Authorization, Authentication, Symmetric cryptography, Asymmetric cryptography, Digital signatures |