About this ABVV syllabus
This PDF contains the official syllabus "Computer Science" issued for students of Atal Bihari Vajpayee Vishwavidyalaya. It lists the papers, units, credits and marks distribution you need to study for your semester examinations.
How to study with the syllabus
- अपना सेमेस्टर और पेपर कोड ढूँढें (NEP में: DSC = मुख्य विषय, DSE = वैकल्पिक, GE = सामान्य वैकल्पिक, SEC = कौशल, VAC = मूल्य वर्धित, AEC = क्षमता संवर्धन)।
- सभी इकाइयों के नाम एक पेज पर लिखें और जो इकाई पूरी हो जाए उस पर ✓ लगाते जाएँ।
- हर इकाई को पिछले वर्षों के प्रश्न पत्रों से मिलाएँ, ताकि सबसे ज़रूरी टॉपिक पता चलें।
Syllabus contents (text version)
यह टेक्स्ट मूल PDF से लिया गया है ताकि आप इसे जल्दी पढ़ और खोज सकें। सूत्र, चित्र और हिंदी टेक्स्ट सही न दिखें तो ऊपर दी गई PDF देखें।
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,
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
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.
Control, Arrays, Structures, Union, String, Pointers, Functions, File Handling, Command
Line Argumaents, Preprocessors.
Object Oriented Programming: Class, Object, Instantiation, Inheritance, Encapsulation,
Abstract Class, Polymorphism.
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.
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,
Surfaces; Illumination Models, Polygon Rendering Methods, Viewing Pipeline and
Coordinates; General Projection Transforms and Cipping.
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,
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.
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,
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;
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.
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.
Task Set and Process Patterns; Process Lifecycle, Prescriptive Process Models, Project
Management, Component Based Development, Aspect-Oriented Software Development,
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.
Quality Assurance, Risk Management, Risk Mitigation, Monitoring and Management
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
Software Configuration Management: Change Control and Version Control; Software
Reuse, Software Re-engineering, Reverse Engineering.
Data Structures: Arrays and their Applications; Sparse Matrix, Stacks, Queues, Priority
Queues, Linked Lists, Trees, Forest, Binary Tree, Threaded Binary Tree, Binary Search Tree,
Algorithms; Hashing.
Performance Analysis of Algorithms and Recurrences:Time and Space Complexities;
Asymptotic Notation, Recurrence Relations.
Design Techniques: Divide and Conquer; Dynamic Programming, Greedy Algorithms,
Backtracking, Branch and Bound.
Lower Bound Theory: Comparison Trees, Lower Bounds through Reductions.
Graph Algorithms: Breadth-First Search, Depth-First Search, Shortest Paths, Maximum
Flow, Minimum Spanning Trees.
Selected Topics: Number Theoretic Algorithms, Polynomial Arithmetic, Fast Fourier
Transform, String Matching Algorithms.
Advanced Algorithms: Parallel Algorithms for Sorting, Searching and Merging,
Approximation Algorithms, Randomized Algorithms.
Theory of Computation: Formal Language, Non-Computational Problems, Diagonal
Regular Language Models: Deterministic Finite Automaton (DFA), Non-Deterministic
Finite Automaton (NDFA), Equivalence of DFA and NDFA, Regular Languages, Regular
Grammars, Regular Expressions, Properties of Regular Language, Pumping Lemma, Non-
Regular Languages, Lexical Analysis.
Context Free Language: Pushdown Automaton (PDA), Non-Deterministic Pushdown
Automaton (NPDA), Context Free Grammar, Chomsky Normal Form, Greibach Normal
Context Free Grammars; Properties of Context Free Language.
Turing Machines (TM): Standard Turing Machine and its Variations; Universal Turing
Machines, Models of Computation and Church-Turing Thesis; Recursive and Recursively