Está en la página 1de 44

Poona District Education Association’s

A. G. Awate College of Engineering, Hadapsar Pune –28
Department of Computer Engineering
Subject: Data Structure & Algorithm Subject Code: 210244
Subject Teacher: Prof. S.M.Bhadkumbhe Acad.Year:2010-11 Semester I

Teaching Plan

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

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

32 Limitations of static memory 13/9/2010
Dynamic memory allocation in C.

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

39 Analysis of the algorithms used 23/9/2010
40 Stacks and Queues: stack as ADT 27/9/2010 1,2,3,4

Prof. S.M.Bhadkumbhe Prof. R.V.Patil
(Signature of Teacher) (Head of Department)

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

Reference Books(RB):

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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