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 1 2

Name of the Topic Arrays , Pointers: Arrays & Pointers Functions : Parameter passing by value , by reference Scope rules, pointers String manipulations Structure & Union Passing & returning Recursion , File Handling Introduction to Data Structures Data object, Data structure ADT Concept of Primitive and non primitive, linear and Non-linear static and dynamic persistent and ephemeral data structures Analysis of algorithm frequency count Time complexity & Space complexity of an algorithm Big ‘O’, ‘Ω ’ and ‘θ ’ notations, Best, Worst and Average case analysis Linear Data Structures using Sequential Organization Concept arrays as ADT, Row major and Column major Address calculation Multidimensional arrays, Concept of ordered list Applications Polynomial , Sparse Matrix Algorithms for sparse matrix operations addition, simple transpose, fast transpose & multiplication Sorting and searching techniques: Bubble sort, Selection sort, Insertion sort, Shell Radix sort, Quick sort and Merge sort Analysis of sorting technique best, worst and average case, Algorithms for Sequential search, Binary search, Fibonacci search Index Sequential search, analysis of each searching technique Linear Data Structures using Linked Organization: Limitations of static memory Dynamic memory allocation in C. Singly linked list, Doubly linked list, Circular linked list insertion, deletion, traversal & other operations Applications: polynomials using circular linked list Garbage collection and compaction Representation of polynomial using generalized linked list Concept of skip list. Analysis of the algorithms used Stacks and Queues: stack as ADT

Proposed date 1/7/2010 5/7/2010 6/7/2010 8/7/2010 12/7/2010 13/7/2010 14/7/2010 15/7/2010 19/7/2010 20/7/2010 21/7/2010 22/7/2010 26/7/2010 27/7/2010 28/7/2010 29/7/2010 5/8/2010 9/8/2010 10/8/2010 11/8/2010 12/8/2010 17/8/2010 23/8/2010 24/8/2010 25/8/2010 26/8/2010 30/8/2010 31/8/2010 01/9/2010 02/9/2010 06/9/2010 13/9/2010 14/9/2010 15/9/2010 16/9/2010 20/9/2010 21/9/2010 22/9/2010 23/9/2010 27/9/2010

Actual date of coverage

Reference 1,2,4

I

3 4 5 6 7 8 9 10 11

2,3,4

II

12 13 14

III

15 16 17 18 19 20 21 22

2,3,5

IV

23 24 25 26 27 28 29

2,3,4,5

V

30 31 32 33 34 35 36 37 38 39 40

2,4,5

1,2,3,4

Prof. S.M.Bhadkumbhe (Signature of Teacher)

Prof. R.V.Patil (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 Subject: Digital Electronics Lab Subject Teacher: Prof P.B. Sarkale
Department of Computer Engineering Subject Code: 210247

Acad. Year: 2010-11 (Semester –I)

Teaching Plan (Practical)
Sr No Pr. No Name of the Practical Batch Proposed Date Performance Date Remark

1

1

To study the TTL Characteristics.

2

2

To design and implement Code Conversions. To verify the functioning of Multiplexer. To verify the functioning of Demultiplexer. Design and implement of BCD Adder. To study Parity Generator & Detector. To study Flip-flops, registers and counters. To study 4-bit Multiplier.

3

3

4

4

5

5

6

6

7

7

8

8

9

9

10

11

To design & implement 3-bit up/down Ripple asynchronous counter. 10(a) To design a Sequence Generator for given sequence. (b) To design a Sequence Generator for given sequence. 11 To design 3-bit synchronous up/down counter.

S1 S2 S3 S1 S2 S3 S1 S2 S3 S1 S2 S3 S1 S2 S3 S1 S2 S3 S1 S2 S3 S1 S2 S3 S1 S2 S3 S1 S2 S3 S1 S2 S3

14/07/2010 16/07/2010 12/07/2010 17/07/2010 17/07/2010 13/07/2010 21/07/2010 23/07/2010 19/07/2010 24/07/2010 24/07/2010 20/07/2010 28/07/2010 30/07/2010 26/07/2010 31/07/2010 31/07/2010 27/07/2010 7/08/2010 7/08/2010 3/08/2010 11/08/2010 13/08/2010 9/08/2010 14/08/2010 14/08/2010 10/08/2010 18/08/2010 20/08/2010 16/08/2010 21/08/2010 21/08/2010 17/08/2010

13 13 14 14 S1 S2 S3 S1 S2 S3 S1 S2 S3 25/08/2010 27/08/2010 23/08/2010 28/08/2010 28/08/2010 24/08/2010 01/09/2010 03/09/2010 30/08/2010 15 15 To study PsPiece Software. To study FPGA Devices. V. Patil (Head of Department) . 16 16 To study Electronic Workbench Software.B. To study 4-bit Barrel shifter using Multiplexer.12 12 To design a Mod –N-Counter using IC 7490 To study Pseudo Random Binary Sequence Generator. 17 17 S1 S2 S3 S1 S2 S3 S1 S2 S3 04/09/2010 04/09/2010 31/08/2010 08/09/2010 17/09/2010 06/09/2010 18/09/2010 18/09/2010 13/09/2010 Prof P. Sarkale (Signature of Teacher) Prof R.

TTL Configurations Active pull-up.B Acad. Octal numbers and number conversion Signed Binary number representation.Algebra for logic circuits Codes : BCD. Portion to be covered Number System& Logic Design Minimization techniqcs. 1. 1. 2’s complement arithmetic.Awate College of Engineering. noise margin. fan-in. Hexadecimal Arithmetic. 1’s complement and 2’s complement representation Binary. Excess-3.Speed. Wired AND. operating temperature etc. open collector.Year : 2010-11 ( Sem-I) Teaching Plan Unit No. Subject Code: Proposed Actual Date of Coverage Date 9/7/2010 Reference 2 12/7/2010 3 4 5 7 8 2. Sarkale P. Idealized logic gates and symbols. power dissipation. Operation of TTL NAND gate.G. Introduction. Signed Magnitude. Truth tables and Boolean algebra. DeMorgan's rules Axiomatic definition of Boolean algebra Basic theorems and properties of Boolean algebra Logic FamiliesTTL: Standard TTL characteristics. Hadapsar Pune-28 Department of Computer Engineering Subject: Digital Electronics and Design Subject Teacher: Prof. Lecture No. Gray code . Binary Code and their conversion Boolean algebra. current and voltage parameters. totem pole. Binary.Poona District Education Association’s A. Hexadecimal numbers. 1 14/7/2010 15/7/2010 16/7/2010 21/7/2010 22/7/2010 23/7/2010 2 3 26/7/2010 28/7/2010 . fan-out.

Multiplexers (MUX) : Working of MUX.Reduction techniques: KMaps (only up to 4 variables) Quine – McClusky technique Arithmetic Operations: . 3. Open drain outputs. Simplification of logical functions Minimization of SOP and POS forms. 3.Half. 2. 3. T. CMOS characteristics. 1. Decoder. POS form. SOP form. JK. registers. Interfacing: TTL to CMOS and CMOS to TTL Revision Combinational Logic:Logic minimization Representation of truth-table. look ahead and carry. 4. 29/7/2010 30/7/2010 2/8/2010 4/8/2010 5/8/2010 6/8/2010 9/8/2010 11/8/2010 12/8/2010 13/8/2010 16/8/2010 18/8/2010 20/8/2010 23/8/2010 25/8/2010 26/8/2010 27/8/2010 . CMOS configurations.7474.Wired Logic. 5. CMOS: CMOS Inverter. Full Sub tractor. Implementation of expression using MUX (ICD74153. 5 6. Study of7473. Full Adder. Difference between combinational circuits and sequential circuits Flip. counters Registers : Buffer register.7476 Application of Flip-flops. Don’t care conditions. 2. parity generator and checker usingcomparator using 7485. BCD Addition Circuits: . 8. Bounce Elimination Switch.4 5 6 1. BCD adder using and subtract using 7483. Half Subtract or. 6. Preset & Clear.flop : SR. 4. 7. (IC 74138) Sequential Logic Introduction: Sequential Circuits. Demultiplexers (DEMUX):Implementation of expression using DEMUX. Demultiplexers 74151). Master andSlave Flip Flops their truth tables and excitation tables Conversion from one type to another type of Flip Flop.Adder.7495 Counters : Asynchronous counter. Subtraction. 4.Binary Addition. shift register. D.

Data Objects & Data Types. Output Buffers. 3/9/2010 6/9/2010 8/9/2010 9/9/2010 13/9/2010 15/9/2010 16/9/2010 17/9/2010 6.Input. design of simple controller. AND. 1.B (Signature of Teacher) . 6. 4. ASM & Programmable Logic Devices Algorithmic State Machines. 5. 27/9/2010 Prof. Modulus n counter(IC 7490. 20/9/2010 3. Types of Counter Programmable Logic Devices PLD: PLA.7. 7. Johnson Counter. VHDL and Introduction to Microprocessors Introduction to HDL. 4.Input. 2. Architecture. PLD: PLA. BCDCounter. 8085 Programmers model as an example.Sarkale P. OR. Control Bus. OR. Synchronous counter. AND. Data Bus Address Bus. MUX VHDL for Sequential CircuitsSynchronous and Asynchronous Counter. Entity.Sequence Generator. Sequence generator and detector. 74191). Modeling Styles Concurrent and Sequential Statements. V (Head Of Department) Prof. Patil R. Output Buffers. Invert/ Non-Invert Matrix. 8. Introduction of Ideal Microprocessor. Attributes Design Examples. Invert/ Non-Invert Matrix. 30/8/2010 1/9/2010 2/9/2010 2. 5. Study of basic architecture of FPGA CPLD Revision. 1.ASM charts. Pseudo Random Binary Sequence Generator. VHDLLibrary. 5. Shift Register Introduction to Microprocessor. 8. 22/9/2010 23/9/2010 24/9/2010 6. 3. multiplexer controller method Examples. ring counters. VHDL for Combinational Circuits-Adder. notations.

Arch.Year:2010-11 (Semester –I) Teaching Plan Unit Lecture No 1 2 I 3 4 5 6 7 8 9 II 10 Name of the Topic History of 80286. John Yarbrough.2 Initialization & configuration.M. “Digital Logic applications and Design” Thomson 2. Flyod “Digital Principles”. TB 2. ISBN 0 – 07 – 049492 – 4 2.C. TB 1. 32 bit data bus 19/7/10 interface .16 bit. Zvonko Vranesic “ Fundamentals of Digital Logic with VHDL Design” Mcgraw-Hill Reference Books 1.. “Modern Digital Electronics”. Proposed Actual date date of coverage 2/7/10 3/7/10 5/7/10 9/7/10 10/7/10 12/7/10 12/7/10 1. Pearson Education 3. branch prediction Instruction & Data caches Floating Point Unit. Pearson Edition Poona District Education Association’s A. Hadapsar Pune –28 Department of Computer Engineering Subject: Microprocessor & Microcontroller Subject Teacher: Prof. J. Pentium real mode Functional description. Awate College of Engineering. 3rd Edition. R.386. Tat Mc-Graw Hill 4.Leach “ Digital Principles and Applications”. G. 16/7/10 Bus operations-reset. Non pipelined & pipelined Memory Org. Stephen Brown.& I/O org. 5th edition. 2003. D.Text Books James Bignell.Hingane Subject Code: 310243 Acad.Pentium Pentium pin description . features & pipeline stages & data types.486.2 Reference 1. Robert Donavan “Digital Electronics” 5th edition CENEGAGE Learning ISBN 1. real mode.Bhaskar “VHDL Primer” 3rd Edition. RISC features Instruction paring rules. Malvino. 8 bit. Tata McGraw-Hill. data 17/7/10 transfer mechanism.features. Jain.

TLB Multitasking. Features. design of min. I/O permission bitmap Virtual mode features. Interrupts. Comparison of all 3 modes 8051 Micro controller: family architecture Programming Model Register set. Programming. transfer of control.11 12 13 14 III 15 16 17 18 19 Pentium programming model. task switching. memory mgmt through seg. program memory. Linear to physical address translation Page level protection. External data memory.2 20 21 22 IV 23 24 25 26 27 V 28 29 30 31 32 33 14/8/10 20/8/10 21/8/10 23/8/10 27/8/10 28/8/10 30/8/10 3/9/10 4/9/10 13/9/10 17/9/10 20/9/10 24/9/10 25/9/10 3. Support registers. Logical to linear address translation. virtual memory Linear to Physical address translation .4. virtual 86 mode./O instruction .Bus cycle Protected mode. Interrupt structure 23/7/10 24/7/10 26/7/10 30/7/10 31/7/10 6/8/10 7/8/10 9/8/10 13/8/10 1..5 1.I/O support registers. Related descriptors.. system Memory interfacing –external RAM/ROM interface CPU timings. Register set. Paging support register Support register. related instr. segmentation. Exceptions. Addressing modes. Address generation. serial port and programming.2 . Interrupt structure. registers available Entering & leaving V86 8086 mode.5 3.4. protection by seg Privilege level-protection. Instruction Set . real protection. Privilege level instruction. descriptors. I/O handling & I. related instruction Inter privilege level. SFRs Addressing Modes . register bank. Data transfer .

204. “ The Pentium Microprocessor”.Hingane (Signature of Teacher) Prof. ”Microcontrollers – Theory and applications”. Gillipse.Ayala K. 2004. ISBN 81-7808-574-7 5.M. “The 8051 Microcontroller and embedded systems”.U.R.S. ISBN 0-07058595-4 4.Shah.VI 34 35 36 37 38 Timer & their programming Serial port & their programming Power Saving modes in 8051 Introduction to 8096 Microcontroller Features & Architecture 27/9/10 1/10/10 4/10/10 8/10/10 9/10/10 Prof. Deshmukh A. Microprocessor & Microcontroller. Pearson education.V. Mazidi . 3.ISBN 81-7808-545-3 2. “The 8051 Microcontroller” ISBN 81-900828-4-1 .C.Patil (Head of Department) References: 1. Tata McGraw Hill. Tech-Max pub. Antonakos J.

Year: 2010-11 (Semester –I) Teaching Plan (Practical) Sr NO 1 Pr.Hingane Subject Code: 310243 Acad. No 1 Name of the Practical Proposed Date 03/07/2010 02/07/2010 06/07/2010 05/07/2010 10/07/2010 09/07/2010 14/07/2010 12/07/2010 17/07/2010 16/07/2010 20/07/2010 19/07/2010 24/07/2010 23/07/2010 28/07/2010 26/07/2010 31/07/2010 30/07/2010 11/08/2010 28/07/2010 9/08/2010 6/08/2010 18/08/2010 09/08/2010 Performance Date WAP an ALP to simulate TYPE command using PSP WAP an ALP to simulate COPY command using PSP WAP an ALP/in line code for displaying boot sector of floopy WAP an ALP /in line code for displaying file content using root directory of hard disk WAP an ALP/in line code for displaying FAT for floppy disk Write a ‘C’ program for PC to PC communication a) File Transfer b) Full duplex character transfer 2 2 3 3 4 4 5 5 6 6 Batch T1 T2 T3 T4 T1 T2 T3 T4 T1 T2 T3 T4 T1 T2 T3 T4 T1 T2 T3 T4 T1 T2 T3 T4 Remark . Hadapsar Pune –28 Department of Computer Engineering Subject: : Microprocessor & Microcontroller Subject Teacher: Prof .C. G.M.Poona District Education Association’s A. Awate College of Engineering.

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

2. Natural & Flat top PAM. Amplitude Modulation: DSBFC.28 Department of Computer Engineering Subject Data Communication Subject Teacher: Prof.4 1.Equivalence between FM and PM Digital Continuous wave Modulation: ASK..2.5 I 3 4 5 6 II 7 8 9 .4. AM Receiver Angle Modulation: Frequency & PhaseFM analysis Bandwidth Req. Rathod Subject Code: 310242 Acad.DSBSC.4 2.Poona District Education Association’s A. Awate College of Engineering.4 2. Hadapsar.3 1. FSK PSK and Modems & multiplexing technique Pulse Modulation: Sampling Theorem. 2.3 2. R. carrier Acquisition.5 2. B.QAM. Modulation-Base band & Carrier Communication. G. Year: 2010-11 (Semester –I) Teaching Plan Unit Lect No 1 2 Name of the Topic Introduction: communication. Pune. Pulse Time Modulation Pulse Transmission over Band Limited Channel Proposed Date 02-07-10 06-07-10 07-07-10 09-07-10 13-07-10 14-07-10 16-07-10 20-07-10 21-07-10 Actual Date of Coverage References 2.3 2.SSB.

DPCM. Error Control Coding .4 2.2. Handshaking tech. NRZ. selective repeat . Bound. Go Back N.3 2. Codes.4 errors Hamming: Distance.5 2. Methods of controlling 23-07-10 27-07-10 28-07-10 30-07-10 06-08-10 10-08-10 11-08-10 13-08-10 17-08-10 2.Manchester. Stop and wait. methods. CRC Block code Types of codes. Error Detection & correction Syndrome calculation. ARQ.ADPCM Line Code: RZ. PCM.10 11 12 13 14 15 III 16 17 18 Effect of Gaussian Type Noise On Digital Transmission Crosstalk.4 2.3 1.4 2. FEC. Linear Block Code.AMI Information & Coding: Shannon’s theorems on channel capacity Huffman Code. types of error Types of errors. .5 2. Code Efficiency.

Topologies Virtual LAN .5 2. Shanmugam K.2. B. MAC sub layer Channel allocation Multiple access protocol Virtual LAN’s VI 34 35 36 Prof. . DQDB.4 2.3.4 2. Rathod Prof.Unit Lect No 19 20 Name of the Topic Data Communication Techno & CN: Proposed Date 18-08-10 20-08-10 24-08-10 25-08-10 27-08-10 31-08-10 01-09-10 03-09-10 14-09-10 15-09-10 17-09-10 21-09-10 22-09-10 24-09-10 28-09-10 29-09-10 01-10-10 05-10-10 Actual Date of Coverage References 2.3 2.5 2.TCP Model LAN Standards. ATM Physical Layer: Transmission Media Wireless Transmission Digital Hierarchy Switching Techniques Network hardware Components Brides & Switches Data Link Control: Data link layer 21 22 23 24 25 26 27 28 29 30 31 32 33 V design issues Framing. “Communication Networks” .5 2.6 2. “Modern Digital and Analog Communication Systems” 2 Stallings W.3 2.4 2. Protocols & Standards OSI Model . Lathi B. “Digital and Analog Communication Systems” 6.3 2.3 IV PSTN. 5. Godbole A “Data Communication and Networks” 4 Gupta P “Data Communications”. 4 2.5 2. V. R.4 2. DSL technologies SONET Wireless technologies in CN. R. Bluetooth. Patil (Signature of Teacher) (Head of Department) Books for Reference: 1. “Data and Computer Communication” 3. Cellular telephony CN Application.3 1.4 2.5 2. Garcia L. Error Control HDLC.6 2. Ethernet.

.

3 1.2.2.Awate College of Engineering.2.2.3 1.2.2.T The Discrete Fourier Transform Linearity Symmetry Linear Convolution using DFT Goerzel Algorithm DIT FFT Inverse DFT using FFT Proposed Date 01/07/10 02/07/10 06/07/10 07/07/10 08/07/10 09/07/10 13/07/10 14/07/10 15/07/10 16/07/10 06/07/10 20/07/10 21/07/10 22/07/10 23/07/10 27/07/10 28/07/10 29/07/10 30/07/10 05/08/10 06/08/10 10/08/10 11/08/10 12/08/10 13/08/10 17/08/10 18/08/10 20/08/10 13/08/10 24/08/10 25/08/10 26/08/10 I II III IV Actual Date References of Coverage 1.2.2.Poona District Education Assoication’s A.3 1.2.2. P M Agarkar TEACHING PLAN Subject Code: 310244 Academic Year : 2010-11 (Sem I) Unit U Lecture No.2.3 1. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 Name of the Topic Classification of Signals: Analog.3 1.3 1.2.3 1.3 1.3 1.3 1.3 1.2.3 1.3 1.3 1.3 1.3 1.3 1.2.2.3 1.3 .3 1.3 1.3 1.2.2.2.3 1.3 1. Hadapsar .2.2.2.2.2. Pune Department of Computer Engineering Subject: Digital Signal Processing (4H/W) Subject Teacher: Prof.2.2.3 1.3 1.2.3 1.2.2.2.2.3 1.3 1.3 1.G.3 1.2.3 1.2. Discrete-time and Digital Linear Time Invariant Systems properties of LTI systems Eigen functions for LTI systems Sampling Theorem reconstruction of a band limited Signal quantization and encoding Fourier Transform Parseval’s theorem windowing theorem ROC and its properties partial fraction Linearity multiplication by exponential sequence solution of difference equation Frequency Response of LTI Systems group delay Stability and causality significance of poles/zeros FR of a single zero or pole systems with Linear phase Generalized Linear phase systems Four Types of GLPS Sampling the F.

33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 Name of the Topic Concept of filtering Specifications Characteristics of Butterworth Design examples properties of commonly used windows Generalized Linear Phase Design Examples Comparison of IIR and FIR Filters Block diagrams and Signal flow Basic structures for IIR System cascade form. Manual . White S.3 1...3 1.2852-5 2. parallel form Transposed Forms Basic Structures for FIR Systems cascade form Finite Register Length effect Instruction set of ADSP 21XX Proposed Date 27/08/10 31/08/10 02/09/10 03/09/10 14/09/10 15/09/10 16/09/10 17/09/10 21/09/10 22/09/10 23/09/10 24/09/10 28/09/10 29/09/10 30/09/10 01/10/10 V VI Actual Date References of Coverage 1. Buck J. Agarkar Dept.2. "Digital Signal Processing".2. Prentice Hall. 2nd Edition.2.D. Scitech Publications. Tata McGraw-Hill. ISBN 0-07-463996-X 4. Oppenheim A.2. "Discrete time signal processing".2. ISBN-81-7808-244-6. ISBN 0-07-044705-5 3. "Digital signal processing".Unit Lecture No.V.3 1. Schafer R.M. of Computer Engineering Text Books: 1. Manolakis D.. 2nd Edition. "Digital Signal Processing: A Computer Based Approach". Babu R. Prentice Hall.3 1. Proakis J...2. 1998. 2003. ISBN 81-2030720-8 Reference Books: 1.2. "Digital Signal Processing".2.Patil H.3 1.3 1.2.3 1. 3rd Edition.. R.3 1... "Digital Signal Processing".3 1. P.2.3 1.2.O. 2..2.3 1. Thomson Learning. ISBN -981 -240-620-4 . Vallavraj A.3 1. ISBN SI-873.2.3 1.2.3 1.ADSP 21 XX family DSP 5. Prof. Mitra S.2.3 1.3 Prof.2.

Year:2010-11 (Semester –I) Teaching Plan . Sonawane N. Subject Code: 310241 Acad. Awate College of Engineering.D. G.Poona District Education Association’s A. Hadapsar Pune –28 Department of Computer Engineering Subject: Database Management Systems Subject Teacher: Prof.

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

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

Hadapsar Pune –28 Department of Computer Engineering Subject: RDBMS AND VISUAL PROGRAMMING LABORATORY(T) Subject Code: 310246 Subject Teacher: Prof. “Database System Sesigns” 4.. Control Array. Timer. Acad. Tool bar. List Box. 3. File list box.sequential files. Image list box.Begg C. 5.0 – Data types. ActiveX user Control.. Horizontal scrollbar.Year:2010-11 (Semester –I) Teaching Plan Unit Lect. loops. Command.Visual Basic 6. ActiveX user Control 02/07/10 . Input box.2. Menu. (Head of Department) Poona District Education Association’s B. Message box. Connaly T. Check Box.. Directory list box. Drive box.Text Box. Properties. Sliders. Combo Box. Visual basic 6.. Tab strips. Option Box. MDI forms. Status bar. 2. Common Dialog Control. Picture Box. Image Box.0 Projects – Standard EXE. Binary files. Ramkrishna R. Sub routines & functions File Handling. Frame. ActiveX DLL. Control statements. Graphics Control. No Name of the Topic Proposed date Actual covera ge date Ref. Rich Text Box Treeview Control. Label. Silberschatz A. Date C. OLE Control. random access files. Events & Methods.” Database Management Systems”.D. 1.0 .(Signature of Teacher) References: 1. Korth. Vertical scrollbar. Database System concepts. Coronal. “Database Systems”. Awate College of Engineering. Progressbar.0 Integrated Development Environment Visual Basic 6. Array & dynamic array handling. Rab P. Image combo box. G. Visual Basic 6. “ An Introduction to Database System”. I 1 2 3 4 5 6 Part I: Visual Programming Language Concept of Event Driven Programming. ActiveX EXE/DLL . Sonawane N. 3 03/07/10 09/07/10 10/07/10 16/07/10 17/07/10 .

SQL. REF. and synonyms. Control structure. Aggregate. Loops. View DCL Statement : Grant. SQL SET Operators SQL Functions -Character.II 7 8 9 10 11 12 13 14 15 16 17 18 III 19 Part II: RDBMS .Sub Program : Stored Functions & Stored Procedures. 3 . Exception Handling : Built in Exception & User defined Exception . Date. Save Point Introduction to PLSQL. update.DCL Statement : Grant. Operators Cursors : Implicit. Case Expression. Having Clause Order By.. User. View. sequence. Role DML Statement: Insert. DDL Statement : Create. Joins. Null Values. Select. Explicit. Package Database Triggers : Row level & Statement level. Loops. View.SQL Operators.Database Triggers : Row level & Statement level. Collection and Record . Integrity constraints.Embedded SQL and Dynamic SQL Part III : Mini Project : Database Project Life Cycle 23/07/10 1. Subquery. PL/SQL Block. Data types. Alter.. Control structure. Collection and Record. DCL.2. update. and synonyms.Group By. Index. Order By. Drop – Table. sequence. View. User. TCL Data types. REF. Rollback. Save Point Introduction to PLSQL. Revoke TCL Statement : Commit. PL/SQL Introduction to SQL. 3 24/07/10 30/7/10 31/07/10 13/08/10 14/08/10 20/08/10 21/08/10 27/08/10 28/08/10 03/09/10 04/09/10 17/09/10 1.Exception Handling : Built in Exception & User defined Exception DDL Statement : Create. Multi table Inert & Merge. Rollback.2. Drop – Table. Subquery. Data types. Operators Cursors : Implicit. Alter. Multi table Inert & Merge. Delete – Table. Role DML Statement: Insert. DML.Sub Program : Stored Functions & Stored Procedures. Index. Case Expression. Introduction to DDL. Joins. Delete – Table. Revoke TCL Statement : Commit. Package. Explicit. Select. PL/SQL Block.

2001. "Databases: Design.V..0 Backend : Oracle/ MySQL / SQL Server Report : Data Report..D.07 . Tata McGraw-Hill Edition. Atwood T. Semaan E. ADO.. No Name of the Practical Batch Proposed Date Performance Date Remark 1 1 Design and Develop Scientific Calculator using control array 2 2 Design and Develop Menu driven Text & Image editor 3 3 Design and Develop an application which demonstrates the use of Drive box..Database Programming : ODBC.0 Poona District Education Association’s A. Hadapsar Pune –28 Department of Computer Engineering Subject : RDBMS AND VISUAL PROGRAMMING LABORATORY Subject Code: 310254 Subject Teacher: Prof N.. inside – Out. Mixed strategy. ISBN 0 -07 . 2004. File List box and Tree view control 4 4 Design and Develop a program for T1 T2 T3 T4 T1 T2 T3 T4 T1 T2 T3 T4 T1 07/07/10 05/07/10 05/07/10 06/07/10 08/07/10 07/07/10 09/07/10 10/07/10 14/07/10 12/07/10 12/07/10 13/07/10 15/07/10 . Hardman R.Sonawane Acad..D. 'Teach Yourself SQL in 21 Days".Design Entity Relationship Model Relational Model. RDO Testing : Form Validation Prof.20 24/09/10 Database Analysis and Design Design Approach – Bottom Up. R. Sonawane N. OLEDB. Tata McGraw-Hill.044534 . McLAUGHLIN M. (Signature of Teacher) Prof. Year: 2010-11 (Semester –I) Teaching Plan (Practical) Sr No Pr. Top Down. Techmedia. ISBN 0 . Awate College of Engineering. "PL/SQL Programming: Develop Database Driven PL/SQL Applications".059779 . Directory listbox.6 3) Urman S.Database Normalization Implementation :Front End : Visual Basic 6. Gennick J. Development and Deployment Using MS-ACCESS". ISBN 81-7635-014-1 2) Rob P. G..Patil (Head of Department) Reference Books: 1) Luers T..

Select. Password.animation(traffic signal. Lower Case. functions. Design at least 10 SQL queries for suitable database application using SQL DMLstatements: all types of Join. Index. Upper Case. and demonstrate the use of ActiveX Control in Standard EXE project 7 7 8 8 9 9 Design and Develop ActiveX DLL for linear search & binary search and demonstrate the use of ActiveX DLL in Standard EXE project 10 10 10. View . Sub-Query and View. Synonym Design at least 10 SQL queries for suitable database application using SQL DMLstatements: Insert. Design student Information form using Visual Basic 6. Sequence. 13 13 14 14 15 15 Write a PL/SQL block to calculate . Update. bouncing ball. Date. Develop a program for Sequential and Random Access file handling. Email.0 and Implement validation for Text. Delete with operators. Events. flying butterfly) 5 5 Design and Develop features of Paint Brush application 6 6 Design and Develop ActiveX user control (numeric text box. string manipulation function) Set Properties. Number. Character matching etc 11 11 T2 T3 T4 T1 T2 T3 T4 T1 T2 T3 T4 T1 T2 T3 T4 T1 T2 T3 T4 T1 T2 T3 T4 T1 T2 T3 T4 T1 T2 T3 T4 T1 T2 T3 T4 T1 T2 T3 T4 T1 T2 T3 T4 T1 14/07/10 16/07/10 17/07/10 21/07/10 19/07/10 19/07/10 20/07/10 22/07/10 21/07/10 23/07/10 24/07/10 28/07/10 26/07/10 26/07/10 27/07/10 29/07/10 28/07/10 30/07/10 31/07/10 05/08/10 09/08/10 06/08/10 07/08/10 11/08/10 11/08/10 09/08/10 10/08/10 12/08/10 17/08/10 13/08/10 14/08/10 18/08/10 23/08/10 20/08/10 17/08/10 25/08/10 25/08/10 23/08/10 21/08/10 26/08/10 30/08/10 27/08/10 24/08/10 02/09/10 12 12 Design and Develop SQL DDL statements which demonstrate the use of SQL objects suchas Table. Clauses. Length. set operators. Methods.

16 16 Write a PL/SQL block to implement all types of cursors.Sonawane (Signature of Teacher) Ref. BPB Publication 6. 19 19 Implement Embedded SQL queries using C/C++ as host language. “ Visual Basic 6 Programming ”. T2 T3 T4 T1 T2 T3 T4 T1 T2 T3 T4 T1 T2 T3 T4 T1 T2 T3 T4 01/09/10 30/08/10 28/08/10 16/09/10 06/09/10 03/09/10 04/09/10 22/09/10 13/09/10 06/09/10 14/09/10 29/09/10 15/09/10 13/09/10 21/09/10 30/09/10 20/09/10 17/09/10 25/09/10 Prof R. PL/SQL: The Programming Language of Oracle”.the grade of minimum 10 students. Ivan Bayross. Tata McgrawHill . “ Visual Basic 6 Programming . “ Mastering Visual Basic 6 ”. Dr.S.Year:200910 (Semester-I) Teaching Plan . Awate College of Engineering.Content Development Group 4. Baltej Kaur Subject Code : 310245 Acad. DreamTech 5. “ Oracle 9i/10g The Complete Reference”. Tata McGraw Hill Poona District Education Association's G. 17 17 Write a PL/SQL stored procedure and function.D. 18 18 Write a database Trigger (Row level and Statement level).Black Book”. “ SQL and PL/SQL for Oracle 10g Black Book”.Deshpande.Books: 1. P. DreamTeach Press 2. Kevin Loney. Patil (Head of Department) Prof N. V. Envagelos Petroutsos. “ SQL. Hadapsar Pune -28 Department of Computer Engineering Subject .Theory of Computer Science Subject Teacher: Prof. George Koch. bpb Publication 3.

Precedance of OPR Algebraic laws of RE. Central Concepts to Automata Theory: 01/07/2010 1. RE to DFA FA limitations. FA with etransitions Use of e-transitions. GREP utilities of Unix. Strings. NFA with e. Moore and Mealy machines -Definition. Closure & decision. Lexical Analysis & finding patterns in text Context Free Grammars (CFG) and Languages: Definition. the language of an NFA 08/07/2010 5 6 7 8 9 10 II 11 12 13 Equivalence of NFA and DFA. Languages and Problems. derivations.4 2 3 Alphabets. Simpler Notations for DFA.3. languages of a grammar. Equivalence and minimization of automata 05/08/2010 16 17 18 Ill 19 Application of RE: Regular expressions in Unix. 02/07/2010 05/07/2010 4 Non-deterministic Finite Automaton (NFA): NFA.3.2. Automata and Complexity.2. Finite Automata: An Informal Picture of FA. DFA: How a DFA processes Strings. Extended transitions and languages for e-NFA Eliminating €-transitions-Con version of NFA with e to NFA without e.3 23/07/2010 26/07/2010 29/07/2010 14 Properties of Regular Languages: pumping lemma for regular languages 30/07/2010 15 closure and decision properties of regular languages. e-closures. the language of DFA.2.Unit Lecture No Name of the Topic Proposed date Actual date of coverage Reference I 1 Introduction to Finite Automata. Regular Expression (RE) & languages : Operator of RE. Arden's Theorem FA & RE : DFA to RE . sentential form 06/08/2010 09/08/2010 12/08/2010 13/08/2010 1. Building RE.4 . properties of Regular lang. Conversion of NFA with 6 to DFA (direcmethod). inter-conversion. Extending the transition function to strings. equivalence & minimization 09/07/2010 12/07/2010 15/07/2010 16/07/2010 19/07/2010 22/07/2010 1. Structural Representations. models. Extended transition function. Conversion of NFA without e to DFA.

Non-deterministic linear Regular Grammar. Push Down Automata(PDA) .definition.3. derivation and parse tree Inference to tree. R. Ambiguity in Complexity: Introduction to Computational grammars and languages: removal of ambiguity.Regular lang & DPDA.4 Prof. of TM TM & halting problem. Equivalence of PDA & CFG 20/08/2010 23/08/2010 04/10/2010 04/10/2010 26/08/2010 07/10/2010 07/10/2010 27/08/2010 08/10/2010 08/10/2010 30/08/2010 1. 02/09/2010 03/09/2010 27 NPDA. DPDA & ambiguous grammer.inference. Closure & Decision properties of CFL 13/09/2010 28 Application of CFG : Parser. Patil (Signature of Teacher) (Signature of HOD ) .3. Regular Grammar and Polynomial time Finite Automata. programming Tech. of PDA. Correspondence Problem.4 25 26 CFG to PDA. the pumping lemma for CFL.V. Extension to basic TM Introduction to Post Machine. Post Form and Greibach Normal Form. Lang. lang. left linear and right Problems solvable in polynomial time. Polynomial time reduction and NP-complete problems. inherent ambiguity Un-decidability: A Language that is not recursively enumerable Properties of CFL. PDA to CFG Deterministic PDA .4 1.3. Post machine & TM 17/09/2010 20/09/2010 23/09/2010 24/09/2010 27/09/2010 30/09/2010 01/10/2010 1. Baltej Kaur Prof. Definition. Comparison with FA PDA.20 VI 21 35 36 22 37 38 23 39 40 24 IV Parse Tree. DPDA & CFL. Intractable Problems* The classes P and NP Regular Grammar .Normal forms-Chomsky Normal An un-decidable problem that is RE. Markup language 16/09/2010 29 V 30 31 32 32 33 34 XML & document type definition Turing Machine : Problems The TM notations.

Introduction to language & theory of Computation Theory of computer science . Awate College of Engineering.Mishra. G.K. Theory of Computation By Vivek Kulkarni Martin j. .K. No Name of the Practical Batch Proposed Date Performance Date Remark 1 1 Assignment to understand basic syntax of LEX specifications. Year: 2010-11 (Semester –I) Teaching Plan (Practical) Sr No Pr. 4.References: 1. Assignment to understand basic syntax of YACC B2 B1 B3 B2 3 3 02/07/10 09/07/10 03/07/10 10/07/10 05/07/10 06/07/10 12/07/10 13/07/10 15/07/10 16/07/10 14/07/10 17/07/10 19/07/10 23/07/10 . N. 2. Hadapsar Pune –28 Subject : Computer Laboratory-l Subject Teacher: Baltej Kaur Department of Computer Engineering Subject Code: 410446 Acad.A.Chandrasekaran Poona District Education Association’s A. Abhyankar Theory of computer science .LP. built-in functions and Variables B1 B3 B2 2 2 Implement a lexical analyzer for a subset of C using LEX Implementation should support Error handling. 3.

assignment. write a compiler using LEX and YACC. 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. Display all records stored in the symbol table. if.specifications. AWK Report Generation. Provide the details of all conflicting entries in the parser table generated by LEX and YACC and how they have been resolved-Syntax Write an attributed translation grammar to recognize declarations of simple variables. Write a code to store the identifiers from the input in a symbol table and also to record other relevant information about the identifiers. (To be carried out in a group of 4 to 6 students) Study of UNIX Commands B2 B3 B1 B2 B3 31/07/10 05/08/10 B1 B1 B3 31/07/10 05/08/10 05/08/10 9 9 Shell Programming and AWK Programming with suitable application and use of advanced filters. B2 B2 B3 B1 B1 B3 B1 B1 B3 06/08/10 06/08/10 06/08/10 09/08/10 09/08/10 10/08/10 09/08/10 09/08/10 10/08/10 . For a small subset of C with essential programming constructs. suspend it using wait system call and transfer it into the zombie state. "for". built-in functions and Variables B3 B1 21/07/10 24/07/10 22/07/10 26/07/10 27/07/10 28/07/10 29/07/10 30/07/10 4 4 5 5 6 6 7 8 7 8 Write an ambiguous CFG to recognize an infix expression and implement a parser that recognizes the infix expression using YACC. Using fork system call creates child process.

Unnamed pipe 2.Server communication using following IPC mechanism 1. Named pipe 3. Time complexity measure is to be obtained. Minimal spanning Trees/ Job scheduling as an example of Greedy approach. Write & insert a module in Linux Kernel generator concept. B1 B1 B3 B2 B2 B1 B1 . Semaphore 5. Implement an Alarm clock application using signals 7. state 6. Simultaneous execution of two threads 8. (single source shortest path and all pairs shortest path. open. File management using low level file access system calls such as write. Recursive and iterative (non recursive) algorithm for specific problem and their complexity measures (comparison expected) Quick Sort/ Merge Sort implementations using divide and conquer approach. Finding shortest path for multistage graph problem.10 10 11 11 12 12 13 13 Client . B2 B2 B3 09/08/10 10/08/10 11/08/10 B1 B1 B3 B2 B3 B1 B1 B3 B2 B2 B3 B1 B1 B3 B2 B3 B2 B3 12/08/10 13/08/10 14/08/10 17/08/10 18/08/10 19/08/10 20/08/10 21/08/10 23/08/10 24/08/10 25/08/10 26/08/10 27/08/10 28/08/10 30/08/10 01/09/2010 02/09/10 06/09/10 25/08/10 28/08/10 31/08/10 01/09/10 02/09/10 03/09/10 04/09/10 13/09/10 14/09/10 16/09/10 17/09/10 14 14 15 15 16 16 0/1 knapsack's problem using Dynamic Programming.) OBST/Flow Shop Scheduling as an example of dynamic programming. Seek. Backtracking and Branch & Bound Strategies.

"Understanding the Linux Kernel. "UNIX Network Programming". ISBN: 81-2032062-X 3. Kernighan. 5/e. Richard Stones. W. Richard Stevens. 2/e Volume 2. Rob Pike. 3/e. ISBN: 0-59600213-0 . Neil Matthew. ISBN: 81-2650484-6 4.Year:2009-10 (Semester-I) . Second Edition". Marco Cesati. Patil (Head of Department) Reference Books: 1. ISBN: 81203-0499-3 2.. "The UNIX Programming Environment" Prentice Hall India. Awate College of Engineering. Use fixed tuple size formulation. A complete LC branch and bound algorithm for job sequencing with dead lines problem.. Tata McGraw Hill.. Prentice Hall India.17 17 8-Queen problem/ Graph coloring problem : general backtracking method and recursive back tracking method and their comparison for space and time complexity. WROX Publication. Brian W. 18 18 B2 B2 B3 B1 B1 B3 B2 B2 B3 B1 B1 B2 B3 B3 20/09/10 21/09/10 22/09/10 23/09/10 24/09/10 25/09/10 27/09/10 28/09/10 29/09/10 30/09/10 01/10/10 04/10/10 05/10/10 06/10/10 07/10/10 09/10/10 19 19 Algorithm implementation for 'Traveling salesman' problem using (a) Dynamic programming approach. Baltej Kaur Subject Code: 410444 Acad. Prof Baltej Kaur (Signature of Teacher) Prof R. Richard L. Peterson. Hadapsar Pune -28 Department of Computer Engineering Subject: Principles of Compiler Design Subject Teacher: Prof. V. 5. Linux". 2/e. ISBN: 0-07-052489-7 Hill Poona District Education Association's G. (b) Branch & Bound approach. "The Complete Reference. Daniel P.*. "Beginning Linux Programming".. Bovet.

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

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

Pearson Education. ISBN 81. ISBN 81-8147-369-8. Chattopadhyay. l. K. 7758 . D.(Signature of Teacher) References (Head of Department) 1. R. T. S. . "Lex & Yacc". Sethi. MorganKaufinann Publishers. Levine. "Compiler Design". and Tools". 2000.K. ISBN 81-7366 -061-X. J. 5. 2003. Louden. ISBN 81-2032725-X. ISBN 981 243 . Cooper. 3. Mason. Brown. A V Aho. Techniques.694-4 4. Torczon.590 . J D Ullman. 2005. O'Reilly. Prentice-Hall of India. R. Thomson Brookes/Cole (ISE). "Engineering a Compiler". "Compilers: Principles. "Compiler Construction: Principles and Practice".8 2. L.

P.Poona District Education Association’s A. Hadapsar Pune –28 Subject: Operating System Department of Computer Engineering Subject Code: 440442 Subject Teacher: Prof.B Sarkale Acad. Awate College of Engineering.Year:2010-11 Semester I Teaching Plan . G.

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

ISBN-81-203-2063-8 3. Prentice Hall India. 5/e. ISBN-81-2030516-7 Poona District Education Association’s A. Awate College of Engineering. G. -. "The design of the UNIX Operating System".. No Name of the Practical Batch Proposed Date Performance Date Remark 1 1 ORDBMS.V. multivalued attributes. ISBN-9971-51388-9 Reference Books: 1. Tanenbaum. Tata McGraw Hill Publications. Year: 2010-11 (Semester –I) Teaching Plan (Practical) Sr No Pr.Memane Department of Computer Engineering ADBMS(2008 Course) Subject Code: 410445 Acad.address book using LDAP 2 2 3 3 Web based system using ASP B1 B2 B3 B4 B1 B2 B3 B4 B1 B2 B3 B4 21/07/2010 23/07/2010 20/07/2010 22/07/2010 11/08/2010 13/08/2010 10/08/2010 12/08/2010 25/08/2010 27/08/2010 24/08/2010 26/08/2010 . John Wiley & Sons." Modern Operating Systems"."Operating Systems . Galvin. William Stallings. "Operating System-Internals and Design Principles ". "Operating System Concepts" 6/e. B Sarkale (Signature of Teacher) Prof. P.Prof.. Bach.Patil (Head of Department) Text Books: 1. Dhamdhre D.A Concept-Based Approach". Edition-2006 2.Implement system using composite.. Prentice Hall India. inheritence Directory system. 2/e. Andrew S. Hadapsar Pune –28 Subject : Subject Teacher: Prof M. Gagnes . Silberschatz. Prentice Hall India. M. R. 'Maurice J.K. 2nd '. ISBN81-297-01094-3 2.

Memane (Signature of Teacher) Prof R V Patil (Head of Department) Poona District Education Association’s A. G. Hadapsar Pune –28 Department of Computer Engineering Subject Design And Analysis of Algorithm Subject Teacher: Prof.’θ ’ asymptotic notation.3 1. S. Proposed Date 02/07/10 05/07/10 06/07/10 Actual Date of Coverage References 2.K. Awate College of Engineering.3 . Best and worst analysis of algorithms Space complexity. Year: 2010-11 (Semester –I) Teaching Plan Unit I Lecture No 1 2 3 Name of the Topic ‘O’.’Ω ’.2. Average. Best and worst analysis of algorithms for Time complexity. B.3 1.4 4 Building cubes and OLAP analysis 5 5 Data mining algorithms 6 6 Case Study a) MYSQL b) Oracle B1 B2 B3 B4 B1 B2 B3 B4 B1 B2 B3 B4 01/09/2010 03/09/2010 31/08/2010 02/09/2010 15/09/2010 17/09/2010 14/09/2010 16/09/2010 29/09/2010 01/10/2010 28/09/2010 30/09/2010 Prof M. Average. Kankate Subject Code: 410441 Acad.

Optimal merge pattern Minimal spanning trees &Dijkstra Algorithm Dynamic Programming: General Strategy 0/1 knapsack Multistage Graph OBST Traveling Salesperson Problem Traveling Salesperson Problem Flow shop Scheduling 07/07/10 09/07/10 12/07/10 13/07/10 14/07/10 16/07/10 19/07/10 20/07/10 21/07/10 23/07/10 26/07/10 27/07/10 28/07/10 30/07/10 06/08/10 09/08/10 10/08/10 11/08/10 13/08/10 17/08/10 18/08/10 1.2 1. Proof Techniques: by Contradiction Proof Techniques: by Mathematical Induction Priority Queues: Heap and Heap Sort.2.2.3 1.3 2.3 1. Quick Sort Merge Sort.3 1.2.2.2.3 1.3 1.2.3 1.2.3 1. Exponentiation.3 1. Divide and Conquer: General strategy. Greedy Method General Strategy Knapsack problem Job sequencing with Deadlines.2.3 1.3 1.2 1.3 1. Binary Search.3 .2.3 1.2.4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 II III Amortize Analysis Solving Recurrence Equations.3 1.2.2.2.3 1.2.3 1.

2.3 1. Merging Sorting Networks Parallel Sorting. Prefix computation Selection.2.2.2.3 1.3 1.3 IV 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 V VI 44 45 46 1.2.3 1.2.2 1.3 1. NP-Hard Problem: code generation Problem Simplified NP Hard Problems. Pointer Doubling. Graph Problems NP –Hard And NP Complete Problems: Algorithm Complexity Intractability Non-Deterministic polynomial Time Decision Problem.2.2.3 1.3 1.3 1.2.3 . NP Complete Problem: Satisfiability problem.3 1.Unit Lecture No 25 26 Name of the Topic Backtracking & Branch and Bound: General Strategy 8 Queens Problem Graph Coloring Hamiltonian Cycles 0/1 Knapsack Branch & Bound General Strategy 0/1 Knapsack Traveling Salesperson Problem Parallel Algorithm: Computational Model Basic Tech & Algorithm Complete Binary Tree.2.3 1.3 1.2.3 2. Cooks Theorem.2.3 1. Proposed Date 20/08/10 23/08/10 24/08/10 25/08/10 27/08/10 30/08/10 31/08/10 01/09/10 02/09/10 06/09/10 13/09/10 14/09/10 15/09/10 17/09/10 20/09/10 21/09/10 22/09/10 24/09/10 27/09/10 28/09/10 29/09/10 01/10/10 Actual Date of Coverage References 1.2.

V. 2. S. 3. Prof. ” Introduction To Algorithm” . Patil (Head of Department) Bressard: “Fundamental of Algorithm” Horowitz and Sahani:”Funadamental of Computer Algorithm” Thomas H Cormen and Carlos. R.Prof. B. Kankate (Signature of Teacher) Books References: 1.

Sign up to vote on this title
UsefulNot useful