Download M.Sc Elective Syllabus - Holkar Science College

M.Sc. (C. S.) I Semester
Core-1 Computer & Communication Fundamentals
2016-2018 and onwards
Unit I
Computer Organization : Digital and Analog computers, Major components of a digital computer,
Memory addressing capability of a CPU, Word length of a computer, Processing speed of a CPU,
Definitions of Hardware, Software and Firmware. Definitions of Dumb, Smart and Intelligent terminals.
Binary Systems: Digital Systems, Binary Numbers, Number Base Conversions, Octal and Hexadecimal
Numbers, Complements, Signed Binary Numbers, Binary Codes: BCD code, Gray Code, ASCII code,
Excess 3 Code, Error detecting Code.
Unit II
Computer Arithmetic :Binary representation of Negative Integers using 2’s complement and Signed
magnitude representation, Fixed point Arithmetic operations on Positive and Signed (Negative) Integers
like addition, subtraction, multiplication.
Boolean Algebra and Logic Gates : Basic Definitions, Basic Theorems and properties of Boolean
Algebra, Boolean Functions, Canonical and standard forms, Other Logic operations, Digital Logic gates,
Integrated Circuits. Gate-Level Minimization: The K-Map Method, 3 and 4 variable K-Map, Product of
sums simplification, Sum of Products simplification, Don’t care conditions, NAND and NOR
implementations, Exclusive-OR function.
Unit III
Combinational Logic: Combinational Circuits, Analysis Procedure, Design Procedure, Binary half
adder, binary full adder, binary full subtractor, binary parallel adder, carry propagation delay and
Propagation delay calculation of various digital circuits. Carry look ahead generator fast adder ,Decimal
Adder, Binary multiplier, Magnitude comparator, Code converters like binary to gray, BCD to excess 3.
Decoders, Encoders, Multiplexers, Demultiplexers.
Unit IV
Analysis of clocked sequential circuits: State diagrams, State equations for D, JK and T Flip flops. State
reduction methods using all Flip Flops. Mealy and Moore Models. Shift Registers- Serial in Serial out,
Serial in Parallel out, Parallel in Serial out and Parallel in Parallel out. Designing of Asynchronous
(Ripple) Counters, Design of Synchronous Counters. Synchronous Sequential logic : Sequential circuits,
Latches, Flip Flops : SR, D, JK, T. Master Slave JK Flip flop. Characteristic equations and Excitation
tables of flip flops.
Unit V
Communication Systems: Basics of communication systems, Types of communication, Transmission
impairments, analog vs. digital transmission, requirements of communication systems, channel capacity.
Shannon’s theorem. Data rate of a channel, Physical Communication Media- Bounded Media: Twisted
Pair, Coaxial Cable, Optical Fiber. Unbounded Media – Microwave Communication, Radio wave
Communication, Satellite Comm. Time Division Multiplexing and Frequency Division Multiplexing.
Data communications and its components, Half Duplex and Full Duplex Transmission. Asynchronous
and synchronous transmission LAN, MAN, WAN. Network Topologies- Bus, Star, mesh, Ring.
Categories of networks: Introduction of Communication Protocols like OSI and TCP/IP model.
Required Text(s):







Digital Design by M. Morris Mano. Third addition
Computer Architecture By Dr. Rajkamal.
Data communications and networking By A. Forouzan
Computer Fundamentals – Architecture and Organisation By B. Ram.
Computer networks by Andrew Tanenbaum
Principles of digital communication system & computer networks By K.V.K.K. Prasad
Computer organization and architecture by William Stallings.
M.Sc. (C. S.) I Semester
Discrete Structure
2016-2018 and onwards
Core-2
Unit I
The foundation: Logic, Sets and Functions: Introduction, logic, prepositional equivalences. Predicates
and quantifier, set, set operations, fuzzy sets, functions for computer science, sequences and summations.
Unit II
Mathematical reasoning: Methods of proof, mathematical induction, recursive definitions, recursive
algorithms.
Languages and Grammars: Introduction to Languages and Grammars. Phrase-Structure Grammars,
Types of Phrase structure grammars
Unit III
Combinatorics : The basics of counting, The Piegeon Hole Principle, Permutations and combinations,
Advanced counting techiques, recurrence relations,solving recurrence relations, Algorithms, Complexity
of Algoritms.
Unit IV
Relations: Relations and their properties, n-ary relations and their applications, representing relations,
closures of relations, equivalence relations, partial ordering.
Unit V
Graph: Introduction to graphs terminology, representing graphs and graph isomorphism, connectivity,
Euler and Hamiltonian Paths, shortest Path problems, planar graphsm, graph colouring, chromatic
number, Euler’s formula. Kuratowski’s theorem. The Four Colour problem, applications of graph
colouring, introduction to trees, application of trees, tree traversal,trees and sorting, spanning trees,
minimum spanning trees.
Required Text(s):
 Kenneth H,Rosen, Discrete Mathematical and it’s application, 6th Edition, Tata McGraw Hill,
2007.
 C.L Liu, “Elements of Discrete Mathematics, 2nd Edition, Tata McGraw Hill, 1985.
 Kolman, Busby & Ross Discrete Mathematical Structures, 5th Edition, Pearson education, 2003
 Trembly. J.P & Manohar. P,Discrete Mathematical Structures with Applications to Computer
Science, 1975
M.Sc. (C. S.) I Semester
Core-3 Operating System
2016-2018 and onwards
Unit I
Introduction: Evolution of operating systems, operating system concepts, operating system Services,
System Calls. Batch processing, time sharing operating systems, real time systems.
Process Management: Process Concept, Scheduling, operations on process, cooperating process, IPC.
CPU Scheduling: basic Concepts, Scheduling Criteria & Algorithms.
Unit II
Concurrent Process: Mutual Exclusion, Synchronization. Techniques of inter process communication,
message driven operating systems. Deadlock handling techniques.
Unit III
Memory Management: Concepts, Single user memory management. Partition memory allocation.
Virtual memory management using paging and segmentation techniques, Virtual Memory Concepts.
Unit IV
File Management: Operations on a file, Structure of File System, File Access Methods, Directory
structure , sharing and protection of file , Directory structure & implementation, Allocation Methods,
Free Space Management.
Unit V
Device Management: Goal of input /output software design, Structure of device hardware and software.
Layers of I/O software. Structure of device driver, disk driver, disk arm scheduling Algorithms, terminal
driver, function of clock driver, printer, mouse, scanner etc.
Case Studies: Unix/Linux, Windows operating system.
Required Text(s):




A. Silberschatz and P. Galvin ,Operating System Concepts, 6th Edition, Addison Wesley, 2003.
William Stallings, Operating systems, 4th Edition, Prentice Hall, 2000.
D.Dhamdhere, Operating System: a concept based approach, 1st Edition, Tata McGraw Hill,
2003.
A.S. Tanenbaum , Modern Operating System, 3rd Edition, Prentice Hall of India
M.Sc. (C. S.) I Semester
Core-4 Programming & Problem solving Through “C”
2016-2018 and onwards
Unit I
Overview of Problem solving: Introduction to computer based Problem solving, Programming concepts
with flowcharting and algorithms , classification of Programming languages, Programming environment
{Assemblers, compilers, interpreters, linkers and loaders}. Developing and debugging flowcharts for
programming problem.
Unit II
Fundaments of C programming: Overview of C - Various constructs of C program, coding style, data
types, constants and variables, expressions and operators, basic input/output operations and formatting
characters, decision making and branching, looping constructs, Arguments to main, Enumerations and
bits fields, typedef, type casting, Storage class.
Unit III
Array and their Applications: Arrays {one dimensional and multidimensional array}, String Handling,
Searching and sorting techniques, matrices operations.
Unit IV
Advanced Programming Concepts: Structures and union, Functions {Standard and User defined
function, parameter passing, scope rules}, Recursion {Using recursion, conversion of recursive program
to non-recursive}. Dynamic memory allocation and pointer{Uses, pitfalls, pointer to various user defined
and standard data types}.
Unit V
More Advanced Programming Concepts: Pre-processors
ifdef…}.Introduction to file handling. Header files creation, Graphics.
{define,
include,
macro’s,
Required Text(s):
 B.W. Kerighan & D.M. Ritchie, The C programming Language, 2nd Edition Prentice Hall, 1998.
 Herbert Schildt, C++ The Complete Reference , 4th Edition McGraw-Hill 2000.
 Yashavant Kanetkar, Let Us C, 8th Edition, Infinity Science Press 2008.
 Ashok N. Kamthane, “Programming with ANSI and Turbo C”, Pearson Education.
M.Sc. (C. S.) II Semester
Core- 5 Computer Networks
2016-2018 and onwards
Unit I
Introduction: Computer Network, Goals and Applications, Reference models – OSI and TCP/IP. A
Comparative study. Network hardware – LAN, MAN and WAN and topologies. LAN components – File
server, Workstations, Network Adapter Cards. Connection Oriented and Connection less services,
Switching Techniques – Circuit Switching, Packet Switching.
Unit II
Design Issues: Framing, Error Control, Flow Control, Error Detection and Correction, Elementary Data
Link Protocols, Sliding window protocol, Data link layer in the Internet – SLIP and PPP.
Unit III
Multiple Access Protocols: Aloha, CSMA Protocols, Collision-Free Protocols, Ethernet: Cabling,
Manchester Encoding, MAC Sublayer Protocol, Token bus : MAC Sublayer Protocol, Token Ring. MAC
Sublayer Protocol, High speed LANs – Fast Ethernet, FDDI, Wireless LANs, Bridges.
Unit IV
Network Layer: Design issues, Routing Algorithms: Optimality Principle, Shortest Path Routing,
Flooding ,Distance Vector Routing, Link State Routing , Hierarchical Routing, Broadcasting Routing,
Multicast Routing, The Network Layer in the Internet: Internet Protocol, Internet addressing and Internet
Control protocols.
Unit V
Transport Layer: Services, The Internet, Transport Protocols : TCP and UDP.
Application Layer: DNS Name Space, Name Servers, FTP, TELNET, WWW, SNMP, HTTP, SMTP,
Network Security : Cryptography, Symmetric- key Algorithms ,Public- key Algorithms, Digital
Signatures, E-mail Security.
Required Text(s)
 A. Tanenbaum, Computer Networks, 5th Edition, Addison-Wesley, 2003.
 W. Stallings ,Data and Computer Communications, Prentice-Hall, 5th Edition, 1997
 Michael A. Miller Data and Network Communication, Delmar Thomson Learning Inc.
 Introduction to Computer Networks: Douglas E. Comer, Prentice-Hall.
 James F. Kurore & Keith W. Rose , Computer Networking ,3rd Edition Pearson Education, 2005.
 Alberto Leon-Garcia and Indra Widjaja, Communication Networks : Fundamentals Concepts and
Key Architecture, Tata McGraw-Hill Publishing Company Limited
M.Sc. (C. S.) II Semester
Core-6 Data Structures using C++
2016-2018 and onwards
Unit I
Introduction to C++, Definition of data structures and abstract data types. Static and Dynamic
implementations. Examples and real life applications, Data Structures: Arrays, Address calculation in a
single and multi dimensional array. Sparse matrices.
Unit II
Definition, Array based implementation of stacks, Linked List based implementation of stacks, Examples.
Infix, postfix, prefix representation .Applications: Mathematical expression Evaluation.
Definition: Queues & Lists: Array based implementation of Queues / Lists, Linked List implementation
of Queues / Lists, Circular implementation of Queues and singly linked Lists, Straight / circular
implementation of doubly linked Queues / Lists, Priority queues, Applications.
Unit III
Definition of trees and Binary trees, Properties of Binary trees and Implementation, Binary Traversal preorder, post order, in order traversal, Binary Search Trees, Implementations. Threaded trees, balanced
multi way search trees, AVL Trees, Implementations, Applications. Definition of Undirected and
Directed Graphs and Networks, The Array based implementation of graphs, Adjacency matrix, path
matrix implementation, The Linked List representation of graphs, Shortest path Algorithm, Graph
Traversal – Breadth first Traversal, Depth first Traversal, Connectivity of graphs; Connected components
of graphs, Weighted Graphs, Applications.
Unit IV
Definition: Hash function, Collision Resolution Techniques, Hashing Applications. Time Complexity,
Big – Oh - notation, Running Times, Best Case, Worst Case, Average Case, Factors depends on running
time, Introduction to Recursion, Divide and Conquer Algorithm, Evaluating time Complexity.
Unit V
Introduction, Sorting by exchange, selection, insertions, Bubble sort, Selection sort, Insertion sort, Pseudo
code algorithm and their C++ implementation, Efficiency of above algorithms, Shell sort, Performance of
shell sort, Merge sort, Merging of sorted arrays, merge sort Algorithms Quick sort Algorithm. Analysis of
Quick sort, Picking a Pivot, A partitioning strategy, Heap sort, Heap Construction, Heap sort, bottom –
up, Top – down Heap sort approach, Radix sort.
Straight Sequential Search, Array implementations, Linked List representations, Binary Search, non –
recursive Algorithms, recursive Algorithms, Indexed Sequential Search.
Required Text(s)
 Jr. Symour Lipschetz, Schaum’s outline of Theory & Problems of Data Structures, McGraw-Hill,
1986.
 Ellis Horowitz & Sartaj Sahni, Dinesh Mehta: Fundamentals of Data structures in C++,2nd
Edition, Universitys Press,2008.
 Sartaj Sahni, Data Structure: Algorithms and application in C++, International edition,
WCB/McGraw Hill, 2000.
M.Sc. (C. S.) II Semester
Core-7 Computer oriented numerical and statistical method
2016-2018 and onwards
Unit 1
Solution of non-linear & transcendental equations
Computer Arithmetic: Floating-point representation of numbers, arithmetic operations with
normalized floating-point numbers and their consequences, significant figures. Error in number
representation-inherent error, truncation, absolute, relative, percentage and round-off error.
Iterative Methods: Bisection method, method of false position, newtonrapson method, secant
method, method of successive approximation, concept oriented theoretical consideration of
above methods.
Unit 2
Solution of linear equations Meaning, conditions for solutions, solution of equation by direct
methods - (Gaussian elimination, Gaussian jordan), iterative methods - (Jacobi method, gaussian
seidel), ill-conditional equations and solution.
Unit 3
Interpolation and approximation Introduction, finite differences, Newton's formulae, Central
difference formulae, interpolation with unevenly spaced points, divided difference and their
properties, inverse interpolation and double interpolation.
Unit 4
Numerical integration & solution of ordinary differential equations Concept of numerical
integration with geometrical representation, trapezoidal method, simpson - 1/3 rule, simpson 3/8 rule, veddle's rule, understanding and solution of Ordinary Differential Equation and
theoretical consideration, euler method, modified euler's method, R-K 2nd order & 4th order
method, predictor corrector methods.
Unit 5
Statistics Graphical representation, Frequency distributions, Measures of central tendency,
Measures of dispersions, Correlation, Regression.
TEXT BOOK:
V. Rajaraman, Computer Oriented Numerical Methods, Prentice Hall, India.
REFERENCE BOOKS
1. S. S. Sastry, Introductory Methods of Numerical Analysis.
2. M. K. Jain, S.R.K. Iyengar & R. K. Jain, Numerical Methods for Scientific and Engineering
Computation.
3. H. C. Saxena, Finite Differences and Numerical Analysis.
4. Modes A., Numerical Analysis for Computer Science.
M.Sc. (C. S.) II Semester
Core-8 Database Management Systems
2016-2018 and onwards
Unit I
Introduction: Purpose of DBMS, view of data, data independence, data model, data base languages,
traditional/flat files versus database approach, merits and demerits of both approaches. Profile of people
working in DB environment, database administration, and overall system structure.
Entity-relationship model: Basic concepts of entities and relationships, design issues, mapping
constraints, keys, super key, entity-relationship (E-R) diagram, weak entity sets, extended E-R features,
design of E-R database schema and reduction of E-R schema to tables.
Unit II
Relational –model: Structure of relational database, relational algebra, tuple relational calculus, and
extended relational algebra operators.
Integrity Constraints: Domain constraints, referential integrity, foreign key.
Structure Query Language(SQL): Basic structure ,set operations, aggregate functions, Null values
nested and correlated sub queries ,derived relations,views,Data Definition Language(DDL) Embedded
SQL,and other SQL features, introduction to(other relational query languages),Query –ByExample(QBE) and QUEry Language(QUEL), assertions, triggers and stored procedures.
Unit III
Design theory of relational databases: Functional Dependencies, Design issues problem faced in
designing an application, decomposition, Normalization using multivalue dependencies, Normalization
using join dependencies, Domain key normal form and alternative approaches to database design.
Unit IV
Concurrent operation on database: Locked based protocols, Time-stamp based protocols, multiple
granularity, multiversion schemes, deadlock handling, Insert and delete operation, Thomas Writing Rule
and concurrency in index structures.
Unit V
Crash recovery systems: Failure classification, storage structure, recorey and Atomicity, Log Based
Recovery mechanisms, Shadow paging, Recovery with concurrent transactions, and advanced recovery
techniques.
Introduction to distributed and Object Oriented Databases.
Case study : Oracle
Required Text(s):
 Henry F. Kourth, Abraham Silverschatz, S. Sudarshan “Database System Concepts”,5th Edition
TataMcGraw Hills Publishing Co.,2005
 Ramez Elmasri, shamkant B. Navathe, Fundamentals of Database System, 5th edition, addition
Wesley, 2006.
 An Introduction to Database system- Bipin C. Desai.
 SQL, PL/SQL the Programming Language of Oracle- Ivan Bayross.
 An Introduction to Database system- C.J. Date.
M.Sc. (C. S.) III Semester
Core-9 Object Oriented Programming using Java
2016-2018 and onwards
Unit I
Introduction to Java: Features of Java, Object-oriented programming overview, Introduction of Java
Technologies, How to write simple Java programs, Data Types, Variables &Arrays, Naming
Conventions. Type conversion & casting, Operators, Control Statements, Selection Statements, Iteration
Statements, Jump Statements.
String Handling: The String constructors, String operators Character Exaction, String comparison,
String Buffer.
Unit II
Introducing Class: Class fundamentals, Declaring objects, Introducing methods, Constructors, Garbage
collection, Overloading methods, Parameter passing, Nested and Inner class.
Inheritance: Basic, Using super, Method overriding, Dynamic Method Dispatch, Abstract classes, The
Object class.
Unit III
Packages and Interfaces: Defining a Package, Understanding CLASSPATH, Access Protection,
Importing packages, defining an Interface, Achieving multiple inheritance through interfaces, Variables in
Interfaces.
Exception Handling: Exception handling fundamentals, Exception types, Using try and catch, Multiple
catch and nested try, Throw, throws and finally, Creating own exception classes.
Multithreading: What are threads, The java thread model, Thread priorities, Thread life cycle, Creating
thread, Creating multiple threads, Thread Groups, Synchronization, Inter-thread
Communication.
Unit IV
Streams and Files: Files and Streams
Introduction To Swing: Overview of swing Components, Event Handling, Layout managers
Applets: Applet basics, Applet Architecture, Applet skeleton, Applet HTML Tag and attributes, Passing
parameters to Applets.
Unit V
Database connectivity: JDBC, The design of JDBC, Typical uses of JDBC, The Structured Query
language, Basic JDBC Programming concepts, Executing Queries.
Introduction to Generic and Collection API.
Required Text(s)
 Deitel & Deitel ,JAVA How to Program, 6th Edition , Pearson Education.
 Herbert Schildt ,The Complete Reference JAVA 2, 4th Edition , Tata McGraw-Hill.
 John Hubbard, Schaum’s Easy outline: Programming with Java .
 JAVA 2 Black Book.
 Bruce Eckel ,Thinking in Java by Bruce Eckel , Prentice Hall.
 Gary Cornell, Cay Horstmann ,Core Java 1.2: Volume 1 Fundamentals by Gary Cornell, Cay
Horstmann, Prentice Hall.
 Java Series ,The Sun Microsystems Press Java Series.
 Janson Hunter with William Crawford Java Servlet Programming, ,O’Reilly.
M.Sc. (C. S.) III Semester
Core-10 Database Applications and Tools
2016-2018 and onwards
Unit I
Database Development Process: Database Development within information Systems Development,
Information System Architecture, Information Engineering, Information System planning. Database
Development Process, System Development Lifecycle
Unit II
Database Analysis: Modeling Data in Organization, ER Model and ER Model Constructs, EER Models
and EER Models Constructs, case study
Unit III
Logical and Physical Design of Database System: Relational Data model, Transforming EER into
Relations, Normalization, Designing Fields, Choosing Data Types, Choosing Data Integrity, Designing
Physical Records and De-normalization,
Unit IV
Designing Physical Files: File Organizations, Sequential File Organization, Indexed File Organization,
Hashed File Organization, RAID, Query Processing and Optimization.
Unit IV
Advanced Topics(Overview) : Data Warehousing, Data Mining, Distributed Databases, Object Oriented
databases, Object Relational Databases, Case Study.
Reference Books:
 Jeffrey A. Hoffer, Mary Prescott, Fred McFadden, Modern Database Management, 8th
Edition, Pearson Education.
 Thomas M. Connolly, Carolyn E. Begg, Data Base System: A Practical approach to
Design, Implementation and Management, 4th edition, Addition Wesley, 2004.
M.Sc. (C. S.) III Semester
Elective-1 Theory of Computation
2016-2018 and onwards
Unit I
Introduction :Grammars and Languages, Context Free and Context Sensitive Languages. Programs ,
Languages and Parsing, Phrase Structure Grammars and their classification. Chomsky Hierarchy, Closure
Properties.
UNIT II
Theory of Automata: Finite Automata, Deterministic Finite Accepters- Transition Graphs, Languages
and DFAs, Regular Languages, Non-Deterministic Finite Acceptors. Equivalence of Deterministic and
Non-deterministic Finite Accepters, Mealy and Moore models-Definitions, Transformation of Mealy
Machine into Moore Machine and vice-versa. Minimization of Finite Automata – Definition and
Construction.
UNIT III
Regular Languages: Regular Expressions, Connection between Regular Expressions and Regular
Languages. Regular Grammars – Right and Left Linear Grammars, Equivalence between Regular
Languages and Regular Grammars.
UNIT IV
Context-Free Languages : Context-Free Grammars- Leftmost and Rightmost Derivations, Derivation
Trees, Parsing and Ambiguity, Simplification of CFGs. Chomsky Normal Form, Greibach Normal Form,
Cockie-Kasami-Younger Algorithm. Properties of Context-Free Languages.
UNIT V
Pushdown Automata : Definition, Nondeterministic Pushdown Automata, Pushdown Automata for
Context Free Languages. Context-Free Grammars for Pushdown Automata. Deterministic Pushdown
Automata and Deterministic Context-Free Languages.
Turing Machines: Definition of standard Turing Machine, Turing Machine as Language Accepters and
Transducers.
Required Text(s):
 Mishra and Chandrasekaran, Theory of Computer Science, Prentice Hall of India.
 Hopcraft and Ullman, Introduction to Automata Theory, Languages and Computation, Narosa
Publishing House.
 John E. Hopcroft , Rajeev Motwani , Jeffrey D. Ullman , Introduction to Automata Theory,
Languages, and Computation ,3rd Edition,Addison Wesley, 2006.
 Moll, Arbib and Kfoury, An Introduction to Formal Language Theory, Springer-Verlag.
 Peter Linz, An Introduction to Formal Languages and Automata, Narosa Publishing House
M.Sc. (C. S.) III Semester
Or Elective-1 Linux/ UNIX Administration
2016-2018 and onwards
Unit 1
Background: Evolution of Unix OS. Unix implementations. Features of Unix operating system.
Linux operating system: Development of Linux. Applications of Linux operating system.
Unit 2
Basic UNIX environment: Basic commands, directory management, pipes, tee, I/O redirection
and other utilities. Advanced commands: File system and process management commands,
Shell, Pattern matching, Navigating the File Systems.
Unit 3
Unix editor: VI editor, Creating new files. Text addition, deletion and changes. Dealing with
sentences and paragraphs. Searching. Cut, paste and copy. Running C/C++ programs. Shell
programming: Features of shell. Shell variables. Control statements.
Advance shell
programming: Command line arguments. Interactive shell scripts. Debugging of shell scripts.
Communication facilities in UNIX.
Unit 4
Structure of unix operating system: Structure of unix kernel, Unix system calls. Unix system:
File system calls, Process management calls. Advance Filter: Awk: Number processing, Interface
with shell, functions.
Unit 5
Unix system administration: Adding and removing users. User accounting. Adding and
removing hardware. Performing backups and restore. Disk space management. Unix system
administration: Configuring the kernel. Network management in UNIX. Performance analysis.
UNIX Desktop.
1. Text Book :
UNIX Operating Systems: Sumitabh Das, Tata McGraw Hills publication.
2. Reference books :
1. UNIX System Administration Handbook( Second edition): Evi Nemeth, Garth Synder, Scott
Seebass, Trent R Hein, Pearson Education - Asia, 2000.
2. C: Design of UNIX Operating System: Maurice J. Back, Pearson Education – Asia
M.Sc. (C. S.) III Semester
Elective-2 Software Engineering
2016-2018 and onwards
Unit I
Introduction to Software Engineering & Software Processes: Software problem, Software engineering
problem, Software engineering approach, Software characteristics and Applications. Software processes
and its components, characteristics of software processes, Software development processes: Linear
Sequential model, Prototyping model, RAD model, Iterative Enhancement model, Spiral model,
Component based development, Comparative study of various development models.
Unit II
Project management process & Project Planning: The people, product, process and project, Phases of
project management process, Project life cycle, the W5HH principle. Software configuration management
process, Process management process: Capability Maturity Model (CMM). Project estimation (Size &
Cost), Project Scheduling, Staffing and personnel planning, Software configuration management plans,
Quality assurance plans, Project monitoring plans, Risk management.
Unit III
Software Requirement Analysis and Specification :Software requirements, Problem analysis
(Structured analysis and Object Oriented analysis), Requirements specifications, Validation and
Verification.
Unit IV
Software Design: Design principles: Problem partitioning and hierarchy, Abstraction, Modularity, Topdown and Bottom-up strategies. Effective Modular design: functional independency, Cohesion, Coupling.
Structured design methodology.
Software Quality Assurance: Quality concept, Quality management system, movements and assurance,
Software reviews: formal and technical, Formal approaches to SQA, Statistical software quality
assurance, Software reliability, ISO 9000, SQA plan.
Unit V
Software Testing: Software testing techniques: Testing fundamentals, White box testing, Black box
testing, Testing for specialized environments, architectures and applications. Software testing strategies:
A strategic approach to software testing, Strategic issues, Unit testing, Integration testing, Validation
testing and system testing, The art of debugging.
Required Text(s):
 Pankaj Jalote, An Integrated Approach to Software Engineering , Narosa Publishing House.
 R. S. Pressman ,Software Engineering-A practitioner’s approach, 6th Edition Tata McGraw-Hill
International Editions, New York,2004.
 Ian Sommerville , Software Engineering, 8th edition, Pearson Education, New Delhi.
 Richard E. Fairly, Software Engineering Concepts, Tata McGraw Hill Inc. New York.5.
 W. S. Jawadekar ,Software Engineering: Principle & Practice, Tata McGraw-Hill, New York.
 Rajib
Mall
,Fundamentals
of
Software
Engineering,
PHI,
New
Delhi
M.Sc. (C. S.) III Semester
Or Elective-2 Computer Architecture
2016-2018 and onwards
Unit I
Technological trends, measuring performance, Amdahl’s law.
Basic structure of computer hardware: Functional units and components in computer Organization:
The memory unit, the input and output subsystem, the bus structures, ALU.
Program development tools: Compiler, interpreter, assembler.
Unit II
Instruction sets and processor organizations: Instruction and Interrupt Cycles, Instruction Sequencing,
Addressing Modes. Instruction set.
8088 microprocessor: Architecture. 8088 Assembly language programming.
Unit III
Processing unit design: Processor micro architecture I - fundamental concepts of data path
Implementation. Processor micro architecture II- data path implementation, Hardwired control
Unit, micro programmed Execution.
Unit IV
Instruction pipelining and parallel processing: Instruction pipelining hazards, Instruction set Design
influence on pipelining, Example of a pipelined CISC & RISC processor.
Unit V
Instruction level parallelism: VLIW Processors, Vector processors, Multithreaded processors,
Extracting parallelism. Caches: Data Caches, instruction caches, Unified caches. Cache implementations,
multilevel caches.
Virtual memory : Organization, Mapping functions for translating the program pages in virtual to
physical address space, Cache and virtual memory.
Required Text(s):
 Computer Architecture: Scahaum’s outlines by Nicholas Carter Adapted by Dr. Rajkamal, 1st
Edition, McGraw Hill,2001.
 Computer Organization by Hamecher.
 William stallings ,Computer Organization & Architecture, 6th Edition, Prentice Hall, 2002.
 Computer Architecture & Parallel Processing, Hwang & Briggs, McGraw Hill.
M.Sc. (C. S.) IV Semester
Core -11 System Analysis and Design
2016-2018 and onwards
UNIT-I System Concept: Definition, Characteristics, Elements of system, Physical and abstract system,
open and closed system, man-made information systems. System Development Life Cycle: Various
phases of system development, Considerations for system planning and control for system success.
System Planning: Base for planning a system, Dimensions of Planning.
UNIT-II Initial Investigation: Determining users requirements and analysis, fact finding process and
techniques. Feasibility study: Determination of feasibility study, Technical, Operational & Economic
Feasibilities, System performance constraints, and identification of system objectives, feasibility report.
Cost/Benefit Analysis: Data analysis, cost and benefit analysis of a new system. Categories determination
and system proposal.
UNIT-III Tools of structured Analysis: Logical and Physical models, context, diagram, data dictionary,
data diagram, form driven methodology, IPO and HIPO charts, Gantt charts, system model, pseudo codes,
Flow charts- system flow chart, run flow charts etc., decision tree, decision tables, data validation, Input/
Output and Form Design: Input and output form design methodologies, menu, screen design, layout
consideration.
UNIT-IV Management standards – Systems analysis standards, Prgramming standards, Operating
standards. Documentation standards – User Manual, system development manual, programming manual,
programming specifications, operator manual. System testing & quality: System testing and quality
assurance, steps in system implementation and software maintenance. System security: Data Security,
Disaster/ recovery and ethics in system development, threat and risk analysis. System audit.
UNIT-V Organisation of EDP: Introduction. Job Responsibilities & duties of EDP Personnels- EDP
manager, System Analyst, Programmers, Operators etc. Essential features in EDP Organization. Selection
of Data Processing Resources: purchase, lease, rent-advantages and disadvantages. Hardware and
software procurement – In-house purchase v/s hiring and lease.
Text & Reference Books: ‰
System Analysis & Design by V K Jain, Dreamtech Press ‰
Modern System Analysis & Design by A Hoffer, F George, S Valaciah Low Priced Edn. Pearson
Education. ‰
M.Sc. (C. S.) IV Semester
Core – 12 Design and Analysis of Algorithms
2016-2018 and onwards
Unit I
Order Analysis: Objectives of time analysis of Algorithms. Big – oh and Theta notations. Master Theorem and
its proof, Solutions of divides and conquers recurrence relations.
Searching, Sorting, and Divide and Conquer Strategy: Linear Search, binary Search, Searching, Sorting and
Divide and Conquer Strategy: Merge-Sort; Quick-Sort with average case analysis. Heaps and heap-sort. Lower
bound on comparison- based sorting and counting sort.
Unit II
Dynamic Programming: Methodology and examples (Fibonacci number, Knapsack problem and some other
simple examples) Dynamic Programming: Matrix Chain Multiplication, Weighted interval scheduling,
Assembly Line Scheduling.
Unit III
Greedy Method: Methodology, Examples and comparison with DP (more examples to come later in Graph
Algorithms).
Greedy Method: Knapsack problem and some other simple examples.
Unit IV
Graph Algorithms: Basics of graphs and their representations. BFS, DFS, Topological Sorting. Minimum
Spanning trees (Kruskal and Prim’s Algorithms and brief discussions of disjoint set and Fibonacci heap data
structure). Shortest Paths (Dijkstra, Bellman- Ford, Floyd-Warshall).
Unit V
Hard Problems and Approximation Algorithms: Problem classes P, NP, NP-hard and NP-complete,
deterministic and nondeterministic Polynomial- time algorithms. Approximation algorithms for some NPcomplete problems.
Recommended Books and Reference Material:



A.V. Aho, J.E. Hop croft, and J. D. Ullman, The Design and Analysis of Computer Algorithms,
Addison Wesley.
Thomas H. Cormen, Charles E. leiserson, Ronald L. Rivest, Clifford stein, Introduction to algorithms,
The MIT Press: 2nd Edition (1st September, 2001).
E. horowitz and Sahni, Fundamentals of Computer Algorithms, galgotia Publications.
M.Sc. (C. S.) IV Semester
Elective-3 Internets and Web Technology
2016-2018 and onwards
Unit 1
Introduction Dynamic Web Programming, HTML Forms, scripting languages, Introduction to HTTP,
web Server and application Servers, Installation of Application servers, Configuration files, Web.xml.
Java Servlet, Servlet Development Process, Deployment Descriptors, The Generic Servlet Lifecycle.
Unit 2
Servlet Packages, Classes, Interfaces, and Methods, Handling Forms with Servlets. Various methods of
Session Handling. Various elements of deployment descriptors. Java Database Connectivity: various steps
in process of connection to the database, Various type of JDBC Driver.
Unit 3
Connection of JSP and Servlet with different database viz. Oracle, MS-SQL Server, MySQL. java.sql
Package. Accessing metadata from the database. Type of Statement, Connection pooling: multiple users
and need of connection pooling.
Unit 4
JSP Basics: JSP lifecycle, Directives, scripting elements, standard actions, implicit objects. Writing JSPs.
Expression Language (EL), Separating Business Logic and Presentation Logic, Building and using
JavaBean.
Unit 5
Session handling in JSP, Types of errors and exceptions handling, Standard Tab Library in JSP, Building
Custom Tag Library, JSP Tag Library, MVC Design pattern Advances in J2EE and Other Web
technology
1. Text Book :
Kevin Mukhar, Chris Zelenak, James L Weaver, “Beginning Java EE 5: From Novice to
Professional” Apress
2. Reference books :
1. Marty Hall, Larry Brown, “Core Servlets and Java Server Pages”, 2nd edition, Pearson
Education
2. JavaDoc for various technologies
3. Internet and Web technologies, TMH, 2002
M.Sc. (C. S.) IV Semester
Or Elective-3 Accounting and Financial Management
2016-2018 and onwards
UNIT I
Basic accounting concepts. Accounting structure: Process of accounting, journal, ledger and trial
balance based on double entry book keeping.
UNIT II
Practical system of accounting: Cash book, sales and purchase goods, bills of exchange, book
reconciliation statement
UNIT III
Preparation of financial statement: income statement (Profit and loss account), Statement of
financial position (Balance sheet) and adjustment, valuation of assets and depreciation method.
UNIT IV
Cash and fund flow statement. Analysis of financial statement-financial ratio.
UNIT V
Introduction to cost accounting: Element of cost , cost determinations, Direct and indirect cost,
cost centers and cost units, The behavior of cost .
TEXT BOOK
Introduction to accountancy by T.S Grewal. S.Chand Books
REFERENCE BOOKS:
1. Reddy TS and Han Prasad Reddy - Financial and Management Accounting
2 .Financial Management - Prasanna Chandra
3. Myddelton - The essence of Financial Management - Prentice-Hall Of India
4. Vanhorne - Fundamentals of Financial Management - Prentice-Hall Of India
5. Accounting principles by Robert Anthony.
6. Advance accountancy by R.I Gupta
7. An introduction to accounting by Maheshwary S.N
M.Sc. (C. S.) IV Semester
Elective – 4 Computer Graphics and Multimedia
2016-2018 and onwards
Unit I
Introduction: Application of Graphics, Display Devices: Refresh Cathode -Ray Tubes, Raster Scan
Displays, Random Scan Displays, Color CRT Monitors, Flat Panel Displays. Video cards/display cards.
Input Devices: Mouse, Trackball, Space ball, Data Glove, Joystick, Light pen, Scanner, Digital Camera,
Touch Panels, Voice Systems.
Hardcopy Devices: Printers and Plotters
Unit II
Graphics Primitives:
Line Generation Algorithms: DDA algorithm, Bresenham’s algorithm.
Circle Generation Algorithms: Midpoint Circle algorithm, Bresenham’s circle generation algorithm.
Displaying Lines,characters and polygon.
Polygon filling Algorithms: Scan Line Polygon fill algorithm, Inside - Outside Tests, Boundary-Fill
algorithm, Flood -Fill algorithm. Fundamentals of aliasing and Antialiasing Technique.
Unit III
Clipping: Clipping operations, Point clipping.,
Line clipping: Cohen Sutherland Algorithm, Liang Barsky Algorithm, Nicholl-Lee-Nicholl Algorithm.,
Polygon clipping: Sutherland- Hodgeman Algorithm, Weiler Atherton Algorithm., Text clipping,
Exterior clipping.
Unit IV
Two Dimensional & Three Dimensional
Two Dimensional Transformations: Translation, Scaling, Rotation, Reflection, Shear, Homogenous
coordinate system, composite transformations, raster method of transformation.
Two Dimensional Viewing: Window to View port coordinate transformation.
Three Dimensional: 3D Geometry, 3D display techniques, transformations. Projections: Parallel
Projection, Perspective Projection.
Unit V
Shading and Color Application:
Visible surface Detection Methods: Depth Buffer Method, A-Buffer Method.
Illumination Model: Diffuse & Specular reflection, Point Source, Ambient Light, Transparency, Surface
Pattern & texture, shadow,
Holftoning, Dithering Techniques, Color Models.
Required Text(s)
 Donald Hearn and M. Pauline Baker, Computer Graphics , Second Edition, Tata McGraw
Hill,1997.
 Donald Hearn and M. Pauline Baker, Computer Graphics : C version , Second Edition, Tata
McGraw Hill,1996.
 William M. Newman, Principales of Interactive Computer Graphics, Second Edition, Tata
McGraw Hill,1978.
 David F. Rogers,Tata Procedural Elements for Computer Graphics, Mc-Graw-Hill Edn,New
Delhi, 2000.
M.Sc. (C. S.) IV Semester
Or Elective -4 Compiler Design
2016-2018 and onwards
Unit I
Translators, interpreters, assemblers, Compilers, Model of a compiler. Analysis of source program, The
phases of a compiler, Cousins of the compilers. Finite automata, non-deterministic and deterministic finite
automata, Acceptance of strings by NDFA and DFA, Transforming NDFA to DFA.
Minimization/Optimization of a DFA, related algorithm, Regular sets and regular expression. Obtaining
regular expression from finite automata. Lexical analyzer design, the role of Lexical Analyzer, Input
Buffering, Specification of tokens, and Recognition of tokens. Syntax analysis, CFG, derivation of a parse
tree, reduction of grammar, useless grammar symbols, Elimination of null and unitProductions.
Elimination of left recursion Regular grammar, Right linear and left linear grammar.
Unit II
Parsing: Top-Down and Bottom Up parsing, general parsing strategies. Brute-force approach, recursive
descent parser and algorithms. Simple LL (1) grammar, LL (1) with null and without null rules grammars,
Bottom-up parsing- Handle of a right sentential Form, Shift-reduce parsers, operator precedence parsing,
LR, SLR, canonical LR and LALR grammar and parsers.
Unit III
Symbol table contents, organization for non- block structured language-unordered, ordered, and treestructured and hash ,Organization for block structured languages-stack symbols tables. Stackimplemented tree structured stack implemented hash structured symbol tables.
Unit IV
Specification of translations, implementation of translation specified by syntax-directed definition, Lattributed definitions, and syntax-directed translation schemes Intermediates code generation,
representing three-address statement, translation schemes for programming language constructs.
Unit V
Code Optimization:- Definition, loop Optimization, Elimination of local and global common sub
Expressions, loop unrolling, Loop Jamming.
Code Generation:- Definition, machine model, code generation methods, Peephole optimization. Error
Handling :- Error recovery from various phase and parsing.
Required Text(s)
 Alfred V. Aho, Monica S. Lam Ravi Sethi, Jeffrey D. Ullman, Compilers: Principals, Techniques,
and Tools, 2nd Edition, addition Wesley: 2006.
 Alfred V. Aho, Jeffrey D. Ullman, Principals, of Compiler Design,Addition Wesley: 1977
 Jean Paul Tremblay, Paul G. Sorenson, The Theory & Practice of Compiler Writing, Tata
Mcgraw Hill, May 1985.
 William A. Barrett, John D. Couch ,Compiler Construction Theory & Practice, Sra, june 1979.
Open Elective Paper: Computer Application (Inter-disciplinary)
UNIT- I
Computer Generations Von Neumann Machine Architecture, Functional Units and Components
in Computer Organization. Computers – Block diagram, Basic components of a Digital
Computer - Control unit, ALU, Memory, Uses of Program Development, Tool, Editor, Compiler,
Assembler, Interpreter, Algorithm, Flowchart, Logic Development & Problem solving.
UNIT- II
MS-Windows: Operating system-Definition & functions, basics of Windows. Basic components
of windows, icons, types of icons, taskbar, activating windows, using desktop, title bar, running
applications, exploring computer, managing files and folders, copying and moving files and
folders. Control panel – display properties, adding and removing software and hardware, setting
date and time, screen saver and appearance. Using windows accessories.
UNIT III
Documentation Using MS-Word - Introduction to Office Automation, Creating & Editing
Document, Formatting Document, Auto-text, Autocorrect, Spelling and Grammar Tool,
Document Dictionary, Page Formatting, Bookmark, Advance Features of MS-Word-Mail Merge,
Macros, Tables, File Management, Printing, Styles, linking and embedding object, Template.
UNIT IV
Electronic Spread Sheet using MS-Excel - Introduction to MS-Excel, Creating & Editing
Worksheet, Formatting and Essential Operations, Formulas and Functions, Charts, Advance
features of MS-Excel-Pivot table & Pivot Chart, Linking and Consolidation.
UNIT V
Presentation using MS-PowerPoint: Presentations, Creating, Manipulating & Enhancing Slides,
Organizational Charts, Excel Charts, Word Art, Layering art Objects, Animations and Sounds,
Inserting Animated Pictures or Accessing through Object, Inserting Recorded Sound Effect or
In-Built Sound Effect.
TEXT AND REFERENCE BOOK
1.
2.
3.
4.
5.
Rashid Sheikh, “Computer Organization & Architecture” (Only for First Unit)
Learn Microsoft Office – Russell A. Shultz – BPB Publication
Microsoft Office – Complete Reference – BPB Publication
Courter, G Marquis (1999). Microsoft Office 2000: Professional Edition. BPB.
PC Software – Shree Sai Prakashan, Meerut