Information technology engineering semester 3 syllabus

Information technology engineering semester 3 syllabus – The Mumbai University degree course bachelors syllabus for Information technology for semester 3 has computer engineering subjects also.The main subjects here are Database managements systems, Data structures and Logic design.

Information technology engineering semester 3 syllabus

 

LOGIC DESIGN

Prerequisite Semiconductor theory, Diodes,
Integrated Circuits
02
I Biasing of BJT Biasing of BJT: DC operating
point, BJT characteristics &
parameters, all biasing circuits,
analysis of above circuits and their
design, variation of operation point
and its stability. Differential
08 CO1
University of Mumbai, B. E. (Information Technology), Rev 2016 10
Amplifier, constant current source,
current mirror.
II Number System
and codes
Introduction to Number systems,
Binary Number systems, Signed
Binary Numbers, Binary, Octal,
Decimal and Hexadecimal number
Systems and their conversion,
Binary arithmetic using
compliments, Gray Code, BCD
Code, Excess-3 code, ASCII
Code.inter-conversion of codes,
08 CO2
III Boolean Algebra
and Logic gates
Introduction, NAND and NOR
operations, Exclusive –OR and
Exclusive –NOR operations,
Boolean Algebra Theorems and
Properties , Standard SOP and POS
form, Reduction of Boolean
functions using Algebric method, K
-map method (2,3,4
Variable).Variable entered Maps,
Quine Mc Cluskey, Mixed Logic
Combinational Circuits and
multiple output function
Basic Digital Circuits: NOT,AND,
OR,NAND,NOR,EX-OR,EX-NOR
Gates.
10
CO2
CO3
IV Design and
Analysis of
Combinational
Circuits
Introduction, Half and Full Adder,
Half and Full Subtractor, Four Bit
Binary Adder, One digit BCD
Adder, code conversion, Encoder
and Decoder ,Multiplexers and Demultiplexers,
Decoders, Binary
comparator (2,3 variable)4-bit
Magnitude Comparator IC 7485
and ALU IC74181.
08 CO2
CO3
CO4
V Sequential Logic
Design
Flip Flops : SR, JK, D, T, master
slave flip flop, Truth Table,
excitation table and conversion
Register: Shift register, SISO,
SIPO, PISO, PIPO, Bi-directional
and universal shift register.
Counters: Design of synchronous
and asynchronous ,Modulo
Counter, Up Down counter IC
74193, Ring and Johnson Counter
9 CO4
CO5
VI VHDL Introduction to VHDL, Library,
Entity, Architecture Modeling
styles, Concurrent and Sequential
statements, data objects and data
types, attributes, design examples
07 CO5
CO6
University of Mumbai, B. E. (Information Technology), Rev 2016 11
for combinational circuits
Text Books:
1. Robert L. Boylestad, Louis Nashelsky, “Electronic devices and circuit Theory”, PHI
2. R. P. Jain, “Modern Digital Electronics”, Tata McGraw Hill.
3. M. Morris Mano, “Digital Logic and computer Design”, PHI
4. J. Bhasker.“ VHDL Primer”, Pearson Education.
5. Balbaniam,Carison,”Digital Logic Design Principles”, Wiley Publication
References:
1. Martin s. Roden, Gordon L. Carpenter, William R. Wieserman “Electronic Design-From
Concept to Reality”, Shroff Publishers and Distributors.
2. A. Anand Kumar, “Fundamentals of Digital Circuits ”, Prentice Hall India
3. Subrata Ghosal, ”Digital Electronics”, Cengage Learning.
4. Anil K. Maini, “Digital Electronics Principles and Integrated Circuits”, Wiley India
5. Donald p Leach, Albert Paul Malvino, “Digital principles and Applications”, Tata McGraw Hill

 

DATA STRUCTURES and ANALYSIS

Detailed syllabus:
Sr.
No.
Module Detailed Content Hours CO
Mapping
0 Prerequisite C Programming Language 02
I
Introduction to Data structures,
Need of Data structures, Types of
07 CO1
University of Mumbai, B. E. (Information Technology), Rev 2016 13
Introduction to
Data structures and
Analysis
Data structures : Linear and non
linear data structures
Arrays, Stacks, Queue, Linked list
and Tree, Graph, Recursion, ADT
(Abstract Data type).
Introduction to Analysis,
Algorithms, characteristics of an
algorithms, Time and Space
complexities, Order of growth
functions, Asymptotic notations
CO2
CO3
CO6
II Stack
Introduction to Stack, Stack as
ADT, Operations on stack,
Application of stack: – reversing
string, Polish notations
07
CO1
CO2
CO3
CO6
III Queue
Introduction to Queue, Queue as
ADT, Operations on Queue, Linear
representation of queue, Circular
Queue, Priority Queue, De-queue,
Application of Queues 06
CO1
CO2
CO3
CO6
IV Linked list
Introduction to Linked List, Basic
concept of Linked List, Memory
allocation & de allocation of
Linked list, Singly Linked list,
Doubly Linked list, Circular linked
list, Operations on linked list,
Linked representation of stack,
Linked representation of Queue,
Application of linked list.
08
CO1
CO2
CO3
CO6
V Sorting and
Searching
Introduction to Sorting: Bubble
Sort, Selection Sort, Insertion Sort,
Quick Sort, Merge Sort, Heap Sort,
Shell Sort, Radix sort. Analysis of
Sorting Techniques. Comparison of
sorting Techniques
Introduction to Searching: Linear
12
CO4
CO5
CO6
University of Mumbai, B. E. (Information Technology), Rev 2016 14
search, Binary search, Hashing
Techniques, Different Hash
functions, Collision& Collision
resolution techniques, Analysis of
searching Techniques.
VI Trees & Graph
Introduction to Trees, Definitions&
Tree terminologies, Binary tree
representation, Operations on
binary tree, Traversal of binary
trees, Binary search tree, Threaded
Binary tree, Expression tree,
Application of Trees
Introduction to Graph, Introduction
Graph Terminologies, Graph
Representation, Type of graphs,
Graph traversal:Depth first
search(DFS)&Breadth First
search(BFS), Minimum Spanning
Tree : Prim’s & Kruskal’s Shortest
Path Algorithm – Dijkstra’s
Algorithm. Applications of graph
10
CO1
CO2
CO3
CO6
Text Books:
1. Data structures using C by Tenenbaum, Langsam, Augenstein , Pearson.
2. Data Structures using C, ReemaThareja, Oxford.
3. C and Data structures, Prof. P.S.Deshpande, Prof. O.G.Kakde, Dreamtech Press.
4. Introduction to Data Structure and its Applications Jean-Paul Tremblay, P. G.
Sorenson
Reference Books:
1. Data Structures Using C & C++, Rajesh K. Shukla, Wiley- India.
2. Data Structures and Algorithm Analysis in C ,Mark A.Weiss ,Pearson
3. ALGORITHMS Design and Analysis, Bhasin, OXFORD.
4. Computer Algorithms by Ellis Horowitz and Sartaj Sahni, Universities Press.

 

DATABASE MANAGEMENT SYSTEMS

Detailed syllabus:
Sr.
No.
Module Detailed Content Hours CO
Mapping
0 Prerequisites Basic knowledge of operating systems
and file systems, Any programming
02
University of Mumbai, B. E. (Information Technology), Rev 2016 17
knowledge
I Introduction
Database
Concepts
Introduction, Characteristics of
databases, File system V/s Database
system, Users of a Database system
Data Models, Schemas, and Instances,
Three-Schema Architecture and Data
Independence, Database Administrator
(DBA), Role of a DBA
05 CO 1
II Entity–
Relationship
Data Model
Conceptual Modeling of a database,
The Entity-Relationship (ER) Model,
Entity Types, Entity Sets, Attributes,
and Keys, Relationship Types,
Relationship Sets, Weak Entity Types
Generalization, Specialization and
Aggregation, Extended EntityRelationship
(EER) Model.
09 CO 2
III Relational Model
and Relational
Algebra
Introduction to Relational Model,
Relational Model Constraints and
Relational Database Schemas, Concept
of Keys: Primary Kay, Secondary key,
Foreign Key, Mapping the ER and EER
Model to the Relational Model,
Introduction to Relational Algebra,
Relational Algebra expressions for
? Unary Relational Operations,
? Set Theory operations,
? Binary Relational operation
Relational Algebra Queries
09 CO 2
IV Structured Query
Language (SQL)
Overview of SQL , Data Definition
Commands, Set operations , aggregate
function , null values, , Data
Manipulation commands, Data Control
commands , Views in SQL, Complex
Retrieval Queries using Group By,
Recursive Queries, nested Queries ;
Referential integrity in SQL. Event
Condition Action (ECA) model
(Triggers) in SQL; Database
Programming with JDBC, Security
and authorization in SQL Functions
and Procedures in SQL and cursors.
10 CO 3,
CO 4
V Relational–
Database Design
Design guidelines for relational
schema, Functional Dependencies,
Definition of Normal Forms- 1NF,
2NF, 3NF, BCNF, Converting
Relational Schema to higher normal
forms.
08 CO 5
University of Mumbai, B. E. (Information Technology), Rev 2016 18
VI Storage and
Indexing
Operation on Files; hashing
Techniques; Types of Indexes: SingleLevel
Ordered Indexes; Multilevel
Indexes; Overview of B-Trees and B+-
Trees; Indexes on Multiple Keys.
09 CO 6
Text Books:
1. Korth, Slberchatz,Sudarshan, ”Database System Concepts”, 6th Edition, McGraw – Hill
2. Elmasri and Navathe, “ Fundamentals of Database Systems”, 6th Edition, PEARSON Education.
3. G. K. Gupta :”Database Management Systems”, McGraw – Hill
References:
1. Raghu Ramkrishnan and Johannes Gehrke, “ Database Management Systems”,TMH
2. Hector Garcia-Molina, Jeffrey D. Ullman, Jennifer Widom “Database System Implementation”,
Pearson Ltd. 1/ e
3. Thomas M. Connolly Carolyn Begg, Database Systems : A Practical Approach to Design,
Implementation and Management, 4/e, Pearson Education.

 

305- PRINCIPLES OF COMMUNCATION

 

Detailed syllabus:
Sr.
No.
Module Detailed Content Hours CO
Mapping
0 Prerequisite Electrical engineering concepts,
analog and digital electronics.
02 —
I Introduction Basics of analog communication
systems (Block diagram), Sources
of information, Baseband and band
pass signals, Types of
communication channels,
Frequency / Spectrum allocations,
Need for modulation and
demodulation
03 CO1
II Fourier Transform
and Noise
Introduction to Fourier Transform,
its properties (time and frequency
shifting and convolution property),
Fourier transform of unit step, delta
and gate function. Correlated and
uncorrelated sources of noise in
communication system, Noise
parameters –Signal to noise ratio,
Noise factor, Noise figure, Friis
formula and Equivalent noise
temperature
05 CO2
III Modulation and
Demodulation
(AM and FM)
AM: Amplitude modulation
techniques and its types- DSBFC
AM,
DSBSC-AM, SSB SC AMspectrum,
waveforms, bandwidth,
Power calculations. AM Receivers
– Block diagram of TRF receivers
and Super heterodyne receiver.
Receiver characteristics –
Sensitivity, Selectivity, Fidelity,
Image frequency and its rejection
and double spotting
FM : Principle of FM- waveforms,
spectrum, bandwidth. Preemphasis
and de-emphasis in FM,
FM noise triangle, Comparison of
AM and
FM systems, FM generation: Direct
method –Varactor diode
Modulator, Indirect method
(Armstrong method) block diagram
and waveforms.
FM demodulator: Foster Seely
discriminator, Ratio detector.
12 CO3
IV Pulse Analog
Modulation
Sampling theorem for low pass and
band pass signals with proof,
Anti- aliasing filter, PAM, PWM
and PPM generation and
05 CO4
University of Mumbai, B. E. (Information Technology), Rev 2016 21
Degeneration.
V Digital Modulation
Techniques and
Transmission
Introduction to digital
communication (Block diagram),
Quantization process, Pulse code
modulation, Delta modulation,
Adaptive delta modulation,
Principle of time division
multiplexing, Frequency division
multiplexing and its applications.
Introduction to Line codes, Intersymbol
interference, Binary phase
shift keying, Differentially encoded
phase shift keying, Quadrature
phase shift keying, M-ary phase
shift keying, Quadrature amplitude
shift keying
08 CO5
VI Radiation and
Propagation of
Waves
Electromagnetic radiation,
fundamentals, types of propagation,
ground wave, sky wave,
tropospheric scatter propagation
04 CO6
Text Books:
1. Simon Haykin, Michael Moher, Introduction to Analog & Digital Communications, Wiley India
Pvt. Ltd., 2nd Ed.
2. Herbert Taub, Donald L Schilling, Goutam Saha, Principles of Communication Systems, Tata
McGraw Hill, 3rdEd.
3. V Chandrasekar, Communication Systems, Oxford University Press, Ist Ed.
References:
1. George Kennedy, Bernard Davis, SRM Prasanna, Electronic Communication Systems, Tata
McGraw Hill, 5th Ed.
2. Wayne Tomasi, Electronic Communications Systems, Pearson Publication, 5th Ed.
3. BP Lathi,Zhi Ding, Modern Digital and Analog Communication Systems, Oxford University.
4. K Sam Shanmugam, Digital and Analog Communication Systems, Wiley India Pvt. Ltd, 1st Ed.