JSPM’s Rajarshi Shahu College of Engineering

Department of Information TechnologySESSION PLAN SEM-I / 2012-13

Department: IT Class: T.EName of Staff: Prof. Anuja R. Zade Name of Subject: OS

No. of Lects. Planned: 46Theory: 100 Marks

Lecture No. Topics to be Covered

Planned Date

Actual Date

Book/ Website Referred

Teaching-aid Used

Unit 1 Introduction

1. O.S. Shell,Linux Shell Commands

21/06/12

2. Shell Programming, Variables If—else, while do..done, case..esac Assignment 1(C ) part

22/06/12

3. Grep command 26/06/12

4. For loop special parameters Assignment 1 B part

27/06/12

5. Database Assignment File Operation Assignment 1 (A) part Edit Delete Modify a particular record

28/06/12

6. AWK programming AWK variables AWK with all options

03/07/12

7. Architecture of OS(Ex Monolithic Micro Kernal, Layered etc) Operating system objectives and functions

04/07/12

8. Virtual Computers, Interactions of OS & hardware architecture Evolution of

05/07/12

9. Batch Multiprogramming ,Multitasking Multi-user, Parallel,

10/07/12

10. System calls Linux, Ms-Windows, Handheld OS

11/07/12

Unit II Process Management

11. Process Concept, Process states, Process description, Process control

12/07/12

12. Assignment 17/07/12

13. Uniprocessor Scheduling: Types of scheduling: Preemptive, No preemptive, SchedulingAlgorithms: FCFS, SJFS,

18/07/12

14. RR, Priority 19/07/12

15. Practice Example 24/07/12

16. Assignment &Examples

25/07/12

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

26/07/12

18. Threads Process and Threads 31/07/12

Unit III Process Communication and Synchronization

19. . Concurrency: Principles of Concurrency, Mutual Exclusion H/w Support

01/08/12

20. Software approaches,Semaphores and Mutex Message Passing, Monitors,

02/8/12

21. Classical Problems Of Synchronization: Readers-Writers Problem, P

08/08/12

22. Producer Consumer Problem 09/08/12

23. Dining Philosopher problem, 14/08/12

24. Deadlock: Principles of deadlock, Deadlock Prevention, Deadlock Avoidance,

16/08/12

25. Deadlock Detection, An Integrated Deadlock Strategies

17/08/12

26. Example 21/08/12

27. Example on Bankers Algorithm

22/08/12

Unit IV Memory Management

28. Memory Management requirements, Memory partitioning: Fixed and DynamicPartitioning

23/08/12

29. Buddy System Memory Allocation: Allocation Strategies (First Fit, Best Fit, Worst Fit,Next Fit)

28/08/12

30. Example 29/08/12

31. Fragmentation, Swapping 30/08/12

32. Segmentation 4/09/12

33. Paging 5/09/12

34. Virtual Memory, Demand paging, Page Replacement Policies

06/09/12

35. FIFO, LRU, Optimal, clock , Examle

11/09/12

36. Thrashing, Working Set Model 12/09/12

Unit V I/O and File Management

37. I/O management & Disk scheduling: I/O Devices, Organization of I/O functions,

13/09/12

38. Operating System Design issues, I/O Buffering, Disk Scheduling (FCFS, SCAN, C-SCAN, SSTF), RAID, Disk Caches

18/09/12

39. File Management: Overview, File Organization and access, File Security issues.

19/09/12

40. Record Blocking, Secondary Storage Management, Comparative study of Windows and UNIX file system.

20/09/12

Unit VI Protection and Security

41. Computer security & protection: Security Threats,

25/09/12

42. Attacks and assests, Intruders, 26/09/12

43. Malicious software, Protection 27/09/12

44. Protection Policy and mechanisms

02/10/12

45. Authentications: Internal Access Authorizations, Implementations

03/10/12

46.University Question paper discussion

04/10/12

References : Text BooksT1: Stalling William, "Operating Systems 6th Edition, Pearson Education, ISBN 978-81-317- 2528-3T2: 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,PHIR4: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 HOD IT

Prof.A. R. Zade Prof. S. V. Kedar

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

JSPM’S RAJARSHI SHAHU COLLEGE OF ENGINEERINGTathawade, Pune - 33.

Teaching Plan, Semester – I (2012-13)

Department: IT Class: T.EName of Staff: Prof. Seema V. Kedar Name of Subject: DBMS & ISLNo. of Lects. Planned: 49

Lect. No.

Topic(s) to be covered Planned Date

Actual Date

Book/ Website Referre

d

Teaching-aid Used

Unit 1 : Introduction1. Basic concepts , Purpose of

DBMS, Applications of DBMS.

21/06/2012

2. Advantages and Disadvantages of DBMS, Comparison between DBMS and File processing system, Instances and schema, Data Independence.

25/06/2012

3. Data abstraction, Data Models, Database Languages.

26/06/2012

4. Components of a DBMS and overall structure of a DBMS, Multi-User DBMS Architecture, System Catalogs

28/06/2012

5. Introduction to VB 29/06/2012

6. Basic Concepts, entity, attributes, relationships, constraints, keys,

02/07/2012

7. E-R and EER diagrams: Components of E-R Model Conventions , converting E-R diagram into tables, EER Model components

03/07/2012

8. Converting EER diagram into tables.

05/07/2012

9. Designing Calculator using VB

06/07/2012

10. Relational Model: Basic concepts, Attributes and

09/07/2012

Domains, Codd's Rules11. Relational Integrity:

Domain, Entity, Referential Integrities, Enterprise Constraints, Views, Schema diagram

10/07/2012

Unit 2: Introduction to SQL12. Characteristics and

advantages, SQL Data Types and Literals

12/07/2012

13. DDL, DML, SQL Operators, Tables: Creating, Modifying, Deleting

13/07/2012

14. Views: Creating,Dropping, Updation using Views, Indexes, Nulls

16/07/2012

15. SQL DML Queries: SELECT Query and clauses, Set Operations

17/07/2012

16. Predicates and Joins, Set membership, Tuple Variables, Set comparison, Ordering of Tuples

19/07/2012

17. Aggregate functions, Nested Queries, Database Modification using SQL

20/07/2012

18. Insert, Update and Delete Queries, concept of Stored Procedures

23/07/2012

19. Cursors 24/07/2012

20. Triggers, assertions 26/07/2012

21. DDL/DML Practical Assignment Discussion

27/07/2012

22. Roles and privilegesProgrammatic SQL: Embedded SQL, Dynamic SQL.

30/07/2012

Unit 3: Relational Database Design23. Purpose of Normalization,

Data Redundancy and Update Anomalies

31/07/2012

24. Functional Dependencies: Basic concepts, closure of set of functional dependencies

02/08/2012

25. PL/SQL Practical assignments Discussion

03/08/2012

26. closure of attribute set, canonical cover

06/08/2012

27. Decomposition: lossless join decomposition and dependency preservation

07/08/2012

28. The Process ofNormalization: 1NF, 2NF

09/08/2012

29. Miniproject on RDBMS and Front End development Discussion

10/08/2012

30. 3NF, BCNF 13/08/2012

31. 4NF, 5NF 14/08/2012

Unit 4: File Systems

32. File Organization, Organization of records in files

16/08/2012

33. Indices, Static and Dynamic Hashing

20/08/2012

34. B-trees and B+ Trees 21/08/2012

35. Introduction to Query Processing: Overview, Measures of query cost

23/08/2012

36. 24/08/2012

37. Selection and join operations, Evaluation of Expressions

27/08/2012

38. Introduction to Query Optimization, Estimation, Transformation of Relational Expressions

28/08/2012

Unit 5: Transaction Management:39. Basic concept of a

Transaction , Properties of Transactions

30/08/2012

40. Concept of Schedule, Serial Schedule, Serializability: Conflict and View

31/08/2012

41. Cascaded Aborts, Recoverable and Non-recoverable Schedules

03/09/2012

42. Concurrency Control: Need, Locking Methods, Deadlocks

04/09/2012

43. Timestamping Methods, Optimistic Techniques

06/09/2012

44. Multi-Version Concurrency Control

07/09/2012

45. Different Crash Recovery methods such as Shadow-

10/09/2012

Paging and Log-Based Recovery: Deferred and Immediate, Checkpoints

Unit 6 : Object-oriented Databases and Database Architectures46. Need of OODBMS ,

Storing Objects in Relational Database

11/09/2012

47. Introduction to OO Data Models, Persistent Programming Languages, Pointer Swizzling Techniques

13/09/2012

48. Database Architectures: Centralized and Client-Server Architectures , 2 Tier and 3 Tier Architecture, Introduction to Distributed Database systems

14/09/2012

49. Introduction to data warehousing and its components, Introduction to data mining using association rules,

15/09/2012

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", 5 th

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, McGraw-

Hill, 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 Date of Conclusion: 11 /10/2012

JSPM’S RAJARSHI SHAHU COLLEGE OF ENGINEERINGTathawade, Pune -33.

Teaching Plan for Tutorial classes, Semester – I (2012-13)

Department : IT Class : T.E.Name of Staff : Prof. V. V. Dakhode. Name of Subject : TOCNo. of Lects. Planned: 16

Sr.No.

Topic Name Planned Date

Actual Date

Book/ Website Referred

Teaching-aid Used

Basic Concept:

1

Revision of Basic Machine, Finite State machine: state tables, transition graph, acceptance and regection

25/06/12

2

Revision of Formal definition, Recursive definition of regular expression, regular set, identities of regular expressions.

02/07/12

Finite automata(FA):

3

Revision and some extra example on FA. 09/07/12

4

Revision and some extra example on DFA and NFA. 16/07/12

5

Revision and some extra example on NFA with e moves, NFA without e moves, removal of e moves,conversion of NFA without e moves to DFA, conversion of NFA with e moves to DFA.

23/07/12

6

Revision and some extra example FA with output: Moore and mealey machines-definition, models, inter conversion

30/07/12

Contexts Free Grammars and languages

7

Revision and some extra example Phrase structure grammar, context free grammar, context free languages(CFL),Production rules, formalization, derivation and derivation trees, ambiguous grammar.

06/08/12

8

Revision and some extra example removal of ambiguity and inherent ambiguity, simplification ofgrammar-removal of unit production, useless production, useless symbol, and production

13/08/12

9

Revision and some extra example normal forms(ch0masky normal form and greibach normalform),Chomsky hierarchy

20/08/12

Regular Grammar and CFL

10Revision and some extra example FA to RG and RG to FA 27/08/12

11

Revision and some extra example inter conversionbetween left linear and right linear regular grammar

03/09/12

12

Revision and some extra example Properties,normal forms,etc.Pumping lemma of CFL, definition of/for CFl and application automata theory

10/09/12

Push down automata(PDA)

13

Revision and some extra example deterministic, pushes down automata(DPDA), non-deterministic push down automata(NPDA)

17/09/12

14

Revision and some extra example the language of PDA. Equivalance of PDA’s and CFG’s

24/09/12

15

Revision and some extra example clousure properties of CFL’s. Concept of post machines 1/10/12

Turning Machine:

16

Revision and some extra example TM, recursive sets, partial recursive function,recursively enumerable sets, computing a partial function with TM, combining TM’s variations of TMRevision and some extra example Multi-tape TM’s, universal TM, model of computation and church’s turing hypothesis, unsolvable problem,TM’s halting problem.

08/10/12

HOD Signature Staff Signature

Text Books:

T1. Daniel I.A.Cohen,"Introduction to automata theory languages and computations”,Pearson education asia,second editionT2. John C. martin,” Introduction to language and theory of computation”, TMH, 3 rd

edition.

Reference Books:

R1. Hopcroft Ulman, “Introduction to automata theory, languages and computations”,Pearson education Asia, 2nd editionR2. 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 andcomputation)”, Prentice hall india, 2nd edition

Web sites W1.www.nptel.eduW2.www.w3schools.comW3.www.wikipedia.com

Teaching Aids Used:

C: Chalk and Talk L: LCD PPT Presentation G: Guest Lectures O: OHP V: Video Lectures