Poona District Education Association’s

A. G. Awate College of Engineering, Hadapsar Pune –28

Department of Computer Engineering
Subject: Data Structure & Algorithm Subject Code: 210244
Subject Teacher: Prof. S.M.Bhadkumbhe Acad.Year:2010-11 Semester I

Teaching Plan
Unit Lecture No Name of the Topic Proposed Actual date Reference
date of coverage
1 Arrays , Pointers: Arrays & Pointers 1/7/2010 1,2,4
2 Functions : Parameter passing by 5/7/2010
value , by reference
I 3 Scope rules, pointers 6/7/2010
4 String manipulations 8/7/2010
5 Structure & Union 12/7/2010
6 Passing & returning 13/7/2010
7 Recursion , File Handling 14/7/2010
8 Introduction to Data Structures 15/7/2010 2,3,4
9 Data object, Data structure ADT 19/7/2010
10 Concept of Primitive and non primitive, 20/7/2010
linear and Non-linear
11 static and dynamic persistent and 21/7/2010
ephemeral data structures
II 12 Analysis of algorithm frequency 22/7/2010
count
13 Time complexity & Space complexity 26/7/2010
of an algorithm
14 Big ‘O’, ‘’ and ‘’ notations, Best, 27/7/2010
Worst and Average case analysis
III 15 Linear Data Structures using 28/7/2010 2,3,5
Sequential Organization Concept
16 arrays as ADT, 29/7/2010
17 Row major and Column major 5/8/2010
18 Address calculation 9/8/2010
19 Multidimensional arrays, Concept of 10/8/2010
ordered list
20 Applications Polynomial , Sparse 11/8/2010
Matrix
21 Algorithms for sparse matrix 12/8/2010
operations
22 addition, simple transpose, fast 17/8/2010
transpose & multiplication
IV 23 Sorting and searching techniques: 23/8/2010 2,3,4,5

24 Bubble sort, Selection sort, Insertion 24/8/2010

sort, Shell
25 Radix sort, Quick sort and Merge sort 25/8/2010
26 Analysis of sorting technique 26/8/2010
27 best, worst and average case, 30/8/2010
28 Algorithms for Sequential search, 31/8/2010
Binary search,
29 Fibonacci search Index Sequential 01/9/2010
search,
30 analysis of each searching technique 02/9/2010
V 31 Linear Data Structures using Linked 06/9/2010 2,4,5
Organization:

32 Limitations of static memory 13/9/2010

Dynamic memory allocation in C.

33 Singly linked list, Doubly linked list, 14/9/2010

Circular linked list
34 insertion, deletion, traversal & other 15/9/2010
operations
35 Applications: polynomials using 16/9/2010
circular linked list
36 Garbage collection and compaction 20/9/2010
37 Representation of polynomial using 21/9/2010
generalized linked list
38 Concept of skip list. 22/9/2010

39 Analysis of the algorithms used 23/9/2010

40 Stacks and Queues: stack as ADT 27/9/2010 1,2,3,4
Prof. S.M.Bhadkumbhe Prof. R.V.Patil
(Signature of Teacher) (Head of Department)

Text Books (TB):

1. R. Gilberg, B. Forouzan, “Data Structures: A pseudo code approach with C”, Cenage Learning, ISBN
9788131503140.     
2. E. Horowitz , S.Sahani, S.Anderson-Freed ““Fundamentals of Data Structures in C”, Universities Press ,2008 ,ISBN
10:8173716056

Reference Books(RB):

3.  A. Aho, J. Hopcroft, J. Ulman, “Data Structures and Algorithms”, Pearson Education, 1998, ISBN-0-201-43578-0
4.  Y. Langsam, M. Augenstin and A. Tannenbaum, “Data Structures using C and C++”, 2nd Edition, Prentice Hall of India,
2002, ISBN-81-203-1177-9
5.  J. Tremblay, P. Soresan, “An introduction to data structures with Applications”, 2nd edition, Tata McGraw-Hill
International Editions, 1984, ISBN-0-07-462471-7.

Poona District Education Association’s

A. G. Awate College of Engineering, Hadapsar Pune –28
Department of Computer Engineering
Subject: Digital Electronics Lab Subject Code: 210247
Subject Teacher: Prof P.B. Sarkale Acad. Year: 2010-11 (Semester –I)

Teaching Plan (Practical)

Sr Pr. Name of the Practical Proposed Performance
No No Batch Date Date Remark
1 1 To study the TTL Characteristics. S1 14/07/2010
S2 16/07/2010
S3 12/07/2010
2 2 To design and implement Code S1 17/07/2010
Conversions. S2 17/07/2010
S3 13/07/2010
3 3 To verify the functioning of S1 21/07/2010
Multiplexer. S2 23/07/2010
S3 19/07/2010
4 4 To verify the functioning of S1 24/07/2010
Demultiplexer. S2 24/07/2010
S3 20/07/2010
5 5 Design and implement of BCD S1 28/07/2010
Adder. S2 30/07/2010
 S3 26/07/2010
6 6 To study Parity Generator & S1 31/07/2010
Detector. S2 31/07/2010
S3 27/07/2010
7 7 To study Flip-flops, registers and S1 7/08/2010
counters. S2 7/08/2010
S3 3/08/2010
8 8 To study 4-bit Multiplier. S1 11/08/2010
S2 13/08/2010
S3 9/08/2010
9 9 To design & implement 3-bit S1 14/08/2010
up/down Ripple asynchronous S2 14/08/2010
counter. S3 10/08/2010
10 10(a) To design a Sequence Generator for S1 18/08/2010
given sequence. S2 20/08/2010
(b) To design a Sequence Generator for S3 16/08/2010
given sequence.
11 11 To design 3-bit synchronous S1 21/08/2010
up/down counter. S2 21/08/2010
S3 17/08/2010
12 12 To design a Mod –N-Counter using S1 25/08/2010
IC 7490 S2 27/08/2010
S3 23/08/2010
13 13 To study Pseudo Random Binary S1 28/08/2010
Sequence Generator. S2 28/08/2010
S3 24/08/2010
14 14 To study 4-bit Barrel shifter using S1 01/09/2010
Multiplexer. S2 03/09/2010
S3 30/08/2010

15 15 To study PsPiece Software. S1 04/09/2010

S2 04/09/2010
S3 31/08/2010
16 16 To study Electronic Workbench S1 08/09/2010
Software. S2 17/09/2010
S3 06/09/2010
17 17 To study FPGA Devices. S1 18/09/2010
S2 18/09/2010
S3 13/09/2010
 Prof P.B. Sarkale Prof R. V. Patil
(Signature of Teacher) (Head of Department)

Poona District Education Association’s

A.G.Awate College of Engineering, Hadapsar Pune-28

Department of Computer Engineering

Subject: Digital Electronics and Design Subject Code:

Subject Teacher: Prof. Sarkale P.B
Acad.Year : 2010-11 ( Sem-I)
Teaching Plan
Unit Lecture Portion to be covered Proposed Actual Date Reference
No. No. Date of Coverage
1. 1. Number System& Logic Design 9/7/2010
Minimization techniqcs.
Introduction. Binary, Hexadecimal
numbers, Octal numbers and number
conversion
2 Signed Binary number 12/7/2010
representation. Signed Magnitude,
1’s complement and 2’s complement
representation
 3 Binary, Hexadecimal Arithmetic. 2’s 14/7/2010
complement arithmetic.Algebra for
logic circuits
4 Codes : BCD, Excess-3, Gray code , 15/7/2010
Binary Code and their conversion
5 Boolean algebra. Truth tables and 16/7/2010
Boolean algebra. Idealized logic
gates and symbols.
7 DeMorgan's rules Axiomatic 21/7/2010
definition of Boolean algebra
8 Basic theorems and properties of 22/7/2010
Boolean algebra
2. 1 Logic FamiliesTTL: Standard TTL 23/7/2010
characteristics- Speed, power
dissipation, fan-in, fan-out, current
and voltage parameters,
2 noise margin, operating temperature 26/7/2010
etc. Operation of TTL NAND gate.
TTL Configurations
3 Active pull-up, Wired AND, totem 28/7/2010
pole, open collector.
4 CMOS: CMOS Inverter, CMOS 29/7/2010
characteristics, CMOS
configurations- Wired Logic, Open
drain outputs.
5 Interfacing: TTL to CMOS and 30/7/2010
CMOS to TTL
6 Revision 2/8/2010
3. 1. Combinational Logic:Logic 4/8/2010
minimization Representation of
truth-table, SOP form, POS form,
Simplification of logical functions
2. Minimization of SOP and POS 5/8/2010
forms, Don’t care
conditions.Reduction techniques: K-
Maps (only up to 4 variables)
3. Quine – McClusky technique 6/8/2010
Arithmetic Operations: - Binary
Addition, Subtraction, BCD Addition
4. Circuits: - Half- Adder, Full Adder, 9/8/2010
Half Subtract or, Full Sub tractor,
5. BCD adder using and subtract using 11/8/2010
7483.
6. look ahead and carry, parity 12/8/2010
generator and checker
usingcomparator using 7485.
7. Multiplexers (MUX) : Working of 13/8/2010
MUX, Implementation of expression
 using MUX
(ICD74153, Demultiplexers 74151).
8. Demultiplexers (DEMUX):- 16/8/2010
Implementation of expression using
DEMUX, Decoder. (IC 74138)
4. 1. Sequential Logic 18/8/2010
Introduction: Sequential Circuits.
Difference between combinational
circuits and sequential circuits
2. Flip- flop : SR, JK, D, T; Preset & 20/8/2010
Clear, Master andSlave Flip Flops
their truth tables and excitation tables
3. Conversion from one type to another 23/8/2010
type of Flip Flop. Study
of7473,7474,7476
4. Application of Flip-flops. Bounce 25/8/2010
Elimination Switch, registers,
counters
5 Registers : Buffer register; shift 26/8/2010
register;7495
6. Counters : Asynchronous counter. 27/8/2010
Synchronous counter, ring counters,
7. BCDCounter, Johnson Counter, 30/8/2010
8. Modulus n counter(IC 7490, 74191), 1/9/2010
Pseudo Random Binary Sequence
Generator, Sequence generator and
detector.
5. 1. ASM & Programmable Logic 2/9/2010
Devices

Algorithmic State Machines,ASM

charts, notations,
2. design of simple controller, 3/9/2010
multiplexer controller method
3. Examples.Sequence Generator, 6/9/2010
Types of Counter
4. Programmable Logic Devices 8/9/2010
5. PLD: PLA- Input, Output Buffers, 9/9/2010
AND, OR, Invert/ Non-Invert
Matrix.
6. PLD: PLA- Input, Output Buffers, 13/9/2010
AND, OR, Invert/ Non-Invert
Matrix.
7. Study of basic architecture of FPGA 15/9/2010
CPLD
8. Revision. 16/9/2010
6. 1. VHDL and Introduction to 17/9/2010
Microprocessors
 Introduction to HDL, VHDL-
Library, Entity, Architecture,
Modeling Styles
2. Concurrent and Sequential 20/9/2010
Statements, Data Objects & Data
Types, Attributes

3. Design Examples. VHDL for 22/9/2010

Combinational Circuits-Adder, MUX
4. VHDL for Sequential Circuits- 23/9/2010
Synchronous and Asynchronous
Counter.
5. Shift Register 24/9/2010
Introduction to Microprocessor.
Introduction of Ideal Microprocessor,
Data Bus
6. Address Bus, Control Bus, 8085 27/9/2010
Programmers model as an example.

Prof.Sarkale P.B Prof. Patil R. V

(Signature of Teacher) (Head Of Department)
Text Books
James Bignell, Robert Donavan “Digital Electronics” 5th edition CENEGAGE Learning
ISBN
1. TB 1. R. Jain, “Modern Digital Electronics”, 3rd Edition, Tata McGraw-Hill, 2003, ISBN 0 – 07
– 049492 – 4
2. TB 2. Stephen Brown, Zvonko Vranesic “ Fundamentals of Digital Logic with VHDL Design”
Mcgraw-Hill
Reference Books
1. John Yarbrough, “Digital Logic applications and Design” Thomson
2. Flyod “Digital Principles”, Pearson Education
3. Malvino, D.Leach “ Digital Principles and Applications”, 5th edition, Tat Mc-Graw Hill
4. J.Bhaskar “VHDL Primer” 3rd Edition, Pearson Edition

Poona District Education Association’s

A. G. Awate College of Engineering, Hadapsar Pune –28
Department of Computer Engineering

Subject: Microprocessor & Microcontroller Subject Code: 310243

Subject Teacher: Prof.M.C.Hingane Acad.Year:2010-11 (Semester –I)

Teaching Plan

Unit Lecture Name of the Topic Proposed Actual Reference

No date date of
coverage
 1 History of 80286,386,486,Pentium 2/7/10 1,2
2 Pentium pin description 3/7/10
,features,Arch,
3 Pentium real mode 5/7/10
I 4 Functional description, real mode, 9/7/10
RISC features
5 Instruction paring rules, branch 10/7/10
prediction
6 Instruction & Data caches 12/7/10

7 Floating Point Unit, features & 12/7/10

pipeline stages & data types.

8 Initialization & configuration, 16/7/10 1,2

Bus operations-reset, Non pipelined
& pipelined
9 Memory Org.& I/O org., data 17/7/10
II transfer mechanism,
10 8 bit,16 bit, 32 bit data bus 19/7/10
interface
11 Pentium programming model, 23/7/10
Register set,
12 Addressing modes, 24/7/10
13 Data transfer ,Bus cycle 26/7/10
14 Protected mode, segmentation, 30/7/10 1,2
Support registers, related instr.,
III memory mgmt through seg.,
15 Logical to linear address 31/7/10
translation, protection by seg
16 Privilege level-protection, related 6/8/10
instruction
17 Inter privilege level, transfer of 7/8/10
control, Paging support register
18 Support register, descriptors, Linear 9/8/10
to physical address translation
19 Page level protection, virtual 13/8/10
memory

20 Linear to Physical address 14/8/10

translation ,TLB
21 Multitasking, Interrupts, 20/8/10 1,2
Exceptions,I/O support registers.
22 Related descriptors, task switching, 21/8/10
IV I/O permission bitmap
Virtual mode features,
23 Address generation, Privilege level 23/8/10
instruction, registers available
 24 Entering & leaving V86 8086 27/8/10
mode, I/O handling & I./O
instruction .
25 Interrupt structure, real protection, 28/8/10
virtual 86 mode,
26 Comparison of all 3 modes 30/8/10
27 8051 Micro controller: family 3/9/10 3,4,5
V architecture
28 Programming Model Register set, 4/9/10
register bank, SFRs
29 Addressing Modes , Instruction 13/9/10
Set ,
30 External data memory, program 17/9/10
memory,
31 Programming, serial port and 20/9/10
programming, Features, design of
min. system
32 Memory interfacing –external 24/9/10
RAM/ROM interface
33 CPU timings, Interrupt structure 25/9/10 3,4,5
VI 34 Timer & their programming 27/9/10
35 Serial port & their programming 1/10/10
36 Power Saving modes in 8051 4/10/10
37 Introduction to 8096 8/10/10
Microcontroller
38 Features & Architecture 9/10/10

Prof.M.C.Hingane Prof.R.V.Patil
(Signature of Teacher) (Head of Department)

References:
1. Antonakos J. “ The Pentium Microprocessor”, Pearson education, 2004,ISBN 81-7808-545-3
2. Microprocessor & Microcontroller- U.S.Shah, Tech-Max pub.
3. Deshmukh A, ”Microcontrollers – Theory and applications”, Tata McGraw Hill, 204, ISBN 0-07-
058595-4
4. Mazidi , Gillipse, “The 8051 Microcontroller and embedded systems”, ISBN 81-7808-574-7
5.Ayala K. “The 8051 Microcontroller” ISBN 81-900828-4-1
 Poona District Education Association’s
A. G. Awate College of Engineering, Hadapsar Pune –28

Department of Computer Engineering

Subject: : Microprocessor & Microcontroller Subject Code: 310243

Subject Teacher: Prof .M.C.Hingane Acad. Year: 2010-11 (Semester –I)

Teaching Plan (Practical)

Sr Pr. Name of the Practical Proposed Performance

NO No Batch Date Date Remark
WAP an ALP to simulate TYPE T1 03/07/2010
1 1 command using PSP T2 02/07/2010
T3 06/07/2010
T4 05/07/2010
T1 10/07/2010
2 2 WAP an ALP to simulate COPY T2 09/07/2010
command using PSP T3 14/07/2010
T4 12/07/2010
WAP an ALP/in line code for T1 17/07/2010
3 3 displaying boot sector of floopy T2 16/07/2010
T3 20/07/2010
T4 19/07/2010
WAP an ALP /in line code for T1 24/07/2010
4 4 displaying file content using root T2 23/07/2010
directory of hard disk T3 28/07/2010
T4 26/07/2010
WAP an ALP/in line code for T1 31/07/2010
5 5 displaying FAT for floppy disk T2 30/07/2010
T3 11/08/2010
T4 28/07/2010
Write a ‘C’ program for PC to T1 9/08/2010
6 6 PC communication T2 6/08/2010
a) File Transfer T3 18/08/2010
b) Full duplex character T4 09/08/2010
transfer

WAP an ALP for Mouse device T1 21/08/2010

7 7 driver T2 13/08/2010
T3 24/08/2010
T4 11/08/2010
WAP an ALP for DPMI T1 28/08/2010
8 8 T2 26/08/2010
T3 25/08/2010
T4 18/08/2010
Study of Pentium Motherboard T1 4/09/2010
9 9 T2 03/09/2010
T3 31/08/2010
T4 23/08/2010
WAP an ALP to implement T1 13/09/2010
10 10 multitasking using Pentium T2 17/09/2010
Programming T3 01/09/2010
T4 25/08/2010
WAP an 8051 ALP for rate T1 20/09/2010
11 11 generation using Timer 0/Timer T2 24/09/2010
1 by using T3 14/09/2010
a) Polling Method T4 30/08/2010
b) ISP method
WAP an 8051 ALP for Serial T1 27/09/2010
12 12 port Programming to transfer T2 30/09/2010
block of data using T3 22/09/2010
a)Polling Method T4 13/09/2010
b)ISP method
T1 4/10/2010
13 13 T2 01/10/2010
T3 29/09/2010
 WAP an 8051 ALP to interface T4 29/09/2010
stepper motor for following
operation
a) Full step
b) Half Step
c) Clock wise
d)Anticlockwise
Write an installable DOS device T1 9/10/2010
14 14 driver for printer T2 08/10/2010
T3 06/10/2010
T4 04/10/2010

Prof.M.C.Hingane Prof R V Patil

(Signature of Teacher) (Head of Department)

Poona District Education Association’s

A. G. Awate College of Engineering, Hadapsar, Pune- 28
Department of Computer Engineering

Subject Data Communication Subject Code: 310242

Subject Teacher: Prof. R. B. Rathod Acad. Year: 2010-11 (Semester –I)

Teaching Plan
 Actual
Lect Proposed
Unit Name of the Topic Date of References
No Date
Coverage
Introduction: communication,
1 Modulation-Base band & Carrier 02-07-10 2,3
Communication.
Amplitude Modulation:
2 DSBFC,DSBSC,SSB,QAM, 06-07-10 2,4
carrier Acquisition, AM Receiver
I Angle Modulation: Frequency & Phase-
3 07-07-10 2,4
FM analysis
Bandwidth Req.- Equivalence between
4 09-07-10 2,4
FM and PM
Digital Continuous wave Modulation:
5 13-07-10 1,2,3
ASK, FSK
PSK and Modems & multiplexing
6 14-07-10 2,4,
technique
Pulse Modulation: Sampling Theorem,
7 16-07-10 2,3
Natural & Flat top
8 PAM, Pulse Time Modulation 20-07-10 1,2,5
Pulse Transmission over Band Limited
9 21-07-10 2,5
II Channel
Effect of Gaussian Type Noise
10 23-07-10 2,4
On Digital Transmission
11 Crosstalk, PCM, DPCM,ADPCM 27-07-10 2,3
12 Line Code: RZ, NRZ,Manchester,AMI 28-07-10
Information & Coding: Shannon’s
13 30-07-10 2,4
theorems on channel capacity
Huffman Code, Code Efficiency, Error
14 06-08-10 2,5
Control Coding , methods, types of error
Types of errors, Methods of controlling
15 10-08-10 2,4
errors
III Hamming: Distance, Bound, Codes,
16 11-08-10 2,3
CRC Block code
Types of codes, Linear Block Code, Error
17 13-08-10 1,2,5
Detection & correction
Syndrome calculation, Handshaking
18 tech. , FEC, ARQ, Stop and wait, Go 17-08-10 2,4
Back N, selective repeat
 Actual
Lect Proposed
Unit Name of the Topic Date of References
No Date
Coverage
Data Communication Techno & CN:
19 18-08-10 2, 4
PSTN, DSL technologies SONET
Wireless technologies in CN, Bluetooth,
20 20-08-10 2,4
Cellular telephony
IV 21 CN Application, Protocols & Standards 24-08-10 2,3
22 OSI Model ,TCP Model 25-08-10 1,2,5
23 LAN Standards, Ethernet, Topologies 27-08-10 2,5
24 Virtual LAN , DQDB, ATM 31-08-10 2,5
25 Physical Layer: Transmission Media 01-09-10 2,3
26 Wireless Transmission 03-09-10 2,4
27 Digital Hierarchy 14-09-10 2,5
V
28 Switching Techniques 15-09-10 2,4
29 Network hardware Components 17-09-10 2,3
30 Brides & Switches 21-09-10 2,4
Data Link Control: Data link layer
31 22-09-10 2,3,4
design issues
32 Framing, Error Control 24-09-10 2,3

33 HDLC, MAC sub layer 28-09-10 2,6

VI
34 Channel allocation 29-09-10 2,6

35 Multiple access protocol 01-10-10 2,5

36 Virtual LAN’s 05-10-10 2,3

Prof. R. B. Rathod Prof. R. V. Patil

(Signature of Teacher) (Head of Department)
Books for Reference:
1. Lathi B. “Modern Digital and Analog Communication Systems”
2 Stallings W. “Data and Computer Communication”
3. Godbole A “Data Communication and Networks”
4 Gupta P “Data Communications”.
5. Shanmugam K, “Digital and Analog Communication Systems”
6. Garcia L. “Communication Networks”
.
 Poona District Education Assoication’s
A.G.Awate College of Engineering, Hadapsar , Pune
Department of Computer Engineering

Subject: Digital Signal Processing (4H/W) Subject Code: 310244

Subject Teacher: Prof. P M Agarkar Academic Year : 2010-11 (Sem I)
TEACHING PLAN

Unit Lecture Name of the Topic Proposed Actual Date References

No. Date of
Coverage
U 1 Classification of Signals: 01/07/10 1,2,3
2 Analog, Discrete-time and Digital 02/07/10 1,2,3
3 Linear Time Invariant Systems 06/07/10 1,2,3
4 properties of LTI systems 07/07/10 1,2,3
I 5 Eigen functions for LTI systems 08/07/10 1,2,3
6 Sampling Theorem 09/07/10 1,2,3
7 reconstruction of a band limited Signal 13/07/10 1,2,3
8 quantization and encoding 14/07/10 1,2,3
9 Fourier Transform 15/07/10 1,2,3
10 Parseval’s theorem 16/07/10 1,2,3
11 windowing theorem 06/07/10 1,2,3
II 12 ROC and its properties 20/07/10 1,2,3
13 partial fraction 21/07/10 1,2,3
14 Linearity 22/07/10 1,2,3
15 multiplication by exponential sequence 23/07/10 1,2,3
16 solution of difference equation 27/07/10 1,2,3
17 Frequency Response of LTI Systems 28/07/10 1,2,3
18 group delay 29/07/10 1,2,3
19 Stability and causality 30/07/10 1,2,3
III 20 significance of poles/zeros 05/08/10 1,2,3
21 FR of a single zero or pole 06/08/10 1,2,3
22 systems with Linear phase 10/08/10 1,2,3
23 Generalized Linear phase systems 11/08/10 1,2,3
24 Four Types of GLPS 12/08/10 1,2,3
 25 Sampling the F.T 13/08/10 1,2,3
26 The Discrete Fourier Transform 17/08/10 1,2,3
27 Linearity 18/08/10 1,2,3
28 Symmetry 20/08/10 1,2,3
IV 29 Linear Convolution using DFT 13/08/10 1,2,3
30 Goerzel Algorithm 24/08/10 1,2,3
31 DIT FFT 25/08/10 1,2,3
32 Inverse DFT using FFT 26/08/10 1,2,3

Unit Lecture Name of the Topic Proposed Actual Date References

No. Date of
Coverage
33 Concept of filtering 27/08/10 1,2,3
34 Specifications 31/08/10 1,2,3
35 Characteristics of Butterworth 02/09/10 1,2,3
36 Design examples 03/09/10 1,2,3
V 37 properties of commonly used windows 14/09/10 1,2,3
38 Generalized Linear Phase 15/09/10 1,2,3
39 Design Examples 16/09/10 1,2,3
40 Comparison of IIR and FIR Filters 17/09/10 1,2,3
41 Block diagrams and Signal flow 21/09/10 1,2,3
42 Basic structures for IIR System 22/09/10 1,2,3
43 cascade form, parallel form 23/09/10 1,2,3
44 Transposed Forms 24/09/10 1,2,3
VI 45 Basic Structures for FIR Systems 28/09/10 1,2,3
46 cascade form 29/09/10 1,2,3
47 Finite Register Length effect 30/09/10 1,2,3
48 Instruction set of ADSP 21XX 01/10/10 1,2,3

Prof. P.M. Agarkar Prof. R.V.Patil

Dept. of Computer Engineering H.O.D.

Text Books:
1. Oppenheim A., Schafer R., Buck J., "Discrete time signal processing", 2nd Edition, Prentice Hall,
2003, ISBN-81-7808-244-6.
2. Proakis J., Manolakis D., "Digital signal processing", 3rd Edition, Prentice Hall, ISBN 81-203-
0720-8
Reference Books:
1. Babu R., "Digital Signal Processing", 2nd Edition, Scitech Publications, ISBN SI-873- 2852-5
2. Mitra S., "Digital Signal Processing: A Computer Based Approach", Tata McGraw-Hill, 1998,
ISBN 0-07-044705-5
3. Vallavraj A., "Digital Signal Processing", ISBN 0-07-463996-X
4. Manual - ADSP 21 XX family DSP
5. White S., "Digital Signal Processing", Thomson Learning, ISBN -981 -240-620-4

Poona District Education Association’s

A. G. Awate College of Engineering, Hadapsar Pune –28

Department of Computer Engineering

Subject: Database Management Systems Subject Code: 310241

Subject Teacher: Prof. Sonawane N.D. Acad.Year:2010-11 (Semester –I)

Teaching Plan
Unit Lect. Name of the Topic Proposed Actual Ref.
No date Coverag
e date
I 1 Introduction to DBMS: Basic Concepts, advantages Of 01/07/10 1,2,
a DBMS over File-Processing System Data Abstraction, 3,4
Database Languages, Data Models and Data
Independence.
2 Components of a DBMS and overall Structure of DBMS, 05/07/10
Multi-User DBMS Architecture, System Catalogs
3 Data Modeling: Basic Concepts , Entity, Attributes, 06/07/10
Relationship, Constraints, Keys
4 ER and EER Dia: Components of ER model, 08/07/10
Conventions converting ER diagram into tables, EER
model components, converting EER dia into tables.
5 Relational Model: Basic concept , Attribute and 12/07/10
Domains , Codd’s Rules
6 Relational Integrity: Nulls , Entity, Referential Integrity, 13/07/10
Enterprise Constraints, Views , Schema Diagrams
II 7 Relational Algebra & SQL: Relational Query 15/07/10 1,2,
Languages: -Relational Algebra and Relational 3,4
Calculus , Tuples Relational and Domain relational
Calculus
8 Introduction to SQL: Characteristics and Advantages, 19/07/10
SQL data types and literals , DDL , DML, SQL
operators ,
9 Tables: Creating , Modifying, Deleting, Views: Creating 20/7/10
Dropping ,Updation using Views, Indexes , Nulls
 10 SQL DML Queries: Select Query and Clauses, Set 22/07/10
Operations, Predicates, Joins, Set membership, tuple
variables, Set Comparison , Ordering of Tuples
11 Aggregate Functions , Nested Queries Database 26/07/10
Modification using SQL Insert, Update and Delete
Queries
12 Concept Stored Procedure and Trigger, 27/07/10
13 Introduction to QBE and QUEL programmatic SQL: 29/07/10
Embedded SQL ,
14 Dynamic SQL, ODBC. 05/08/10

III 15 Relational Database Design: Purpose of 09/08/10 1,2,

Normalization, Data Redundancy and Update Anomalies 3,4
16 Functional Dependencies:Basic concepts, closure of set 10/08/10
of functional dependencies,
17 closure of attribute set, canonical cover 12/08/10
18 Decomposition: lossless join decomposition & 17/08/10
dependency preservation
19 The Process of Normalization: 1NF, 2NF, 3NF, 23/08/10
20 BCNF, 4NF, 5NF 24/08/10
IV 21 File Systems & Query Processing 26/08/10 1,2,
File Organization, Organization of records in files, 3,4
Indices
22 Static and Dynamic hashing 30/08/10
23 B trees and B+ trees. 31/08/10
24 Introduction to Query Processing: Overview, 02/09/10
measures of query cost, selection and join operation.
25 Evaluation of expression, Introduction to the query 06/09/10
optimization.
26 Estimation, Transformation of Relational expression. 13/09/10
V 27 Transaction Management : 14/09/10 1,2,
Basic concept of a Transaction, Properties of 3,4,
Transactions 5
28 16/09/10
Concepts of Schedule, Serial Schedule, and
Serilizability: Conflict and View, Cascade Aborts.
29 20/09/10
Recoverable and Non-recoverable Schedule,
Concurrency Control: Need, Locking Methods.
30 21/09/10
Deadlocks ,Timestamps methods, Optimistic
Techniques, Multiversion Concurrency Controls.
31 23/09/10
Different Crash Recovery Methods such as
Shadow paging.
32 Log based Recovery: Deferred and Immediate, 27/09/10
Checkpoints.
VI 33 Object-Oriented Databases and Database 28/09/10 1,2,
Architectures: Need of OODBMS,Storing Objects in 3,4,
Relational Databases,Inro. To OO Data Models. 5
34 30/09/10
Persistent Prog. Language, Pointer Swizzling
Techniques
35 Database Architectures: Centralized and Client-Server 04/10/10
Architectures, 2 Tier and 3 Tier Architecture
36 05/10/10
Introduction to Distributed Database systems
37 Introduction to data mining using association rules 07/10/10
38 Introduction to data warehousing and its components. 08/10/10

Prof. Sonawane N.D. Prof. R.V.Patil

(Signature of Teacher) (Head of Department)

References:
1. Silberschatz A., Korth, Database System concepts.
2. Connaly T.,Begg C., “Database Systems”.
3. Rab P. Coronal, “Database System Sesigns”
4. Date C. “ An Introduction to Database System”.
5. Ramkrishna R.,” Database Management Systems”.

Poona District Education Association’s

B. G. Awate College of Engineering, Hadapsar Pune –28

Department of Computer Engineering

Subject: RDBMS AND VISUAL PROGRAMMING LABORATORY(T) Subject Code: 310246

Subject Teacher: Prof. Sonawane N.D. Acad.Year:2010-11 (Semester –I)

Teaching Plan

Unit Lect. Name of the Topic Proposed Actual Ref.

No date covera
ge date
I 1 Part I: Visual Programming Language 02/07/10 . 1,2,
Concept of Event Driven Programming, Visual basic 3
6.0 Integrated Development Environment
2 Visual Basic 6.0 Projects – Standard EXE, ActiveX 03/07/10
EXE/DLL , ActiveX user Control,Visual Basic 6.0 –
Data types, Control statements, loops,
3 Array & dynamic array handling, Sub 09/07/10
routines & functions File Handling- sequential files,
Binary files, random access files.
 4 Visual Basic 6.0 - Text Box, Command, Label, Picture 10/07/10
Box, Image Box, Graphics Control, List
Box, Combo Box, Check Box, Option Box, Frame,
Image list box, Image combo box, Drive box,
Directory list box, File list box, OLE Control, Timer,
Rich Text Box
5 Treeview Control, Progressbar, Tool bar, Status bar, 16/07/10
Tab strips, Sliders, Horizontal scrollbar, Vertical
scrollbar, Common Dialog Control, Message box,
Input box,
6 Menu, Properties, Events & Methods, MDI forms, 17/07/10
Control Array, ActiveX DLL, ActiveX user Control
II 7 Part II: RDBMS - SQL, PL/SQL 23/07/10 1,2,
Introduction to SQL, Introduction to DDL, DML, 3
DCL, TCL
8 Data types, Integrity constraints,SQL Operators, SQL 24/07/10
SET Operators
9 SQL Functions -Character, Date, Null Values, 30/7/10
Aggregate,Group By, Having Clause
10 Order By, Joins, Subquery, Multi table Inert & 31/07/10
Merge, Case Expression.
11 Order By, Joins, Subquery, Multi table Inert & Merge, 13/08/10
Case Expression.
12 DDL Statement : Create, Alter, Drop – Table, View, 14/08/10
Index, sequence, and synonyms, User, Role
DML Statement: Insert, Select, update, Delete –
Table, View,DCL Statement : Grant, Revoke
TCL Statement : Commit, Rollback, Save Point
Introduction to PLSQL, PL/SQL Block, Data types,
Control structure, Loops, Operators
13 Cursors : Implicit, Explicit, REF., Collection and 20/08/10
Record ,Sub Program : Stored Functions & Stored
Procedures, Package,Database Triggers : Row level
& Statement level.Exception Handling : Built in
Exception & User defined Exception
14 DDL Statement : Create, Alter, Drop – Table, View, 21/08/10
Index, sequence, and synonyms, User, Role
DML Statement: Insert, Select, update, Delete –
Table, View
15 DCL Statement : Grant, Revoke 27/08/10
TCL Statement : Commit, Rollback, Save Point
Introduction to PLSQL, PL/SQL Block, Data types,
Control structure, Loops, Operators
16 Cursors : Implicit, Explicit, REF., Collection and 28/08/10
Record,Sub Program : Stored Functions & Stored
Procedures, Package
17 Database Triggers : Row level & Statement level. 03/09/10
 18 Exception Handling : Built in Exception & User 04/09/10
defined Exception ,Embedded SQL and Dynamic
SQL
III 19 Part III : Mini Project : Database Project Life 17/09/10 1,2,
Cycle 3
20 Database Analysis and Design 24/09/10
Design Approach – Bottom Up, Top Down, inside –
Out, Mixed strategy.Design Entity Relationship Model
Relational Model,Database Normalization
Implementation :Front End : Visual Basic 6.0
Backend : Oracle/ MySQL / SQL Server
Report : Data Report,Database Programming :
ODBC, OLEDB, ADO, RDO
Testing : Form Validation

Prof. Sonawane N.D. Prof. R.V.Patil

(Signature of Teacher) (Head of Department)

Reference Books:
1) Luers T., Atwood T., Gennick J., 'Teach Yourself SQL in 21 Days", Techmedia, ISBN 81-7635-014-1
2) Rob P., Semaan E., "Databases: Design, Development and Deployment Using MS-ACCESS", 2001,
Tata McGraw-Hill, ISBN 0 - 07 - 044534 - 6
3) Urman S., Hardman R., McLAUGHLIN M., "PL/SQL Programming: Develop Database Driven PL/SQL
Applications", Tata McGraw-Hill Edition, 2004, ISBN 0 -07 - 059779 - 0

Poona District Education Association’s

A. G. Awate College of Engineering, Hadapsar Pune –28
Department of Computer Engineering
Subject : RDBMS AND VISUAL PROGRAMMING LABORATORY Subject Code: 310254
Subject Teacher: Prof N.D.Sonawane Acad. Year: 2010-11 (Semester –I)

Teaching Plan (Practical)

Sr Pr. Name of the Practical Proposed Performance
No No Batch Date Date Remark
1 1 Design and Develop Scientific T1 07/07/10
Calculator using control array T2 05/07/10
T3 05/07/10
T4 06/07/10
2 2 Design and Develop Menu driven T1 08/07/10
Text & Image editor T2 07/07/10
T3 09/07/10
T4 10/07/10
3 3 Design and Develop an application T1 14/07/10
which demonstrates the use of Drive T2 12/07/10
box, Directory listbox, File List box T3 12/07/10
and Tree view control
T4 13/07/10
4 4 Design and Develop a program for T1 15/07/10
animation(traffic signal, bouncing T2 14/07/10
ball, flying butterfly) T3 16/07/10
T4 17/07/10
5 5 Design and Develop features of T1 21/07/10
Paint Brush application T2 19/07/10
T3 19/07/10
T4 20/07/10
6 6 Design and Develop ActiveX user T1 22/07/10
control (numeric text box, string T2 21/07/10
manipulation function) T3 23/07/10
T4 24/07/10
7 7 Set Properties, Methods, Events, T1 28/07/10
and demonstrate the use of ActiveX T2 26/07/10
Control in Standard T3 26/07/10
T4 27/07/10
8 8 EXE project T1 29/07/10
T2 28/07/10
T3 30/07/10
T4 31/07/10
9 9 Design and Develop ActiveX DLL for T1 05/08/10
linear search & binary search and T2 09/08/10
demonstrate the use of ActiveX DLL in T3 06/08/10
Standard EXE project
T4 07/08/10
10 10 10. Develop a program for T1 11/08/10
Sequential and Random Access file T2 11/08/10
handling. T3 09/08/10
T4 10/08/10
11 11 Design student Information form using T1 12/08/10
Visual Basic 6.0 and Implement
T2 17/08/10
validation for Text,
Number, Email, Length, Upper Case, T3 13/08/10
Lower Case, Date, Password,
T4 14/08/10
Character matching etc
12 12 Design and Develop SQL DDL T1 18/08/10
statements which demonstrate the T2 23/08/10
use of SQL objects suchas Table,
T3 20/08/10
View , Index, Sequence, Synonym
T4 17/08/10
13 13 Design at least 10 SQL queries for T1 25/08/10
suitable database application using T2 25/08/10
SQL DMLstatements: Insert, Select, T3 23/08/10
Update, Delete with operators,
T4 21/08/10
functions, set operators, Clauses.
14 14 Design at least 10 SQL queries for T1 26/08/10
suitable database application using T2 30/08/10
SQL DMLstatements: all types of Join,
T3 27/08/10
Sub-Query and View.
T4 24/08/10
15 15 Write a PL/SQL block to calculate T1 02/09/10
the grade of minimum 10 students. T2 01/09/10
T3 30/08/10
T4 28/08/10
16 16 Write a PL/SQL block to T1 16/09/10
implement all types of cursors. T2 06/09/10
T3 03/09/10
T4 04/09/10
17 17 Write a PL/SQL stored procedure T1 22/09/10
and function. T2 13/09/10
T3 06/09/10
T4 14/09/10
18 18 Write a database Trigger (Row level T1 29/09/10
and Statement level). T2 15/09/10
T3 13/09/10
T4 21/09/10
19 19 Implement Embedded SQL queries T1 30/09/10
using C/C++ as host language. T2 20/09/10
T3 17/09/10
T4 25/09/10

Prof N.D.Sonawane Prof R. V. Patil

(Signature of Teacher) (Head of Department)
Ref.Books:
1. “ Visual Basic 6 Programming - Black Book”, DreamTeach Press
2. “ Mastering Visual Basic 6 ”, Envagelos Petroutsos, bpb Publication
3. “ Visual Basic 6 Programming ”, Tata McgrawHill ,Content Development Group
4. “ SQL and PL/SQL for Oracle 10g Black Book”, Dr. P.S.Deshpande, DreamTech
5. “ SQL, PL/SQL: The Programming Language of Oracle”, Ivan Bayross, BPB Publication
6. “ Oracle 9i/10g The Complete Reference”, Kevin Loney, George Koch, Tata McGraw Hill

Poona District Education Association's

A. G. Awate College of Engineering, Hadapsar Pune -28
Department of Computer Engineering
Subject - Theory of Computer Science Subject Subject Code : 310245 Acad.Year:2009-

Teacher: Prof. Baltej Kaur 10 (Semester-I)

Teaching Plan
Unit Lecture Name of the Topic Proposed Actual date Reference
No date of coverage

I 1 Introduction to Finite Automata, Structural 01/07/2010 1,2,3,4

Representations, Automata and Complexity,
Central Concepts to Automata Theory:
2 Alphabets, Strings, Languages and Problems, 02/07/2010
Finite Automata: An Informal Picture of FA,
3 DFA: How a DFA processes Strings, Simpler 05/07/2010
Notations for DFA, Extending the transition
function to strings, the language of DFA.

4 Non-deterministic Finite Automaton (NFA): NFA, 08/07/2010

Extended transition function, the language of an
NFA
5 Equivalence of NFA and DFA, FA with e- 09/07/2010
transitions
6 Use of e-transitions, NFA with e, e-closures, 12/07/2010
Extended transitions and languages for e-NFA
7 Eliminating €-transitions-Con version of NFA with 15/07/2010
e to NFA without e,
8 Conversion of NFA without e to DFA, Conversion 16/07/2010
of NFA with 6 to DFA (direcmethod),
9 Moore and Mealy machines -Definition, models, 19/07/2010
inter-conversion.
10 Regular Expression (RE) & languages : 22/07/2010 1,2,3
II Operator of RE, Building RE, Precedance of
OPR
11 Algebraic laws of RE, Arden's Theorem 23/07/2010

12 FA & RE : DFA to RE , RE to DFA 26/07/2010

13 FA limitations, properties of Regular lang. Closure & 29/07/2010

decision, equivalence & minimization

14 Properties of Regular Languages: pumping lemma 30/07/2010

for regular languages

15 closure and decision properties of regular languages, 05/08/2010

Equivalence and minimization of automata

16 Application of RE: Regular expressions in Unix, 06/08/2010

GREP utilities of Unix.
17 Lexical Analysis & finding patterns in text 09/08/2010

18 Context Free Grammars (CFG) and Languages: 12/08/2010 1,2,3,4

Ill
19 Definition, derivations, languages of a grammar, 13/08/2010
sentential form
 20 Parse Tree- inference, derivation and parse tree 20/08/2010

21 Inference to tree, Ambiguity in grammars and 23/08/2010

languages: removal of ambiguity, inherent ambiguity

22 Properties of CFL- Normal forms-Chomsky Normal 26/08/2010

Form and Greibach Normal Form,

23 Regular Grammar - definition, left linear and right 27/08/2010

linear Regular Grammar, Regular Grammar and
Finite Automata,

24 Push Down Automata(PDA) ; 30/08/2010 1,3,4

IV Definition, Lang, of PDA, Equivalence of PDA
& CFG
25 CFG to PDA, PDA to CFG 02/09/2010
26 Deterministic PDA - Regular lang & DPDA, DPDA & 03/09/2010
CFL, DPDA & ambiguous grammer,

27 NPDA, the pumping lemma for CFL, Closure & 13/09/2010

Decision properties of CFL

28 Application of CFG : Parser, Markup language 16/09/2010

29 XML & document type definition 17/09/2010

V 30 Turing Machine : Problems 20/09/2010 1,3,4
31 The TM notations, lang. of TM 23/09/2010
32 TM & halting problem, programming Tech. 24/09/2010

32 Extension to basic TM 27/09/2010

33 Introduction to Post Machine, Comparison 30/09/2010
with FA
34 PDA, Post machine & TM 01/10/2010

VI 35 Introduction to Computational Complexity: 04/10/2010 1,3,4

36 Un-decidability: A Language that is not recursively 04/10/2010

enumerable
37 An un-decidable problem that is RE, Post 07/10/2010
Correspondence Problem,
38 Intractable Problems* The classes P and NP 07/10/2010

39 Problems solvable in polynomial time, Non-deterministic 08/10/2010

Polynomial time
 40 Polynomial time reduction and NP-complete 08/10/2010
problems.

Prof. Baltej Kaur Prof. R.V. Patil

(Signature of Teacher) (Signature of HOD )

References:

1. Theory of Computation By Vivek Kulkarni

2. Martin j. .Introduction to language & theory of Computation
3. Theory of computer science - A.K. Abhyankar
4. Theory of computer science - K.LP.Mishra, N.Chandrasekaran

Poona District Education Association’s

A. G. Awate College of Engineering, Hadapsar Pune –28
Department of Computer Engineering
Subject : Computer Laboratory-l Subject Code: 410446
Subject Teacher: Baltej Kaur Acad. Year: 2010-11 (Semester –I)

Teaching Plan (Practical)

Sr Pr. Name of the Practical Proposed Performance
No No Batch Date Date Remark
1 1 Assignment to understand B1 02/07/10
basic syntax of LEX 09/07/10
specifications, built-in B3 03/07/10
 functions and Variables 10/07/10
B2 05/07/10
06/07/10
2 2 Implement a lexical B2 12/07/10
analyzer for a subset of C 13/07/10
using LEX Implementation B1 15/07/10
should support 16/07/10
Error handling, B3 14/07/10
17/07/10
3 3 Assignment to understand B2 19/07/10
basic syntax of YACC 23/07/10
specifications, built-in B3 21/07/10
functions and Variables 24/07/10
B1 22/07/10

4 4 Write an ambiguous CFG B2 26/07/10

to recognize an infix 27/07/10
expression and implement a
parser that recognizes the B3 28/07/10
infix expression using 29/07/10
YACC. Provide the details B1 30/07/10
of all conflicting entries in
the parser table generated
by LEX and YACC and
how they have been
resolved-Syntax
5 5 Write an attributed B2 31/07/10
translation grammar to B3 05/08/10
recognize declarations of
simple variables, "for",
assignment, if, if-else
statements as per syntax of
C or Pascal and generate
equivalent three address
code for the given input
made up of constructs
mentioned above using
LEX and YACC. Write a
code to store the identifiers
from the input in a symbol
table and also to record
other relevant information
about the identifiers.
Display all records stored in
the symbol table.
6 6 For a small subset of C with B1 31/07/10
essential programming B1 05/08/10
constructs, write a compiler B3 05/08/10
using LEX and YACC. (To
be carried out in a group of 4
to 6 students)
7 7 Study of UNIX Commands B2 06/08/10
B2 06/08/10
 B3 06/08/10
8 8 Shell Programming and B1 09/08/10
AWK Programming with B1 09/08/10
suitable application and use B3 10/08/10
of advanced filters, AWK
Report Generation.
9 9 Using fork system call B1 09/08/10
creates child process, B1 09/08/10
suspend it using wait B3 10/08/10
system call and transfer it
into the zombie state.
10 10 Client - Server B2 09/08/10
communication using B2 10/08/10
following IPC mechanism B3 11/08/10
1. Unnamed pipe
2. Named pipe
3. Semaphore
5. File management using
low level file access system
calls such as write, open,
Seek, state
6. Implement an Alarm
clock application using
signals
7. Simultaneous execution
of two threads
8. Write & insert a module
in Linux Kernel generator
concept.
11 11 Recursive and iterative (non B1 12/08/10
recursive) algorithm for B1 13/08/10
specific problem and their
complexity measures B3 14/08/10
(comparison expected)
12 12 Quick Sort/ Merge Sort B2 17/08/10
implementations using B3 18/08/10
divide and conquer
approach. Time complexity B1 19/08/10
measure is to be obtained.
13 13 Minimal spanning Trees/ B1 20/08/10
Job scheduling as an B3 21/08/10
example of Greedy B2 23/08/10
approach. B2 24/08/10
14 14 Finding shortest path for B3 25/08/10
multistage graph problem, B1 26/08/10
(single source shortest path B1 27/08/10
and all pairs shortest path.) B3 28/08/10
15 15 OBST/Flow Shop B2 30/08/10
Scheduling as an example B3 01/09/2010
of dynamic programming. B2 02/09/10
06/09/10
B3 25/08/10
 28/08/10
31/08/10
01/09/10
16 16 0/1 knapsack's problem B1 02/09/10
using Dynamic B1 03/09/10
Programming, Backtracking B3 04/09/10
and Branch & Bound B2 13/09/10
Strategies. B2 14/09/10
B1 16/09/10
B1 17/09/10
B2 20/09/10
17 17 8-Queen problem/ Graph B2 21/09/10
coloring problem : general B3 22/09/10
backtracking method and B1 23/09/10
recursive back tracking B1 24/09/10
method and their B3 25/09/10
comparison for space and B2 27/09/10
time complexity.
B2 28/09/10
B3 29/09/10
18 18 A complete LC branch and B1 30/09/10
bound algorithm for job B1 01/10/10
sequencing with dead lines B2 04/10/10
problem. Use fixed tuple 05/10/10
size formulation. B3 06/10/10
07/10/10

19 19 Algorithm implementation B3 09/10/10

for 'Traveling salesman'
problem using -
(a) Dynamic programming
approach.
(b) Branch & Bound
approach.

Prof Baltej Kaur Prof R. V. Patil

(Signature of Teacher) (Head of Department)

Reference Books:
1. Brian W. Kernighan, Rob Pike, "The UNIX Programming Environment" Prentice Hall India, ISBN: 81-
203-0499-3
2. W. Richard Stevens, "UNIX Network Programming", 2/e Volume 2, Prentice Hall India, ISBN: 81-203-
2062-X
3. Neil Matthew, Richard Stones, "Beginning Linux Programming", 3/e, WROX Publication, ISBN: 81-265-
0484-6
4. Daniel P. Bovet, Marco Cesati, "Understanding the Linux Kernel, Second Edition", 2/e, ISBN: 0-596-
00213-0 ;,.*.,.
5. Richard L. Peterson, "The Complete Reference, Linux", 5/e, Tata McGraw Hill, ISBN: 0-07-052489-7
Hill
 Poona District Education Association's
A. G. Awate College of Engineering, Hadapsar Pune -28
Department of Computer Engineering
Subject: Principles of Compiler Design Subject Code: 410444
Subject Teacher: Prof. Baltej Kaur Acad.Year:2009-10 (Semester-I)
Teaching Plan

Unit Lecture Name of the Topic Proposed Actual Reference

No date date of
coverage
I 1 Introduction of Compiler : 02/07/2010 1,2,3
Translator issues, why to write
compiler, Compilation process,
Frond end & back end Model
2 Cc tools, Interpreter & the related 05/07/2010
issue, cross compiler, bootstrapping,
incremental compiler,
3 byte code compiler 06/07/2010
Lexical Analysis : Review,
alphabet, token, lexical error
4 Block Schematic of L.A. 07/07/2010
5 Automatic construction of L.A. (LEX) 09/07/2010
6 LEX specification & features 12/07/2010
II 7 Syntax Analysis : Introduction : Role 13/07/2010 1,5
of parser
8 Top down RD parser 14/07/2010
9 Predictive parser, LL(1) parser 16/07/2010
10 Bottom up Parsers- operator 19/07/2010
11 Shift Reduce Parser 20/07/2010
12 SLR Parser, LR(K) Parser 21/07/2010
13 LALR parser Using 23/07/2010
ambiguous grammar
14 Error detection & Recovery 26/07/2010
15 Automatic construction of 27/07/2010
16 YACC specification 28/07/2010
17 Syntax directed translation : 30/07/2010 1,2,3,4,5
III definition, Construction of trees
18 Bottom up Evaluation of S- 06/08/2010
attributed definition
19 L- Attributed definitions 09/08/2010
20 Top down translation 10/08/2010
21 Bottom up evaluation of inherited 11/08/2010
attri.

22 Intermediate Code Generation : 13/08/2010

Intermediate Lang, declarations
23 Assignment statements, iterative 16/08/2010
stmt.
24 Case statements, arrays , structures 17/08/2010
 25 Conditional stmt, Boolean 18/08/2010
expressions back patching,
procedure call
26 Intermediate code generator using 20/08/2010
YACC
IV 27 Run time storage organization : 23/08/2010 1,3,4,5
source Lang issues, Storage
organization & allocation strategies
28 Blocked structured & non blocked 24/08/2010
structured Lang. Activation record
29 Variable length data, procedure 25/08/2010
parameters, nested procedures
30 Access to non local names. 27/08/2010
Procedure call & return
31 Static & dynamic scope symbols 30/08/2010
32 Table organization & management 01/09/2010
V 33 Code Generation :Introduction, 03/09/2010 1,3,4,5
issues in code generation,
Target machine description ,basic 13/09/2010
34 blocks & flow graphs
Next-use information, Register 14/09/2010
35 allocation & assignment
36 Deg representation of basic blocks 17/09/2010
37 Peephole optimization 20/09/2010
38 Generating code from a DAG 21/09/2010
39 Dynamic Programming 22/09/2010
40 Code generator- generator concept 24/09/2010
VI 41 Code Optimization : 27/09/2010 1,3.5
Introduction, classification
of optimization
42 Principle source of optimization, 28/09/2010
optimization of basic blocks, loops
in flow graph
43 Optimizing transformations: 29/09/2010
compile time evaluation
44 Common sub expression 01/10/2010
elimination, variable propagation,
code movement, strength reduction
45 Dead code elimination & loop 04/10/2010
optimization, local optimization
46 DAG based local optimization, 05/10/2010
Global optimization: Control &
47 data flow ana.
Computing global data flow info : 06/10/2010
meet over paths, dataflow eq.,
48 data flowdataflow
Iterative ana analysis, 08/10/2010
Available expressions, live
range identification

Prof Baltej Kaur Prof. R.V.Patil

(Signature of Teacher) (Head of Department)

References

1. A V Aho, R. Sethi, J D Ullman, "Compilers: Principles, Techniques, and Tools",

Pearson Education, ISBN 81, 7758 - 590 - 8
2. l.K. Cooper, L, Torczon, "Engineering a Compiler", MorganKaufinann Publishers,
ISBN 81-8147-369-8.
3. K. Louden, "Compiler Construction: Principles and Practice", Thomson
Brookes/Cole (ISE), 2003, ISBN 981
243 - 694-4
4. J. R. Levine, T. Mason, D. Brown, "Lex & Yacc", O'Reilly, 2000, ISBN 81-7366
-061-X.
5. S. Chattopadhyay, "Compiler Design", Prentice-Hall of India, 2005, ISBN 81-203-
2725-X.
 Poona District Education Association’s
A. G. Awate College of Engineering, Hadapsar Pune –28
Department of Computer Engineering
Subject: Operating System Subject Code: 440442
Subject Teacher: Prof. P.B Sarkale

Acad.Year:2010-11 Semester I

Teaching Plan

Unit Lecture No Name of the Topic Proposed Actual date of Reference

date coverage
1 Process synchronization and inter- 6/7/2010 1,2,4
process communication
2 Critical section problem and 9/7/2010
I semaphores
3 Classic problems of synchronization 13/7/2010
4 Critical regions, monitors, OS 14/7/2010
synchronization.
5 Deadlock characterization, methods for 16/7/2010 2,3,4
handling deadlocks
6 Deadlock Detection, Prevention, 20/7/2010
avoidance, recovery & protection.
7 Domain of protection, Access matrix 21/7/2010
8 Implementation of access matrix, 23/7/2010
II Revocation of access rights security
9 Security problems, user authentication, 27/7/2010
program threats, system threats,
security system
10 Intrusions detection & cryptography. 28/7/2010
III 15 System Architecture, User perspective 30/7/2010 2,3,5
16 Operating system Services 3/8/2010
17 Kernel Data structures, System Admin 4/8/2010
18 Buffer Headers, Structure of Buffer 6/8/2010
pool.
19 Scenarios for retrieval of buffer 10/8/2010
20 Reading and writing Disk Blocks 11/8/2010
21 Adv. & Disadv. Of Buffer Cache 13/8/2010
IV 23 Internal representation of files Inodes, 17/8/2010 2,3,4,5
Dir
24 Conversion of a path name to an Inode, 18/8/2010
Super Block
25 Allocation of Disk Blocks, Other file 24/8/2010
types
26 System Calls for the file system: open, 25/8/2010
read, write, file & Record Locking
27 Iseek, close, File creation, Creation Of 27/8/2010
special files
28 Change Directory & change Root 31/8/2010
29 Mounting & Unmounting file system, 1/9/2010
link, unlink
V 31 Structures of processes, Process states 3/9/2010 2,4,5
& transitions
32 Layout of System Memory, Context Of 7/9/2010
Process
33 Manipulation of the process address 8/9/2010
space, sleep
34 Process Creation,Signals, Process 14/9/2010
Termination
35 Awaiting process termination 15/9/2010
37 The User ID of a process, Changing the 17/9/2010
size of a process.
38 The shell, System boot & the init 21/9/2010
process, Process Scheduling and Time
39 Process scheduling, System calls for 22/9/2010
time & clock
40 Memory Management Policies, 24/9/2010 1,2,3,4
Swapping
41 Demand Paging, a hybrid system with 28/9/2010
VI swapping
42 Demand Paging I/O Subsystem, Driver 29/9/2010
Interfaces
43 Disk Drivers, Terminal Drivers, 1/10/2010
Streams.

Prof. P. B Sarkale Prof. R.V.Patil

(Signature of Teacher) (Head of Department)

Text Books:
1. William Stallings, "Operating System-Internals and Design Principles ", 5/e, Prentice Hall India, ISBN-
81-297-01094-3
2. Silberschatz, Galvin, Gagnes , "Operating System Concepts" 6/e, John Wiley & Sons, ISBN-9971-51-
388-9
Reference Books:
1. Dhamdhre D. M.,"Operating Systems - A Concept-Based Approach", Tata McGraw Hill Publications,
2nd '; -..; Edition-2006
2. Andrew S. Tanenbaum," Modern Operating Systems", 2/e, Prentice Hall India, ISBN-81-203-2063-8
3. 'Maurice J. Bach, "The design of the UNIX Operating System", Prentice Hall India, ISBN-81-203-
0516-7

Poona District Education Association’s

 A. G. Awate College of Engineering, Hadapsar Pune –28
Department of Computer Engineering
Subject : ADBMS(2008 Course) Subject Code: 410445
Subject Teacher: Prof M.K.Memane Acad. Year: 2010-11 (Semester –I)

Teaching Plan (Practical)

Sr Pr. Name of the Practical Proposed Performance
No No Batch Date Date Remark
1 1 ORDBMS- Implement system B1 21/07/2010
using composite, multivalued B2 23/07/2010
attributes, inheritence B3 20/07/2010
B4 22/07/2010
2 2 Directory system- address book B1 11/08/2010
using LDAP B2 13/08/2010
B3 10/08/2010
B4 12/08/2010
3 3 Web based system using ASP B1 25/08/2010
B2 27/08/2010
B3 24/08/2010
B4 26/08/2010
4 4 Building cubes and OLAP analysis B1 01/09/2010
B2 03/09/2010
B3 31/08/2010
B4 02/09/2010
5 5 Data mining algorithms B1 15/09/2010
B2 17/09/2010
B3 14/09/2010
B4 16/09/2010
6 6 Case Study B1 29/09/2010
a) MYSQL B2 01/10/2010
b) Oracle B3 28/09/2010
B4 30/09/2010

Prof M.K.Memane Prof R V Patil

(Signature of Teacher) (Head of Department)

Poona District Education Association’s

 A. G. Awate College of Engineering, Hadapsar Pune –28

Department of Computer Engineering

Subject Design And Analysis of Algorithm Subject Code: 410441

Subject Teacher: Prof. B. S. Kankate Acad. Year: 2010-11 (Semester –I)

Teaching Plan
Unit Lecture Name of the Topic Proposed Actual References
No Date Date of
Coverage
1 ‘O’,’’,’’ asymptotic notation, 02/07/10 2,3
2 Average, Best and worst 05/07/10 1,2,3
analysis of algorithms for Time
complexity.
3 Average, Best and worst 06/07/10 1,3
analysis of algorithms Space
complexity.
I 4 Amortize Analysis 07/07/10 1,2,3
5 Solving Recurrence Equations. 09/07/10 1,2,3
6 Proof Techniques: by 12/07/10 1,2,3
Contradiction
7 Proof Techniques: by 13/07/10 1,2,3
Mathematical Induction
8 Priority Queues: Heap and Heap 14/07/10 1,3
Sort.
9 Divide and Conquer: General 16/07/10 1,2,3
strategy, Exponentiation.
10 Binary Search, 19/07/10 1,2,3
11 Quick Sort 20/07/10 1,2,3
12 Merge Sort. 21/07/10 1,2
II 13 Greedy Method General Strategy 23/07/10 1,2,3
14 Knapsack problem 26/07/10 1,2,3
15 Job sequencing with Deadlines. 27/07/10 2,3
16 Optimal merge pattern 28/07/10 1,2,3
17 Minimal spanning trees &Dijkstra 30/07/10 1,2
Algorithm
18 Dynamic Programming: General 06/08/10 1,2,3
Strategy
19 0/1 knapsack 09/08/10 1,2,3
20 Multistage Graph 10/08/10 1,3
III
21 OBST 11/08/10 1,2,3
22 Traveling Salesperson Problem 13/08/10
23 Traveling Salesperson Problem 17/08/10
24 Flow shop Scheduling 18/08/10 1,2,3
Unit Lecture Name of the Topic Proposed Actual References
No Date Date of
Coverage
25 Backtracking & Branch and 20/08/10 1,2,3
Bound: General Strategy
26 8 Queens Problem 23/08/10 1,3
27 Graph Coloring 24/08/10 1,2,3
IV 28 Hamiltonian Cycles 25/08/10 1,2,3
29 0/1 Knapsack 27/08/10 1,2,3
30 Branch & Bound General 30/08/10 1,2,3
Strategy
31 0/1 Knapsack 31/08/10
32 Traveling Salesperson Problem 01/09/10 1,2
33 Parallel Algorithm: 02/09/10 1,2,3
34 Computational Model 06/09/10 1,2,3
35 Basic Tech & Algorithm 13/09/10 1,2,3
36 Complete Binary Tree, Pointer 14/09/10 2,3
V 37 Doubling, Prefix computation 15/09/10 1,2,3
38 Selection, Merging 17/09/10
39 Sorting Networks 20/09/10
40 Parallel Sorting, Graph 21/09/10 1,2,3
Problems
41 NP –Hard And NP Complete 22/09/10 1,2,3
Problems: Algorithm
42 Complexity Intractability 24/09/10
43 Non-Deterministic polynomial 27/09/10
Time Decision Problem, Cooks
VI Theorem.
44 NP Complete Problem: 28/09/10
Satisfiability problem.
45 NP-Hard Problem: code 29/09/10 1,2,3
generation Problem
46 Simplified NP Hard Problems. 01/10/10 1,2,3
 Prof. B. S. Kankate Prof. R. V. Patil
(Signature of Teacher) (Head of Department)

Books References:

1. Bressard: “Fundamental of Algorithm”

2. Horowitz and Sahani:”Funadamental of Computer Algorithm”
3. Thomas H Cormen and Carlos, ” Introduction To Algorithm”