M.Sc.

Computer Science : Syllabus [ CBCS ]

RAMA DEVI WOMEN’S UNIVERSITY

MASTER OF SCIENCE
M.Sc. COMPUTER SCIENCE [ CBCS ]

SEMESTER-I
SL.NO PAPER COURSE TITLE MARKS CREDIT GROUP
1 CS-1 DATA STRUCTURE & 100 6 HCC-1
ALGORITHMS
2 CS-2 COMPUTER SYSTEM 100 6 HCC-2
ARCHITECTURE
3 CS-3 DATABASE SYSTEMS & 100 6 HCC-3
IMPLEMENTATION
4 CS-4 a) Data structure & 100 6 HCC-4
Algorithm Lab
b) Database Lab
SEMESTER-II
5 CS-5 OPERATING SYSTEM 100 6 HCC-5
DESIGN
6 CS-6 DISCRETE MATHEMATICAL 100 6 AEC-1
STRUCTURE
7 CS-7 ADVANCED JAVA 100 6 AEC-2

8 CS-8 a) Operating System Lab 100 6 HCC-6

b) Advanced Java Lab
SEMESTER-3
9 CS-9 COMPUTER NETWORKS 100 6 HCC-7
10 CS-10 ARTIFICIAL INTELLIGENCE 100 6 CEC-1
11 CS-11 a) Networking Lab 100 6 CEC-2
b) AI Lab
12 CS-12 THEORY OF 100 6 AEC-1
COMPUTATION
13 CS-13 INFORMATION 50 3 OEC
TECHNOLOGY
SEMESTER-4
14 CS-14 COMPILER DESIGN 100 6 HCC-8
15 CS-15 PROJECT / DISSERTATION 100 6 HCC-9

16 CS-16 SOFTWARE ENGINEERING 100 6 CEC-3

17 CS-17 MOBILE COMPUTING 100 6 CEC-4
18 CS-18 E-COMMERCE 50 3 OEC-2

HCC- HARD CORE COURSE CEC-CORE ELECTIVE COURSE

AEC-ALLIED ELECTIVE COURSE OEC-OPEN ELECTIVE COURSE
 M.Sc. Computer Science : Syllabus [ CBCS ]

RAMA DEVI WOMEN’S UNIVERSITY

MASTER OF SCIENCE

M.Sc. COMPUTER SCIENCE [ CBCS ]

1st Year

SMESTER –I H ARD CORE COURSE -1 PAPER-CS1 [ 20+80= 100 Marks]

DATA STRUCTURE & ALGORITHM

Unit- I: Introduction, The Role of algorithms in computing, Growth of functions,

Recurrences, Heap sort, Quick sort, Sorting in linear time.

Unit-II: Elementary Data Structures, Hash Tables, Binary Search Trees, AVL Tree, trees,
B-trees, B+ trees, Data Structures for Disjoint sets.

Unit-III: Elementary Graph algorithms, Representation of Graphs, BFS DFS And

Topological Sort, Minimum Spanning Trees (Algorithm of Kruskal & Prim)
Shortest path (Dijkstra’s Algorithm),All Pairs Shortest path (Floyed-Warshall
Algorithms) .

Unit – IV: Algorithm Design And Analysis Techniques: Dynamic programming (Matrix Chain
multiplication, LCS),Greedy algorithms, (Ex: Activity-Selection problem,Job
sequencing with deadlines),Backtracking (EX: Eight_queens Problems and
subset sum problem), Amortized analysis.,String Matching,String matching
algorithms. Rabin –Karp,
Unit – V: P, NP and NP-Completeness, Approximate Algorithm: Polynomial-Time
Verification, NP-Completeness and reducebility,NP-Completeness proofs,NP-
Completeness problems,(Hamilton Cycle Problem & Travelling Salesman
Problem) ,Vertex Cover, Clique, 3 CNF, SAT.

Text books:

1. Introduction to Algorithms T.H. Corman, C.E.Leiserson, R.L.Rivest and C. Stein

2. Classic Data Structure – Debasis Samanta ,PHI

Reference books:

1. Gilles Brassard and Paul Bratley: Fundamentals of Algorithmics

2. A.V. Aho, J.E.Hopcroft and J.D.Ullman: The Design and Analysis of computer
Algorithms.
3. Ellis, Horwitz, Sartaj Sahani and S. Rajashekaran, Computer Algorithms,
Galgotia Publications Pvt. Ltd.
SEM-I HARD CORE COURSE-2 PAPER-CS2 [ 20+80=100 Marks]

COMPUTER SYSTEM ARCHITECTURE

UNIT I: Computer Function and Interconnection: Computer Components, Computer

Function, Interconnection Structures, Bus Interconnection, PCI, Cache
Memory: Computer Memory System, Cache Memory Principles, Elements
of Cache Design, Pentium-4 Cache Organization.

Unit-II: External Memory: Magnetic Disk, RAID, Optical Memory, Magnetic Tape,
External Devices, I/O Module, Programmed I/O, Interrupt-Driven I/O,
Direct Memory Access, I/O Channels and Processors, Fire Wire and Infini
Band.

Unit-III: CPU Structure and Function: Processor Organization, Register

Organization, Instruction Cycle, Instruction Pipelining. The Pentium
Processor. Reduced Instruction Set Computer (RISC): Instruction
Execution Characteristics, Use of a large Register File, Compiler-Based
Register Optimization, Reduced Instruction Set Architecture, RISC
Pipelining, MIPS R4000, SPARC, RISC Versus CISC Controversy.

Unit-IV: Instruction Level Parallelism and Superscalar Processors: Overview,

Design Issues, Pentium-4. IA-64 Architecture: Motivation, General
Organization, Prediction, Speculation, and Software Pipelining, IA-64
Instruction Set Architecture, Itanium Organization.

Unit-V: Parallel Organization: Multiple Processors Organizations, Symmetric

Multiprocessors, Cache Coherence and MESI Protocol, Clusters, Non-
Uniform Memory Access (NUMA), Vector Computation.

Text Books
1. Stalling W.Computer Organization and Architectrure. (PHI)
2. G.Vranesic, S.G.ZAky – Computer Organization McGraw Hill 1996

References
1. M.M.Mano – Computer System Architecture, 3rd Edition, PHI 1993
2. K.Hwang – Advanced Computer Architecture, McGraw Hill, 1993
3. D.Sima, T.Fountation, P.Kacsak – Advanced Computer Architecture – A design space Approach,
Addison Wesley, 1997
SEM-I HARD CORE COURSE-3 PAPER-CS-3 [20+80= 100 Marks]

DATABASE SYETEMS & IMPLEMENTETAION

Unit I
Data modeling using the entity relationship Model, Using High level conceptual data models for database
design, An example database application, Entity Types, Entity sets, Attributes and keys, Relationships,
Relationship types, Roles and structural constraints, Weak entity types, Refining the ER design for the
company database, ER diagrams, Naming conventions and design issues.
Enhanced entity-relationship and object modeling subclasses.
Unit II
ER and EER to relational mapping, Mapping EER model concepts to relations, The tuple relational
calculus, The Domain relational calculus, Functional Dependencies and Normalization for relational
Databases – Informal design guidelines for relational schemas, Functional dependencies, Normal forms
based on primary keys, General definitions of second and third normal forms, Boyce-codd normal form.
Unit III
SQL- The Relational Database Standard – Data Definition, Constraints and schemas, Changes in SQL2,
Basic queries in SQL, More complex SQL queries, Insert, Delete and Update statement in SQL, Views in
SQL, Specifying general constraints as assertion.
Unit IV
Query processing and Optimization – Translating SQL queries into relational algebra, Basic diagram for
executing query operations, Using Heuristics in query optimization,
Transaction processing concepts – Introduction to transaction processing, Transaction and system
concepts, Desirable properties of transaction, Schedules and recoverability, Serialisability of schedules.
Concurrency Control Techniques – Locking techniques for concurrency control, Concurrency control
based on time stamp ordering, Multi version concurrency control techniques, Validations concurrency
control techniques.
Unit V
Database Security and Authorization – Introduction to database security issues, Discretionary access
control based on granting and revoking privileges, Mandatory access control for multilevel security.
Distributed Database and Client Server architecture – Distributed database concepts, Data fragmentation,
Replication and allocation technique for distributed database, Types of distributed database systems,
Query processing in distributed databases, Overviews of concurrency control and recovery in distributed
databases, An overview of client server architecture and its relationship to distributed database.

Text Book
1. Fundamentals of Database System – Elmasri Navathe – Addison Wesley
2. Learning Oracle SQL and PL/SQL: A simplified Guide

Reference Books
1. A. Silberschatz, H.F. Korth, S. Sudarshan, “Database System Concepts” 6/e, McGraw
Hill, 2010
2. R. Ramakrishanan, J. Gehrke, “Database Management Systems”, McGraw-Hill
SEMESTER-I HARD CORE COURSE-4 PAPER-CS4 [20 + 80=100 Marks]

PRACTICAL

c) Data structure & Algorithm Lab

d) Database Lab
SEMESTER-II HARD CORE COURSE-5 PAPER:CS-5 [ 100 Marks ]

OPERATING SYSTEM DESIGN

UNIT-I
Introduction: Definition of OS - early History - history of DOS and UNIX operating system
Process: Definition of process - process states - process state transition - interrupt processing -
interrupt classes - context switching - semaphores - deadlock and definite postponement. User
Operating System Interface, System Calls, Types of System Calls, System Programs,
Operating-System Design and Implementation, Operating System Structure, Virtual Machines,
Operating System Debugging, Operating System Generations. System Boot.
UNIT-II
Storage management: Real storage management strategies - contiguous versus non-
contiguous storage allocation - single user contiguous storage allocation - fixed partition
multiprogramming - variable partition multiprogramming - multiprogramming with storage
swapping. Virtual storage: Virtual storage management strategies - page replacement strategies
- working sets - demand paging - paging sets.
UNIT-III
Processor management: Preemptive versus non-preemptive scheduling - priorities -deadline
scheduling - FIFO - RR - Quantum size - SJF - SRT - SHN. Distributed computing:
Classification of sequential and parallel processing-array processors - dataflow computers -
multiprocessing - fault tolerance.
UNIT-IV
Device and information management: Operation of moving head disk storage - need for disk
scheduling - seek optimization - FCFS - SSTF - SCAN - RAM disks - optical disks. Files and
database systems: File system - function - organization - allocating and freeing space - file
descriptor - access control matrix.
UNIT-V
Case studies: DOS - memory management - overlaying - extended and expanded memory -
memory allocation - file system and allocation method - internal and external command memory
management functions - file management functions. UNIX: Process in UNIX - memory
management - I/O systems - file systems and allocation method - semaphores - command
systems

Text Book
1. Willam Stallings, "Operating Systems", 5/e PHI/Pearson Education, .
2. Silberschatz, Peterson, Galvin, "Operating System Concepts", Addisson Wessely,
Fifth Edition,
3. H.M.Deital, “An introduction to operating systems”, Addison wisely,
References
1. Charles Crowley, "Operating systems - A Design Oriented Approach", Tata
McGraw Hill, 1998.
2 Andrew S. Tannenbaum, "Operating Systems: Design and Implementation", ,
PHI, 2006.
3. Mukesh singhal, Niranjan G shivaratri, “Advanced concepts in operating systems ”, TMG,.
SEM-II ALLIED ELECTIVE COURSE-1 PAPER-CS-6 [20+80= 100 Marks]

DISCRETE MATHEMATICAL STRUCTURES

Unit-I: Fundamentals of logic, Prepositional equivalences, Predicates and

Quantifiers, Nested Quantifiers, Methods of Proof, Sequences and
summations, Convergence of series, Mathematical Induction.

Unit-II: Sets, set operations, properties of binary relations, equivalence relations

and partitions, partial ordering relations and lattices, chains, function and
the pigeonhole principle.

Unit-III: The basic of counting, permutations and combinations, recurrence

relations, solving recurrence relations, generating functions, inclusion-
exclusion

Unit-IV: Introduction to graphs, graph terminology, Representing graphs and graph

isomorphism, Euler and Hamilton paths, introduction to trees, applications
of trees.

Unit-V: Groups, subgroups, cosets and Lagrange’s Theorem, Codes and group
codes, homomorphism and normal subgroups, Isomorphism, Ring,
Integral Domains and Fields.

Text Book

1.Kenneth H. Rosen, Discrete /mathematics and its Applications, Mc Graw Hill

International
1. C.L. Liu, “elements of Discrete Mathematics”, Mc Graw Hill International .
Reference Books

1. Bernardi Kolman, Robert C. Busby, Sharon Ross, “Discrete Mathematical

Structure” Prentice Hall of India.
2. Mott, J.L. Kandel, A. & Baker, T.P.: Discrete Mathematics for Computer Science
and Mathematics,
3. N.Ch. S.N. Lyenger, Chankrasekaran, Venkatesh, Arunachalam, “Discrete
Mathematics”, Vikas Publication.
SEM-II ALLIED ELECTIVE COURSE-2 PAPER-CS-7 [20+80= 100 Marks ]

ADVANCE JAVA

UNIT-I
Multithreading : Creating thread and running it, Multiple Thread acting on single object,
Synhronization, Thread communication, Thread group, Thread priorities, daemon Thread, Life
Cycle of Thread.
Collection Framework: What is collection framework, What is requirement, Hierarchy of Collection
Framework, Collection Interface, Difference between collection and array, Set interface, Sortedset
Interface,Vector set.
UNIT-II
Networking : Internet Addressing, Inet Address, Factory Methods, Instance Methods , TCP/IP Client
TCP/IP server , URL Class,, URL Connection, Sockets, Datagrams.
Enterprise Java Bean : Preparing a Class to be a Java Bean, Creating a Java Bean, Java Bean
Properties, Types of beans , Stateful Session bean, Stateless Session bean, Entity bean.

UNIT-III
Java Database Connectivity (JDBC) :Establishing Connection, Manipulating Databases with JDBC,
Merging Data from Multiple Tables ,Conditional (if) statements ,Using prepared statements, Using
callable statements ,Scrollable result sets, Updatable result sets, Transactions , commits, rollbacks,
and save points
UNIT-IV
Servlets : Servlet Overview and Architecture, Interface Servlet and the Servlet life cycle, Handling
HTTP get Requests, Handling HTTP post Requests, Redirecting Requests to other Resources,
Session , Tracking, Cookies, Session Tracking with Http Session.
Java Server Pages (JSP): Introduction, Java Server pages Overview , A first java server page
Example,JSP Components., Jsp architecture , jsp tags and jsp expressions Fixed template data ,
lifecycle of a jsp, JSP Applet communication, Java Bean, Standard Actions, Directives, Custom Tag
libraries.
UNIT-V
Remote Method Invocation : Defining the Remote Interface, Implementing the Remote Interface ,
Compiling and Executing the Server and the Client.
Common Object Request Broker Architecture ( CORBA) : Technical / Architectural Overview,
CORBA Basics, CORBA services .

Reference Book :
1. “Advance Java 2 Platform HOW TO PROGRAM” by H.M. Deitel, P.J. Deitel, S.E. Santry –
Prentice Hall
2. JSP and Servlets—Mahesh P.Matha,PHI.
3. Java 2 -Patrick Naughton,Herbert Schildt.
SEMESTER-II HARD CORE COURSE-6 PAPER-CS-8 [20+80=100 Marks]

PRACTICAL

a) Operating System Lab

b) Advanced Java Lab
 2ND Year
SMESTER-III
SEMESTER-III HARD CORE COURSE-7 PAPER-CS-9 [20+80=100 Marks]
COMPUTER NETWORK

Unit-I: Encoding & Modulation: Digital-To-Digital, Analog-to-Digital, Digital-to-

Analog and Analog-to-Analog Conversions. Transmission of Digital Data,
Interfaces and Modems: Digital Data Transmission, DTE-DCE Interface
Standards, Modems, 56K Modem, Cable Modem, Multiplexing: Frequency
Division, Wave Division and Time Division Multiplexing, Multiplexing in the
Telephone System, Digital Subscriber Line (DSL), FTTC.

Unit-II: Data Link Control: Line Discipline, Flow Control, Data Link Protocols: A
Synchronous Protocols, Character-Oriented Protocols, Bit-Oriented
Protocols, Link Access Procedures. Local Area Networks: Project 802,
Ethernet, Switched Ethernet, Fast Ethernet, Gigabit Ethernet, Token Bus,
Token Ring, Fiber Distributed Data Interface (FDDI).

Unit-III: Metropolitan Area Networks: IEEE 802.6(DQDB), Switched, Multimegabit

Data Services (SMDS), Switching: Circuit Switching, Packet Switching,
Message Switching. Point-to-Point Protocol: Transition States, PPP
Layers, Link Control Protocol (LCP), Authentication, Network Control
Protocol (NCP).

Unit-IV: Integrated Services Digital Network: Services, Scribers Access to the

ISDN, ISDN layers, Board Band ISDN. X.25: X.25 Layers. Frame Relay:
Frame Relay Operation, Frame Relay Layers, Congestion Control, Leaky
Bucket Algorithm, Traffic Control.

Unit-V: ATM: ATM Architecture, Switching, Switch Fabrics, ATM Layers, Service
Classes, ATM Applications, SONET: Synchronous Transport Signals,
Physical Configuration, SONET Layers, SONET Frame, Multiplexing STS
Frames, Applications. Networking & Internetworking Devices: Repeaters,
Bridges, Routers, Gateways, Routing Algorithms (Distance Vector & Link
State Routing).

Text Book:

1. Forouzan. B.A.-- Data Communications and Networking, (TMH)

2. Tanenbaum. A.S--: Computer Networks (PHI).
3. Willium stallings- -Computer Communication and Networks.
SEMIII COREEL ELECTIVE COURSE-1 PAPER-CS-10 [20+80=100 Marks]

ARTIFICIAL INTELLIGENCY

Unit-I: Introduction to AI, History of AI, State of Art Intelligent Agents: Structure of
Intelligent agent, Problem Solving by Searching: BFS, Unitary Cost
Search, DFS, IDS, Bi-directional Search, Constraint Satisfactory Search,
Informed Search Best First Search, Heuristic Function, Memory Bounded
Search, A* and IDA*, Game Playing: Min-Max Search.

Unit-II: Knowledge and Reasoning: Agents that Reason Logically, First Order
Logic, Syntax and Semantics. Inference in First Order Logic: Inference
Rules, Modus Ponens, Unification, Forward and Backward Reasoning,
Resolutions Planning: A simple Planning Agent, from Problem Solving to
Planning, Planning in Situation Calculus, Planning and Acting: Conditional
Planning.

Unit-III: Learning: Learning from Observations. A General Model of Learning

Agents, Inductive Learning; Expert Systems, Architecture, Knowledge
Acquisition, MYCIN; Natural Language Processing; Syntactic Processing,
Semantic Analysis, Practical Applications: Machine Translation, Efficient
Parsing.

Unit-IV: Introduction to Pattern Recognition: Recognition & Classification Process,

Learning, Classification Patterns, Visual Image Understanding, Image
Transformation; Perception: Image Formation, Image Processing
Operations for easy Vision, Speech, Recognition, Introduction to Robotics.

Unit-V:

NLP, Communication, A formal grammar for a fragment of English,

Syntactic analysis (chat parsing), semantic Interpretation, Ambiguity of
grammar, Machine Translation.

Text Book:

1. Stuart Russel & Peter Norvig: Artificial Intelligence A Modern Approach. (Person
Education Asia.)
2. Artificial Intelligence – Mishra,PHI
3. D.W. Patterson, “Introduction to A.I and Expert Systems”, PHI,
4. Rich & Knight, “Artificial Intelligence”, Tata McGraw Hill, .
5. W.F. Clocksin and Mellish, “Programming in PROLOG”, Narosa Publishing House, 3/e
SEMESTER-III CORE ELECTIVE-2 PAPER-CS-11 [20+80=100 Marks]

PRACTICAL

a) Networking Lab
b) AI LAB
 SEM-III AEC-3 PAPER-CS-12 [20+80=100 Marks]

THEORY OF COMPUTATION

Unit-I: Background materials: Alphabets, Strings, Empty Strings, Sets, Empty Set, Proof
Methods: Induction and Contradiction, Deterministic Finite Automata, Non-
deterministic Finite Automata, Equivalence of NFA, and DFA, Regular
Expressions and Languages, Conversion of DFAs to Regular Expressions, and
Vice verse, Properties of Regular Languages: Pumping Lemma, Closure
properties: Union, Intersection, Complement, Difference, Reversal,
Homomorphism, and Inverse Homomorphism. Decision Problems for Regular
Languages (Four Problems): The Emptiness/Universality Problem. The
Finiteness Problem, The Membership Problem, And The Equivalence Problem.
Unit-II: Context Free Languages & Pushdown Automata: Context Free Languages,
Context Free Grammars, Derivation, Ambiguity, Parsing, Pushdown Automata:
Definition of PDAs, Acceptance of PDAs by final state and by empty stack,
Conversion of CFG to PDA and vice versa. DPDAs & DCFLs, Determinism &
Parsing, Simplification of CFG’s Chomsky Normal Form, Greibach Normal Form.
The Pumping Lemma for CFL’s. Closure properties union, concatenation, *, +,
Unit-III: Turing Machines: TM Definition and Notation; Instantaneous Descriptions, NTM
& DTM, Programming tricks for TMs, Examples involving TM Computations,
Extensions and Restrictions to Basic TM Model, (Multi Tape, Multi Dimensional,
Counter machine, Two Stack PDAs).
Unit-IV: Decidability Theory: The Church-Turing Thesis, Universal Turing Machines and
TM Encoding, Decidable and semi-decidable languages, Recursive Enumeration
and Decidability, Many-one Reductions, Hardness, Undecidability, Closure
Properties. The Diagonalization Language, The Halting Problem, Post’s
Correspondence Problem, Undecidable Problems from Language Theory, Rice’s
Theorem. Linear Bounded /automata (LBA).
Unit-V: Complexity Theory: Measuring Complexity, The O, Ω,  - Time Complexity
classes: P, NP, NP – Completeness, Coping with NP – Completeness, Cook –
Levin’s Theorem, Some NP-Complete Problems: SAT, 3-SAT, Hamiltonian Path,
Vertex Cover, Independent Set, Space Complexity classes: PSPACE, L, NL.
Text Book
1. Introduction to Automata Theory, Languages & Computation – Hopcroft, Motwani & Ullman.
2. Introduction to Theory of Computation: M.Siper, Thompson Learning
3. Fundamental of the theory of Computation ,Priciples and Practice- R.Greenland, H.J.Hoorer.
4. K.L.P. Mishra and N. Chandrasekaran, Theory of Computer Science, PHI.
5. Michael Sipser, Introduction to the Theory of Computation, Thomson Learning.
6. J P Hoperoft, J D Ullman, Introduction to Automata, Languages and
Computation, Narosa Publications.
7. John C. Martin, Introduction to Languages and the Theory of Computation,2 nd
Edition, McGraw Hill.
 SEMESTER-III OPEN ELECTIVE-I PAPER-CS-13 [10+40=50 Marks]

INFORMATION TECHNOLOGY

Unit I
Introduction to System Hardware Logical organization of Computer - primary Memory -
Organization, Data representation - Integer, floating point, character. Central processing Unit –
Arithmetic and Logical Unit, Registers, Control unit. Data and control paths between memory
and CPU, Memory technologies, memory access time. Cache Memory Input Output devices.
Secondary storage media and devices. Communication Ports. Types of computers - PCs, Main
Frames, Parallel. Hardware Standards, Standard Busses, their bandwidths and comparison.
Unit II
Software Concepts Programming Languages - evolution, features and applications. Language
processors. Operating Systems - User's view - evolution, services, operating systems
interfaces. Command Line, GUI, Windowing. OS as Resource Manager - Process or Task, File
management. Security and Protection. OS Utilities - Features of Popular OS such as Windows,
UNIX, OS/2. General Software features and trends - GUI, Object Portability. Network
Capabilities. Compatibility with other software, compatibility with peripherals,.
Unit III
Communication and Network Technologies Communications- Data Communications - Methods
of Data Communications - Digital vs. Analog, Synchronous vs. Asynchronous, Simplex, Half-
duplex, full-duplex, circuit switching, packet switching. Communication media - speed and
capacity, twisted pair, coaxial, fiber optics, wireless. Common Network Components. Hosts and
Servers, Work Stations, Protocol Converters, Modems, Terminal Controllers, Routers. Network
Typologies - LAN, WAN,MAN.

Suggested Readings:
1. Fundamentals of Information Technology - Jaiswal S, Galgotia Publications, NewDelhi.
2. Introduction to Information Technology—Rajaraman,PHI
3. Information Technology, The breading wave: Dennis P. Curtin, Kim Folley etal,
McGraw Hill,.
 SEMESTER-IV
SEMESTER-IV HARD CORE COURSE-8 PAPER-CS-14 [20+80=100 Marks]

COMPILER DESIGN

UNIT-I
Lexical analysis: Regular expression-nondeterministic automata-deterministic automata- Equivalent to
NFAs-minimizing the states of DFA-implementation of lexical analyzer.

UNIT-II
Syntax analysis: Top down parsing concepts-recursive descent parsing - predictive parsers - non recursive
predicate parsing - bottom-up parsing - handle pruning - shift reduce parsing-operator parsing - LR
parsers-parser generators -YACC.

UNIT-III
Intermediate code generation: Syntax directed definitions - construction of syntax trees - top down
translation - bottom up evaluation of inherited attributed - recursive evaluators-assigning space at
compiler construction time - type checking - overloading of functions and operators - polymorphic
function.

UNIT-IV
Storage organization: Storage organization-storage allocation strategies - parameter passing - symbol
tables - dynamic storage allocation - intermediate languages - representation of declarations - assignment
statement - Boolean expression - back patching - procedure calls.

UNIT-V
Code generation and Code optimization: Design of code generators - runtime storage management - basic
blocks - flow graphs - register allocation and assignment - DAG representation of basic blocks - peephole
optimization - code optimization - the principle sources of optimization - optimization of basic blocks -
global data flow analysis - loop optimizations.

Text Books
1. Alfred Aho, Ravi Sethi, Jeffy D.Ullman, “Compilers - Principles,Techniques and Tools” ,
Pearson
2. Chattopadhyay Santhanu,”Compiler Design”,PHI.
3. Holub Allen,”Compilers in C”, PHI,.
 SEM-IV HARD CORE COURSE-9 PAPER-CS-15 [20+80=100 Marks]

PROJECT/DISSERTATION

The objective of the project/dissertation is to enable the students to work in a

project of latest topic / research area / industrial applications. Each project group
should have 2-3 students. Each group shall have a guide. During this semester
the students are expected to do literature survey, formulate the problem and form
a methodology of arriving at the solution of the problem. Also during this
semester, the students are expected to complete the project and submit a full-
fledged report comprising of the complete system developed along with
implementation and test results. The departmental committee shall examine the
students and the evaluation is based on continuous internal assessment
comprising of two reviews.
SEM-IV CORE ELECTIVE COURSE-3 PAPER-CS-16 [20+80=100 Marks]

SOFTWARE ENGINEERING

Unit-I: Computer-Based system Engineering: Emergent System Properties, Systems

and their Environment, System Modeling, System Engineering Process, System
Procurement. Software Process: Software Process Models, Process Iteration,
Software Specification, Design and Implementation, Software Validation and
Evaluation, Automated Process Support. Project Management: Management
Activities, Project Planning, Project Scheduling, Risk Management.

UNIT-II Software Requirements: Functional and Non-Functional Requirements, Use

Requirements. System Requirements, Software Requirements Document.
Requirements Engineering Processes: Feasibility Studies, Requirements
Elicitation and Analysis, Requirements Validation, Requirements Management.
System Models: Context Models, Behavioural Models, Data models, Object
models, CASE Workbenches.

Unit-III Architectural Design: System Structuring, Control Models, Modular Decomposition,

Domain-Specific Architectures. Distributed System Architectures: Multiprocessor
Architectures, Client-Server Architectures, Distributed Architectures, CORBA.
Real-Time Software Design: System Design, Real-Time Executives, Monitoring
and Control Systems, Data Acquisition Systems. Design with Reuse:
Component-Based Development, Application Families, design Patterns.
Dependability: Critical Systems, Availability and Reliability, Safety, Security,
Critical Systems Specifications: Software Reliability Specification, Safety
Specification, Security Specification. Critical Systems Development: Fault
Minimization, Fault tolerance, Fault Tolerance Architectures, Safe System
Design.

Unit IV Object Oriented software design, Development process. UML : Use cases, Class
diagrams, Essential Interaction diagram, Class diagram (Advanced concepts).

Unit V UML : Packages and collaboration, State diagrams, Activity diagrams, Physical
diagrams, UML and Programming.

Text Books

Software Engineering – Sommerville , Addition -Wesley

Software Engineering- Pressman,R.S, MGH

Fundamental of Software Engineering—Rajib Mall,PHI

Software Engineering-Agarwal,K.K & Singh, New Age International.

 SEM-IV CORE ELECTIVE COURSE-4 PAPER-CS-17 [20+80=100 Marks]

MOBILE COMPUTING
Unit 1
Introduction to telecommunication systems: Current Wireless Systems: Overview of
Paging Systems, Cordless Phones, Cellular Telephone Systems, Satellite
Communication, Wireless LANs, Blue tooth. Medium access control,
Telecommunication Systems – SDMA, TDMA, CDMA, GSM Satellite Systems - Basics,
Routing Localization, Handover. Broadcast Systems Overview, Cyclic Repetition of
Data, Digital Audio Broadcasting, Digital Video Broadcasting.
Unit 2
Wireless Standards:Wireless LAN – IEEE 802.11 – Infrared vs Radio Transmission,
Infrastructure Networks, Ad-hoc Networks, HIPERLAN, Bluetooth Wireless ATM –
Working group, Services, Reference Model, Functions, Radio Access Layer, Handover,
Location Management, Addressing Mobile Quality of Service, Access Point Control
Protocol.
Unit 3
Mobile Network Layer: Mobile IP Goals, Assumptions and Requirements, Entities, IP
packet Delivery Agent Advertisement and Discovery, Registration. Tunneling and
Encapsulation, Optimization Reverse Tunneling, IPv6, DHCP. Adhoc Networks -
Characteristics, Performance Issues, Routing in mobile hosts.
Unit 4
Mobile Transport Layer & Wireless Application Protocol: Traditional TCP, Indirect TCP,
Snooping TCP, Mobile TCP, Transmission / Timeout Freezing Selective
Retransmission, Transaction oriented TCP. Architecture, Datagram Protocol, Transport
Layer Security , Transaction Protocol, Session Protocol , Application Environment ,
Wireless Telephony.
Unit 5
Application Issues: Dynamic DNS File System, Synchronization Protocol, Context
aware applications, Security, Analysis of existing wireless network, GSM Systems
Overview: Architecture, Location tracking, and call setup. Security, Data Services N/W
Signaling, GSM mobility management, Operations, Administration and maintenance.

Text Books
1. J Schiller ,’Mobile Communication’ , Addison Wesley,
2. John Wiley,’ Mobile Communication Design Fundamentals’

Reference Books
1 Wireless Communication and Networks, Pearson Education,
2. WAP-Wireless Application Protocol, Pearson Education,
 SEM-IV OPEN ELECTIVE COURSE-2 PAPER-CS-18 [ 10+ 40=50 Marks]

E-COMMERCE

Unit I
Introduction ,Overview of Electronic Commerce - Definition of Electronic Commerce - E
Business -Potential Benefits of E Commerce – Categories of E-commerce,The Internet as
enablers of E Commerce - Impact of E Commerce on Business Models - Market Forces
influencing highway - The global information distribution networks - The regulatory
environment for E Commerce.

Unit II
Electronic Data Interchange (EDI), Electronic Commerce and the Internet Introduction -
traditional EDI systems - Benefits - Data Transfer and Standards - Financial EDI – EDI Systems
and the Internet - Legal, Security and Private Concerns - Authentication - Internet Trading
Relationships Consumer to Business (B2C) Business to Business (B2C), Consumer to
Consumer (C2C).
Unit III
Security Overview, Cryptography and Authentication Introduction - Messaging Security Issues -
Confidentiality - Integrity - Authentication. Encryption Techniques ,Digital Signatures – Good
Encryption Practices – Key Management - key management tasks – Additional Authentication
Methods. Firewalls -Definition - component - Functionality - securing the firewall - factors
considered in securing the firewall -Limitations.

Reference Books::

1. Electronic Commerce - Security, Risk Management and Control, Greenstein and Feinman,
2. Electronic Commerce:From Vision to Fulfillment—Award ( PHI )
3. Irwin Mc.Gra-Hill,
4. Electronic Commerce - A Managerial Perspective, Ed-aim Turban, Jae Lcc, David King Michael
Chung, Addison Wesley, New Delhi.