Syllabus: UGC NET Computer Science Paper - II) | Crash Course for UGC NET Computer science PDF Download

 Page 1


 
                                                
  
 
UNIVERSITY GRANTS COMMISSION 
NET BUREAU 
  
                                 NET SYLLABUS 
 
Subject : COMPUTER SCIENCE AND APPLICATIONS            
                                                                                            Code No.:(87) 
 
                                                                                                        
Unit - 1 : Discrete Structures and Optimization   
 
Mathematical Logic: Propositional and Predicate Logic, Propositional Equivalences, 
Normal Forms, Predicates and Quantifiers, Nested Quantifiers, Rules of Inference. 
 
Sets and Relations: Set Operations, Representation and Properties of Relations, 
Equivalence Relations, Partially Ordering. 
 
Counting, Mathematical Induction and Discrete Probability: Basics of Counting, 
Pigeonhole Principle, Permutations and Combinations, Inclusion- Exclusion Principle, 
Mathematical Induction, Probability, Bayes’ Theorem. 
 
Group Theory: Groups, Subgroups, Semi Groups, Product and Quotients of Algebraic 
Structures, Isomorphism, Homomorphism, Automorphism, Rings, Integral Domains, 
Fields, Applications of Group Theory. 
 
Graph Theory: Simple Graph, Multigraph, Weighted Graph, Paths and Circuits, Shortest 
Paths in Weighted Graphs, Eulerian Paths and Circuits, Hamiltonian Paths and Circuits, 
Planner graph, Graph Coloring, Bipartite Graphs, Trees and Rooted Trees, Prefix Codes, 
Tree Traversals, Spanning Trees and Cut-Sets. 
 
Boolean Algebra: Boolean Functions and its Representation, Simplifications of Boolean 
Functions. 
 
Optimization: Linear Programming - Mathematical Model, Graphical Solution, Simplex and  
Dual Simplex Method, Sensitive Analysis; Integer Programming, Transportation and 
Assignment Models, PERT-CPM: Diagram Representation, Critical Path Calculations, 
Resource Levelling, Cost Consideration in Project Scheduling. 
 
Unit - 2 : Computer System Architecture   
 
Page 2


 
                                                
  
 
UNIVERSITY GRANTS COMMISSION 
NET BUREAU 
  
                                 NET SYLLABUS 
 
Subject : COMPUTER SCIENCE AND APPLICATIONS            
                                                                                            Code No.:(87) 
 
                                                                                                        
Unit - 1 : Discrete Structures and Optimization   
 
Mathematical Logic: Propositional and Predicate Logic, Propositional Equivalences, 
Normal Forms, Predicates and Quantifiers, Nested Quantifiers, Rules of Inference. 
 
Sets and Relations: Set Operations, Representation and Properties of Relations, 
Equivalence Relations, Partially Ordering. 
 
Counting, Mathematical Induction and Discrete Probability: Basics of Counting, 
Pigeonhole Principle, Permutations and Combinations, Inclusion- Exclusion Principle, 
Mathematical Induction, Probability, Bayes’ Theorem. 
 
Group Theory: Groups, Subgroups, Semi Groups, Product and Quotients of Algebraic 
Structures, Isomorphism, Homomorphism, Automorphism, Rings, Integral Domains, 
Fields, Applications of Group Theory. 
 
Graph Theory: Simple Graph, Multigraph, Weighted Graph, Paths and Circuits, Shortest 
Paths in Weighted Graphs, Eulerian Paths and Circuits, Hamiltonian Paths and Circuits, 
Planner graph, Graph Coloring, Bipartite Graphs, Trees and Rooted Trees, Prefix Codes, 
Tree Traversals, Spanning Trees and Cut-Sets. 
 
Boolean Algebra: Boolean Functions and its Representation, Simplifications of Boolean 
Functions. 
 
Optimization: Linear Programming - Mathematical Model, Graphical Solution, Simplex and  
Dual Simplex Method, Sensitive Analysis; Integer Programming, Transportation and 
Assignment Models, PERT-CPM: Diagram Representation, Critical Path Calculations, 
Resource Levelling, Cost Consideration in Project Scheduling. 
 
Unit - 2 : Computer System Architecture   
 
2 
 
Digital Logic Circuits and Components: Digital Computers, Logic Gates, Boolean 
Algebra, Map Simplifications, Combinational Circuits, Flip-Flops, Sequential Circuits, 
Integrated Circuits, Decoders, Multiplexers, Registers and Counters, Memory Unit. 
 
Data Representation: Data Types, Number Systems and Conversion, Complements, Fixed 
Point Representation, Floating Point Representation, Error Detection Codes, Computer 
Arithmetic - Addition, Subtraction, Multiplication and Division Algorithms. 
 
Register Transfer and Microoperations: Register Transfer Language, Bus and Memory 
Transfers, Arithmetic, Logic and Shift Microoperations. 
 
Basic Computer Organization and Design: Stored Program Organization and Instruction 
Codes, Computer Registers, Computer Instructions, Timing and Control, Instruction Cycle, 
Memory-Reference Instructions, Input-Output, Interrupt. 
 
Programming the Basic Computer: Machine Language, Assembly Language, Assembler, 
Program Loops, Subroutines, Input-Output Programming. 
 
Microprogrammed Control: Control Memory, Address Sequencing, Design of Control 
Unit. 
 
Central Processing Unit: General Register Organization, Stack Organization, Instruction 
Formats, Addressing Modes, RISC Computer, CISC Computer. 
 
Pipeline and Vector Processing: Parallel Processing, Pipelining, Arithmetic Pipeline, 
Instruction Pipeline, Vector Processing Array Processors. 
 
Input-Output Organization: Peripheral Devices, Input-Output Interface, Asynchronous 
Data Transfer, Modes of Transfer, Priority Interrupt, DMA, Serial Communication. 
 
Memory Hierarchy: Main Memory, Auxillary Memory, Associative Memory, Cache 
Memory, Virtual Memory, Memory Management Hardware. 
 
Multiprocessors: Characteristics of Multiprocessors, Interconnection Structures, 
Interprocessor Arbitration, Interprocessor Communication and Synchronization, Cache 
Coherence, Multicore Processors. 
 
Unit - 3 : Programming Languages and Computer Graphics 
 
Language Design and Translation Issues: Programming Language Concepts, Paradigms 
and Models, Programming Environments, Virtual Computers and Binding Times, 
Programming Language Syntax, Stages in Translation, Formal Transition Models.  
 
Elementary Data Types: Properties of Types and Objects; Scalar and Composite Data 
Types. 
 
Programming in C: Tokens, Identifiers, Data Types, Sequence Control, Subprogram 
Control, Arrays, Structures, Union, String, Pointers, Functions, File Handling, Command 
Line Argumaents, Preprocessors. 
 
Page 3


 
                                                
  
 
UNIVERSITY GRANTS COMMISSION 
NET BUREAU 
  
                                 NET SYLLABUS 
 
Subject : COMPUTER SCIENCE AND APPLICATIONS            
                                                                                            Code No.:(87) 
 
                                                                                                        
Unit - 1 : Discrete Structures and Optimization   
 
Mathematical Logic: Propositional and Predicate Logic, Propositional Equivalences, 
Normal Forms, Predicates and Quantifiers, Nested Quantifiers, Rules of Inference. 
 
Sets and Relations: Set Operations, Representation and Properties of Relations, 
Equivalence Relations, Partially Ordering. 
 
Counting, Mathematical Induction and Discrete Probability: Basics of Counting, 
Pigeonhole Principle, Permutations and Combinations, Inclusion- Exclusion Principle, 
Mathematical Induction, Probability, Bayes’ Theorem. 
 
Group Theory: Groups, Subgroups, Semi Groups, Product and Quotients of Algebraic 
Structures, Isomorphism, Homomorphism, Automorphism, Rings, Integral Domains, 
Fields, Applications of Group Theory. 
 
Graph Theory: Simple Graph, Multigraph, Weighted Graph, Paths and Circuits, Shortest 
Paths in Weighted Graphs, Eulerian Paths and Circuits, Hamiltonian Paths and Circuits, 
Planner graph, Graph Coloring, Bipartite Graphs, Trees and Rooted Trees, Prefix Codes, 
Tree Traversals, Spanning Trees and Cut-Sets. 
 
Boolean Algebra: Boolean Functions and its Representation, Simplifications of Boolean 
Functions. 
 
Optimization: Linear Programming - Mathematical Model, Graphical Solution, Simplex and  
Dual Simplex Method, Sensitive Analysis; Integer Programming, Transportation and 
Assignment Models, PERT-CPM: Diagram Representation, Critical Path Calculations, 
Resource Levelling, Cost Consideration in Project Scheduling. 
 
Unit - 2 : Computer System Architecture   
 
2 
 
Digital Logic Circuits and Components: Digital Computers, Logic Gates, Boolean 
Algebra, Map Simplifications, Combinational Circuits, Flip-Flops, Sequential Circuits, 
Integrated Circuits, Decoders, Multiplexers, Registers and Counters, Memory Unit. 
 
Data Representation: Data Types, Number Systems and Conversion, Complements, Fixed 
Point Representation, Floating Point Representation, Error Detection Codes, Computer 
Arithmetic - Addition, Subtraction, Multiplication and Division Algorithms. 
 
Register Transfer and Microoperations: Register Transfer Language, Bus and Memory 
Transfers, Arithmetic, Logic and Shift Microoperations. 
 
Basic Computer Organization and Design: Stored Program Organization and Instruction 
Codes, Computer Registers, Computer Instructions, Timing and Control, Instruction Cycle, 
Memory-Reference Instructions, Input-Output, Interrupt. 
 
Programming the Basic Computer: Machine Language, Assembly Language, Assembler, 
Program Loops, Subroutines, Input-Output Programming. 
 
Microprogrammed Control: Control Memory, Address Sequencing, Design of Control 
Unit. 
 
Central Processing Unit: General Register Organization, Stack Organization, Instruction 
Formats, Addressing Modes, RISC Computer, CISC Computer. 
 
Pipeline and Vector Processing: Parallel Processing, Pipelining, Arithmetic Pipeline, 
Instruction Pipeline, Vector Processing Array Processors. 
 
Input-Output Organization: Peripheral Devices, Input-Output Interface, Asynchronous 
Data Transfer, Modes of Transfer, Priority Interrupt, DMA, Serial Communication. 
 
Memory Hierarchy: Main Memory, Auxillary Memory, Associative Memory, Cache 
Memory, Virtual Memory, Memory Management Hardware. 
 
Multiprocessors: Characteristics of Multiprocessors, Interconnection Structures, 
Interprocessor Arbitration, Interprocessor Communication and Synchronization, Cache 
Coherence, Multicore Processors. 
 
Unit - 3 : Programming Languages and Computer Graphics 
 
Language Design and Translation Issues: Programming Language Concepts, Paradigms 
and Models, Programming Environments, Virtual Computers and Binding Times, 
Programming Language Syntax, Stages in Translation, Formal Transition Models.  
 
Elementary Data Types: Properties of Types and Objects; Scalar and Composite Data 
Types. 
 
Programming in C: Tokens, Identifiers, Data Types, Sequence Control, Subprogram 
Control, Arrays, Structures, Union, String, Pointers, Functions, File Handling, Command 
Line Argumaents, Preprocessors. 
 
3 
 
Object Oriented Programming: Class, Object, Instantiation, Inheritance, Encapsulation, 
Abstract Class, Polymorphism. 
 
Programming in C++: Tokens, Identifiers, Variables and Constants; Data types, Operators, 
Control statements, Functions Parameter Passing, Virtual Functions, Class and Objects; 
Constructors and Destructors; Overloading, Inheritance, Templates, Exception and Event 
Handling; Streams and Files; Multifile Programs. 
 
Web Programming: HTML, DHTML, XML, Scripting, Java, Servlets, Applets. 
 
Computer Graphics: Video-Display Devices, Raster-Scan and Random-Scan Systems; 
Graphics Monitors, Input Devices, Points and Lines; Line Drawing Algorithms, Mid-Point 
Circle and Ellipse Algorithms; Scan Line Polygon Fill Algorithm, Boundary-Fill and Flood-
Fill.  
 
2-D Geometrical Transforms and Viewing: Translation, Scaling, Rotation, Reflection and 
Shear Transformations; Matrix Representations and Homogeneous Coordinates; Composite 
Transforms, Transformations Between Coordinate Systems, Viewing Pipeline, Viewing 
Coordinate Reference Frame, Window to View-Port Coordinate Transformation, Viewing 
Functions,  Line and Polygon Clipping Algorithms. 
 
3-D Object Representation, Geometric Transformations and Viewing: Polygon Surfaces, 
Quadric Surfaces, Spline Representation, Bezier and B-Spline Curves; Bezier and B-Spline 
Surfaces; Illumination Models, Polygon Rendering Methods, Viewing Pipeline and 
Coordinates;  General Projection Transforms and Cipping. 
 
Unit – 4 : Database Management Systems 
 
Database System Concepts and Architecture: Data Models, Schemas, and Instances; 
Three-Schema Architecture and Data Independence; Database Languages and Interfaces; 
Centralized and Client/Server Architectures for DBMS. 
 
Data Modeling: Entity-Relationship Diagram, Relational Model - Constraints, Languages, 
Design, and Programming, Relational Database Schemas, Update Operations and Dealing 
with Constraint Violations; Relational Algebra and Relational Calculus; Codd Rules. 
 
SQL: Data Definition and Data Types; Constraints, Queries, Insert, Delete, and Update 
Statements; Views, Stored Procedures and Functions;  Database Triggers, SQL Injection. 
 
Normalization for Relational Databases: Functional Dependencies and Normalization;  
Algorithms for Query Processing and Optimization; Transaction Processing, Concurrency 
Control Techniques, Database Recovery Techniques, Object and Object-Relational 
Databases; Database Security and Authorization.  
 
Enhanced Data Models: Temporal Database Concepts, Multimedia Databases, Deductive 
Databases, XML and Internet Databases; Mobile Databases, Geographic Information 
Systems, Genome Data Management, Distributed Databases and Client-Server Architectures. 
 
Data Warehousing and Data Mining: Data Modeling for Data Warehouses, Concept 
Hierarchy, OLAP and OLTP; Association Rules, Classification, Clustering, Regression, 
Page 4


 
                                                
  
 
UNIVERSITY GRANTS COMMISSION 
NET BUREAU 
  
                                 NET SYLLABUS 
 
Subject : COMPUTER SCIENCE AND APPLICATIONS            
                                                                                            Code No.:(87) 
 
                                                                                                        
Unit - 1 : Discrete Structures and Optimization   
 
Mathematical Logic: Propositional and Predicate Logic, Propositional Equivalences, 
Normal Forms, Predicates and Quantifiers, Nested Quantifiers, Rules of Inference. 
 
Sets and Relations: Set Operations, Representation and Properties of Relations, 
Equivalence Relations, Partially Ordering. 
 
Counting, Mathematical Induction and Discrete Probability: Basics of Counting, 
Pigeonhole Principle, Permutations and Combinations, Inclusion- Exclusion Principle, 
Mathematical Induction, Probability, Bayes’ Theorem. 
 
Group Theory: Groups, Subgroups, Semi Groups, Product and Quotients of Algebraic 
Structures, Isomorphism, Homomorphism, Automorphism, Rings, Integral Domains, 
Fields, Applications of Group Theory. 
 
Graph Theory: Simple Graph, Multigraph, Weighted Graph, Paths and Circuits, Shortest 
Paths in Weighted Graphs, Eulerian Paths and Circuits, Hamiltonian Paths and Circuits, 
Planner graph, Graph Coloring, Bipartite Graphs, Trees and Rooted Trees, Prefix Codes, 
Tree Traversals, Spanning Trees and Cut-Sets. 
 
Boolean Algebra: Boolean Functions and its Representation, Simplifications of Boolean 
Functions. 
 
Optimization: Linear Programming - Mathematical Model, Graphical Solution, Simplex and  
Dual Simplex Method, Sensitive Analysis; Integer Programming, Transportation and 
Assignment Models, PERT-CPM: Diagram Representation, Critical Path Calculations, 
Resource Levelling, Cost Consideration in Project Scheduling. 
 
Unit - 2 : Computer System Architecture   
 
2 
 
Digital Logic Circuits and Components: Digital Computers, Logic Gates, Boolean 
Algebra, Map Simplifications, Combinational Circuits, Flip-Flops, Sequential Circuits, 
Integrated Circuits, Decoders, Multiplexers, Registers and Counters, Memory Unit. 
 
Data Representation: Data Types, Number Systems and Conversion, Complements, Fixed 
Point Representation, Floating Point Representation, Error Detection Codes, Computer 
Arithmetic - Addition, Subtraction, Multiplication and Division Algorithms. 
 
Register Transfer and Microoperations: Register Transfer Language, Bus and Memory 
Transfers, Arithmetic, Logic and Shift Microoperations. 
 
Basic Computer Organization and Design: Stored Program Organization and Instruction 
Codes, Computer Registers, Computer Instructions, Timing and Control, Instruction Cycle, 
Memory-Reference Instructions, Input-Output, Interrupt. 
 
Programming the Basic Computer: Machine Language, Assembly Language, Assembler, 
Program Loops, Subroutines, Input-Output Programming. 
 
Microprogrammed Control: Control Memory, Address Sequencing, Design of Control 
Unit. 
 
Central Processing Unit: General Register Organization, Stack Organization, Instruction 
Formats, Addressing Modes, RISC Computer, CISC Computer. 
 
Pipeline and Vector Processing: Parallel Processing, Pipelining, Arithmetic Pipeline, 
Instruction Pipeline, Vector Processing Array Processors. 
 
Input-Output Organization: Peripheral Devices, Input-Output Interface, Asynchronous 
Data Transfer, Modes of Transfer, Priority Interrupt, DMA, Serial Communication. 
 
Memory Hierarchy: Main Memory, Auxillary Memory, Associative Memory, Cache 
Memory, Virtual Memory, Memory Management Hardware. 
 
Multiprocessors: Characteristics of Multiprocessors, Interconnection Structures, 
Interprocessor Arbitration, Interprocessor Communication and Synchronization, Cache 
Coherence, Multicore Processors. 
 
Unit - 3 : Programming Languages and Computer Graphics 
 
Language Design and Translation Issues: Programming Language Concepts, Paradigms 
and Models, Programming Environments, Virtual Computers and Binding Times, 
Programming Language Syntax, Stages in Translation, Formal Transition Models.  
 
Elementary Data Types: Properties of Types and Objects; Scalar and Composite Data 
Types. 
 
Programming in C: Tokens, Identifiers, Data Types, Sequence Control, Subprogram 
Control, Arrays, Structures, Union, String, Pointers, Functions, File Handling, Command 
Line Argumaents, Preprocessors. 
 
3 
 
Object Oriented Programming: Class, Object, Instantiation, Inheritance, Encapsulation, 
Abstract Class, Polymorphism. 
 
Programming in C++: Tokens, Identifiers, Variables and Constants; Data types, Operators, 
Control statements, Functions Parameter Passing, Virtual Functions, Class and Objects; 
Constructors and Destructors; Overloading, Inheritance, Templates, Exception and Event 
Handling; Streams and Files; Multifile Programs. 
 
Web Programming: HTML, DHTML, XML, Scripting, Java, Servlets, Applets. 
 
Computer Graphics: Video-Display Devices, Raster-Scan and Random-Scan Systems; 
Graphics Monitors, Input Devices, Points and Lines; Line Drawing Algorithms, Mid-Point 
Circle and Ellipse Algorithms; Scan Line Polygon Fill Algorithm, Boundary-Fill and Flood-
Fill.  
 
2-D Geometrical Transforms and Viewing: Translation, Scaling, Rotation, Reflection and 
Shear Transformations; Matrix Representations and Homogeneous Coordinates; Composite 
Transforms, Transformations Between Coordinate Systems, Viewing Pipeline, Viewing 
Coordinate Reference Frame, Window to View-Port Coordinate Transformation, Viewing 
Functions,  Line and Polygon Clipping Algorithms. 
 
3-D Object Representation, Geometric Transformations and Viewing: Polygon Surfaces, 
Quadric Surfaces, Spline Representation, Bezier and B-Spline Curves; Bezier and B-Spline 
Surfaces; Illumination Models, Polygon Rendering Methods, Viewing Pipeline and 
Coordinates;  General Projection Transforms and Cipping. 
 
Unit – 4 : Database Management Systems 
 
Database System Concepts and Architecture: Data Models, Schemas, and Instances; 
Three-Schema Architecture and Data Independence; Database Languages and Interfaces; 
Centralized and Client/Server Architectures for DBMS. 
 
Data Modeling: Entity-Relationship Diagram, Relational Model - Constraints, Languages, 
Design, and Programming, Relational Database Schemas, Update Operations and Dealing 
with Constraint Violations; Relational Algebra and Relational Calculus; Codd Rules. 
 
SQL: Data Definition and Data Types; Constraints, Queries, Insert, Delete, and Update 
Statements; Views, Stored Procedures and Functions;  Database Triggers, SQL Injection. 
 
Normalization for Relational Databases: Functional Dependencies and Normalization;  
Algorithms for Query Processing and Optimization; Transaction Processing, Concurrency 
Control Techniques, Database Recovery Techniques, Object and Object-Relational 
Databases; Database Security and Authorization.  
 
Enhanced Data Models: Temporal Database Concepts, Multimedia Databases, Deductive 
Databases, XML and Internet Databases; Mobile Databases, Geographic Information 
Systems, Genome Data Management, Distributed Databases and Client-Server Architectures. 
 
Data Warehousing and Data Mining: Data Modeling for Data Warehouses, Concept 
Hierarchy, OLAP and OLTP; Association Rules, Classification, Clustering, Regression, 
4 
 
Support Vector Machine, K-Nearest Neighbour, Hidden Markov Model, Summarization, 
Dependency Modeling,  Link Analysis,  Sequencing Analysis, Social Network Analysis.  
 
Big Data Systems: Big Data Characteristics, Types of Big Data, Big Data Architecture, 
Introduction to Map-Reduce and Hadoop;  Distributed File System, HDFS. 
NOSQL: NOSQL and Query Optimization; Different NOSQL Products, Querying and 
Managing NOSQL; Indexing and Ordering Data Sets; NOSQL in Cloud.  
 
Unit – 5 : System Software and Operating System 
 
System Software: Machine, Assembly and High-Level Languages; Compilers and 
Interpreters;  Loading, Linking and Relocation;  Macros, Debuggers. 
 
Basics of Operating Systems: Operating System Structure, Operations and Services; System 
Calls, Operating-System Design and Implementation; System Boot. 
Process Management: Process Scheduling and Operations; Interprocess Communication, 
Communication in Client–Server Systems, Process Synchronization, Critical-Section 
Problem, Peterson’s Solution, Semaphores, Synchronization. 
 
Threads: Multicore Programming, Multithreading Models, Thread Libraries, Implicit 
Threading, Threading  Issues.  
 
CPU Scheduling: Scheduling Criteria and Algorithms; Thread Scheduling, Multiple-
Processor Scheduling,  Real-Time CPU Scheduling. 
 
Deadlocks: Deadlock Characterization, Methods for Handling Deadlocks, Deadlock 
Prevention, Avoidance and Detection; Recovery from Deadlock. 
 
Memory Management: Contiguous Memory Allocation, Swapping, Paging, Segmentation, 
Demand Paging, Page Replacement, Allocation of Frames, Thrashing, Memory-Mapped 
Files. 
 
Storage Management: Mass-Storage Structure, Disk Structure, Scheduling and  
Management, RAID Structure. 
 
File and Input/Output Systems: Access Methods, Directory and Disk Structure; File-
System Mounting, File Sharing, File-System Structure and Implementation; Directory 
Implementation, Allocation Methods, Free-Space Management, Efficiency and Performance; 
Recovery, I/O Hardware, Application I/O Interface, Kernel I/O Subsystem, Transforming I/O 
Requests to Hardware Operations. 
 
Security: Protection, Access Matrix, Access Control, Revocation of Access Rights, Program 
Threats, System and Network Threats; Cryptography as a Security Tool, User Authentication, 
Implementing Security Defenses. 
 
Virtual Machines: Types of Virtual Machines and Implementations; Virtualization. 
  
Linux Operating Systems: Design Principles, Kernel Modules, Process Management, 
Scheduling, Memory Management, File Systems, Input and Output; Interprocess 
Communication,  Network Structure. 
Page 5


 
                                                
  
 
UNIVERSITY GRANTS COMMISSION 
NET BUREAU 
  
                                 NET SYLLABUS 
 
Subject : COMPUTER SCIENCE AND APPLICATIONS            
                                                                                            Code No.:(87) 
 
                                                                                                        
Unit - 1 : Discrete Structures and Optimization   
 
Mathematical Logic: Propositional and Predicate Logic, Propositional Equivalences, 
Normal Forms, Predicates and Quantifiers, Nested Quantifiers, Rules of Inference. 
 
Sets and Relations: Set Operations, Representation and Properties of Relations, 
Equivalence Relations, Partially Ordering. 
 
Counting, Mathematical Induction and Discrete Probability: Basics of Counting, 
Pigeonhole Principle, Permutations and Combinations, Inclusion- Exclusion Principle, 
Mathematical Induction, Probability, Bayes’ Theorem. 
 
Group Theory: Groups, Subgroups, Semi Groups, Product and Quotients of Algebraic 
Structures, Isomorphism, Homomorphism, Automorphism, Rings, Integral Domains, 
Fields, Applications of Group Theory. 
 
Graph Theory: Simple Graph, Multigraph, Weighted Graph, Paths and Circuits, Shortest 
Paths in Weighted Graphs, Eulerian Paths and Circuits, Hamiltonian Paths and Circuits, 
Planner graph, Graph Coloring, Bipartite Graphs, Trees and Rooted Trees, Prefix Codes, 
Tree Traversals, Spanning Trees and Cut-Sets. 
 
Boolean Algebra: Boolean Functions and its Representation, Simplifications of Boolean 
Functions. 
 
Optimization: Linear Programming - Mathematical Model, Graphical Solution, Simplex and  
Dual Simplex Method, Sensitive Analysis; Integer Programming, Transportation and 
Assignment Models, PERT-CPM: Diagram Representation, Critical Path Calculations, 
Resource Levelling, Cost Consideration in Project Scheduling. 
 
Unit - 2 : Computer System Architecture   
 
2 
 
Digital Logic Circuits and Components: Digital Computers, Logic Gates, Boolean 
Algebra, Map Simplifications, Combinational Circuits, Flip-Flops, Sequential Circuits, 
Integrated Circuits, Decoders, Multiplexers, Registers and Counters, Memory Unit. 
 
Data Representation: Data Types, Number Systems and Conversion, Complements, Fixed 
Point Representation, Floating Point Representation, Error Detection Codes, Computer 
Arithmetic - Addition, Subtraction, Multiplication and Division Algorithms. 
 
Register Transfer and Microoperations: Register Transfer Language, Bus and Memory 
Transfers, Arithmetic, Logic and Shift Microoperations. 
 
Basic Computer Organization and Design: Stored Program Organization and Instruction 
Codes, Computer Registers, Computer Instructions, Timing and Control, Instruction Cycle, 
Memory-Reference Instructions, Input-Output, Interrupt. 
 
Programming the Basic Computer: Machine Language, Assembly Language, Assembler, 
Program Loops, Subroutines, Input-Output Programming. 
 
Microprogrammed Control: Control Memory, Address Sequencing, Design of Control 
Unit. 
 
Central Processing Unit: General Register Organization, Stack Organization, Instruction 
Formats, Addressing Modes, RISC Computer, CISC Computer. 
 
Pipeline and Vector Processing: Parallel Processing, Pipelining, Arithmetic Pipeline, 
Instruction Pipeline, Vector Processing Array Processors. 
 
Input-Output Organization: Peripheral Devices, Input-Output Interface, Asynchronous 
Data Transfer, Modes of Transfer, Priority Interrupt, DMA, Serial Communication. 
 
Memory Hierarchy: Main Memory, Auxillary Memory, Associative Memory, Cache 
Memory, Virtual Memory, Memory Management Hardware. 
 
Multiprocessors: Characteristics of Multiprocessors, Interconnection Structures, 
Interprocessor Arbitration, Interprocessor Communication and Synchronization, Cache 
Coherence, Multicore Processors. 
 
Unit - 3 : Programming Languages and Computer Graphics 
 
Language Design and Translation Issues: Programming Language Concepts, Paradigms 
and Models, Programming Environments, Virtual Computers and Binding Times, 
Programming Language Syntax, Stages in Translation, Formal Transition Models.  
 
Elementary Data Types: Properties of Types and Objects; Scalar and Composite Data 
Types. 
 
Programming in C: Tokens, Identifiers, Data Types, Sequence Control, Subprogram 
Control, Arrays, Structures, Union, String, Pointers, Functions, File Handling, Command 
Line Argumaents, Preprocessors. 
 
3 
 
Object Oriented Programming: Class, Object, Instantiation, Inheritance, Encapsulation, 
Abstract Class, Polymorphism. 
 
Programming in C++: Tokens, Identifiers, Variables and Constants; Data types, Operators, 
Control statements, Functions Parameter Passing, Virtual Functions, Class and Objects; 
Constructors and Destructors; Overloading, Inheritance, Templates, Exception and Event 
Handling; Streams and Files; Multifile Programs. 
 
Web Programming: HTML, DHTML, XML, Scripting, Java, Servlets, Applets. 
 
Computer Graphics: Video-Display Devices, Raster-Scan and Random-Scan Systems; 
Graphics Monitors, Input Devices, Points and Lines; Line Drawing Algorithms, Mid-Point 
Circle and Ellipse Algorithms; Scan Line Polygon Fill Algorithm, Boundary-Fill and Flood-
Fill.  
 
2-D Geometrical Transforms and Viewing: Translation, Scaling, Rotation, Reflection and 
Shear Transformations; Matrix Representations and Homogeneous Coordinates; Composite 
Transforms, Transformations Between Coordinate Systems, Viewing Pipeline, Viewing 
Coordinate Reference Frame, Window to View-Port Coordinate Transformation, Viewing 
Functions,  Line and Polygon Clipping Algorithms. 
 
3-D Object Representation, Geometric Transformations and Viewing: Polygon Surfaces, 
Quadric Surfaces, Spline Representation, Bezier and B-Spline Curves; Bezier and B-Spline 
Surfaces; Illumination Models, Polygon Rendering Methods, Viewing Pipeline and 
Coordinates;  General Projection Transforms and Cipping. 
 
Unit – 4 : Database Management Systems 
 
Database System Concepts and Architecture: Data Models, Schemas, and Instances; 
Three-Schema Architecture and Data Independence; Database Languages and Interfaces; 
Centralized and Client/Server Architectures for DBMS. 
 
Data Modeling: Entity-Relationship Diagram, Relational Model - Constraints, Languages, 
Design, and Programming, Relational Database Schemas, Update Operations and Dealing 
with Constraint Violations; Relational Algebra and Relational Calculus; Codd Rules. 
 
SQL: Data Definition and Data Types; Constraints, Queries, Insert, Delete, and Update 
Statements; Views, Stored Procedures and Functions;  Database Triggers, SQL Injection. 
 
Normalization for Relational Databases: Functional Dependencies and Normalization;  
Algorithms for Query Processing and Optimization; Transaction Processing, Concurrency 
Control Techniques, Database Recovery Techniques, Object and Object-Relational 
Databases; Database Security and Authorization.  
 
Enhanced Data Models: Temporal Database Concepts, Multimedia Databases, Deductive 
Databases, XML and Internet Databases; Mobile Databases, Geographic Information 
Systems, Genome Data Management, Distributed Databases and Client-Server Architectures. 
 
Data Warehousing and Data Mining: Data Modeling for Data Warehouses, Concept 
Hierarchy, OLAP and OLTP; Association Rules, Classification, Clustering, Regression, 
4 
 
Support Vector Machine, K-Nearest Neighbour, Hidden Markov Model, Summarization, 
Dependency Modeling,  Link Analysis,  Sequencing Analysis, Social Network Analysis.  
 
Big Data Systems: Big Data Characteristics, Types of Big Data, Big Data Architecture, 
Introduction to Map-Reduce and Hadoop;  Distributed File System, HDFS. 
NOSQL: NOSQL and Query Optimization; Different NOSQL Products, Querying and 
Managing NOSQL; Indexing and Ordering Data Sets; NOSQL in Cloud.  
 
Unit – 5 : System Software and Operating System 
 
System Software: Machine, Assembly and High-Level Languages; Compilers and 
Interpreters;  Loading, Linking and Relocation;  Macros, Debuggers. 
 
Basics of Operating Systems: Operating System Structure, Operations and Services; System 
Calls, Operating-System Design and Implementation; System Boot. 
Process Management: Process Scheduling and Operations; Interprocess Communication, 
Communication in Client–Server Systems, Process Synchronization, Critical-Section 
Problem, Peterson’s Solution, Semaphores, Synchronization. 
 
Threads: Multicore Programming, Multithreading Models, Thread Libraries, Implicit 
Threading, Threading  Issues.  
 
CPU Scheduling: Scheduling Criteria and Algorithms; Thread Scheduling, Multiple-
Processor Scheduling,  Real-Time CPU Scheduling. 
 
Deadlocks: Deadlock Characterization, Methods for Handling Deadlocks, Deadlock 
Prevention, Avoidance and Detection; Recovery from Deadlock. 
 
Memory Management: Contiguous Memory Allocation, Swapping, Paging, Segmentation, 
Demand Paging, Page Replacement, Allocation of Frames, Thrashing, Memory-Mapped 
Files. 
 
Storage Management: Mass-Storage Structure, Disk Structure, Scheduling and  
Management, RAID Structure. 
 
File and Input/Output Systems: Access Methods, Directory and Disk Structure; File-
System Mounting, File Sharing, File-System Structure and Implementation; Directory 
Implementation, Allocation Methods, Free-Space Management, Efficiency and Performance; 
Recovery, I/O Hardware, Application I/O Interface, Kernel I/O Subsystem, Transforming I/O 
Requests to Hardware Operations. 
 
Security: Protection, Access Matrix, Access Control, Revocation of Access Rights, Program 
Threats, System and Network Threats; Cryptography as a Security Tool, User Authentication, 
Implementing Security Defenses. 
 
Virtual Machines: Types of Virtual Machines and Implementations; Virtualization. 
  
Linux Operating Systems: Design Principles, Kernel Modules, Process Management, 
Scheduling, Memory Management, File Systems, Input and Output; Interprocess 
Communication,  Network Structure. 
5 
 
 
Windows Operating Systems: Design Principles, System Components, Terminal Services 
and Fast User Switching;  File System,  Networking.  
 
Distributed Systems: Types of Network based Operating Systems, Network Structure, 
Communication Structure and Protocols; Robustness, Design Issues, Distributed File 
Systems. 
 
Unit – 6 : Software Engineering 
 
Software Process Models: Software Process, Generic Process Model – Framework Activity, 
Task Set and Process Patterns; Process Lifecycle, Prescriptive Process Models, Project 
Management, Component Based Development, Aspect-Oriented Software Development, 
Formal Methods, Agile Process Models – Extreme Programming (XP), Adptive Software 
Development, Scrum, Dynamic System Development Model,  Feature  Driven Development, 
Crystal,  Web Engineering. 
 
Software Requirements: Functional and Non-Functional Requirements;  Eliciting 
Requirements, Developing Use Cases, Requirement Analysis and Modelling;  Requirements 
Review, Software Requirment and Specification (SRS) Document.   
 
Software Design: Abstraction, Architecture, Patterns, Separation of Concerns, Modularity, 
Information Hiding, Functional Independence, Cohesion and Coupling; Object-Oriented 
Design, Data Design, Architectural Design, User Interface Design, Component  Level 
Design. 
 
Software Quality: McCall’s Quality Factors, ISO 9126 Quality Factors, Quality Control, 
Quality Assurance,  Risk Management, Risk Mitigation, Monitoring and Management 
(RMMM);  Software Reliability. 
 
Estimation and Scheduling of Software Projects: Software Sizing, LOC and FP based 
Estimations; Estimating Cost and Effort; Estimation Models, Constructive Cost Model 
(COCOMO),  Project Scheduling and Staffing;  Time-line Charts. 
 
Software Testing: Verification and Validation; Error, Fault, Bug and Failure; Unit and 
Integration Tesing; White-box and Black-box Testing;  Basis Path Testing, Control Structure 
Testing, Deriving Test Cases,  Alpha and Beta Testing;  Regression Testing, Performance 
Testing, Stress Testing. 
 
Software Configuration Management: Change Control and Version Control; Software 
Reuse, Software Re-engineering,  Reverse Engineering. 
 
Unit – 7 : Data Structures and Algorithms 
 
Data Structures: Arrays and their Applications; Sparse Matrix, Stacks, Queues, Priority 
Queues, Linked Lists, Trees, Forest, Binary Tree, Threaded Binary Tree, Binary Search Tree, 
AVL Tree, B Tree, B+ Tree, B* Tree, Data Structure for Sets, Graphs, Sorting and Searching 
Algorithms; Hashing.