|
|
S.E. (CSE/IT) |
|
|
|
|
|
|
First Semester |
|
|
|
|
|
Teaching and Exam Scheme |
|
|
|
|
|
|
|
|
|
|
|
|
| Sr. |
Subject |
Teaching
Scheme |
Examination Scheme |
| No. |
|
Theory |
Practical |
Theory |
Class |
Term-Work |
Pract/Oral |
Total |
| |
|
Hrs/Week |
Hrs/Week |
|
Test |
Marks |
Marks |
Marks |
| 1 |
Engineering Mathematics - III |
4 |
--- |
100 |
20 |
--- |
--- |
100 |
| |
|
|
|
|
|
|
|
|
| 2 |
Electronics
Devices and |
4 |
2 |
100 |
20 |
25 |
25 |
150 |
| |
Digital System |
|
|
|
|
|
|
|
| 3 |
Discrete Mathematical System |
4 |
--- |
100 |
20 |
--- |
--- |
100 |
| |
|
|
|
|
|
|
|
|
| 4 |
Principles
of Programming |
4 |
2 |
100 |
20 |
25 |
25 |
150 |
| |
Languages |
|
|
|
|
|
|
|
| 5 |
Electronics Measurement Systems |
4 |
2 |
100 |
20 |
25 |
--- |
125 |
| |
|
|
|
|
|
|
|
|
| 6 |
Software Development Lab - I |
2 |
2 |
--- |
--- |
25 |
50 |
75 |
| |
|
|
|
|
|
|
|
|
|
|
22 |
8 |
500 |
100 |
100 |
100 |
700 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
First
Semester 700 +
100 =
800 |
|
|
S.E. (CSE/IT) |
|
|
|
|
|
|
Second Semester |
|
|
|
|
Teaching and Exam Scheme |
|
|
|
| Sr. |
Subject |
Teaching
Scheme |
Examination Scheme |
| No. |
|
Theory |
Practical |
Theory |
Class |
Term-Work |
Pract/Oral |
Total |
| |
|
Hrs/Week |
Hrs/Week |
|
Test |
Marks |
Marks |
Marks |
| 1 |
Engineering Mathematics - IV |
4 |
--- |
100 |
20 |
--- |
--- |
100 |
| |
|
|
|
|
|
|
|
|
| 2 |
Object
Oriented Programming |
4 |
2 |
100 |
20 |
25 |
--- |
125 |
| |
and System |
|
|
|
|
|
|
|
| 3 |
Microprocessors & Interfacing |
4 |
2 |
100 |
20 |
25 |
--- |
125 |
| |
|
|
|
|
|
|
|
|
| 4 |
Digital System Design |
4 |
2 |
100 |
20 |
25 |
25 |
150 |
| |
|
|
|
|
|
|
|
|
| 5 |
Data Communication |
4 |
2 |
100 |
20 |
25 |
25 |
150 |
| |
|
|
|
|
|
|
|
|
| 6 |
Software Development Lab - II |
2 |
2 |
--- |
--- |
25 |
25 |
50 |
| |
|
|
|
|
|
|
|
|
|
|
22 |
10 |
500 |
100 |
125 |
75 |
700 |
|
|
|
|
|
|
|
|
|
|
|
|
|
Second
Semester 700 +
100 =
800 |
|
|
|
|
|
|
|
|
|
|
Total
of Semester - I & Semester - II
800 + 800
= 1600 |
|
|
|
|
|
|
|
|
|
|
|
|
|
Data
Communication
Theory : 04 Hours
Theory
Exam : 100 Marks
Practical : 02 Hours
Theory Exam : 03 Hours Paper
Term-Work : 25 Marks
Practical
: 25 Marks
Class Test : 20
Marks
1.
An Overview of Data Communications
The
Importance of Data Communications, The First Data Communications
Systems, Two-State Communications Systems, Early Communications Codes,
Modern Codes, Teleprinters, Data Communications in Computing, General
Description of Data Communications Systems,
(05)
2.
Terminal Devices.
Teleprinters,
Teleprinters Versus CRT Terminals, Serial Printers, CRT Terminals, Parts
of a Terminal, PC Terminals, The Need for Speed. Data
Transmission.
(03)
3.
Messages and Transmission Channels.
Information
as a Quantity, Bounded Medium, Unbounded Medium, Effects of Bandwidth on
a Transmission Channel, Bandwidth Requirements for Signals, Carrier
Systems. (04)
4.
Asynchronous Modems and Interfaces.
Why
Data Can't Be Transmitted Directly, Solving the Problem with Modems,
Analog Modulation, V.21 Standard, Modem Features, Interface and
Signaling Standards, The RS-232 and V,24 Interface, Other Interfaces,
Asynchronous Modem Operations, Smart Modems, Viewing and Changing Modem
Settings, Extended Command Set Variances, Fax Modems.
(06)
5.
Synchronous Modems, Digital Transmission, and Service Units.
Synchronous
Signaling and Standards, Typical Synchronous Components, Standard and
Evolving Modems, High-Speed Modems, Access Control, Digital
Transmission, The V.35 Interface.
(04)
6.
Multiplexing Techniques.
Sharing
a Channel, Statistical Time-Division Multiplexing, Low-Speed Voice/Data
Multiplexers.
(03)
7.
Fiber-Optic and Satellite Communications.
Introduction
and Historical Perspective, Fundamentals of Fiber-Optic Systems,
Fiber-Optic Subsystems and Components, Transmission Systems,
Wavelength-Division Multiplexing, Satellite Transmission Systems.
(05)
8.
Protocols and Error Control.
Protocols
Versus Interfaces, Elements of a Protocol, Convolutional Coding-Cyclic
Redundancy Checks.
(02)
9.
PC Communications Software / Local Area Networks / The Internet
Communications
Program Features, Dial-Up Networking, Overview of LANs, LANs Versus,
Other Techniques, The Ideal LAN, LAN
Standards, Internetworking Devices,
Evolution
of the Internet, Application Services, Internet Access Providers, IP
Addressing, Navigating the Growing Web, Evolving Internet
Applications.
(06)
10.
ISDN.
ISDN
Architecture, ISDN Implementation Standards, Growth and Adaptation of
ISDN, Pricing, Applications.
(02)
Reference
Books : Understanding Data Communications , Seventh Edition,
Addison Wisley, Gilbert Held
Term
Work : It shall
consist of record of at
least 10 Experiments /
Programs/ Assignments based on
above mentioned syllabus.
Practical
Exam : The
Practical examination shall consists of performing an experiment / writing Program / Assignment
based on the practical work done, the record of experiments submitted by the candidate and
viva-voce based on the
syllabus.
DISCRETE MATHEMATICAL STRUCTURES
Theory : 04 Hours
Theory
Exam : 100 Marks
Theory Exam : 03 Hours Paper
Class Test : 20
Marks
-
Sets
and Properties.
Combination of sets, finite and infinite
sets, uncountably infinite sets, mathematical
inclusion, principle of inclusion and exclusion.
(04)
-
Permutations,
Combinations, and Discrete probability.
The rules of sum and
product, permutation, combinations, generation of permutation and
combinations, discrete probability, conditional probability. (05)
-
Relations
and Functions.
A relational model for
databases, properties of binary relations, equivalence relations and
partitions, partial ordering relations and lattices, chains and
antichains, a job scheduling problem, functions and pigeon hole
principle.
(06)
-
Graphs
and Planar graphs
Basic terminology, multi
graphs and weighted graphs, paths and circuits, shortest path in
weighted graphs, Eulerian paths and circuits, traveling sales person
problem, factors of graph, planar graph.
(05)
-
Trees
and Cut sets
Trees, rooted trees, path
lengths in rooted search trees, spanning trees and cut sets, minimum
spanning tree, transport network.
(05)
-
Discrete
Numeric Function and Generating Functions.
Manipulation of numeric
function, asymptotic behavior of numeric functions, generating
functions, combinational problems.
(04)
-
Recurrence
Relation and Recursive Algorithms.
Recurrence relation,
linear recurrence relations with constant coefficients, homogeneous
solutions, particular solution, total solution, solution by method of
generating function.
(06)
-
Boolean
Algebra.
Lattices and algebraic
systems, principle of duality, basic properties, distributed and
complemented lattices, Boolean lattice and Boolean algebra, uniqueness,
Boolean functions and expressions, propositional calculus, design and
implementation of digital network, switching circuits.
(06)
Reference Books:
1.
Elements of Discrete Mathematics – C.L. Liu.
Second edition (McGraw Hill),
2.
Discrete mathematical structures – Kollman, Busby, Ross
(PHI),
3.
Discrete mathematical structures with application to Computer
Science – Trembly Manohar (McGraw
Hill)
Electronic
Devices and Digital Systems
Common to SE (CSE)
& SE (IT)
Theory : 04 Hours
Theory
Exam : 100 Marks
Practical : 02 Hours
Theory Exam : 03
Hours Paper
Termwork
: 25 Marks
Practical :
25 Marks
Class Test :
20 Marks
-
Biasing
of Transistors :
4
Need of Biasing,
Stabilization, Methods of Transistor Biasing, Design of Transistor
biasing circuits.
2. Transistorised
Multivibrators :
4
Switching
action of transistor, Multivibrator and its types,
Design of AMV, MMV and BMV
3. Voltage
Regulators :
3
Characteristic features of a regulators, Transistorised Series Voltage
Regulator, Design of
IC Regulator 723
4.
Number Systems and Codes :
5
Binary, Octal and
Hexadecimal Number systems and their conversions
Binary arithmetic, 8421
BCD Codes, Excess 3 and Gray Codes, ASCII,
EBCDIC and Hollerith
Codes, Error Detection and
Correction,
7 bit Hamming Code.
5. Combinational
Circuit Design :
5
Min Term and Max Term representation of Logical Function,
Minimization of Logic Functions, K-Map (Upto 4 variables) SOP and
POS forms, Reduction using Quinn
McClusky method, Examples of
Arithmetic Circuits.
6. Combinational
Logic Design using MSI Circuits :
5
Multiplexers
and their cascading, 74
Series Types, Demultiplexers &
their cascading,
Decoders, Binary and BCD adders, Digital Comparator,
ALU, Encoder.
7. Sequential
Logic Circuits :
4
Memory
Cell, S-R, Clocked S-R and
J-K Flip-flops, D-Type and T-type,
MS J-K Flip-flops, Applications of flip-flops, Tristate devices
and buffers
8. Sequential
Logic Design :
4
Shift registers, applications as ring counters and twisted ring
counters,
Study of 74 Series
Register IC’s
9. Counters
:
6
Ripple Counter, Modulus of Counters, Asynchronous IC’s,
Cascading of Ripple
Counter IC’s, Synchronous Counters,
Design Principle, Up-Down Counters, Synchronous IC’s
Recommended Books :
1. PULSE,
DIGITAL AND SWITCHING WAVEFORMS
Author : Millman
Jacob, Taub Herbert
Publisher : Tata
McGraw-Hill
2.
DIGITAL ELECTRONICS : AN
INTRODUCTION TO THEORY AND
PRACTICES
Author
: Gothmann William H.
Publisher :
Tata McGraw-Hill
-
Modern
Digital Electronics
Author
: R.P. Jain
Publisher
: Tata McGraw-Hill
-
Digital
Fundamentals by Floyd
Term Work :
It shall consist of record
of at least 10 Laboratory Experiments based on above mentioned syllabus.
Theory Exam :
The theory syllabus for Electronic Devices and Digital Systems is common to SE (CSE) and SE (IT).
The theory exam shall be based on
the syllabus in proportion to the no of hours shown to the right.
Practical Exam :
The Practical examination shall consists of performing an
experiment based on the practical work done, the record of experiments
submitted by the candidate and viva-voce
based on the syllabus.
Syllabus
for T.E. (Computer Science)
Microprocessors
- II
Teaching
Scheme :
Examination Scheme :
Lectures:
04 Hours/Week
Theory Paper : 03 Hours 100
Marks
Practical
: 02 Hours/Week
Term-Work : 25 Marks
The
Processors Register
Organisation of 8086,
Architecture, Signal
Descriptions of 8086, Physical Memory organization, general Bus
Operation, I/O Addressing Capabilities, Minimum mode 8086 system,
Maximum Mode 8086 system, The Processor 8088.
(04)
8086/8088
Instruction Set and Assembler Directives
Machine language
Instruction Formats, Addressing Modes of 8086, Instruction set of
8086/8088, Assembler directives and operators
(04)
The Art of Assembly Language
Programming with 8086/8088
Machine level
programs, Machine coding the programs, programming with an ass63embler,
assembly language programs, STACK Structure of 8086/8088, Interrupts and
Sevice routines, Non Maskable and Maskable Interrupts, Interrupt
Programming, MACROS
(05)
Basic Peripherals and their
Interfacing with 8086/8088
Semiconductor Memory Interfacing, Dynamic RAM Interfacing,
Interfacing I/O Ports, PIO 8255, Modes of Operation of 8255, Interfacing
Analog to Digital Converters, Interfacing Digital to Analog Converters,
Stepper Motor Interfacing
(05)
Special Purpose Programmable
Peripheral Devices and their Interfacing
Programmable
Interval Timer 8253, Programmable Interrupt Controller
8259A, The Keyboard/Display Controller 8279, Programmable
Communication Interface 8251 USART
(04)
DMA, Floppy Disk and CRT
Controllers
DMA Controller 8257,
DMA Transfers and Operations, Programmable DMA Interface 8237,
Floppy Disk Controller 8272m CRT Controller 8275, CRT Controller 6845
(03)
Microcomputer
Operating System
Assembly language
Programming, BIOS and DOS Interrupt., Components of DOS, File Allocation
Table, Root Directory Area, Structure of EXE and COM files, Device
Drivers, Layout of Device Drivers.
(04)
Evolution of Microprocessors
Salient Features of
80286-80287 – A Microprocessor with Memory Management,
Instruction set features of
80286.
(02)
80386-80387
and 80486 - The 32 Bit Processors
:
Salient
Features of 80386DX, The
CPU with a Numeric Coprocessor – 80486DX
(02)
Introduction to Pentium Family
Architecture
Salient Features of 80586 (PENTIUM),
Enhanced Instruction set of Pentium,
Intel MMX Data types, Salient
points about Multimedia Application Programming, Journey to Pentium-Pro
and Pentium-II, Pentium III – The CPU of the next Millenium
(04)
Term
Work :
1)
The term-work consists
of at least 06 Assembly
Language Programs written and compiled
using TASM assembler.
2)
At least 03 interfacing
Programs using Microprocessor
(8085 / 8086) Kit
·
Stepper Motor interfacing
·
Interfacing Analog to Digital Converters
·
Interfacing Digital to Analog Converters
3)
Assignments based on the syllabus
Assessment
of Term-Work should be done as follows :
i)
Continuous Lab Assessment
(40%)
ii)
Actually Performing Practicals in Laboratory
(30%)
iii)
Oral Examination (Internally) contucted at the time of Submission
on the syllabus and practicals performed (30%)
Text
Books :
1)
Ajoy Kumar Ray and Kishor M. Bhurchandi, “Advance
Microprocessors and Peripherals” (Architecture, Programming and
Interfacing), Tata Mcgraw-Hill Publishing Company Limited, New Delhi.
2)
Introduction to Assembly Language Programming, Sivarama P.
Dandamudi, Publisher : Springer, ISBN
: 81-8128-048-2
3)
Liu Gibson, “Microprocessor
Systems : The 8086/8088 Family,
Architecture,
Programming and Design”, PHI.
Reference Books :
I)
Douglas V. Hall, “Microprocessors
and Interfacing – Programming and Hardware”,
2nd Edition, TMH.
II)
Brey, “The Intel Microprocessors 8086/8088, 80186, 80286,
80386, 80486, Architecture, Programming and Interfacing”, PHI
III)
Allen Wyall, “Assembly
Language Programming”, QUE
IV)
Peter Abel, “Assembly Language
Programming”, PHI
Websites:
http://www.intel.com
Data
Structures and Algorithms
Teaching Scheme :
Examination
Scheme :
Theory
Lecturer : 04 Hours/Week
Theory Paper : 100 Marks (03 Hours)
Practical
: 02 Hours/Week
Term-work : 25 Marks
Practical
/ Oral : 25 Marks
Introduction : Java
Review
Performance Analysis of Programs,
Asymptotic Notation, Performance
Measurement
of Programs
06
Linear Lists-Array Representation,
Linear Lists-Linked Representation,
Linear Lists-
Simulated Pointers
06
Arrays and Matrices,
Stacks, Queues
06
Skip Lists and Hashing,
Binary and Other Trees,
Priority Queues
04
Tournament Trees, Binary
Search Trees, Balanced
Search Trees
04
Graphs, The
Greedy Method, Divide
and Conquer
08
Dynamic Programming
Backtracking (ON WEBSITE)
Branch and Bound (ON
WEBSITE)
06
TERM-WORK :
It
shall consist of at least 10 Assignments / Programs based on above
syllabus
Assessment
of term Term-Work should be done as follows :
* Continuous Lab
Assessment
40
%
* Actually
performing practicals in laboratory
30 %
* Oral Examination
(Internally) conducted at the time &nb | 
