JSPMs Rajarshi Shahu College of Engineering

Department of Information Technology SESSION PLAN SEM-I / 2012-13

Department: IT Name of Staff: Prof. Anuja R. Zade No. of Lects. Planned: 46 Theory: 100 Marks Class: T.E Name of Subject: OS

Lecture No.

Topics to be Covered

Planned Date

Actual Date

Book/ Website Referred

Teachingaid Used

Unit 1 Introduction 1. 2. O.S. Shell, Linux Shell Commands Shell Programming, Variables Ifelse, while do..done, case..esac Assignment 1(C ) part Grep command For loop special parameters Assignment 1 B part Database Assignment File Operation Assignment 1 (A) part Edit Delete Modify a particular record AWK programming AWK variables AWK with all options Architecture of OS(Ex Monolithic Micro Kernal, Layered etc) Operating system objectives and functions Virtual Computers, Interactions of OS & hardware architecture Evolution of Batch Multiprogramming Operating System ,Multitasking Multi-user, Parallel,calls Linux, Ms- time System Distributed Real OS Windows, Handheld OS 21/06/12 22/06/12

3. 4. 5.

26/06/12 27/06/12 28/06/12

6.

03/07/12

7.

04/07/12

8. 9. 10.

05/07/12 10/07/12 11/07/12

Unit II Process Management

11.

Process Concept, Process states, Process description, Process control

12/07/12

12. 13.

Assignment
Uniprocessor Scheduling: Types of scheduling: Preemptive, No preemptive, Scheduling Algorithms: FCFS, SJFS, RR, Priority

17/07/12 18/07/12

14. 15. 16. 17.

19/07/12 24/07/12 25/07/12 26/07/12

Practice Example Assignment & Examples

Unix Multilevel Feedback Queue Scheduling Multiprocessor Scheduling: Thread Scheduling, Real Time Scheduling:

18.

Threads Process and Threads Unit III Process Communication and Synchronization

31/07/12

19. . Concurrency: Principles of 20. 21. 22. 23. 24. 25. 26. 27.
Concurrency, Mutual Exclusion H/w Support Software approaches, Semaphores and Mutex Message Passing, Monitors, Classical Problems Of Synchronization: Readers-Writers Problem, P Producer Consumer Problem Dining Philosopher problem, Deadlock: Principles of deadlock, Deadlock Prevention, Deadlock Avoidance, Deadlock Detection, An Integrated Deadlock Strategies

01/08/12 02/8/12 08/08/12 09/08/12 14/08/12 16/08/12 17/08/12 21/08/12 22/08/12

Example Example on Bankers Algorithm Unit IV Memory Management

28.

29.

Memory Management requirements, Memory partitioning: Fixed and DynamicPartitioning Buddy System Memory Allocation: Allocation Strategies (First Fit, Best Fit, Worst Fit,Next Fit)

23/08/12

28/08/12

30.

Example

29/08/12

31. 32.

Fragmentation, Swapping Segmentation

30/08/12 4/09/12

33. 34. 35. 36.

Paging Virtual Memory, Demand paging, Page Replacement Policies FIFO, LRU, Optimal, clock , Examle Thrashing, Working Set Model

5/09/12 06/09/12
11/09/12

12/09/12

37.

38.

39.

40.

Unit V I/O and File Management I/O management & Disk scheduling: I/O Devices, Organization of I/O functions, Operating System Design issues, I/O Buffering, Disk Scheduling (FCFS, SCAN, CSCAN, SSTF), RAID, Disk Caches File Management: Overview, File Organization and access, File Security issues. Record Blocking, Secondary Storage Management, Comparative study of Windows and UNIX file system. Unit VI Protection and Security Computer security & protection: Security Threats, Attacks and assests, Intruders, Malicious software, Protection

13/09/12

18/09/12

19/09/12

20/09/12

41. 42. 43.

25/09/12 26/09/12 27/09/12

44. 45.

46.

Protection Policy and mechanisms Authentications: Internal Access Authorizations, Implementations University Question paper discussion

02/10/12 03/10/12

04/10/12

References : Text Books T1: Stalling William, "Operating Systems 6th Edition, Pearson Education, ISBN 978-81317- 2528-3 T2: Das Sumitabha," Unix Concepts and Applications", 3rd Edition, Tata McGraw Hill, 2003, ISBN 0-07-053475-6. Reference Books: R1: Milan Milenkovic "Operating Systems Concepts and Design ", ISBN 9780074632727, TMGH. R2: Silbcrschatz A.Galvin P., Gagne G.,"Operating System Concepts 8e",John Wiley and Sons,2003,ISBN 9812-53-055-X. R3: Andrew S. Tanenbaum , Modern Operating Systems, 3/E, ISBN-13: 9780136006633, PHI R4:M. J. Bach, The Design of The Unix Operating System, ISBN: 978-81-203-0516-8, PHI. R5: Charles Crowley, Operating Systems: A Design-oriented Approach ISBN: 0074635514 TMH. Teaching Aids and Methods Used:
C - Chalk and Talk L LCD Presentation G - Guest Lectures V- Video Lectures O- OHP Presentation

Subject Incharge Prof.A. R. Zade

HOD IT Prof. S. V. Kedar

Date of Commencement: 21/06/2012

Date of Conclusion: 11/10/ 2012

JSPMS RAJARSHI SHAHU COLLEGE OF ENGINEERING

Tathawade, Pune - 33.

Teaching Plan, Semester I (2012-13) Department: IT Name of Staff: Prof. Seema V. Kedar No. of Lects. Planned: 49
Lect. Topic(s) to be covered No. Unit 1 : Introduction 1. Basic concepts , Purpose of DBMS, Applications of DBMS. 2. Advantages and Disadvantages of DBMS, Comparison between DBMS and File processing system, Instances and schema, Data Independence. 3. Data abstraction, Data Models, Database Languages. 4. Components of a DBMS and overall structure of a DBMS, Multi-User DBMS Architecture, System Catalogs 5. Introduction to VB Basic Concepts, entity, attributes, relationships, constraints, keys, 7. E-R and EER diagrams: Components of E-R Model Conventions , converting ER diagram into tables, EER Model components 8. Converting EER diagram into tables. 9. Designing Calculator using VB 10. Relational Model: Basic concepts, Attributes and 6. Planned Date

Class: T.E Name of Subject: DBMS & ISL

Actual Date

Book/ TeachingWebsite aid Used Referred

21/06/2012

25/06/2012

26/06/2012

28/06/2012

29/06/2012 02/07/2012

03/07/2012

05/07/2012 06/07/2012 09/07/2012

Domains, Codd's Rules 11. Relational Integrity: Domain, Entity, Referential Integrities, Enterprise Constraints, Views, Schema diagram Unit 2: Introduction to SQL 12. Characteristics and advantages, SQL Data Types and Literals 13. DDL, DML, SQL Operators, Tables: Creating, Modifying, Deleting 14. Views: Creating, Dropping, Updation using Views, Indexes, Nulls 15. SQL DML Queries: SELECT Query and clauses, Set Operations 16. Predicates and Joins, Set membership, Tuple Variables, Set comparison, Ordering of Tuples 17. Aggregate functions, Nested Queries, Database Modification using SQL 18. Insert, Update and Delete Queries, concept of Stored Procedures 19. Cursors 20. Triggers, assertions 21. DDL/DML Practical Assignment Discussion 22. Roles and privileges Programmatic SQL: Embedded SQL, Dynamic SQL. Unit 3: Relational Database Design 23. Purpose of Normalization, Data Redundancy and Update Anomalies 24. Functional Dependencies: Basic concepts, closure of set of functional dependencies 25. PL/SQL Practical assignments Discussion 26. closure of attribute set, canonical cover

10/07/2012

12/07/2012

13/07/2012

16/07/2012

17/07/2012

19/07/2012

20/07/2012

23/07/2012

24/07/2012 26/07/2012 27/07/2012 30/07/2012

31/07/2012

02/08/2012

03/08/2012 06/08/2012

27. Decomposition: lossless join decomposition and dependency preservation 28. The Process of Normalization: 1NF, 2NF 29. Miniproject on RDBMS and Front End development Discussion 30. 3NF, BCNF 31. 4NF, 5NF Unit 4: File Systems 32. File Organization, Organization of records in files 33. Indices, Static and Dynamic Hashing 34. B-trees and B+ Trees 35. Introduction to Query Processing: Overview, Measures of query cost 36. 37. Selection and join operations, Evaluation of Expressions 38. Introduction to Query Optimization, Estimation, Transformation of Relational Expressions Unit 5: Transaction Management: 39. Basic concept of a Transaction , Properties of Transactions 40. Concept of Schedule, Serial Schedule, Serializability: Conflict and View 41. Cascaded Aborts, Recoverable and Nonrecoverable Schedules 42. Concurrency Control: Need, Locking Methods, Deadlocks 43. Timestamping Methods, Optimistic Techniques 44. Multi-Version Concurrency Control 45. Different Crash Recovery methods such as ShadowPaging and Log-Based Recovery: Deferred and

07/08/2012

09/08/2012 10/08/2012

13/08/2012 14/08/2012

16/08/2012

20/08/2012 21/08/2012 23/08/2012

24/08/2012 27/08/2012

28/08/2012

30/08/2012

31/08/2012

03/09/2012

04/09/2012

06/09/2012 07/09/2012 10/09/2012

Immediate, Checkpoints Unit 6 : Object-oriented Databases and Database Architectures 46. Need of OODBMS , 11/09/2012 Storing Objects in Relational Database 47. Introduction to OO Data 13/09/2012 Models, Persistent Programming Languages, Pointer Swizzling Techniques 48. Database Architectures: 14/09/2012 Centralized and ClientServer Architectures , 2 Tier and 3 Tier Architecture, Introduction to Distributed Database systems 49. Introduction to data 15/09/2012 warehousing and its components, Introduction to data mining using association rules,

Text Books: T1. Silberschatz A., Korth H., Sudarshan S., "Database System Concepts", 4th Edition, McGraw Hill Publishers, 2002, ISBN 0-07-120413-X T2. Elmasri R., Navathe S., "Fundamentals of Database Systems", 4th Edition, Pearson Education, 2003, ISBN 8129702282

Reference Books: R1. Rab P. Coronel C. "Database Systems Design, Implementation and Management", 5th Edition, Thomson Course Technology, 2002, ISBN 981-243-135-7. R2. Connally T., Begg C., "Database Systems", 3rd Edition, Pearson Education, 2002, ISBN 81-7808-861-4. R3. Date C., "An Introduction to Database Systems", 7th Edition, Pearson Education, 2002, ISBN 81 -7808-231- 4. R4. Ramkrishna R., Gehrke J., "Database Management Systems", 3rd Edition, McGrawHill, 2003, ISBN 0-07- 123151 X. R5. Atul Kahate, Introduction to Database Management System, 3rd Edition, Pearson Education 2009, ISBN 978-81-317-0078-5.

Teaching-aid to be used: C: Chalk and Talk L: LCD PPT Presentation G: Guest Lectures O: OHP V: Video Lectures

HOD Signature

Faculty Signature

Date of Commencement: 21/06/2012 11/10/2012

Date of Conclusion:

JSPMS RAJARSHI SHAHU COLLEGE OF ENGINEERING

Tathawade, Pune -33.

Teaching Plan, Semester I (2012-13) Department : IT Name of Staff : Prof. V. V. Dakhode. No. of Lects. Planned: 50
Sr. No. Topic Name Planned Date

Class Name of Subject

: T.E. : TOC

Actual Date

Book/ Website Referred

Teachingaid Used

I 1.

Basic Concept: Symbol/alphabets, string/word, language, formal language, natural and formal Language Basic Machine, Finite State machine: state tables, transition graph, acceptance And rejection. Regular Expressions: Formal definition. Recursive definition of regular expression. Regular set, identities of regular expressions. Languages associated With regular expression. Kleene closure 04/07/12 21/06/12

2.

25/06/12

3. 4. 5. 6. 7.

26/06/12 27/06/12 02/07/12 03/07/12

II 8.

Finite automata(FA): Definition of FA, representation (tabular form of state transition function and machine transition function, transition graphs, and adjancy matrix) finite control of FA over string

09/07/12

9.

10/07/12

10.

language acceptance by FA.deterministic finite automaton(DFA) non-deterministic finite automaton(NFA) concept of moves, NFA with e moves, NFA without e moves,

11/07/12

11.

16/07/12

12.

17/07/12

13. 14. 15.

18/07/12 removal of e moves, 23/07/12 conversion of NFA without e moves to DFA conversion of NFA with e moves to DFA FA with output: Moore and mealey machines-definition, Moore and mealey machinesmodels, inter conversion Contexts Free Grammars and languages Phrase structure grammar, 13/08/12 21. context free grammar, context free languages(CFL), Production rules, formalization, derivation and derivation trees. Ambiguous grammar, removal of ambiguity and inherent ambiguity, 24/07/12

16.

25/07/12

17.

01/08/12

18.

02/08/12

19.

03/08/12

III 20.

14/08/12

22. 23. 24.

20/08/12 21/08/12 22/08/12

25. 26.

grammar-removal of unit production, useless production, useless symbol, and production normal forms(ch0masky normal form and greibach normal form Chomsky hierarchy Regular Grammar and CFL Definition, left linear and right linear regular grammar, Regular grammer and finite automata FA to RG and RG to FA,

27/08/12 28/08/12 29/08/12

27.

28.

IV 29.

03/09/12

30.

04/09/12

31. 32.

05/09/12 Inter conversion between left linear and right linear regular grammar CFL:Properties,normal forms,etc. Pumping lemma of CFL, Definition of/for CFl and application automata theory Push down automata(PDA) Definition, deterministic pushes down automata(DPDA) non-deterministic push down automata(NPDA) The language of PDA. Equivalance of PDAs and CFGs Clousure properties of CFLs. Concept of post machines. 10/09/12

33. 34. 35.

11/09/12 12/09/12 17/09/12

V 36. 37. 38.

18/09/12 24/09/12 25/09/12 26/09/12

39. 40. 41. 42.

01/10/12 03/10/12 04/10/12

VI 43. 44. 45. 46. 47.

Turning Machine: Definition and example of TM recursive sets, partial recursive function recursively enumerable sets computing a partial function with TM combining TMs variations of TM: Multi-tape TMs, universal TM, model of computation and churchs turing hypothesis unsolvable problem in TM TMs halting problem 11/10/12

05/10/12 06/10/12 07/10/12 08/10/12 09/10/12

48.

10/10/12

49. 50.

11/10/12

HOD Signature Signature

Text Books:

Staff

T1. Daniel I.A.Cohen,"Introduction to automata theory languages and computations, Pearson education asia,second edition T2. John C. martin, Introduction to language and theory of computation, TMH, 3rd edition. Reference Books: R1. Hopcroft Ulman, Introduction to automata theory, languages and computations, Pearson education Asia, 2nd edition R2. E V Krishnamurthy,Introduction to Theory of Computer Science, EWP Second 2nd edition. R3. K.L.P Mishra,N.Chandrasekaran, Theory of computer science(automata, languages and computation), Prentice hall india, 2nd edition

Web sites W1.www.nptel.edu W2.www.w3schools.com

W3.www.wikipedia.com Teaching Aids Used: C: Chalk and Talk L: LCD PPT Presentation G: Guest Lectures O: OHP V: Video Lectures