# Information Technology Engineering Semester 4 syllabus

Information Technology Engineering Semester 4 syllabus – The syllabus for Mumbai University four year bachelors degree course in Information Technology engineering for fourth semester has few subjects that are also there for computer engineering like computer organization architecture, Operating System and Automata Theory.

## APPLIED MATHEMATICS 4

Detailed syllabus:
Sr.
No.
Module Detailed Content Hours CO
Mapping
0 Prerequisite Basic of Set, Permutations,
Combination and Probability .
02
I Elements of
Number Theory I
Modular Arithmetic, Divisibility
and Euclid Algorithm, Primes and
the Sieve of Eratosthenes, Testing
for primes, Prime Number
Theorem
06 CO1
University of Mumbai, B. E. (Information Technology), Rev 2016 44
II Elements of
Number Theory II
Euler’s, Fermat’s Little theorems,
Congruences, Computing Inverse
in Congruences, Legendre and
Jacobi Symbols, Chinese
Remainder Theorem
06 CO1
III Probability Statistics: Formal concept, sample
space, outcomes, events
Random Variables: discrete &
continuous random variables,
expectation, Variance, Probability
Density Function & Cumulative
Density Function
Moments, Moment Generating
Function
Probability distribution: binomial
distribution, Poisson & normal
distribution
08 CO2
IV Sampling theory Test of Hypothesis, Level of
significance, Critical region, One
Tailed and two Tailed test, Test of
significant for Large Samples:-
Means of the samples and test of
significant of means of two large
samples
Test of significant of small
samples:- Students t- distribution
for dependent and independent
samples
Chi square test:- Test of goodness
of fit and independence of
attributes, Contingency table.
Correlation
Scattered diagrams
Karl Pearson’s coefficient of
correlation
Spearman’s Rank correlation
Regression Lines
10 CO3
V Graph & Groups
theory.
Introduction to graphs, graph
terminology, representing graphs
and graph isomorphism,
connectivity, Euler and Hamilton
paths, planar graphs, graph
coloring, introduction to trees,
application of trees.
Groups, subgroups, generators and
evaluation of powers, cosets and
Lagrange’s theorem, permutation
groups and Burnside’s theorem,
isomorphism, automorphisms,
homomorphism and normal
12 CO4
CO5
University of Mumbai, B. E. (Information Technology), Rev 2016 45
subgroups, rings, integral domains
and fields.
VI Lattice theory Lattices and algebras systems,
principles of duality, basic
properties of algebraic systems
defined by lattices, distributive and
complimented lattices, Boolean
lattices and Boolean algebras,
uniqueness of finite Boolean
expressions, prepositional calculus.
Coding theory: Coding of binary
information and error detection,
decoding and error correction.
08 CO5
Text Books:
1. Cryptograph and Network Security by B. A. Forouzan & D. Mukhopadhyay, 11th edition,
McGraw Hill Publication.
2. Network Security and Cryptograph byBernard Menezes, Cengage Learning Publication.
3. Higher Engineering Mathematics by Grewal B. S. 38th edition, Khanna Publication 2005.
4. Probability and Statistics for Engineering, Dr. J Ravichandran, Wiley-India.
5. Mathematical Statistics by H. C Saxena, S Chand & Co.
6. C. L. Liu: Elements of Discrete Mathematics, 2nd edition, TMH
References:
1. Elementary Number Theory and its applications by Kenneth H. Rosen, 5th edition, Addison
Wesley Publication.
2. Abstract Algebra by I. N. Herstain, 3rd eition, John Wiley and Sons Publication.
3. Discrete Mathematics by Norman Biggs, 2nd edition, Oxford University Press.
4. Advanced Engg. Mathematics by C. Ray Wylie & Louis Barrett.TMH International Edition.
5. Mathematical Methods of Science and Engineering by Kanti B. Datta, Cengage Learning.
6. Advanced Engineering Mathematics by Kreyszig E. 9th edition, John Wiley.
7. Probability by Seymour Lipschutz, McGraw-Hill publication.

## COMPUTER NETWORKS

I Introduction Network Criteria, Physical Structures,
Network Types: LAN, WAN,
Switching, OSI Reference model,
TCP/IP suite, Comparison of OSI and
TCP/IP, Network devices.
04 CO1
II Application layer
and Presentation
layer
Introduction: Providing Services,
Programming Interface, Using Services
of the Transport Layer, Standard Client
Server applications: World Wide Web
and HTTP, FTP, Electronic Mail,
TELNET, Secure Shell (SSH), Domain
Name System (DNS), Compression:
Lossless Compression, Lossy
Compression, Multimedia data: Text,
Image, Video , Audio ,Multimedia in
the Internet: Streaming Stored
Audio/Video, Streaming Live
Audio/Video, Real-Time Interactive
Audio/Video, Optimal Compression
Huffman Compression, Dictionary
Based Compression, Speech
Compression, LZW, RLE, Image
Compression – GIF,JPEG.
10 CO1
CO2
III Session layer and
Transport layer
Session layer design issues, Session
Layer protocol – Remote Procedure Call
(RPC), Transport layer services,
Transport Layer Protocols: Simple
Protocol, Stop-and-Wait Protocol, GoBack-N
Protocol (GBN), SelectiveRepeat
Protocol, Bidirectional
Protocols: Piggybacking, Internet
Transport-Layer Protocols, User
Datagram Protocol: User Datagram,
UDP Services, UDP Applications,
Transmission Control Protocol: TCP
Services, TCP Features, Segment,
Segment, A TCP Connection, State
Transition Diagram, Windows in TCP,
Flow Control, Error Control, TCP
Congestion Control, TCP Timers,
Options.
10 CO1
CO3
IV Network Layer Introduction: Network-Layer Services,
Packet Switching, Network-Layer
Performance, Network-Layer
Performance, Network-Layer
Congestion, Structure of A Router,
Network Layer Protocols: IPv4
12 CO1
CO4
University of Mumbai, B. E. (Information Technology), Rev 2016 49
Forwarding of IP Packets, ICMPv4,
Unicast Routing: General Idea, Routing
Algorithms, Unicast Routing Protocols,
Multicast Routing : Introduction,
Routing Protocols, Interdomain Routing
Protocols, Next generation IP: Packet
Format , IPv6 Addressing , Transition
from IPv4 to IPv6, ICMPv6, Mobile
IP: Addressing , Agents , Three Phases
, Inefficiency in Mobile IP.
V Data Link Layer Wired Networks; Introduction: Nodes
Flow and Error Control, Error Detection
and Correction, Two DLC Protocols,
Medium Access Protocols: Random
Access, Controlled Access,
Wired LANS: Ethernet Protocol; IEEE
Project 802, Standard Ethernet, Fast
Ethernet (100 Mbps), Gigabit Ethernet,
10-Gigabit Ethernet, Virtual LANs,
Other Wired Networks: Point-to-Point
Networks, SONET, Switched Network:
ATM, Connecting Devices: Repeaters
Sliding Window Compression.
09 CO1
CO5
VI Physical Layer Data and Signals: Analog and Digital,
Transmission Impairment, Data Rate
Limits, Performance, Digital
Transmission: Digital-to-Digital
Conversion , Analog-to-Digital
Conversion, Analog Transmission:
Digital-to-Analog Conversion, Analogto-Analog
Conversion ,Bandwidth
Spectrum, Transmission Media:
Guided Media, Unguided Media:
Wireless, Real Time Interactive
Protocols: Rationale for New Protocols,
RTP, Session Initialization Protocol
(SIP), H.323, SCTP.
05 CO1
CO6
Text Books:
1. Behrouz A. Forouzan, Forouzan Mosharrat , Computer Networks A Top down Approach, Mc
Graw Hill education.
2. Andrew S Tanenbaum, Computer Networks -, 4th Edition, Pearson Education.
3. Ranjan Bose, Information Theory, Coding and Cryptography, Ranjan Bose, Tata McGrawHill ,
Second Edition.
University of Mumbai, B. E. (Information Technology), Rev 2016 50
4. Diane Teare, “ Authorized Self- Study Guide Designing for CISCO Internetwork
Solutions(DESGN), Second Edition.
References:
1. Behrouz A. Forouzan, Data communications and Networking, Fifth edition TMH 2013.
2. James F. Kurose, K. W. Ross, Computer Networking: A Top-Down Approach Featuring the
Internet, 3rd Edition, Pearson Eduction.
3. L. L. Peterson and B. S. Davie, Computer Networks: A Systems Approach, 4th Ed, Elsevier
India.
4. S. Keshav, An Engineering Approach to Computer Networks, 2nd Edition, Pearson Edication.
5. W. A. Shay, Understanding communications and Networks, 3rd Edition, W. A. Shay, Cengage
Learning.
6. Khalid Sayood, Introduction to Data Compression, Third Edition, Morgan Kaufman.

## OPERATING SYSTEM

Overview of
Operating
System
Introduction: Operating System Structure and
operations, Process management, Memory
management, storage management, Protection and
security, Distributed and special purpose Systems;
System Structure: Operating system services and
interface, System calls and its types, System
programs, Operating System Design and
implementation, OS structure, Virtual machines, OS
debugging and generation, System boot.
07 C01
II Process
Management
Process concept: Process Scheduling, Operation on
process and Interprocess communication;,
Basic concepts, Scheduling algorithms and Criteria,
Scheduling;
09 C02
III Process
coordination
Synchronization: The critical Section Problem,
Peterson’s Solution, synchronization Hardware and
semaphores, Classic problems of synchronization,
Model, Deadlock Characterization , Methods for
Avoidance , Deadlock Detection, Recovery from
09 CO3
IV Memory
Management
Memory Management strategies: Background,
Swapping, Contiguous Memory Allocation, Paging ,
Structure of the Page Table, Segmentation; Virtual
Memory Management: Demand Paging, Copy-onWrite,
Page Replacement, Allocation of Frames,
Thrashing, Memory-Mapped Files, Allocating Kernel
Memory, Other Considerations.
10 C04
V Storage
Management
File system: File Concept , Access Methods,
Directory and Disk Structure, File-System Mounting,
File Sharing, Protection; Implementing file System:
File-System Structure, File-System Implementation,
Directory Implementation, Allocation Methods, FreeSpace
Management, Efficiency and Performance,
Recovery, NFS; Secondary Storage Structure:
Overview of Mass-Storage
Structure, Disk Structure, Disk Attachment, Disk
Scheduling, Disk Management, RAID Structure,
Stable-Storage Implementation, Tertiary-Storage
Structure, Swap-Space Management; I/O systems:
Overview I/0 Hardware, Application I/0 Interface,
Kernel I/0 Subsystem, Transforming I/0 Requests to
09 C05
University of Mumbai, B. E. (Information Technology), Rev 2016 53
Hardware Operations, STREAMS, Performance
VI Distributed
Systems
Distributed operating System: Network based OS,
Network Structure and Topology, Communication
Structure and Protocols; Distributed File system:
Naming and transparency, Remote file access, Stateful
Versus Stateless Service, File Replication; Distributed
Synchronization: Mutual Exclusion, Concurrency
06 C06
Text Books:
1. Operating System Concepts, Abraham Silberschatz, Greg Gagne, Peter Baer Galvin, 8th edition
Wiley.
2. Modern Operating System, Tanenbaum, Pearson Education.
3. Operating Systems: Internal and Design Principles: William Stallings, PHI
Reference Books:
1. Operating System Design and Implementation, A Tanenbaum, Pearson
2. Real Time Systems Design and Analysis, Wiley, IEEE Press
3. Principles of Operating Systems: Naresh Chauhan, Oxford Higher Education

## Computer Organization and Architecture

Overview of
Computer
Architecture &
Introduction of Computer Organization and
Architecture. Basic organization of computer
and block level description of the functional
07 CO1
University of Mumbai, B. E. (Information Technology), Rev 2016 55
Organization units. Evolution of Computers, Von
Neumann model. Performance measure of
Computer Architecture.
Architecture of 8086 family, 8086 Hardware
Design, Minimum mode & Maximum mode
of Operation. Study of bus controller 8288 &
its use in Maximum mode.
II Programming 8086 Addressing modes, Instruction Set,
Assembly Language Programming, Mixed
Language Programming, Programs based on
Stacks, Strings, Procedures, Macros, Timers,
Counters & delay.
10 CO2
III Processor
Organization and
Architecture
CPU Architecture, Register Organization,
Instruction formats, basic instruction cycle.
Instruction interpretation and sequencing.
Control Unit: Soft wired (Microprogrammed)
and hardwired control unit
design methods. Microinstruction sequencing
and execution. Micro operations, concepts of
nano programming. Introduction to parallel
processing concepts, Flynn’s classifications,
pipeline processing, instruction pipelining,
pipeline stages, pipeline hazards.
11 CO3
IV Data Representation
and Arithmetic
Algorithms
Number representation: Binary Data
representation, two’s complement
representation and Floating-point
representation. Integer Data arithmetic:
Unsigned & Signed multiplication- Add &
Shift Method, Booth’s algorithm. Division of
integers: Restoring and non-restoring
division, signed division, basics of floating
point representation IEEE 754 floating
point(Single & double precision) number
representation. Floating point arithmetic:
10 CO4
V Memory Organization Introduction to Memory and Memory
parameters. Classifications of primary and
secondary memories. Types of RAM and
ROM, Allocation policies, Memory
hierarchy and characteristics. Cache
memory: Concept, architecture (L1, L2, L3),
mapping techniques. Cache Coherency,
Interleaved and Associative memory.
07 CO5
VI I/O Organization Input/output systems, I/O modules and 8089
IO processor. Types of data transfer
techniques: Programmed I/O, Interrupt
driven I/O and DMA.
05 CO6
University of Mumbai, B. E. (Information Technology), Rev 2016 56
Text Books:
1. Carl Hamacher, Zvonko Vranesic and Safwat Zaky, “Computer Organization”, Fifth Edition, Tata
McGraw-Hill.
2. William Stallings, “Computer Organization and Architecture: Designing for Performance”, Eighth
Edition, Pearson.
3. 8086/8088 family: Design Programming and Interfacing: By John Uffenbeck (Pearson Education)
4. Microprocessor and Interfacing: By Douglas Hall (TMH Publication).
References:
1. B. Govindarajulu, “Computer Architecture and Organization: Design Principles and Applications”,
Second Edition, Tata McGraw-Hill.
2. Dr. M. Usha, T. S. Srikanth, “Computer System Architecture and Organization”, First Edition,
Wiley-India.
3. John P. Hayes, “Computer Architecture and Organization”, McGraw-Hill.,Third Edition.
4. K Bhurchandi, “Advanced Microprocessors & Peripherals”, Tata McGraw-Hill Education

## AUTOMATA THEORY

Introductio
n and
Regular
Languages: Alphabets and Strings.
Regular Languages: Regular
Expressions, Regular Languages,
Regular Grammars, RL and LL
06 CO1
University of Mumbai, B. E. (Information Technology), Rev 2016 58
Languages grammars, Closure properties
II Finite
Automata
and
machines
Finite Automata: FA as language
acceptor or verifier, NFA ( with and
without ?) , DFA, RE to NFA, NFA to
DFA, Reduced DFA , NFA-DFA
equivalence, FA to RE.
Finite State Machines: m/c with output
Moore and Mealy machines. M/c as
translators. Melay and Moore m/c
conversion
09 CO2
III Context
Free
Grammars
Context Free Languages: CFG,
Leftmost and Rightmost derivations,
Ambiguity,
Simplification and Normalization (
CNF) and Chomskey Hierarchy ( Types
0 to 3)
08 CO3
IV Push Down
Automata
Push Down Automata: Deterministic (
single stack )PDA, Equivalence
between PDA
and CFG.
05 CO4
V Turing
Machine
Turing Machine: Deterministic TM ,
Multi-track and Multi-tape TMs,
concept of UTM and idea of system
program. Issue and concept of Halting
Problem
07 CO5
VI Application
s of
Automata
1.Power and Limitations of Regular and
Context Free Grammars and Machines
2.Designing Functions:
FA: Acceptor and Verifier.
FSM: Translator
PDA: Simple Parser for WF parenthesis,
palindromes etc.
TM: Basic bit wise calculator(+ /-
/AND/OR) and Translator
04 CO2
CO4
CO5
CO6
Text books
1. J.C.Martin, “Introduction to languages and the Theory of Computation”, TMH.
2. Kavi Mahesh, “Theory of Computation A Problem Solving Approach”, Wiley India
References
1. John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman, “Introduction to Automata Theory,
Languages and Computation”, Pearson Education.
2. Daniel I.A. Cohen, “Introduction to Computer Theory”, John Wiley & Sons.
3. Theory of Computation – By Vivek Kulkarni from Oxford University.
4. N.Chandrashekhar& K.L.P. Mishra, “Theory of Computer Science, Automata Languages &
Computations”, PHI publications.