All Teaching Plan

Poona District Education Association’s A. G. Awate College of Engineering, Hadapsar Pune –28

Department of Computer EngineeringSubject: 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 date

Actual date of coverage

Reference

I

1 Arrays , Pointers: Arrays & Pointers 1/7/2010 1,2,42 Functions : Parameter passing by

value , by reference5/7/2010

3 Scope rules, pointers 6/7/20104 String manipulations 8/7/20105 Structure & Union 12/7/20106 Passing & returning 13/7/20107 Recursion , File Handling 14/7/2010

II

8 Introduction to Data Structures 15/7/2010 2,3,49 Data object, Data structure ADT 19/7/201010 Concept of Primitive and non primitive,

linear and Non-linear20/7/2010

11 static and dynamic persistent and ephemeral data structures

21/7/2010

12 Analysis of algorithm frequency count

22/7/2010

13 Time complexity & Space complexity of an algorithm

26/7/2010

14 Big ‘O’, ‘’ and ‘’ notations, Best, Worst and Average case analysis

27/7/2010

III 15 Linear Data Structures using Sequential Organization Concept

28/7/2010 2,3,5

16 arrays as ADT, 29/7/201017 Row major and Column major 5/8/201018 Address calculation 9/8/201019 Multidimensional arrays, Concept of

ordered list10/8/2010

20 Applications Polynomial , Sparse Matrix

11/8/2010

21 Algorithms for sparse matrix operations

12/8/2010

22 addition, simple transpose, fast transpose & multiplication

17/8/2010

IV 23 Sorting and searching techniques: 23/8/2010 2,3,4,5

24 Bubble sort, Selection sort, Insertion sort, Shell

24/8/2010

25 Radix sort, Quick sort and Merge sort 25/8/201026 Analysis of sorting technique 26/8/201027 best, worst and average case, 30/8/201028 Algorithms for Sequential search,

Binary search,31/8/2010

29 Fibonacci search Index Sequential search,

01/9/2010

30 analysis of each searching technique 02/9/2010V 31 Linear Data Structures using Linked

Organization:06/9/2010 2,4,5

32 Limitations of static memory Dynamic memory allocation in C.

13/9/2010

33 Singly linked list, Doubly linked list, Circular linked list

14/9/2010

34 insertion, deletion, traversal & other operations

15/9/2010

35 Applications: polynomials using circular linked list

16/9/2010

36 Garbage collection and compaction 20/9/201037 Representation of polynomial using

generalized linked list21/9/2010

38 Concept of skip list. 22/9/2010

39 Analysis of the algorithms used 23/9/201040 Stacks and Queues: stack as ADT 27/9/2010 1,2,3,441 stack using sequential & linked 28/9/2010

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.


Department of Computer EngineeringSubject: Digital Electronics Lab Subject Code: 210247Subject Teacher: Prof P.B. Sarkale Acad. Year: 2010-11 (Semester –I)

Sr No

Pr.No

Name of the PracticalBatch

Proposed Date

Performance Date Remark

1 1 To study the TTL Characteristics. S1 14/07/2010S2 16/07/2010S3 12/07/2010

2 2 To design and implement Code Conversions.

S1 17/07/2010S2 17/07/2010S3 13/07/2010

3 3 To verify the functioning of Multiplexer.

S1 21/07/2010S2 23/07/2010S3 19/07/2010

4 4 To verify the functioning of Demultiplexer.

S1 24/07/2010S2 24/07/2010S3 20/07/2010

5 5 Design and implement of BCD Adder.

S1 28/07/2010S2 30/07/2010

Teaching Plan (Practical)

S3 26/07/20106 6 To study Parity Generator &

Detector.S1 31/07/2010S2 31/07/2010S3 27/07/2010

7 7 To study Flip-flops, registers and counters.

S1 7/08/2010S2 7/08/2010S3 3/08/2010

8 8 To study 4-bit Multiplier. S1 11/08/2010S2 13/08/2010S3 9/08/2010

9 9 To design & implement 3-bit up/down Ripple asynchronous counter.

S1 14/08/2010S2 14/08/2010S3 10/08/2010

10 10(a)

(b)

To design a Sequence Generator for given sequence.To design a Sequence Generator for given sequence.

S1 18/08/2010S2 20/08/2010S3 16/08/2010

11 11 To design 3-bit synchronous up/down counter.

S1 21/08/2010S2 21/08/2010S3 17/08/2010

12 12 To design a Mod –N-Counter using IC 7490

S1 25/08/2010S2 27/08/2010S3 23/08/2010

13 13 To study Pseudo Random Binary Sequence Generator.

S1 28/08/2010S2 28/08/2010S3 24/08/2010

14 14 To study 4-bit Barrel shifter using Multiplexer.

S1 01/09/2010S2 03/09/2010S3 30/08/2010

15 15 To study PsPiece Software. S1 04/09/2010S2 04/09/2010S3 31/08/2010

16 16 To study Electronic Workbench Software.

S1 08/09/2010S2 17/09/2010S3 06/09/2010

17 17 To study FPGA Devices. S1 18/09/2010S2 18/09/2010S3 13/09/2010

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

(Signature of Teacher) (Head of Department)

Poona District Education Association’sA.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)

UnitNo.

Lecture No.

Portion to be covered Proposed Date

Actual Date of Coverage

Reference

1. 1. Number System& Logic Design Minimization techniqcs. Introduction. Binary, Hexadecimal numbers, Octal numbers and number conversion

9/7/2010

2 Signed Binary number representation. Signed Magnitude, 1’s complement and 2’s complement representation

12/7/2010

Teaching Plan

3 Binary, Hexadecimal Arithmetic. 2’s complement arithmetic.Algebra for logic circuits

14/7/2010

4 Codes : BCD, Excess-3, Gray code , Binary Code and their conversion

15/7/2010

5 Boolean algebra. Truth tables and Boolean algebra. Idealized logic gates and symbols.

16/7/2010

7 DeMorgan's rules Axiomatic definition of Boolean algebra

21/7/2010

8 Basic theorems and properties of Boolean algebra

22/7/2010

2. 1 Logic FamiliesTTL: Standard TTL characteristics- Speed, power dissipation, fan-in, fan-out, current and voltage parameters,

23/7/2010

2 noise margin, operating temperature etc. Operation of TTL NAND gate. TTL Configurations

26/7/2010

3 Active pull-up, Wired AND, totem pole, open collector.

28/7/2010

4 CMOS: CMOS Inverter, CMOS characteristics, CMOS configurations- Wired Logic, Open drain outputs.

29/7/2010

5 Interfacing: TTL to CMOS and CMOS to TTL

30/7/2010

6 Revision 2/8/20103. 1. Combinational Logic:Logic

minimization Representation of truth-table, SOP form, POS form, Simplification of logical functions

4/8/2010

2. Minimization of SOP and POS forms, Don’t care conditions.Reduction techniques: K-Maps (only up to 4 variables)

5/8/2010

3. Quine – McClusky techniqueArithmetic Operations: - Binary Addition, Subtraction, BCD Addition

6/8/2010

4. Circuits: - Half- Adder, Full Adder, Half Subtract or, Full Sub tractor,

9/8/2010

5. BCD adder using and subtract using 7483.

11/8/2010

6. look ahead and carry, parity generator and checker usingcomparator using 7485.

12/8/2010

7. Multiplexers (MUX) : Working of MUX, Implementation of expression

13/8/2010

using MUX (ICD74153, Demultiplexers 74151).

8. Demultiplexers (DEMUX):- Implementation of expression using DEMUX, Decoder. (IC 74138)

16/8/2010

4. 1. Sequential LogicIntroduction: Sequential Circuits. Difference between combinational circuits and sequential circuits

18/8/2010

2. Flip- flop : SR, JK, D, T; Preset & Clear, Master andSlave Flip Flops their truth tables and excitation tables

20/8/2010

3. Conversion from one type to another type of Flip Flop. Study of7473,7474,7476

23/8/2010

4. Application of Flip-flops. Bounce Elimination Switch, registers, counters

25/8/2010

5 Registers : Buffer register; shift register;7495

26/8/2010

6. Counters : Asynchronous counter. Synchronous counter, ring counters,

27/8/2010

7. BCDCounter, Johnson Counter, 30/8/20108. Modulus n counter(IC 7490, 74191),

Pseudo Random Binary Sequence Generator, Sequence generator and detector.

1/9/2010

5. 1. ASM & Programmable Logic Devices

Algorithmic State Machines,ASM charts, notations,

2/9/2010

2. design of simple controller, multiplexer controller method

3/9/2010

3. Examples.Sequence Generator, Types of Counter

6/9/2010

4. Programmable Logic Devices 8/9/20105. PLD: PLA- Input, Output Buffers,

AND, OR, Invert/ Non-Invert Matrix.

9/9/2010

6. PLD: PLA- Input, Output Buffers, AND, OR, Invert/ Non-Invert Matrix.

13/9/2010

7. Study of basic architecture of FPGA CPLD

15/9/2010

8. Revision. 16/9/20106. 1. VHDL and Introduction to

Microprocessors17/9/2010

Introduction to HDL, VHDL- Library, Entity, Architecture, Modeling Styles

2. Concurrent and Sequential Statements, Data Objects & Data Types, Attributes

20/9/2010

3. Design Examples. VHDL for Combinational Circuits-Adder, MUX

22/9/2010

4. VHDL for Sequential Circuits-Synchronous and Asynchronous Counter.

23/9/2010

5. Shift RegisterIntroduction to Microprocessor. Introduction of Ideal Microprocessor, Data Bus

24/9/2010

6. Address Bus, Control Bus, 8085 Programmers model as an example.

27/9/2010

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 Books1. John Yarbrough, “Digital Logic applications and Design” Thomson2. Flyod “Digital Principles”, Pearson Education3. Malvino, D.Leach “ Digital Principles and Applications”, 5th edition, Tat Mc-Graw Hill4. J.Bhaskar “VHDL Primer” 3rd Edition, Pearson Edition



Subject: Microprocessor & Microcontroller Subject Code: 310243

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

Unit Lecture No

Name of the Topic Proposed date


Reference

Teaching Plan

I

1 History of 80286,386,486,Pentium 2/7/10 1,22 Pentium pin

description ,features,Arch, 3/7/10

3 Pentium real mode 5/7/104 Functional description, real mode,

RISC features9/7/10

5 Instruction paring rules, branch prediction

10/7/10

6 Instruction & Data caches 12/7/10

7 Floating Point Unit, features & pipeline stages & data types.

12/7/10

II

8 Initialization & configuration,Bus operations-reset, Non pipelined & pipelined

16/7/10 1,2

9 Memory Org.& I/O org., data transfer mechanism,

17/7/10

10 8 bit,16 bit, 32 bit data bus interface

19/7/10

11 Pentium programming model,Register set,

23/7/10

12 Addressing modes, 24/7/1013 Data transfer ,Bus cycle 26/7/10

III

14 Protected mode, segmentation,Support registers, related instr., memory mgmt through seg.,

30/7/10 1,2

15 Logical to linear address translation, protection by seg

31/7/10

16 Privilege level-protection, related instruction

6/8/10

17 Inter privilege level, transfer of control, Paging support register

7/8/10

18 Support register, descriptors, Linear to physical address translation

9/8/10

19 Page level protection, virtual memory

13/8/10

20 Linear to Physical address translation ,TLB

14/8/10

IV

21 Multitasking, Interrupts, Exceptions,I/O support registers.

20/8/10 1,2

22 Related descriptors, task switching, I/O permission bitmapVirtual mode features,

21/8/10

23 Address generation, Privilege level instruction, registers available

23/8/10

24 Entering & leaving V86 8086 mode, I/O handling & I./O instruction .

27/8/10

25 Interrupt structure, real protection, virtual 86 mode,

28/8/10

26 Comparison of all 3 modes 30/8/10

V27 8051 Micro controller: family

architecture3/9/10 3,4,5

28 Programming Model Register set, register bank, SFRs

4/9/10

29 Addressing Modes , Instruction Set ,

13/9/10

30 External data memory, program memory,

17/9/10

31 Programming, serial port and programming, Features, design of min. system

20/9/10

32 Memory interfacing –external RAM/ROM interface

24/9/10

VI33 CPU timings, Interrupt structure 25/9/10 3,4,5

34 Timer & their programming 27/9/1035 Serial port & their programming 1/10/1036 Power Saving modes in 8051 4/10/1037 Introduction to 8096

Microcontroller8/10/10

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-32. Microprocessor & Microcontroller- U.S.Shah, Tech-Max pub.3. Deshmukh A, ”Microcontrollers – Theory and applications”, Tata McGraw Hill, 204, ISBN 0-07-058595-44. Mazidi , Gillipse, “The 8051 Microcontroller and embedded systems”, ISBN 81-7808-574-75.Ayala K. “The 8051 Microcontroller” ISBN 81-900828-4-1



Subject: : Microprocessor & Microcontroller Subject Code: 310243Subject Teacher: Prof .M.C.Hingane Acad. Year: 2010-11 (Semester –I)

Sr NO

Pr.No


Proposed Date


1 1WAP an ALP to simulate TYPE command using PSP

T1 03/07/2010T2 02/07/2010T3 06/07/2010T4 05/07/2010T1 10/07/2010


2 2 WAP an ALP to simulate COPY command using PSP

T2 09/07/2010T3 14/07/2010T4 12/07/2010

3 3WAP an ALP/in line code for displaying boot sector of floopy

T1 17/07/2010T2 16/07/2010T3 20/07/2010T4 19/07/2010

4 4WAP an ALP /in line code for displaying file content using root directory of hard disk

T1 24/07/2010T2 23/07/2010T3 28/07/2010T4 26/07/2010

5 5WAP an ALP/in line code for displaying FAT for floppy disk

T1 31/07/2010T2 30/07/2010T3 11/08/2010T4 28/07/2010

6 6Write a ‘C’ program for PC to PC communication

a) File Transferb) Full duplex character

transfer

T1 9/08/2010T2 6/08/2010T3 18/08/2010T4 09/08/2010

7 7WAP an ALP for Mouse device driver

T1 21/08/2010T2 13/08/2010T3 24/08/2010T4 11/08/2010

8 8WAP an ALP for DPMI T1 28/08/2010

T2 26/08/2010T3 25/08/2010T4 18/08/2010

9 9Study of Pentium Motherboard T1 4/09/2010

T2 03/09/2010T3 31/08/2010T4 23/08/2010

10 10WAP an ALP to implement multitasking using Pentium Programming

T1 13/09/2010T2 17/09/2010T3 01/09/2010T4 25/08/2010

11 11WAP an 8051 ALP for rate generation using Timer 0/Timer 1 by using

a) Polling Methodb) ISP method

T1 20/09/2010T2 24/09/2010T3 14/09/2010T4 30/08/2010

12 12WAP an 8051 ALP for Serial port Programming to transfer block of data using a)Polling Method b)ISP method

T1 27/09/2010T2 30/09/2010T3 22/09/2010T4 13/09/2010

13 13T1 4/10/2010T2 01/10/2010T3 29/09/2010

WAP an 8051 ALP to interface stepper motor for following operation

a) Full stepb) Half Stepc) Clock wise

d)Anticlockwise

T4 29/09/2010

14 14Write an installable DOS device driver for printer

T1 9/10/2010T2 08/10/2010T3 06/10/2010T4 04/10/2010

Prof.M.C.Hingane Prof R V Patil


Poona District Education Association’s

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


Subject Data Communication Subject Code: 310242

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

Teaching Plan

UnitLectNo

Name of the TopicProposed

Date

Actual Date of

Coverage References

I

1Introduction: communication,Modulation-Base band & Carrier Communication.

02-07-10 2,3

2Amplitude Modulation: DSBFC,DSBSC,SSB,QAM,carrier Acquisition, AM Receiver

06-07-10 2,4

3Angle Modulation: Frequency & Phase- FM analysis

07-07-10 2,4

4Bandwidth Req.- Equivalence between FM and PM

09-07-10 2,4

5Digital Continuous wave Modulation: ASK, FSK

13-07-10 1,2,3

6PSK and Modems & multiplexing technique

14-07-10 2,4,

II

7Pulse Modulation: Sampling Theorem, Natural & Flat top 16-07-10 2,3

8 PAM, Pulse Time Modulation 20-07-10 1,2,5

9Pulse Transmission over Band Limited Channel

21-07-10 2,5

10Effect of Gaussian Type NoiseOn Digital Transmission

23-07-10 2,4

11 Crosstalk, PCM, DPCM,ADPCM 27-07-10 2,312 Line Code: RZ, NRZ,Manchester,AMI 28-07-10

III

13Information & Coding: Shannon’s theorems on channel capacity 30-07-10 2,4

14Huffman Code, Code Efficiency, Error Control Coding , methods, types of error

06-08-10 2,5

15Types of errors, Methods of controlling errors

10-08-10 2,4

16Hamming: Distance, Bound, Codes, CRC Block code

11-08-10 2,3

17Types of codes, Linear Block Code, Error Detection & correction

13-08-10 1,2,5

18Syndrome calculation, Handshaking tech. , FEC, ARQ, Stop and wait, Go Back N, selective repeat

17-08-10 2,4

UnitLectNo

Name of the TopicProposed

Date

Actual Date of

Coverage References

IV19

Data Communication Techno & CN: PSTN, DSL technologies SONET

18-08-10 2, 4

20Wireless technologies in CN, Bluetooth, Cellular telephony

20-08-10 2,4

21 CN Application, Protocols & Standards 24-08-10 2,322 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

V

25 Physical Layer: Transmission Media 01-09-10 2,326 Wireless Transmission 03-09-10 2,427 Digital Hierarchy 14-09-10 2,528 Switching Techniques 15-09-10 2,429 Network hardware Components 17-09-10 2,330 Brides & Switches 21-09-10 2,4

VI

31Data Link Control: Data link layer design issues

22-09-10 2,3,4

32 Framing, Error Control 24-09-10 2,3

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

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


Subject: Digital Signal Processing (4H/W) Subject Code: 310244Subject Teacher: Prof. P M Agarkar Academic Year : 2010-11 (Sem I)

Unit LectureNo.

Name of the Topic ProposedDate

Actual Dateof

Coverage

References

U

I

1 Classification of Signals: 01/07/10 1,2,32 Analog, Discrete-time and Digital 02/07/10 1,2,33 Linear Time Invariant Systems 06/07/10 1,2,34 properties of LTI systems 07/07/10 1,2,35 Eigen functions for LTI systems 08/07/10 1,2,36 Sampling Theorem 09/07/10 1,2,37 reconstruction of a band limited Signal 13/07/10 1,2,38 quantization and encoding 14/07/10 1,2,3

II

9 Fourier Transform 15/07/10 1,2,310 Parseval’s theorem 16/07/10 1,2,311 windowing theorem 06/07/10 1,2,312 ROC and its properties 20/07/10 1,2,313 partial fraction 21/07/10 1,2,314 Linearity 22/07/10 1,2,315 multiplication by exponential sequence 23/07/10 1,2,316 solution of difference equation 27/07/10 1,2,3

III

17 Frequency Response of LTI Systems 28/07/10 1,2,318 group delay 29/07/10 1,2,319 Stability and causality 30/07/10 1,2,320 significance of poles/zeros 05/08/10 1,2,321 FR of a single zero or pole 06/08/10 1,2,322 systems with Linear phase 10/08/10 1,2,323 Generalized Linear phase systems 11/08/10 1,2,324 Four Types of GLPS 12/08/10 1,2,3

IV

25 Sampling the F.T 13/08/10 1,2,326 The Discrete Fourier Transform 17/08/10 1,2,327 Linearity 18/08/10 1,2,328 Symmetry 20/08/10 1,2,329 Linear Convolution using DFT 13/08/10 1,2,330 Goerzel Algorithm 24/08/10 1,2,331 DIT FFT 25/08/10 1,2,332 Inverse DFT using FFT 26/08/10 1,2,3

TEACHING PLAN

Unit LectureNo.

Name of the Topic ProposedDate

Actual DateofCoverage

References

V

33 Concept of filtering 27/08/10 1,2,334 Specifications 31/08/10 1,2,335 Characteristics of Butterworth 02/09/10 1,2,336 Design examples 03/09/10 1,2,337 properties of commonly used windows 14/09/10 1,2,338 Generalized Linear Phase 15/09/10 1,2,339 Design Examples 16/09/10 1,2,340 Comparison of IIR and FIR Filters 17/09/10 1,2,3

VI

41 Block diagrams and Signal flow 21/09/10 1,2,342 Basic structures for IIR System 22/09/10 1,2,343 cascade form, parallel form 23/09/10 1,2,344 Transposed Forms 24/09/10 1,2,345 Basic Structures for FIR Systems 28/09/10 1,2,346 cascade form 29/09/10 1,2,347 Finite Register Length effect 30/09/10 1,2,348 Instruction set of ADSP 21XX 01/10/10 1,2,3

Prof. P.M. Agarkar Prof. R.V.PatilDept. 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-8Reference Books:1. Babu R., "Digital Signal Processing", 2nd Edition, Scitech Publications, ISBN SI-873- 2852-52. Mitra S., "Digital Signal Processing: A Computer Based Approach", Tata McGraw-Hill, 1998, ISBN 0-07-044705-53. Vallavraj A., "Digital Signal Processing", ISBN 0-07-463996-X4. Manual - ADSP 21 XX family DSP5. White S., "Digital Signal Processing", Thomson Learning, ISBN -981 -240-620-4



Subject: Database Management Systems Subject Code: 310241

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

Unit Lect. No


Actual Coverage date

Ref.

I 1 Introduction to DBMS: Basic Concepts, advantages Of a DBMS over File-Processing System Data Abstraction, Database Languages, Data Models and Data Independence.

01/07/10 1,2,3,4

2 Components of a DBMS and overall Structure of DBMS, Multi-User DBMS Architecture, System Catalogs

05/07/10

3 Data Modeling: Basic Concepts , Entity, Attributes, Relationship, Constraints, Keys

06/07/10

4 ER and EER Dia: Components of ER model, Conventions converting ER diagram into tables, EER model components, converting EER dia into tables.

08/07/10

5 Relational Model: Basic concept , Attribute and Domains , Codd’s Rules

12/07/10

6 Relational Integrity: Nulls , Entity, Referential Integrity, Enterprise Constraints, Views , Schema Diagrams

13/07/10

II 7 Relational Algebra & SQL: Relational Query Languages: -Relational Algebra and Relational Calculus , Tuples Relational and Domain relational Calculus

15/07/10 1,2,3,4

8 Introduction to SQL: Characteristics and Advantages, SQL data types and literals , DDL , DML, SQL operators ,

19/07/10

9 Tables: Creating , Modifying, Deleting, Views: Creating Dropping ,Updation using Views, Indexes , Nulls

20/7/10

10 SQL DML Queries: Select Query and Clauses, Set Operations, Predicates, Joins, Set membership, tuple variables, Set Comparison , Ordering of Tuples

22/07/10

11 Aggregate Functions , Nested Queries Database Modification using SQL Insert, Update and Delete Queries

26/07/10

12 Concept Stored Procedure and Trigger, 27/07/10

13 Introduction to QBE and QUEL programmatic SQL: Embedded SQL ,

29/07/10

14 Dynamic SQL, ODBC. 05/08/10

III 15 Relational Database Design: Purpose of Normalization, Data Redundancy and Update Anomalies

09/08/10 1,2,3,4

16 Functional Dependencies:Basic concepts, closure of set of functional dependencies,

10/08/10

17 closure of attribute set, canonical cover 12/08/10

18 Decomposition: lossless join decomposition & dependency preservation

17/08/10

19 The Process of Normalization: 1NF, 2NF, 3NF, 23/08/10

Teaching Plan

20 BCNF, 4NF, 5NF 24/08/10

IV 21 File Systems & Query Processing File Organization, Organization of records in files, Indices

26/08/10 1,2,3,4

22 Static and Dynamic hashing 30/08/10

23 B trees and B+ trees. 31/08/10

24 Introduction to Query Processing: Overview, measures of query cost, selection and join operation.

02/09/10

25 Evaluation of expression, Introduction to the query optimization.

06/09/10

26 Estimation, Transformation of Relational expression. 13/09/10

V 27 Transaction Management :Basic concept of a Transaction, Properties of Transactions

14/09/10 1,2,3,4,5

28Concepts of Schedule, Serial Schedule, and Serilizability: Conflict and View, Cascade Aborts.

16/09/10

29Recoverable and Non-recoverable Schedule, Concurrency Control: Need, Locking Methods.

20/09/10

30 Deadlocks ,Timestamps methods, Optimistic Techniques, Multiversion Concurrency Controls.

21/09/10

31 Different Crash Recovery Methods such as Shadow paging.

23/09/10

32 Log based Recovery: Deferred and Immediate, Checkpoints.

27/09/10

VI 33 Object-Oriented Databases and Database Architectures: Need of OODBMS,Storing Objects in Relational Databases,Inro. To OO Data Models.

28/09/10 1,2,3,4,5

34Persistent Prog. Language, Pointer Swizzling Techniques

30/09/10

35 Database Architectures: Centralized and Client-Server Architectures, 2 Tier and 3 Tier Architecture

04/10/10

36Introduction to Distributed Database systems

05/10/10

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


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


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

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

Unit Lect. No


Actual coverage date

Ref.

I 1 Part I: Visual Programming LanguageConcept of Event Driven Programming, Visual basic 6.0 Integrated Development Environment

02/07/10 . 1,2,3

2 Visual Basic 6.0 Projects – Standard EXE, ActiveX EXE/DLL , ActiveX user Control,Visual Basic 6.0 – Data types, Control statements, loops,

03/07/10

3 Array & dynamic array handling, Subroutines & functions File Handling- sequential files, Binary files, random access files.

09/07/10

4 Visual Basic 6.0 - Text Box, Command, Label, Picture Box, Image Box, Graphics Control, ListBox, 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

10/07/10

5 Treeview Control, Progressbar, Tool bar, Status bar, Tab strips, Sliders, Horizontal scrollbar, Vertical scrollbar, Common Dialog Control, Message box, Input box,

16/07/10

6 Menu, Properties, Events & Methods, MDI forms,Control Array, ActiveX DLL, ActiveX user Control

17/07/10

II 7 Part II: RDBMS - SQL, PL/SQLIntroduction to SQL, Introduction to DDL, DML, DCL, TCL

23/07/10 1,2,3

8 Data types, Integrity constraints,SQL Operators, SQL SET Operators

24/07/10

9 SQL Functions -Character, Date, Null Values, Aggregate,Group By, Having Clause

30/7/10

10 Order By, Joins, Subquery, Multi table Inert & Merge, Case Expression.

31/07/10

Teaching Plan

11 Order By, Joins, Subquery, Multi table Inert & Merge, Case Expression.

13/08/10

12 DDL Statement : Create, Alter, Drop – Table, View, Index, sequence, and synonyms, User, RoleDML Statement: Insert, Select, update, Delete – Table, View,DCL Statement : Grant, RevokeTCL Statement : Commit, Rollback, Save PointIntroduction to PLSQL, PL/SQL Block, Data types, Control structure, Loops, Operators

14/08/10

13 Cursors : Implicit, Explicit, REF., Collection and Record ,Sub Program : Stored Functions & Stored Procedures, Package,Database Triggers : Row level & Statement level.Exception Handling : Built in Exception & User defined Exception

20/08/10

14 DDL Statement : Create, Alter, Drop – Table, View, Index, sequence, and synonyms, User, RoleDML Statement: Insert, Select, update, Delete – Table, View

21/08/10

15 DCL Statement : Grant, RevokeTCL Statement : Commit, Rollback, Save PointIntroduction to PLSQL, PL/SQL Block, Data types, Control structure, Loops, Operators

27/08/10

16 Cursors : Implicit, Explicit, REF., Collection and Record,Sub Program : Stored Functions & Stored Procedures, Package

28/08/10

17 Database Triggers : Row level & Statement level. 03/09/10

18 Exception Handling : Built in Exception & User defined Exception ,Embedded SQL and Dynamic SQL

04/09/10

III 19 Part III : Mini Project : Database Project Life Cycle

17/09/10 1,2,3

20 Database Analysis and DesignDesign Approach – Bottom Up, Top Down, inside – Out, Mixed strategy.Design Entity Relationship ModelRelational Model,Database NormalizationImplementation :Front End : Visual Basic 6.0Backend : Oracle/ MySQL / SQL ServerReport : Data Report,Database Programming : ODBC, OLEDB, ADO, RDOTesting : Form Validation

24/09/10

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


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 - 63) 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


Department of Computer EngineeringSubject : RDBMS AND VISUAL PROGRAMMING LABORATORY Subject Code: 310254Subject Teacher: Prof N.D.Sonawane Acad. Year: 2010-11 (Semester –I)

Sr No

Pr.No


Proposed Date


1 1 Design and Develop Scientific Calculator using control array

T1 07/07/10T2 05/07/10T3 05/07/10T4 06/07/10

2 2 Design and Develop Menu driven Text & Image editor

T1 08/07/10T2 07/07/10T3 09/07/10T4 10/07/10

3 3 Design and Develop an application which demonstrates the use of Drive box, Directory listbox, File List box and Tree view control

T1 14/07/10T2 12/07/10T3 12/07/10T4 13/07/10

4 4 Design and Develop a program for animation(traffic signal, bouncing ball, flying butterfly)

T1 15/07/10T2 14/07/10T3 16/07/10T4 17/07/10

5 5 Design and Develop features of Paint Brush application

T1 21/07/10T2 19/07/10T3 19/07/10T4 20/07/10

6 6 Design and Develop ActiveX user control (numeric text box, string manipulation function)

T1 22/07/10T2 21/07/10T3 23/07/10T4 24/07/10

7 7 Set Properties, Methods, Events, and demonstrate the use of ActiveX Control in Standard

T1 28/07/10T2 26/07/10T3 26/07/10T4 27/07/10

8 8 EXE project T1 29/07/10T2 28/07/10


T3 30/07/10T4 31/07/10

9 9 Design and Develop ActiveX DLL for linear search & binary search and demonstrate the use of ActiveX DLL in Standard EXE project

T1 05/08/10T2 09/08/10T3 06/08/10

T4 07/08/1010 10 10. Develop a program for

Sequential and Random Access file handling.

T1 11/08/10T2 11/08/10T3 09/08/10T4 10/08/10

11 11 Design student Information form using Visual Basic 6.0 and Implement validation for Text,Number, Email, Length, Upper Case, Lower Case, Date, Password, Character matching etc

T1 12/08/10

T2 17/08/10

T3 13/08/10

T4 14/08/10

12 12 Design and Develop SQL DDL statements which demonstrate the use of SQL objects suchas Table, View , Index, Sequence, Synonym

T1 18/08/10T2 23/08/10

T3 20/08/10T4 17/08/10

13 13 Design at least 10 SQL queries for suitable database application using SQL DMLstatements: Insert, Select, Update, Delete with operators, functions, set operators, Clauses.

T1 25/08/10T2 25/08/10T3 23/08/10T4 21/08/10

14 14 Design at least 10 SQL queries for suitable database application using SQL DMLstatements: all types of Join, Sub-Query and View.

T1 26/08/10T2 30/08/10T3 27/08/10T4 24/08/10

15 15 Write a PL/SQL block to calculate the grade of minimum 10 students.

T1 02/09/10T2 01/09/10T3 30/08/10T4 28/08/10

16 16 Write a PL/SQL block to implement all types of cursors.

T1 16/09/10T2 06/09/10T3 03/09/10T4 04/09/10

17 17 Write a PL/SQL stored procedure and function.

T1 22/09/10T2 13/09/10T3 06/09/10T4 14/09/10

18 18 Write a database Trigger (Row level and Statement level).

T1 29/09/10T2 15/09/10T3 13/09/10T4 21/09/10

19 19 Implement Embedded SQL queries using C/C++ as host language.

T1 30/09/10T2 20/09/10

T3 17/09/10T4 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 Press2. “ Mastering Visual Basic 6 ”, Envagelos Petroutsos, bpb Publication3. “ Visual Basic 6 Programming ”, Tata McgrawHill ,Content Development Group4. “ SQL and PL/SQL for Oracle 10g Black Book”, Dr. P.S.Deshpande, DreamTech5. “ SQL, PL/SQL: The Programming Language of Oracle”, Ivan Bayross, BPB Publication6. “ 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


Subject - Theory of Computer Science Subject

Teacher: Prof. Baltej Kaur

Teaching Plan

Subject Code : 310245 Acad.Year:2009-

10 (Semester-I)

Unit Lecture

No

Name of the Topic Proposed

date

Actual date

of coverage

Reference

I 1 Introduction to Finite Automata, Structural

Representations, Automata and Complexity,

Central Concepts to Automata Theory:

01/07/2010 1,2,3,4

2 Alphabets, Strings, Languages and Problems,

Finite Automata: An Informal Picture of FA,

02/07/2010

3 DFA: How a DFA processes Strings, Simpler

Notations for DFA, Extending the transition

function to strings, the language of DFA.

05/07/2010

4 Non-deterministic Finite Automaton (NFA): NFA,

Extended transition function, the language of an

NFA

08/07/2010

5 Equivalence of NFA and DFA, FA with e-

transitions

09/07/2010

6 Use of e-transitions, NFA with e, e-closures,

Extended transitions and languages for e-NFA

12/07/2010

7 Eliminating €-transitions-Con version of NFA with

e to NFA without e,

15/07/2010

8 Conversion of NFA without e to DFA, Conversion

of NFA with 6 to DFA (direcmethod),

16/07/2010

9 Moore and Mealy machines -Definition, models,

inter-conversion.

19/07/2010

II10 Regular Expression (RE) & languages :

Operator of RE, Building RE, Precedance of

OPR

22/07/2010 1,2,3

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 &

decision, equivalence & minimization

29/07/2010

14 Properties of Regular Languages: pumping lemma

for regular languages

30/07/2010

15 closure and decision properties of regular languages,

Equivalence and minimization of automata

05/08/2010

16 Application of RE: Regular expressions in Unix,

GREP utilities of Unix.

06/08/2010

17 Lexical Analysis & finding patterns in text 09/08/2010

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

19 Definition, derivations, languages of a grammar,

sentential form

13/08/2010

20 Parse Tree- inference, derivation and parse tree 20/08/2010

21 Inference to tree, Ambiguity in grammars and

languages: removal of ambiguity, inherent ambiguity

23/08/2010

22 Properties of CFL- Normal forms-Chomsky Normal

Form and Greibach Normal Form,

26/08/2010

23 Regular Grammar - definition, left linear and right

linear Regular Grammar, Regular Grammar and

Finite Automata,

27/08/2010

IV24 Push Down Automata(PDA) ;

Definition, Lang, of PDA, Equivalence of PDA

& CFG

30/08/2010 1,3,4

25 CFG to PDA, PDA to CFG 02/09/2010

26 Deterministic PDA - Regular lang & DPDA, DPDA &

CFL, DPDA & ambiguous grammer,

03/09/2010

27 NPDA, the pumping lemma for CFL, Closure &

Decision properties of CFL

13/09/2010

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

with FA

30/09/2010

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

enumerable

04/10/2010

37 An un-decidable problem that is RE, Post

Correspondence Problem,

07/10/2010

38 Intractable Problems* The classes P and NP 07/10/2010

39 Problems solvable in polynomial time, Non-deterministic

Polynomial time

08/10/2010

40 Polynomial time reduction and NP-complete

problems.

08/10/2010

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


Department of Computer EngineeringSubject : Computer Laboratory-l Subject Code: 410446Subject Teacher: Baltej Kaur Acad. Year: 2010-11 (Semester –I)

Sr No

Pr.No


Proposed Date


1 1 Assignment to understand basic syntax of LEX specifications, built-in functions and Variables

B1 02/07/1009/07/10

B3 03/07/1010/07/10

B2 05/07/1006/07/10

2 2 Implement a lexical analyzer for a subset of C using LEX Implementation

B2 12/07/1013/07/10

B1 15/07/10


should supportError handling,

16/07/10B3 14/07/10

17/07/103 3 Assignment to understand

basic syntax of YACC specifications, built-in functions and Variables

B2 19/07/1023/07/10

B3 21/07/1024/07/10

B1 22/07/10

4 4 Write an ambiguous CFG to recognize an infix expression and implement a parser that recognizes the infix expression using YACC. Provide the details of all conflicting entries in the parser table generated by LEX and YACC and how they have been resolved-Syntax

B2 26/07/1027/07/10

B3 28/07/1029/07/10

B1 30/07/10

5 5 Write an attributed translation grammar to 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.

B2 31/07/10B3 05/08/10

6 6 For a small subset of C with essential programming constructs, write a compiler using LEX and YACC. (To be carried out in a group of 4 to 6 students)

B1 31/07/10B1 05/08/10B3 05/08/10

7 7 Study of UNIX Commands B2 06/08/10B2 06/08/10B3 06/08/10

8 8 Shell Programming and AWK Programming with suitable application and use of advanced filters, AWK Report Generation.

B1 09/08/10B1 09/08/10B3 10/08/10

9 9 Using fork system call creates child process, suspend it using wait system call and transfer it into the zombie state.

B1 09/08/10B1 09/08/10B3 10/08/10

10 10 Client - Server communication using following IPC mechanism1. Unnamed pipe2. Named pipe3. Semaphore5. File management using low level file access system calls such as write, open, Seek, state6. Implement an Alarm clock application using signals7. Simultaneous execution of two threads8. Write & insert a module in Linux Kernel generator concept.

B2 09/08/10B2 10/08/10B3 11/08/10

11 11 Recursive and iterative (non recursive) algorithm for specific problem and their complexity measures (comparison expected)

B1 12/08/10

B1 13/08/10

B3 14/08/10

12 12 Quick Sort/ Merge Sort implementations using divide and conquer approach. Time complexity measure is to be obtained.

B2 17/08/10B3 18/08/10

B1 19/08/10

13 13 Minimal spanning Trees/ Job scheduling as an example of Greedy approach.

B1B3

20/08/1021/08/10

B2 23/08/10B2 24/08/10

14 14 Finding shortest path for multistage graph problem, (single source shortest path and all pairs shortest path.)

B3B1

25/08/1026/08/10

B1 27/08/10B3 28/08/10

15 15 OBST/Flow Shop Scheduling as an example of dynamic programming.

B2B3

30/08/1001/09/2010

B2 02/09/1006/09/10

B3 25/08/1028/08/1031/08/1001/09/10

16 16 0/1 knapsack's problem using Dynamic Programming, Backtracking

B1B1

02/09/1003/09/10

B3 04/09/10

and Branch & Bound Strategies.

B2 13/09/10B2B1

14/09/1016/09/10

B1B2

17/09/1020/09/10

17 17 8-Queen problem/ Graph coloring problem : general backtracking method and recursive back tracking method and their comparison for space and time complexity.

B2B3

21/09/1022/09/10

B1B1

23/09/1024/09/10

B3B2

25/09/1027/09/10

B2B3

28/09/1029/09/10

18 18 A complete LC branch and bound algorithm for job sequencing with dead lines problem. Use fixed tuple size formulation.

B1B1

30/09/1001/10/10

B2 04/10/1005/10/10

B3 06/10/1007/10/10

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

B3 09/10/10

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-32. W. Richard Stevens, "UNIX Network Programming", 2/e Volume 2, Prentice Hall India, ISBN: 81-203-2062-X3. Neil Matthew, Richard Stones, "Beginning Linux Programming", 3/e, WROX Publication, ISBN: 81-265-0484-64. 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-7Hill

Poona District Education Association'sA. G. Awate College of Engineering, Hadapsar Pune -28


Subject: Principles of Compiler Design

Subject Teacher: Prof. Baltej Kaur

Subject Code: 410444

Acad.Year:2009-10 (Semester-I)

Teaching Plan

Unit Lecture No



Reference

I 1 Introduction of Compiler : Translator issues, why to write compiler, Compilation process, Frond end & back end Model

02/07/2010 1,2,3

2 Cc tools, Interpreter & the related issue, cross compiler, bootstrapping, incremental compiler,

05/07/2010

3 byte code compiler Lexical Analysis : Review, alphabet, token, lexical error

06/07/2010

4 Block Schematic of L.A. 07/07/20105 Automatic construction of L.A. (LEX) 09/07/20106 LEX specification & features 12/07/2010

II 7 Syntax Analysis : Introduction : Role of parser

13/07/2010 1,5

8 Top down RD parser 14/07/20109 Predictive parser, LL(1) parser 16/07/201010 Bottom up Parsers- operator 19/07/201011 Shift Reduce Parser 20/07/201012 SLR Parser, LR(K) Parser 21/07/201013 LALR parser Using

ambiguous grammar23/07/2010

14 Error detection & Recovery 26/07/201015 Automatic construction of 27/07/201016 YACC specification 28/07/2010

III17 Syntax directed translation :

definition, Construction of trees30/07/2010 1,2,3,4,5

18 Bottom up Evaluation of S- attributed definition

06/08/2010

19 L- Attributed definitions 09/08/201020 Top down translation 10/08/201021 Bottom up evaluation of inherited

attri.11/08/2010

22 Intermediate Code Generation : Intermediate Lang, declarations

13/08/2010

23 Assignment statements, iterative stmt.

16/08/2010

24 Case statements, arrays , structures 17/08/2010

25 Conditional stmt, Boolean expressions back patching, procedure call

18/08/2010

26 Intermediate code generator using YACC

20/08/2010

IV 27 Run time storage organization : source Lang issues, Storage organization & allocation strategies

23/08/2010 1,3,4,5

28 Blocked structured & non blocked structured Lang. Activation record

24/08/2010

29 Variable length data, procedure parameters, nested procedures

25/08/2010

30 Access to non local names. Procedure call & return

27/08/2010

31 Static & dynamic scope symbols 30/08/2010

32 Table organization & management 01/09/2010

V 33 Code Generation :Introduction, issues in code generation,

03/09/2010 1,3,4,5

34Target machine description ,basic blocks & flow graphs

13/09/2010

35Next-use information, Register allocation & assignment

14/09/2010

36 Deg representation of basic blocks 17/09/2010

37 Peephole optimization 20/09/201038 Generating code from a DAG 21/09/201039 Dynamic Programming 22/09/2010

40 Code generator- generator concept 24/09/2010

VI 41 Code Optimization : Introduction, classification of optimization

27/09/2010 1,3.5

42 Principle source of optimization, optimization of basic blocks, loops in flow graph

28/09/2010

43 Optimizing transformations: compile time evaluation

29/09/2010

44 Common sub expression elimination, variable propagation, code movement, strength reduction

01/10/2010

45 Dead code elimination & loop optimization, local optimization

04/10/2010

46 DAG based local optimization, Global optimization: Control & data flow ana.

05/10/2010

47 Computing global data flow info : meet over paths, dataflow eq., data flow ana

06/10/2010

48 Iterative dataflow analysis, Available expressions, live range identification

08/10/2010

Prof Baltej Kaur Prof. R.V.Patil


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.


Department of Computer EngineeringSubject: Operating System Subject Code: 440442

Subject Teacher: Prof. P.B Sarkale

Acad.Year:2010-11 Semester I

Unit Lecture No Name of the Topic Proposed date


Reference

I

1 Process synchronization and inter-process communication

6/7/2010 1,2,4

2 Critical section problem and semaphores

9/7/2010

3 Classic problems of synchronization 13/7/20104 Critical regions, monitors, OS

synchronization.14/7/2010

II

5 Deadlock characterization, methods for handling deadlocks

16/7/2010 2,3,4

6 Deadlock Detection, Prevention, avoidance, recovery & protection.

20/7/2010

7 Domain of protection, Access matrix 21/7/20108 Implementation of access matrix,

Revocation of access rights security23/7/2010

9 Security problems, user authentication, program threats, system threats, security system

27/7/2010

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/201017 Kernel Data structures, System Admin 4/8/201018 Buffer Headers, Structure of Buffer

pool. 6/8/2010

19 Scenarios for retrieval of buffer 10/8/201020 Reading and writing Disk Blocks 11/8/201021 Adv. & Disadv. Of Buffer Cache 13/8/2010

IV 23 Internal representation of files Inodes, Dir

17/8/2010 2,3,4,5

24 Conversion of a path name to an Inode, Super Block

18/8/2010

25 Allocation of Disk Blocks, Other file types

24/8/2010

26 System Calls for the file system: open, read, write, file & Record Locking

25/8/2010

27 Iseek, close, File creation, Creation Of special files

27/8/2010

28 Change Directory & change Root 31/8/201029 Mounting & Unmounting file system,

link, unlink1/9/2010

Teaching Plan

V 31 Structures of processes, Process states & transitions

3/9/2010 2,4,5

32 Layout of System Memory, Context Of Process

7/9/2010

33 Manipulation of the process address space, sleep

8/9/2010

34 Process Creation,Signals, Process Termination

14/9/2010

35 Awaiting process termination 15/9/201037 The User ID of a process, Changing the

size of a process.17/9/2010

38 The shell, System boot & the init process, Process Scheduling and Time

21/9/2010

39 Process scheduling, System calls for time & clock

22/9/2010

VI

40 Memory Management Policies, Swapping

24/9/2010 1,2,3,4

41 Demand Paging, a hybrid system with swapping

28/9/2010

42 Demand Paging I/O Subsystem, Driver Interfaces

29/9/2010

43 Disk Drivers, Terminal Drivers, Streams.

1/10/2010

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-32. Silberschatz, Galvin, Gagnes , "Operating System Concepts" 6/e, John Wiley & Sons, ISBN-9971-51-388-9Reference Books:1. Dhamdhre D. M.,"Operating Systems - A Concept-Based Approach", Tata McGraw Hill Publications, 2nd '; -..; Edition-20062. Andrew S. Tanenbaum," Modern Operating Systems", 2/e, Prentice Hall India, ISBN-81-203-2063-83. 'Maurice J. Bach, "The design of the UNIX Operating System", Prentice Hall India, ISBN-81-203-0516-7


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

Subject : ADBMS(2008 Course) Subject Code: 410445Subject Teacher: Prof M.K.Memane Acad. Year: 2010-11 (Semester –I)

Sr No

Pr.No


Proposed Date


1 1 ORDBMS- Implement system using composite, multivalued attributes, inheritence

B1 21/07/2010B2 23/07/2010B3 20/07/2010B4 22/07/2010

2 2 Directory system- address book using LDAP

B1 11/08/2010B2 13/08/2010B3 10/08/2010B4 12/08/2010

3 3 Web based system using ASP B1 25/08/2010B2 27/08/2010B3 24/08/2010B4 26/08/2010

4 4 Building cubes and OLAP analysis B1 01/09/2010B2 03/09/2010B3 31/08/2010B4 02/09/2010

5 5 Data mining algorithms B1 15/09/2010B2 17/09/2010B3 14/09/2010B4 16/09/2010

6 6 Case Studya) MYSQLb) Oracle

B1 29/09/2010B2 01/10/2010B3 28/09/2010B4 30/09/2010

Prof M.K.Memane Prof R V Patil




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


Subject Design And Analysis of Algorithm Subject Code: 410441

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

Unit Lecture No

Name of the Topic Proposed Date

Actual Date of

Coverage

References

I

1 ‘O’,’’,’’ asymptotic notation, 02/07/10 2,3

2 Average, Best and worst analysis of algorithms for Time complexity.

05/07/10 1,2,3

3 Average, Best and worst analysis of algorithms Space complexity.

06/07/10 1,3

4 Amortize Analysis 07/07/10 1,2,35 Solving Recurrence Equations. 09/07/10 1,2,36 Proof Techniques: by

Contradiction12/07/10 1,2,3

7 Proof Techniques: by Mathematical Induction

13/07/10 1,2,3

8 Priority Queues: Heap and Heap Sort.

14/07/10 1,3

II

9 Divide and Conquer: General strategy, Exponentiation.

16/07/10 1,2,3

10 Binary Search, 19/07/10 1,2,311 Quick Sort 20/07/10 1,2,312 Merge Sort. 21/07/10 1,213 Greedy Method General Strategy 23/07/10 1,2,314 Knapsack problem 26/07/10 1,2,315 Job sequencing with Deadlines. 27/07/10 2,316 Optimal merge pattern 28/07/10 1,2,317 Minimal spanning trees &Dijkstra

Algorithm30/07/10 1,2

III

18 Dynamic Programming: General Strategy

06/08/10 1,2,3

19 0/1 knapsack 09/08/10 1,2,320 Multistage Graph 10/08/10 1,321 OBST 11/08/10 1,2,322 Traveling Salesperson Problem 13/08/1023 Traveling Salesperson Problem 17/08/1024 Flow shop Scheduling 18/08/10 1,2,3

Unit Lecture No

Name of the Topic Proposed Date

Actual Date of

Coverage

References

IV

25 Backtracking & Branch and Bound: General Strategy

20/08/10 1,2,3

26 8 Queens Problem 23/08/10 1,3

27 Graph Coloring 24/08/10 1,2,328 Hamiltonian Cycles 25/08/10 1,2,329 0/1 Knapsack 27/08/10 1,2,330 Branch & Bound General

Strategy30/08/10 1,2,3

31 0/1 Knapsack 31/08/1032 Traveling Salesperson Problem 01/09/10 1,2

V

33 Parallel Algorithm: 02/09/10 1,2,334 Computational Model 06/09/10 1,2,335 Basic Tech & Algorithm 13/09/10 1,2,336 Complete Binary Tree, Pointer 14/09/10 2,337 Doubling, Prefix computation 15/09/10 1,2,3

38 Selection, Merging 17/09/1039 Sorting Networks 20/09/1040 Parallel Sorting, Graph

Problems21/09/10 1,2,3

VI

41 NP –Hard And NP Complete Problems: Algorithm

22/09/10 1,2,3

42 Complexity Intractability 24/09/1043 Non-Deterministic polynomial

Time Decision Problem, Cooks Theorem.

27/09/10

44 NP Complete Problem: Satisfiability problem.

28/09/10

45 NP-Hard Problem: code generation Problem

29/09/10 1,2,3

46 Simplified NP Hard Problems. 01/10/10 1,2,3

Teaching Plan

Prof. B. S. Kankate Prof. R. V. Patil


Books References:

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

Documents

All Teaching Plan