Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
218 views3 pages

? IIT JAM Computer Science Syllabus (CS)

The IIT JAM Computer Science syllabus covers ten key areas including Programming and Data Structures, Discrete Mathematics, Digital Logic, Computer Organization and Architecture, Operating Systems, Databases, Computer Networks, Software Engineering, Mathematics for Computer Science, and Theory of Computation. Each area includes essential topics such as algorithms, logic gates, memory management, SQL, networking protocols, and finite automata. This comprehensive syllabus is designed to prepare students for advanced studies in computer science.

Uploaded by

ratherfazil3
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
218 views3 pages

? IIT JAM Computer Science Syllabus (CS)

The IIT JAM Computer Science syllabus covers ten key areas including Programming and Data Structures, Discrete Mathematics, Digital Logic, Computer Organization and Architecture, Operating Systems, Databases, Computer Networks, Software Engineering, Mathematics for Computer Science, and Theory of Computation. Each area includes essential topics such as algorithms, logic gates, memory management, SQL, networking protocols, and finite automata. This comprehensive syllabus is designed to prepare students for advanced studies in computer science.

Uploaded by

ratherfazil3
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

🖥

IIT JAM Computer Science Syllabus (CS)

1. Programming and Data Structures


• C programming: Data types, operators, expressions, control flow, functions,
recursion, arrays, strings, pointers, structures.
• Object Oriented Programming Concepts
• Data Structures: Arrays, linked lists, stacks, queues, trees, binary search
trees, heaps, graphs.
• Operations on Data Structures: Insertion, deletion, traversal, searching,
sorting.
• Algorithms: Time and space complexity, big-O notation, worst-case/
average-case/best-case analysis.

2. Discrete Mathematics
• Set theory, Relations and Functions
• Mathematical logic: Propositional logic, truth tables, logical equivalence,
predicates, quantifiers.
• Combinatorics: Permutations and combinations, pigeonhole principle,
inclusion-exclusion principle.
• Graph Theory: Graphs, trees, connectivity, Euler and Hamiltonian paths,
graph coloring, spanning trees.
• Boolean Algebra

3. Digital Logic
• Number Systems: Binary, octal, hexadecimal, 2’s complement.
• Logic Gates and Circuits
• Combinational and Sequential Circuits
• Flip-flops, Counters, Multiplexers, Decoders

4. Computer Organization and Architecture


• Basic architecture of a computer
• Memory hierarchy
• Cache memory
• Instruction formats and addressing modes
• Assembly language basics
• Data path and control unit
• Input/Output Organization

5. Operating System
• Basic concepts
• Processes, Threads, CPU scheduling
• Deadlocks: Detection, Prevention, Avoidance
• Memory management: Paging, Segmentation, Virtual Memory
• File systems, I/O systems

6. Databases
• Relational Model
• Entity-Relationship Model
• SQL: Queries, Joins, Subqueries
• Normalization
• Transaction management

7. Computer Networks
• OSI and TCP/IP models
• Basics of Networking: IP addressing, Subnetting
• Routing and switching
• Protocols: TCP, UDP, HTTP, FTP, etc.

8. Software Engineering
• Software Development Life Cycle (SDLC)
• Waterfall, Agile, Spiral Models
• Software Testing: Unit, Integration, System Testing
• Requirements analysis and design

9. Mathematics for Computer Science


• Matrices and Determinants
• Linear Algebra: Vector spaces, linear dependence/independence, basis,
rank.
• Probability and Statistics
• Limits, continuity, and differentiation
• Integration and differential equations

10. Theory of Computation


• Finite Automata (DFA, NFA)
• Regular Expressions
• Context-Free Grammars and Pushdown Automata
• Turing Machines
• Undecidability and NP-Completeness

You might also like