UGC/CBSE NET recommended books for Computer Science(code 87)-with FREE download
Paper pattern
Session
|
Paper
|
Marks
|
Number of Question
|
Duration
|
|---|---|---|---|---|
| First | I | 100 | 60 out of which 50 question to be attempted | 1¼ Hours |
| First | II | 100 | 50 questions all are compulsory | 1¼ Hours |
| Second | III | 150 | 75 questions all are compulsory | 2½ Hours |
Syllabus
SyllabusPaper II Syllabus
1. Discrete Structures
Sets, Relations, Functions. Pigeonhole Principle, Inclusion-Exclusion Principle, Equivalence and Partial Orderings, Elementary Counting Techniques, Probability. Measure (s) for information and Mutual information.
Computability: Models of computation-Finite Automata, Pushdown Automata, Non – determinism and NFA, DPDA and PDAs and Languages accepted by these structures. Grammars, Languages, Non – computability and Examples of non – computable problems.
Graph : Definition, walks, paths, trails, connected graphs, regular and bipartite graphs, cycles and circuits. Tree and rooted tree. Spanning trees. Eccentricity of a vertex radius and diameter of a graph. Central Graphs. Centres of a tree. Hamiltonian and Eulerian graphs, Planar graphs.
Groups : Finite fields and Error correcting / detecting codes.
2. Computer Arithmetic
Propositional (Boolean) Logic, Predicate Logic, Well – formed – formulae (WFF), Satisfiability and Tautology.
Logic Families: TTL, ECL and C – MOS gates. Boolean algebra and Minimization of Boolean functions. Flip-flops – types, race condition and comparison. Design of combinational and sequential circuits.
Representation of Integers : Octal, Hex, Decimal, and Binary. 2′s complement and 1′s complement arithmetic. Floating point representation.
3. Programming in C and C++
Programming in C: Elements of C – Tokens, identifiers, data types in C. Control structures in C. Sequence, selection and iteration(s). Structured data types in C-arrays, struct, union, string, and pointers.
O – O Programming Concepts: Class, object, instantiation. Inheritance, polymorphism and overloading.
C++ Programming: Elements of C++ – Tokens, identifiers. Variables and constants, Datatypes, Operators, Control statements. Functions parameter passing. Class and objects. Constructors and destructors. Overloading, Inheritance, Templates, Exception handling.
4. Relational Database Design and SQL
E-R diagrams and their transformation to relational design, normalization – INF, 2NF, 3NF, BCNF and 4NF. Limitations of 4NF and BCNF.
SQL: Data Definition Language (DDL), Data Manipulation Language (DML), Data Control Language (DCL) commands. Database objects like-Views, indexes, sequences, synonyms, data dictionary.
5. Data and File structures
Data, Information, Definition of data structure. Arrays, stacks, queues, linked lists, trees, graphs, priority queues and heaps.
File Structures: Fields, records and files. Sequential, direct, index-sequential and relative files. Hashing, inverted lists and multi – lists. B trees and B+ trees.
6. Computer Networks
Network fundamentals : Local Area Networks (LAN), Metropolitan Area Networks (MAN), Wide Area Networks (WAN), Wireless Networks, Inter Networks.
Reference Models: The OSI model, TCP / IP model.
Data Communication: Channel capacity. Transmission media-twisted pair, coaxial cables, fibre – optic cables, wireless transmission-radio, microwave, infrared and millimeter waves. Lightwave transmission. Thelephones – local loop, trunks, multiplexing, switching, narrowband ISDN, broadband ISDN, ATM, High speed LANS. Cellular Radio. Communication satellites-geosynchronous and low-orbit.
Internetworking: Switch / Hub, Bridge, Router, Gateways, Concatenated virtual circuits, Tunnelling, Fragmentation, Firewalls.
Routing: Virtual circuits and datagrams. Routing algorithms. Conjestion control.
Network Security: Cryptography-public key, secret key. Domain Name System ( DNS ) – Electronic Mail and Worldwide Web ( WWW ). The DNS, Resource Records, Name servers. E-mail-architecture and Serves.
7. System Software and Compilers
Assembly language fundamentals ( 8085 based assembly language programming ). Assemblers-2-pass and single-pass. Macros and macroprocessors.
Loading, linking, relocation, program relocatability. Linkage editing.
Text editors. Programming Environments. Debuggers and program generators.
Compilation and Interpretation. Bootstrap compilers. Phases of compilation process. Lexical analysis. Lex package on Unix system.
Context free grammars. Parsing and parse trees. Representation of parse ( derivation ) trees as rightmost and leftmost derivations. Bottom up parsers-shift-reduce, operator precedence, and LR. YACC package on Unix system.
Topdown parsers-left recursion and its removal. Recursive descent parser. Predictive parser. Intermediate codes-Quadruples, Triples, Intermediate code generation, Code generation, Code optimization.
8. Operating Systems (with Case Study of Unix)www.netugc.com
Main functions of operating systems. Multiprogramming, multiprocessing, and multitasking.
Memory Management: Virtual memory, paging, fragmentation.
Concurrent Processing: Mutual exclusion. Critical regions, lock and unlock.
Scheduling: CPU scheduling, I / O scheduling, Resource scheduling. Deadlock and scheduling algorithms. Banker’s algorithm for deadlock handling.
UNIX: The Unix System : File system, process management, bourne shell, shell variables, command line programming.
Filters and Commands : Pr, head, tail, cut, paste, sort, uniq, tr, join, etc., grep, egrep, fgrep, etc., sed, awk, etc.
System Calls ( like ) : Creat, open, close, read, write, iseek, link, unlink, stat, fstat, umask, chmod, exec, fork, wait, system.
9. Software Engineering
System Development Life Cycle (SDLC) : Steps, Water fall model, Prototypes, Spiral model.
Software Metrics: Software Project Management.
Software Design: System design, detailed design, function oriented design, object oriented design, user interface design. Design level metrics.
Coding and Testing: Testing level metrics. Software quality and reliability. Clean room approach, software reengineering.
10. Current Trends and Technologies
The topics of current interest in Computer Science and Computer Applications shall be covered. The experts shall use their judgement from time to time to include the topics of popular interest, which are expected to be known for an application development software professional, currently, they include:
Parallel Computing: Parallel virtual machine ( pvm ) and message passing interface ( MPI ) libraries and calls. Advanced architectures. Today’s fastest computers.
Mobile Computing: Mobile connectivity – Cells, Framework, wireless delivery technology and switching methods, mobile information access devices, mobile data internetworking standards, cellular data communication protocols, mobile computing applications. Mobile databases – protocols, scope, tools and technology. M-business.
E – Technologies
Electronic Commerce: Framework, Media Convergence of Applications, Consumer Applications, Organisation Applications.
Electronic Payment Systems: Digital Token, Smart Cards, Credit Cards, Risks in Electronic Payment System, Designing Electronic Payment Systems.
Electronic Data Interchange (EDI): Concepts, Applications, (Legal, Security and Privacy) issues, EDI and Electronic Commerce, Standardization and EDI, EDI Software Implementation, EDI Envelope for Message Transport, Internet – Based EDI.
Digital Libraries and Data Warehousing: Concepts, Types of Digital documents, Issues behind document Infrastructure, Corporate Data Warehouses.
Software Agents: Characteristics and Properties of Agents, Technology behind Software Agents (Applets, Browsers and Software Agents).
Broadband Telecommunications: Concepts, Frame Relay, Cell Relay, Switched Multimegabit Data Service, Asynchronous Transfer Mode.
Main concepts in Geographical Information System (GIS), E – cash, E – Business, ERP packages.
Data Warehousing: Data Warehouse environment, architecture of a data warehouse methodology, analysis, design, construction and administration.
Data Mining: Extracting models and patterns from large databases, data mining techniques, classification, regression, clustering, summarization, dependency modelling, link analysis, sequencing analysis, mining scientific and business data.
Windows Programming:
Introduction to Windows programming – Win32, Microsoft Foundation Classes (MFC), Documents and views, Resources, Message handling in windows.
Simple Applications (in windows) : Scrolling, splitting views, docking toolbars, status bars, common dialogs.
Advanced Windows Programming:
Multiple Document Interface ( MDI ), Multithreading. Object linking and Embedding (OLE). Active X controls. Active Template Library (ATL). Network programming.
1. Discrete Structures
Sets, Relations, Functions. Pigeonhole Principle, Inclusion-Exclusion Principle, Equivalence and Partial Orderings, Elementary Counting Techniques, Probability. Measure (s) for information and Mutual information.
Computability: Models of computation-Finite Automata, Pushdown Automata, Non – determinism and NFA, DPDA and PDAs and Languages accepted by these structures. Grammars, Languages, Non – computability and Examples of non – computable problems.
Graph : Definition, walks, paths, trails, connected graphs, regular and bipartite graphs, cycles and circuits. Tree and rooted tree. Spanning trees. Eccentricity of a vertex radius and diameter of a graph. Central Graphs. Centres of a tree. Hamiltonian and Eulerian graphs, Planar graphs.
Groups : Finite fields and Error correcting / detecting codes.
2. Computer Arithmetic
Propositional (Boolean) Logic, Predicate Logic, Well – formed – formulae (WFF), Satisfiability and Tautology.
Logic Families: TTL, ECL and C – MOS gates. Boolean algebra and Minimization of Boolean functions. Flip-flops – types, race condition and comparison. Design of combinational and sequential circuits.
Representation of Integers : Octal, Hex, Decimal, and Binary. 2′s complement and 1′s complement arithmetic. Floating point representation.
3. Programming in C and C++
Programming in C: Elements of C – Tokens, identifiers, data types in C. Control structures in C. Sequence, selection and iteration(s). Structured data types in C-arrays, struct, union, string, and pointers.
O – O Programming Concepts: Class, object, instantiation. Inheritance, polymorphism and overloading.
C++ Programming: Elements of C++ – Tokens, identifiers. Variables and constants, Datatypes, Operators, Control statements. Functions parameter passing. Class and objects. Constructors and destructors. Overloading, Inheritance, Templates, Exception handling.
4. Relational Database Design and SQL
E-R diagrams and their transformation to relational design, normalization – INF, 2NF, 3NF, BCNF and 4NF. Limitations of 4NF and BCNF.
SQL: Data Definition Language (DDL), Data Manipulation Language (DML), Data Control Language (DCL) commands. Database objects like-Views, indexes, sequences, synonyms, data dictionary.
5. Data and File structures
Data, Information, Definition of data structure. Arrays, stacks, queues, linked lists, trees, graphs, priority queues and heaps.
File Structures: Fields, records and files. Sequential, direct, index-sequential and relative files. Hashing, inverted lists and multi – lists. B trees and B+ trees.
6. Computer Networks
Network fundamentals : Local Area Networks (LAN), Metropolitan Area Networks (MAN), Wide Area Networks (WAN), Wireless Networks, Inter Networks.
Reference Models: The OSI model, TCP / IP model.
Data Communication: Channel capacity. Transmission media-twisted pair, coaxial cables, fibre – optic cables, wireless transmission-radio, microwave, infrared and millimeter waves. Lightwave transmission. Thelephones – local loop, trunks, multiplexing, switching, narrowband ISDN, broadband ISDN, ATM, High speed LANS. Cellular Radio. Communication satellites-geosynchronous and low-orbit.
Internetworking: Switch / Hub, Bridge, Router, Gateways, Concatenated virtual circuits, Tunnelling, Fragmentation, Firewalls.
Routing: Virtual circuits and datagrams. Routing algorithms. Conjestion control.
Network Security: Cryptography-public key, secret key. Domain Name System ( DNS ) – Electronic Mail and Worldwide Web ( WWW ). The DNS, Resource Records, Name servers. E-mail-architecture and Serves.
7. System Software and Compilers
Assembly language fundamentals ( 8085 based assembly language programming ). Assemblers-2-pass and single-pass. Macros and macroprocessors.
Loading, linking, relocation, program relocatability. Linkage editing.
Text editors. Programming Environments. Debuggers and program generators.
Compilation and Interpretation. Bootstrap compilers. Phases of compilation process. Lexical analysis. Lex package on Unix system.
Context free grammars. Parsing and parse trees. Representation of parse ( derivation ) trees as rightmost and leftmost derivations. Bottom up parsers-shift-reduce, operator precedence, and LR. YACC package on Unix system.
Topdown parsers-left recursion and its removal. Recursive descent parser. Predictive parser. Intermediate codes-Quadruples, Triples, Intermediate code generation, Code generation, Code optimization.
8. Operating Systems (with Case Study of Unix)www.netugc.com
Main functions of operating systems. Multiprogramming, multiprocessing, and multitasking.
Memory Management: Virtual memory, paging, fragmentation.
Concurrent Processing: Mutual exclusion. Critical regions, lock and unlock.
Scheduling: CPU scheduling, I / O scheduling, Resource scheduling. Deadlock and scheduling algorithms. Banker’s algorithm for deadlock handling.
UNIX: The Unix System : File system, process management, bourne shell, shell variables, command line programming.
Filters and Commands : Pr, head, tail, cut, paste, sort, uniq, tr, join, etc., grep, egrep, fgrep, etc., sed, awk, etc.
System Calls ( like ) : Creat, open, close, read, write, iseek, link, unlink, stat, fstat, umask, chmod, exec, fork, wait, system.
9. Software Engineering
System Development Life Cycle (SDLC) : Steps, Water fall model, Prototypes, Spiral model.
Software Metrics: Software Project Management.
Software Design: System design, detailed design, function oriented design, object oriented design, user interface design. Design level metrics.
Coding and Testing: Testing level metrics. Software quality and reliability. Clean room approach, software reengineering.
10. Current Trends and Technologies
The topics of current interest in Computer Science and Computer Applications shall be covered. The experts shall use their judgement from time to time to include the topics of popular interest, which are expected to be known for an application development software professional, currently, they include:
Parallel Computing: Parallel virtual machine ( pvm ) and message passing interface ( MPI ) libraries and calls. Advanced architectures. Today’s fastest computers.
Mobile Computing: Mobile connectivity – Cells, Framework, wireless delivery technology and switching methods, mobile information access devices, mobile data internetworking standards, cellular data communication protocols, mobile computing applications. Mobile databases – protocols, scope, tools and technology. M-business.
E – Technologies
Electronic Commerce: Framework, Media Convergence of Applications, Consumer Applications, Organisation Applications.
Electronic Payment Systems: Digital Token, Smart Cards, Credit Cards, Risks in Electronic Payment System, Designing Electronic Payment Systems.
Electronic Data Interchange (EDI): Concepts, Applications, (Legal, Security and Privacy) issues, EDI and Electronic Commerce, Standardization and EDI, EDI Software Implementation, EDI Envelope for Message Transport, Internet – Based EDI.
Digital Libraries and Data Warehousing: Concepts, Types of Digital documents, Issues behind document Infrastructure, Corporate Data Warehouses.
Software Agents: Characteristics and Properties of Agents, Technology behind Software Agents (Applets, Browsers and Software Agents).
Broadband Telecommunications: Concepts, Frame Relay, Cell Relay, Switched Multimegabit Data Service, Asynchronous Transfer Mode.
Main concepts in Geographical Information System (GIS), E – cash, E – Business, ERP packages.
Data Warehousing: Data Warehouse environment, architecture of a data warehouse methodology, analysis, design, construction and administration.
Data Mining: Extracting models and patterns from large databases, data mining techniques, classification, regression, clustering, summarization, dependency modelling, link analysis, sequencing analysis, mining scientific and business data.
Windows Programming:
Introduction to Windows programming – Win32, Microsoft Foundation Classes (MFC), Documents and views, Resources, Message handling in windows.
Simple Applications (in windows) : Scrolling, splitting views, docking toolbars, status bars, common dialogs.
Advanced Windows Programming:
Multiple Document Interface ( MDI ), Multithreading. Object linking and Embedding (OLE). Active X controls. Active Template Library (ATL). Network programming.
Paper III (Part A) Syllabus
Core Group
Unit – I: Combinational Circuit Design, Sequential Circuit Design, Hardwired and Micro Programmed processor design, Instruction formats, Addressing modes, Memory types and organisation, Interfacing peripheral devices, Interrupts.
Microprocessor architecture, Instruction set and Programming ( 8085, P – III / P – IV ), Microprocessor applications.
Unit – II: Database Concepts, ER diagrams, Data Models, Design of Relational Database, Normalisation, SQL and QBE, Query Processing and Optimisation, Centralised and Distributed Database, Security, Concurrency and Recovery in Centralised and Distributed Database Systems, Object Oriented Database Management Systems ( Concepts, Composite objects, Integration with RDBMS applications ), ORACLE.
Unit – III: Display systems, Input devices, 2D Geometry, Graphic operations, 3D Graphics, Animation, Graphic standard, Applications.
Concepts, Storage Devices, Input Tools, Authoring Tools, Application, Files.
Unit – IV: Programming language concepts, paradigms and models.www.netugc.com
Data : Data types, Operators, Expressions, Assignment. Flow of Control.
Control structures, I / O statements, User – defined and built – in functions, Parameter passing.
Principles, classes, inheritance, class hierarchies, polymorphism, dynamic binding, reference semantics and their implementation.
Principles, functions, lists, types and polymorphisms, higher order functions, lazy evaluation, equations and pattern matching.
Principles, horn clauses and their execution, logical variables, relations, data structures, controlling the search order, program development in prolog, implementation of prolog, example programs in prolog.
Principles of parallelism, coroutines, communication and execution. Parallel Virtual Machine (PVM) and Message Passing Interface (MPI) routines and calls. Parallel programs in PVM paradigm as well as MPI paradigm for simple problems like matrix multiplication.
Preconditions, post-conditions, axiomatic approach for semantics, correctness, denotational semantics.
Compiler structure, compiler construction tools, compilation phases.
Finite Automata, Pushdown Automata. Non-determinism and NFA, DPDA, and PDAs and languages accepted by these structures. Grammars, Languages – types of grammars – type 0, type 1, type 2, and type 3. The relationship between types of grammars, and finite machines. Pushdown automata and Context Free Grammars. Lexical Analysis-regular expressions and regular languages. LEX package on Unix. Conversion of NFA to DFA. Minimizing the number of states in a DFA Compilation and Interpretation. Bootstrap compilers.
Context free grammars. Parsing and parse trees. Representation of parse ( derivation ) trees as rightmost and leftmost derivations. Bottom up parsers-shift-reduce, operator precedence, and LR. YACC package on Unix system. Top down parsers-left recursion and its removal. Recursive descent parser. Predictive parser, Intermediate codes – Quadruples, triples. Intermediate code generation, code generation. Code optimization.
Unit – V: Analog and Digital transmission, Asynchronous and Synchronous transmission, Transmission media, Multiplexing and Concentration, Switching techniques, Polling.
Topologies, Networking Devices, OSI Reference Model, Protocols for :
Data link layer
Network layer
Transport layer, TCP / IP protocols, Networks security, Network administration.
Unit – VI: Definition, Simple and Composite structures, Arrays, Lists, Stacks queues, Priority queues. Binary trees, B – trees, Graphs.
Sorting and Searching Algorithms, Analysis of Algorithms, Interpolation and Binary Search, Asymptotic notations-big ohm, omega and theta. Average case analysis of simple programs like finding of a maximum of n elements. Recursion and its systematic removal. Quicksort – Non – recursive implementation with minimal stack storage. Design of Algorithms ( Divide and Conquer, Greedy method, Dynamic programming, Back tracking, Branch and Bound ). Lower bound theory, Non – deterministic algorithm – Non – deterministic programming constructs. Simple non-deterministic programs. NP – hard and NP – complete problems.
Unit – VII: Object, messages, classes, encapsulation, inheritance, polymorphism, aggregation, abstract classes, generalization as extension and restriction. Object oriented design. Multiple inheritance, metadata.
HTML, DHTML, XML, Scripting, Java, Servelets, Applets.
Unit – VIII: Software development models, Requirement analysis and specifications, Software design, Programming techniques and tools, Software validation and quality assurance techniques, Software maintenance and advanced concepts, Software management.
Unit – IX: Introduction, Memory management, Support for concurrent process, Scheduling, System deadlock, Multiprogramming system, I/O management, Distributed operating systems, Study of Unix and Windows NT.
Unit – X: Definitions, AI approach for solving problems.
Automated Reasoning with prepositional logic and predicate logic-fundamental proof procedure, refutation, resolution, refinements to resolution ( ordering / pruning / restriction strategies ).
State space representation of problems, bounding functions, breadth first, depth first, A, A*, AO*, etc. Performance comparison of various search techniques.
Frames, scripts, semantic nets, production systems, procedural representations. Prolog programming.
Components of an expert system, Knowledge representation and Acquisition techniques, Building expert system and Shell.
RTNs, ATNs, Parsing of Ambiguous CFGs. Tree Adjoining Grammars ( TAGs ).
Systems approach to planning, Designing, Development, Implementation and Evaluation of MIS.
Decision-making processes, evaluation of DSS, Group decision support system and case studies, Adaptive design approach to DSS development, Cognitive style in DSS, Integrating expert and Decision support systems.
Core Group
Unit – I: Combinational Circuit Design, Sequential Circuit Design, Hardwired and Micro Programmed processor design, Instruction formats, Addressing modes, Memory types and organisation, Interfacing peripheral devices, Interrupts.
Microprocessor architecture, Instruction set and Programming ( 8085, P – III / P – IV ), Microprocessor applications.
Unit – II: Database Concepts, ER diagrams, Data Models, Design of Relational Database, Normalisation, SQL and QBE, Query Processing and Optimisation, Centralised and Distributed Database, Security, Concurrency and Recovery in Centralised and Distributed Database Systems, Object Oriented Database Management Systems ( Concepts, Composite objects, Integration with RDBMS applications ), ORACLE.
Unit – III: Display systems, Input devices, 2D Geometry, Graphic operations, 3D Graphics, Animation, Graphic standard, Applications.
Concepts, Storage Devices, Input Tools, Authoring Tools, Application, Files.
Unit – IV: Programming language concepts, paradigms and models.www.netugc.com
Data : Data types, Operators, Expressions, Assignment. Flow of Control.
Control structures, I / O statements, User – defined and built – in functions, Parameter passing.
Principles, classes, inheritance, class hierarchies, polymorphism, dynamic binding, reference semantics and their implementation.
Principles, functions, lists, types and polymorphisms, higher order functions, lazy evaluation, equations and pattern matching.
Principles, horn clauses and their execution, logical variables, relations, data structures, controlling the search order, program development in prolog, implementation of prolog, example programs in prolog.
Principles of parallelism, coroutines, communication and execution. Parallel Virtual Machine (PVM) and Message Passing Interface (MPI) routines and calls. Parallel programs in PVM paradigm as well as MPI paradigm for simple problems like matrix multiplication.
Preconditions, post-conditions, axiomatic approach for semantics, correctness, denotational semantics.
Compiler structure, compiler construction tools, compilation phases.
Finite Automata, Pushdown Automata. Non-determinism and NFA, DPDA, and PDAs and languages accepted by these structures. Grammars, Languages – types of grammars – type 0, type 1, type 2, and type 3. The relationship between types of grammars, and finite machines. Pushdown automata and Context Free Grammars. Lexical Analysis-regular expressions and regular languages. LEX package on Unix. Conversion of NFA to DFA. Minimizing the number of states in a DFA Compilation and Interpretation. Bootstrap compilers.
Context free grammars. Parsing and parse trees. Representation of parse ( derivation ) trees as rightmost and leftmost derivations. Bottom up parsers-shift-reduce, operator precedence, and LR. YACC package on Unix system. Top down parsers-left recursion and its removal. Recursive descent parser. Predictive parser, Intermediate codes – Quadruples, triples. Intermediate code generation, code generation. Code optimization.
Unit – V: Analog and Digital transmission, Asynchronous and Synchronous transmission, Transmission media, Multiplexing and Concentration, Switching techniques, Polling.
Topologies, Networking Devices, OSI Reference Model, Protocols for :
Data link layer
Network layer
Transport layer, TCP / IP protocols, Networks security, Network administration.
Unit – VI: Definition, Simple and Composite structures, Arrays, Lists, Stacks queues, Priority queues. Binary trees, B – trees, Graphs.
Sorting and Searching Algorithms, Analysis of Algorithms, Interpolation and Binary Search, Asymptotic notations-big ohm, omega and theta. Average case analysis of simple programs like finding of a maximum of n elements. Recursion and its systematic removal. Quicksort – Non – recursive implementation with minimal stack storage. Design of Algorithms ( Divide and Conquer, Greedy method, Dynamic programming, Back tracking, Branch and Bound ). Lower bound theory, Non – deterministic algorithm – Non – deterministic programming constructs. Simple non-deterministic programs. NP – hard and NP – complete problems.
Unit – VII: Object, messages, classes, encapsulation, inheritance, polymorphism, aggregation, abstract classes, generalization as extension and restriction. Object oriented design. Multiple inheritance, metadata.
HTML, DHTML, XML, Scripting, Java, Servelets, Applets.
Unit – VIII: Software development models, Requirement analysis and specifications, Software design, Programming techniques and tools, Software validation and quality assurance techniques, Software maintenance and advanced concepts, Software management.
Unit – IX: Introduction, Memory management, Support for concurrent process, Scheduling, System deadlock, Multiprogramming system, I/O management, Distributed operating systems, Study of Unix and Windows NT.
Unit – X: Definitions, AI approach for solving problems.
Automated Reasoning with prepositional logic and predicate logic-fundamental proof procedure, refutation, resolution, refinements to resolution ( ordering / pruning / restriction strategies ).
State space representation of problems, bounding functions, breadth first, depth first, A, A*, AO*, etc. Performance comparison of various search techniques.
Frames, scripts, semantic nets, production systems, procedural representations. Prolog programming.
Components of an expert system, Knowledge representation and Acquisition techniques, Building expert system and Shell.
RTNs, ATNs, Parsing of Ambiguous CFGs. Tree Adjoining Grammars ( TAGs ).
Systems approach to planning, Designing, Development, Implementation and Evaluation of MIS.
Decision-making processes, evaluation of DSS, Group decision support system and case studies, Adaptive design approach to DSS development, Cognitive style in DSS, Integrating expert and Decision support systems.
Paper III (Part B) Syllabus
(Elective / Optional)
Elective – I: Theory of Computation: Formal language, Need for formal computational models, Non-computational problems, diagonal argument and Russel’s paradox.
Deterministic Finite Automaton (DFA), Non – deterministic Finite Automaton (NFA), Regular languages and regular sets, Equivalence of DFA and NFA. Minimizing the number of states of a DFA. Non-regular languages, and Pumping lemma.
Pushdown Automaton (PDA), Deterministic Pushdown Automaton ( DPDA ), Non – equilvalence of PDA and DPDA.
Context free Grammars: Greibach Normal Form ( GNF ) and Chomsky Normal Form (CNF), Ambiguity, Parse Tree Representation of Derivations. Equivalence of PDA’s and CFG’s. Parsing techniques for parsing of general CFG’s – Early’s, Cook – Kassami-Younger (CKY), and Tomita’s parsing.
Linear Bounded Automata (LBA) : Power of LBA Closure properties.
Turing Machine (TM): One tape, multitape. The notions of time and space complexity in terms of TM. Construction of TM for simple problems. Computational complexity.
Chomsky Hierarchy of languages: Recursive and recursively-enumerable languages.
Elective – II: Models for Information Channel : Discrete Memoryless Channel, Binary Symmetric Channel ( BSC ), Burst Channel, Bit-error rates. Probability, Entropy and Shannon’s measure of information. Mutual information. Channel capacity theorem. Rate and optimality of Information transmission.
Variable Length Codes : Prefix Codes, Huffmann Codes, Lempel-Ziev ( LZ ) Codes. Optirnality of these codes. Information content of these codes.
Error Correcting and Detecting Codes: Finite fields, Hamming distance, Bounds of codes, Linear (Parity Check) codes, Parity check matrix, Generator matrix, Decoding of linear codes, Hamming codes.
Image Processing: Image Registration, Spatial Fourier Transforms, Discrete Spatial ( 2 dimensional ) Fourier Transforms, Restoration, Lossy Compression of images ( pictures ).
Data Compression Techniques: Representation and compression of text, sound, picture, and video files ( based on the JPEG and MPEG standards ).
Elective – III: Linear Programming Problem ( LPP ) in the standard form, LPP in Canonical form. Conversion of LPP in Standard form to LPP in Canonical form. Simplex-Prevention of cyclic computations in Simplex and Tableau, Big-M method, dual simplex and revised simplex.
Complexity of simplex algorithm(s). Exponential behaviour of simplex.
Ellipsoid method and Karmakar’s method for solving LPPs. Solving simple LPPs through these methods. Comparison of complexity of these methods.
Assignment and Transportation Problems : Simple algorithms like Hungarian method, etc.
Shortest Path Problems : Dijkstra’s and Moore’s method. Complexity.
Network Flow Problem : Formulation. Max – Flow Min – Cut theorem. Ford and Fulkerson’s algorithm. Exponential behaviour of Ford and Fulkerson’s algorithm. Malhotra – Pramodkumar-Maheshwari ( MPM ) Polynomial algorithm for solving Network flow problem. Bipartite Graphs and Matchings; Solving matching problems using Network flow problems.
Matroids : Definition. Graphic and Cographic matroids. Matroid intersection problem.
Non-linear Programming : Kuhn – Tucker conditions. Convex functions and Convex regions. Convex programming problems. Algorithms for solving convex programming problems-Rate of convergence of iterative methods for solving these problems.
Elective – IV: Neural Networks : Perceptron model, Linear separability and XOR problem. Two and three layered neural nets, Back Propagation – Convergence, Hopfield nets, Neural net learning, Applications.
Fuzzy Systems: Definition of a Fuzzy set, Fuzzy relations, Fuzzy functions, Fuzzy measures, Fuzzy reasoning, Applications of Fuzzy systems.
Elective – V: Unix : Operating System, Structure of Unix Operating System, Unix Commands, Interfacing with Unix, Editors and Compilers for Unix, LEX and YACC, File system, System calls, Filters, Shell programming.
Windows : Windows environment, Unicode, Documents and Views, Drawing in a window, Message handling, Scrolling and Splitting views, Docking toolbars and Status bars, Common dialogs and Controls, MDI, Multithreading, OLE, Active X controls, ATL, Database access, Network programming.
(Elective / Optional)
Elective – I: Theory of Computation: Formal language, Need for formal computational models, Non-computational problems, diagonal argument and Russel’s paradox.
Deterministic Finite Automaton (DFA), Non – deterministic Finite Automaton (NFA), Regular languages and regular sets, Equivalence of DFA and NFA. Minimizing the number of states of a DFA. Non-regular languages, and Pumping lemma.
Pushdown Automaton (PDA), Deterministic Pushdown Automaton ( DPDA ), Non – equilvalence of PDA and DPDA.
Context free Grammars: Greibach Normal Form ( GNF ) and Chomsky Normal Form (CNF), Ambiguity, Parse Tree Representation of Derivations. Equivalence of PDA’s and CFG’s. Parsing techniques for parsing of general CFG’s – Early’s, Cook – Kassami-Younger (CKY), and Tomita’s parsing.
Linear Bounded Automata (LBA) : Power of LBA Closure properties.
Turing Machine (TM): One tape, multitape. The notions of time and space complexity in terms of TM. Construction of TM for simple problems. Computational complexity.
Chomsky Hierarchy of languages: Recursive and recursively-enumerable languages.
Elective – II: Models for Information Channel : Discrete Memoryless Channel, Binary Symmetric Channel ( BSC ), Burst Channel, Bit-error rates. Probability, Entropy and Shannon’s measure of information. Mutual information. Channel capacity theorem. Rate and optimality of Information transmission.
Variable Length Codes : Prefix Codes, Huffmann Codes, Lempel-Ziev ( LZ ) Codes. Optirnality of these codes. Information content of these codes.
Error Correcting and Detecting Codes: Finite fields, Hamming distance, Bounds of codes, Linear (Parity Check) codes, Parity check matrix, Generator matrix, Decoding of linear codes, Hamming codes.
Image Processing: Image Registration, Spatial Fourier Transforms, Discrete Spatial ( 2 dimensional ) Fourier Transforms, Restoration, Lossy Compression of images ( pictures ).
Data Compression Techniques: Representation and compression of text, sound, picture, and video files ( based on the JPEG and MPEG standards ).
Elective – III: Linear Programming Problem ( LPP ) in the standard form, LPP in Canonical form. Conversion of LPP in Standard form to LPP in Canonical form. Simplex-Prevention of cyclic computations in Simplex and Tableau, Big-M method, dual simplex and revised simplex.
Complexity of simplex algorithm(s). Exponential behaviour of simplex.
Ellipsoid method and Karmakar’s method for solving LPPs. Solving simple LPPs through these methods. Comparison of complexity of these methods.
Assignment and Transportation Problems : Simple algorithms like Hungarian method, etc.
Shortest Path Problems : Dijkstra’s and Moore’s method. Complexity.
Network Flow Problem : Formulation. Max – Flow Min – Cut theorem. Ford and Fulkerson’s algorithm. Exponential behaviour of Ford and Fulkerson’s algorithm. Malhotra – Pramodkumar-Maheshwari ( MPM ) Polynomial algorithm for solving Network flow problem. Bipartite Graphs and Matchings; Solving matching problems using Network flow problems.
Matroids : Definition. Graphic and Cographic matroids. Matroid intersection problem.
Non-linear Programming : Kuhn – Tucker conditions. Convex functions and Convex regions. Convex programming problems. Algorithms for solving convex programming problems-Rate of convergence of iterative methods for solving these problems.
Elective – IV: Neural Networks : Perceptron model, Linear separability and XOR problem. Two and three layered neural nets, Back Propagation – Convergence, Hopfield nets, Neural net learning, Applications.
Fuzzy Systems: Definition of a Fuzzy set, Fuzzy relations, Fuzzy functions, Fuzzy measures, Fuzzy reasoning, Applications of Fuzzy systems.
Elective – V: Unix : Operating System, Structure of Unix Operating System, Unix Commands, Interfacing with Unix, Editors and Compilers for Unix, LEX and YACC, File system, System calls, Filters, Shell programming.
Windows : Windows environment, Unicode, Documents and Views, Drawing in a window, Message handling, Scrolling and Splitting views, Docking toolbars and Status bars, Common dialogs and Controls, MDI, Multithreading, OLE, Active X controls, ATL, Database access, Network programming.
Recommended books
For Discrete MathematicsDiscrete Mathematics (Schaum's Outlines) by Seymour Lipschutz , Marc Laras Lipson , Varsha H. Patil
(if you want to buy, you can buy from Amazon..(just click on image)
Discrete Mathematics and Its Applications by-- Kenneth H. Rosen 7th edition
(if you want to buy, you can buy from Amazon..(just click on image)
Discrete Mathematical Structure by– Bernard Kolman, Robert C. Busby
A free gift from sarkarisahai (42.5 MB,djvu format, worth 5,089 rupees)
For Theory of Computation
Introduction to Automata Theory, Languages and Computation – John E. Hopcroft and Ullman
(if you want to buy, you can buy from Amazon..(just click on image)
Algorithms and Theory of Computation Handbook, Second Edition, Volume 1: General Concepts and Techniques (Chapman & Hall/CRC Applied Algorithms and Data Structures series)
(if you want to buy, you can buy from Amazon..(just click on image)
Algorithms and Theory of Computation Handbook, Second Edition, Volume 2: Special Topics and Techniques (Chapman & Hall/CRC Applied Algorithms and Data Structures series)
(if you want to buy, you can buy from Amazon..(just click on image)
An Introduction to Formal Languages and Automata – Peter Linz
(if you want to buy, you can buy from Amazon..(just click on image)
For Graph Theory
Graph Theory with Applications to Engineering and Computer Science - Narsingh Deo
(if you want to buy, you can buy from Amazon..(just click on image)
Graph Theory by Reinhard Diestel
(if you want to buy, you can buy from Amazon..(just click on image)
For Computer Arithmetic and architecture
Digital Logic and Computer Design by M. Morris Mano
(if you want to buy, you can buy from Amazon..(just click on image)
Computer Organization and Architecture by Carl Hamacher
(if you want to buy, you can buy from Amazon..(just click on image)
For Programming in C and C++
The C Programming Language – 2nd edition by B.W Kernighan & Dennis M. Ritchie
(if you want to buy, you can buy from Amazon..(just click on image)
For Relational Design and Database
Fundamentals of Database Systems by Ramez Elmasri, Navathe
(if you want to buy, you can buy from Amazon..(just click on image)
For Data and File Structure
Data structure using C and C++ by Tenenbaum, Langsam and Augenstein
(if you want to buy, you can buy from Amazon..(just click on image)
For Computer Networks
Data communications and networking by I Behrouz A Forouza
(if you want to buy, you can buy from Amazon..(just click on image)
Computer Networks by Andrew S. Tanenbaum
(if you want to buy, you can buy from Amazon..(just click on image)
Data and Computer Communications by William Stallings
(if you want to buy, you can buy from Amazon..(just click on image)
For System Software & Compilers (including Microprocessor)
Microprocessor Architecture, Programming and Applications with the 8085 by Ramesh S. Gaonkar
(if you want to buy, you can buy from Amazon..(just click on image)
Compilers: Principles, Techniques and Tools by Aho, Lam, Sethi and Ullman
(if you want to buy, you can buy from Amazon..(just click on image)
For Operating Systems with Unix
Operating System Concepts by Galvin and Silberschatz
(if you want to buy, you can buy from Amazon..(just click on image)
Operating Systems Internals and Design Principles by William Stallings
free gift from sarkari sahai (3.75 MB, worth 5475 rupees)
Unix-Concepts and Applications by M. J. Back, S. Das
(if you want to buy, you can buy from Amazon..(just click on image)
For Software Engineering
Software Engineering A Practitioner’s Approach by Roger S. Pressman
(if you want to buy, you can buy from Amazon..(just click on image)
Fundamentals of Software Engineering, 4th Edition By Rajib Mall
(if you want to buy, you can buy from Amazon..(just click on image)
For Computer Graphics
Introduction to Computer Graphics by Hearn and Baker, Rogers
(if you want to buy, you can buy from Amazon..(just click on image)
For Programming and Algorithm
Introduction to Algorithms by Cormen, Leiserson, Rivest and Stein
(if you want to buy, you can buy from Amazon..(just click on image)
An Introduction to Database System by Bipin C. Desai
(if you want to buy, you can buy from Amazon..(just click on image)
For System Software & Compilers (including Microprocessor)
Microprocessor Architecture, Programming and Applications with the 8085 by Ramesh S. Gaonkar
(if you want to buy, you can buy from Amazon..(just click on image)
For Artificial Intelligence
Artificial Intelligence by Elaine Rich and Kevin Knight
(if you want to buy, you can buy from Amazon..(just click on image)
For Information Theory
Information Theory, Coding and Cryptography by Ranjan Bose
(if you want to buy, you can buy from Amazon..(just click on image)
For Linear and Nonlinear Programming
Linear and Nonlinear Programming by Luenberger David G and Yinyu Ye
For Neural networks and fuzzy logic
Neural Networks and Fuzzy Logic by Dr. R.P. Das & L. Sreedhar
(if you want to buy, you can buy from Amazon..(just click on image)
Neural networks, Fuzzy logic and Genetic algorithms by S. RAJASEKARAN,G. A.VIJAYALAKSHMI PAI
(if you want to buy, you can buy from Amazon..(just click on image)
For Current Trends and Technologies
Parallel Computing: Theory and Practice by M. J. Quinn
(if you want to buy, you can buy from Amazon..(just click on image)
Please share your experience in comment box, it help other aspirants(sarkarisahai.blogspot.com)
Hey there, I think your website might be having browser compatibility issues.
ReplyDeleteWhen I look at your blog site in Ie, it looks fine but when opening in Internet
Explorer, it has some overlapping. I just wanted to give you a quick
heads up! Other then that, terrific blog!
Great goods from you, man. I have understand your stuff previous to and you are just too excellent.
ReplyDeleteI actually like what you have acquired here, really like what you're stating and the way in which you
say it. You make it enjoyable and you still care
for to keep it smart. I cant wait to read far more from you.
This is actually a tremendous web site.
Simpy desire to say your article is as astonishing.
ReplyDeleteThe clarity in your put up is simply spectacular
and i could assume you are an expert oon this subject. Fine along
with your permission let me to graap your RSS feed to
keep up to date with imminent post. Thank you one million and
please carry on the rewarding work.
It is in realkity a great annd helpful piece off information. I'm satisfied that
ReplyDeleteyou just shared this useful info with us. Please stay uus up to date like this.
Thank you for sharing.
If some one desires to be updated with most up-to-date technologies therefore he
ReplyDeletemust be pay a visit this website and be up to date everyday.
Excellent write-up. I definitely appreciate this site.
ReplyDeleteKeep it up!
I am actually delighted to read this webpage posts which carries plenty of valuable data, thanks
ReplyDeletefor providing such information.
Hello, this weekend is pleasant designed forr me, for
ReplyDeletethe reason thqt this point in time i am reading this fantastic
informative article here at myy residence.
First of all I want to say superb blog! I had a quick question that I'd like to ask if you do not mind.
ReplyDeleteI was interested to know how you center yourself and clear your thoughts before writing.
I have had difficulty clearing my mind in getting my thoughts out there.
I truly do enjoy writing however it just seems like the first 10 to 15 minutes are
wasted simply just trying to figure out how to begin. Any recommendations or tips?
Many thanks!
It's enormous that you are getting thoughts from this paragraph as
ReplyDeletewell as from our discussion made here.
hùa theo
ReplyDeleteđộc ác
chuôm
bậc nhất
Bạc đãi
đình hoãn
dàn xếp
thanh niên
bao bọc
phải
phong cách
bật mí
hiện nay
bề ngoài
xung quanh
không tính
cách
bỏ quên
xếp đặt
bởi vậy
ăn bớt
to kềnh
bước đột phá
marketing
các bạn
các
dòng
căn bản
khởi thủy
thiết yếu
cẩn thận
gắp
khó khăn
cáu
chắc chắn
chất liệu vải
phân phối
giá thành
chi tiết
chính hãng
tìm
chống thấm nước
để ý
lưu ý
chuyển động
phục vụ
ra đời
sở hữu
kỹ thuật
siêu thị
cộng
liên hệ
rất
cười cợt
cứu
phổ biến
đông đảo
đa số
đặc biệt
dở người
mê say
điệu dạng
phá huỷ
đau ốm
thứ nhất
toàn bộ
dành dụm
đem lại
tới
trẻ trung
rời khỏi
điểm mạnh
thăm dò
trang bị
đơn giản
giới hạn
dùng
dùng
êm ắng
nhái
ràng buộc
gần đây
gan lì
thân thiện
thân mật
gần
bắt gặp
gấp rút
giả dụ
giải thích
giảm thiểu
hạn chế
hài hòa
tận tình
tiên tiến
lý tưởng
hơi
thua sút
xoàng xĩnh
rốt cục
hậu quả
mở màn
luận điểm
bao hàm
trùng hợp
lúc
làm
không
khuyến mãi
khiếu nại
lăng băng
thôn
chỉ dẫn
lạnh
chệch choạng
rì rào
tiện dụng
lôi kéo
lớn
quỷ quyệt
mô tả
tậu
bắt
năng lực
nặng trĩu
nấu nướng
té
sửng sốt
nhãn hiệu
thời gian nhanh
bát nháo
nhộn nhịp
vượt trội
nức tiếng
oách
ổn định
pha trộn
tốt
phẳng lì
vươn lên là
nguyên tắc
ưng ý
quảng bá
qua chuyện
quan tâm
rách rưới
rườm rà
rẻ rúng
rõ ràng
bao la
sạch sẽ
sáng suốt
sáng sủa
thanh lịch
thâm thúy
kinh hoảng
tái mét
tai vạ
bác tài
tàn tật
tang vật
phi cơ
vô tư
y sĩ
thừa thãi
nối tiếp
Dù thế
tối tăm
ẩm ướt
va chạm
van nài
vắng vẻ
lặt vặt
xa thẳm
xa hoa
xâm chiếm
xanh lơ
xấu xa
van xin
xong xuôi
xu thế
dự định
ỷ lại
trang phục
giống ý
yên ổn
yêu thương
yếu đuối
Hello there! Thiss is kind of off topic but I need some help from an established blog.
ReplyDeleteIs it difficult to set up your own blog? I'm not very techincal but I can figure thngs out pretty quick.
I'm thinkinng about setting up my own but I'm not sure
where to start. Do you have any ideas or suggestions?
With thanks
Amazing! This blog looks just like my old one! It's on a totally different
ReplyDeletetopic but it hhas pretty much the same layout and design. Superb
choice of colors!
Thefe is certainly a lot to find out about this issue. I like all the points you have made.
ReplyDeleteI'm not sure whsre you aree getting your information, but good
ReplyDeletetopic. I needs to spend sme time learning more oor
understanding more. Thanls for magnificent inbfo I was looking for this information for my mission.
Tremendous issues here. I'm very satisfied to look your article.
ReplyDeleteThanks so much and I'm looking forward to touch you. Wiill you kindly drop me a mail?
Wow, thi paragraph iis nice, my sister is analyzing these kinds of things,so I am going
ReplyDeleteto convey her.
Thanks for shafing your thoughts on free instagraam followers.
ReplyDeleteRegards
At thjis time I am ready tto do my breakfast, after having my breakfast coming over
ReplyDeleteagain to read further news.
Hello There. I discovered yourr blog using msn. This is aan extremely well written article.
ReplyDeleteI will be sure to bookmark it and come back to learn extra of your useful info.
Thanks for the post. I'll definitely comeback.
I really like your writing style, fantastic information, regards for putting up :D.
ReplyDeleteThis blog was... how do you say it? Relevant!! Finally I've found something which helped me.
ReplyDeleteMany thanks!
I like what you guys are usually up too. This kind of clever
ReplyDeletework and reporting! Keep up the superb works guys I've added you guys to my
personal blogroll.
Thanks for the marvelous posting! I quite enjoyed reading it,
ReplyDeleteyou could be a great author. I will remember to bookmark your blog and will eventually come back later on. I want to encourage that you continue
your great posts, have a nice afternoon!
It's difficult to find educated people for this topic, but you
ReplyDeletesound like you know what you're talking about! Thanks
It's wonderful that you are getting ideas from this article as well as
ReplyDeletefrom our argument mmade here.