Shivaji University, Kolhapur T.E Computer Science and Engg. (SEMESTER-VI)

Transcription

1 Shivaji University, Kolhapur T.E Computer Science and Engg. (SEMESTER-VI) Sr. Name of Subject Teaching Scheme Examination Scheme L T P Total Theory Marks TW POE Ora l Total Marks Written Online 1 Compiler Construction Operating System - II Database Engineering Storage Networks Information Security Programming Lab - IV Domain Specific Mini- Project Total INDEX Sr. Name of the Subject Code Page 1 Compiler Construction CSE Operating System - II CSE Database Engineering CSE Storage Networks CSE Information Security CSE Programming Lab - IV CSE Domain Specific Mini- Project CSE Page 1 of 87

2 Course Plan for Compiler Construction Course Compiler Construction Course Code Examination Scheme Theory Term Work POE Total Max. Marks Contact Hours/ week Prepared by Mr.S.S.More Date 2 November 2017 Prerequisites 1. Students should know basic concept of system programming 2. Details of compilers and interpreters 3. Aspects of compilation 4. Basics of Assembler and its working stages in terms of pass I and II 5. Compilation of control structures 6. Compilation of expressions Course Outcomes At the end of the course the students should be able to: CO308.1 CO308.2 Explain 2 phases of compiler and compiler construction tools Discuss 2 complete lexical analyzer in C language with symbol table CO308.3 Define 1 the concept of parsing technique like top-down and bottom-up parsing. CO308.4 Analyze 4 S and L attributed syntax directed definitions, storage organization and it s allocations strategies CO308.5 Identify 4 the basics of code optimization techniques and data flow analysis and algorithms CO308.6 Illustrate 3 intermediate code generation techniques with procedure calls issues in design of code generator and target machines Page 2 of 87

3 Mapping of COs with POs POs a b c d e f g h i j k l m COs CO CO CO CO CO CO Course Contents Unit Title of Hours Section I 1. Introduction to Compiling: 6 Compilers, Phases of a compiler, Compiler construction tools, Cousins of compiler 2. Lexical Analysis: 5 Role of a Lexical analyzer, input buffering, specification and recognition of tokens, finite automata implications, designing a lexical analyzer generator. 3 Syntax Analysis: 7 Role of Parser, Writing grammars for context free environments, Topdown parsing, Recursive descent and predictive parsers (LL), Bottom- Up parsing, Operator precedence parsing, LR, SLR and LALR parsers. Page 3 of 87

4 Section II 4 Syntax Directed Translation and Intermediate Code Generation : 7 Syntax directed definitions, construction of syntax tree, S-attributed definitions, L-attributed definitions, Intermediate languages, assignment statements, back patching, procedure calls 5 Code Optimization : 5 Sources of optimization, Peephole optimization and basic blocks, loops in flow graphs, Data flow analysis and equations, code improving transformation and aliases 6 Code Generation : 6 Issues in design of a code generator and target machine, Run time storage management, Basic blocks and flow graphs, Next use information and simple code generator, Issues of register allocation, code generation from Dags Reference Books: Sr. Title of Book Author Publisher/Edition Topics 1 Compilers Principles, Techniques and Tools A.V. Aho, R. Shethi and J.D.Ullman Pearson Education 1 to 6 2 Crafting A Compiler with C Charles Fischer, Richard LeBlanc Pearson Publication 1 to 6 3 Modern Compiler Design D. Grune, H. Bal, C. Jacobs, K. Langendoen Wiley publication 1 to 6 4 Modern Compiler Implementation in Java Andrew W. Appel Cambridge University Press to 6 Page 4 of 87

5 5 Compiler construction D.M. Dhamdare Mc-Millan 1 to 6 6 Unix / Linux manuals. Scheme of Marks Section Unit Title Marks 01 Introduction to Compiling 06 I 02 Lexical Analysis Syntax Analysis 24 II 04 Syntax Directed Translation and Intermediate Code Generation 05 Code Generation Course Unitization 06 Code Optimization 24 Unit Course Outcomes of Questions in Title CAT-I CAT-II CAT-III 1 Introduction to Compiling CO question 2 Lexical Analysis CO question 3 Syntax Analysis CO question 4 Syntax Directed CO questions Translation and Intermediate Code Generation 5 Code Generation CO question 6 Code Optimization CO questions Page 5 of 87

6 Unit wise Lesson Plan Unit No Section I 1 Unit Title Introduction to Compiling Planned Hrs. 6 Unit Outcomes At the end of this unit the students should be able to: UO1 Explain phases of compiler CO308.1 UO2 Construct compiler construction tools CO308.1 Lesson schedule Class Details to be covered 1 Definition of Compilers 2 Phases of a compiler 3 Compiler construction tools 4 Cousins of the compiler 5 Compilers in programming languages Review Questions Q1 What is Compiler? CO308.1 Q2 What are the functions of compiler? CO308.1 Q3 What are the different phases of compiler? CO308.1 Q4 Design and explain various compiler construction tools CO308.1 Page 6 of 87

7 Unit No 2 Unit Title Lexical Analysis Planned Hrs. 5 Unit Outcomes At the end of this unit the students should be able to: UO1 Elaborate the role of a lexical analyzer, input buffering CO308.2 UO2 Design a lexical analyzer generator CO308.2 Lesson schedule Class Details to be covered 1 Role of a Lexical analyzer, 2 Specification and recognition of tokens 3 Finite automata implications 4 Designing a lexical analyzer generator 5 Input buffering Review Questions Q1 What is role of Lexical analyzer in lexical analysis? CO308.2 Q2 How to specify and recognize the tokens? CO308.2 Q3 List and explain finite automata implications CO308.2 Q4 Design lexical analyzer by considering suitable example? CO308.2 Page 7 of 87

8 Unit No 3 Unit Title Syntax Analysis Planned Hrs. 7 Unit Outcomes At the end of this unit the students should be able to: UO1 Demonstrate the role of parser CO308.3 UO2 Explain top-down and bottom-up parsing techniques CO308.3 UO3 Construct LR, SLR and LALR parser CO308.3 Lesson schedule Class Details to be covered 1 Role of a parser, Syntax error recovery, Context free grammar, Eliminating Ambiguity 2 Top down parsing technique 3 Recursive descent parsing, predictive parsing, First and Follow, LL grammars 4 Bottom up parsing, Shift reduce parsing, Operator precedence parsing 5 LR parsing 6 SLR parsing, Canonical LR parsing 7 LALR parsers, parser generators Review Questions Q1 What is bottom up parsing? Explain the shift reduce bottom up parsing algorithm. CO308.3 Q2 What is top down parsing? Explain the non recursive predictive parsing CO308.3 Page 8 of 87

9 Q3 algorithm. What is the role of parser? Explain syntax error handling and error recovery strategies. CO308.3 Unit No 4 Unit Title Syntax Directed Translation and Intermediate Code Generation Planned Hrs. 7 Unit Outcomes At the end of this unit the students should be able to: UO1 Define Syntax Directed Definitions, L and S attributed definitions CO308.4 UO2 Construct syntax tree CO308.4 UO3 Analyze Syntax Directed Definitions CO308.4 UO4 Classify back patching techniques with procedure calls CO308.4 UO5 Design intermediate languages CO308.4 Lesson schedule Class Details to be covered 1 Syntax Directed Definitions-Inherited attributes 2 Syntax Directed Definitions Synthesized attributes 3 Construction of syntax tree with example 4 S- attributed definitions, Bottom up evaluation of S- attributed definitions 5 L- attributed definitions 6 Intermediate Languages, Assignment Statements Page 9 of 87

10 7 Back patching, Procedure calls Review Questions Q1 Explain inherited and synthesized attributes of syntax directed translation CO308.4 Q2 What is meant by S-attributed definitions and Back patching? CO308.4 Q3 Write short note on analysis of syntax directed definition and procedure calls. CO308.4 Unit No 5 Unit Title Code Optimization Planned Hrs. 5 Unit Outcomes At the end of this unit the students should be able to: UO1 Express sources of optimization and basic blocks CO308.5 UO2 Design Directed Acyclic Graph (DAG) and dynamic code generation algorithm CO308.5 Lesson schedule Class Details to be covered 1 Sources of optimization, Semantic preserving transformations, global common sub expression elimination 2 Peephole optimization, Redundant instruction elimination 3 Data flow analysis 4 Code improving transformations copy propagation, code motion, Induction variable elimination 5 Computing aliases Review Questions Page 10 of 87

11 Q1 What is peephole optimization? Describe different characteristics of peephole optimization. CO308.5 Q2 Write and explain an algorithm for common sub expression elimination. CO308.5 Q3 Explain in detail code improving transformation, copy propagation, code motion CO308.5 Unit No 6 Unit Title Code Generation Planned Hrs. 6 Unit Outcomes At the end of this unit the students should be able to: UO1 Write issues in design of a code generator and target machine CO308.6 UO2 Recognize run time storage management CO308.6 UO3 Explain register allocation and dynamic code generation algorithm CO308.6 Lesson schedule Class Details to be covered 1 Issues in design of code generator, register allocation 2 Runtime storage management, basic blocks and flow graphs 3 Next use information 4 Issues of register allocation, global register allocation, usage count, graph coloring 5 Code generation from DAG 6 DAG representation of basic blocks Review Questions Q1 Discuss different issues in design of code generator CO308.6 Page 11 of 87

12 Q2 Write short note on flow graph representation of basic blocks CO308.6 Q3 Represent the basic block by using DAG with suitable example CO308.6 Q4 Write detail note on issues of register allocation in code generation mechanism CO308.6 Model Question Paper Course Title : Compiler Construction Duration 2 Hrs Max. Marks 50 Instructions: Instructions: Figures to right indicate full marks Question number 1 and 4 is compulsory Attempt any one question from remaining Section-I Marks 1 a What are different phases of compiler? Explain in detail 6 b How to specify and recognize the tokens? 6 2 a Design and Explain various compiler construction tools 6 b List out and Explain finite automata implications 7 3 a What is top down parsing? Explain non recursive predictive parsing algorithm in detail 6 b Explain SLR parsing with suitable example 7 Section-II Marks Page 12 of 87

13 4 a What is peephole optimization? Describe different characteristics of peephole optimization 6 b Write and Explain an algorithm for common sub expression elimination 6 5 a Discuss different issues in design of code generator 6 b Represent the basic block by using DAG with suitable example 7 6 a Explain in detail three address statements using quadruple and triple 6 b Write short note on Back patching mechanism 7 Model Question Paper Subject: Compiler Construction (MCQ) Note: All questions are compulsory. Maximum Marks: The current token being scanned in the input is frequently referred to as the. A Terminal symbol B non-terminal symbol C lookahead symbol D Symbol 2. The error can be such as an arithmetic expression with unbalanced parenthesis. A lexical B Syntactic C Symantic D Logical 3. A lexical analysis can detect error like. A Missing semicolon B 1-value required C Type mismatch D None of the above 4. reduces running time of a program. A Call by value B Call by reference C Call by copy restore D Call by name. 5. language allows data to be allocated under program control. Page 13 of 87

14 A C B C++ C Pascal D java. 6. A uses a symbol table to keep track of scope and binding information about names. A Linker B loader C Compiler D Assembler 7. upper-case letters late in the alphabet, such as x,y,z represent. A Terminals B Non-terminals C Grammer symbols D strings of terminals 8. The minimum dfa for (a b)*a(a b)*a will have states. A 2 B 3 C 4 D None of the above. 9. A compiler generates. A Executable code B Relocatable code C both D None of the above. 10. A is a sequence of characters in the source program that matches the pattern for a token. A Token B Pattern C lexeme D None of the above 11. To speed up the lexical analyzer, two-buffer scheme use the to mark the buffer end. A Sentinels B eof C Null D ' \0 ' 12. i) Every token must have an attribute value. ii) Lexical analyzer is called by parser. Which of the above is/are false? A i only B ii only C Both D Neither I or ii 13. i) Regular expressions are used for specifying the tokens in lexical analysis. ii) Finite automata is used for implementing regular expressions. Which of above is/are true? A i only B ii only C neither D Both 14. The table is accessed in every phases of a compiler. A literal B Parse C Symbol D Hash 15. Errors found during compilation are called as errors. Page 14 of 87

15 A Dynamic B Static C Semantic D None of the above 16. What are the stages in the compilation process? A Feasibility study, system design, and testing 17. What is a compiler? B Implementation and documentation C Lexical analysis, syntax analysis, and code generation D None of the above A A compiler does a conversion line by line as the program is run. B A compiler converts the whole of a higher level program code into machine code in one step. 18. What is the first stage in program development? C compiler is a general purpose language providing very efficient execution. D None of the above A Specification and design 19. What is system analysis? A The design of the screen the user will see and use to enter or display data B System analysis C Testing D None of the above B System analysis defines the format and type of data the program will use. C System analysis involves creating a formal model of the problem to be solved. D None of the above 20. A scanner reads a stream of characters and puts them together into some meaningful (with respect to the source language) units called. A String B Variable C Lexeme D Token 21. Code optimization can be done: A After semantic analyzing - performed on a parse tree B After intermediate code generation - performed on a intermediate code C After code generation - performed on a target code. D All of the above. 22. A of a string is a substring that matches the right side of a production and whose reduction to the non-terminal on the left side of the production represents one step along the reverse of a rightmost derivation. Page 15 of 87

16 A Prefix B Suffix C Handle D State 23. can be used to generate code for Boolean expression in one pass. A Back patching B Syntax tree C Declaration D Overall 24. de allocation requires cooperation between the user program and the run time package. A Explicit B Implicit C Controlled D No controlled 25. A declaration in a language is a construct that associates information with a name. A Semantic B Syntactic C Lexical D Procedural 26. The parsing table of LR parser has parts. A 2 B 3 C 5 D Consider the translation scheme shown below: S--> tr, r--> +t {printf( +");} r a T --> num {print (num.val); } Here num is a token that represents an integer and nom. Val represents the corresponding integer value for an input string. A B C D Which of the following is not characteristic of peephole optimization? A Flow of control optimization B Use of machine idioms C Algebric simplifications D None of the above 29. Which of the following is advantage of transformation on basic blocks? A It increases speed of execution B It is useful for improving quality of code. 30. The input to yacc compiler is. C Both a & b. D None of the above A Lex specification B Yacc specification C C program D Target program 31. is the LALR parser generator. Page 16 of 87

17 A Lex B Yacc C Syntax analyzer D Loader 32. In programming language semantic, the term environment refers to a function that maps a to a storage location. A Name B Body C Function D Procedure 33. Control stack is used to keep track of live. A Procedure activation B Function activation C Program activation D Declaration 34. A graph representation of three address statement is A Flow chart B Structure chart C Flow graph D None of the above 35. exists if the last reference occurs before de allocation. A Dangling reference B Garbage C Local correction D Loader 36. A shift reduces parser performs reductions in the reverse order specified by a left-most derivation: A False B True C None of these 37. is intermediate in power and cost between the other two. A Look ahead LR B Simple LR C Canonical LR D YACC 38. In static allocation, data structure cannot be created dynamically, since there is no mechanism for allocation at runtime. A static B Storage C Heap D Stack 39.a) parser generator 1)code optimization b) scanner generation 2)code generation c) data-flow engines 3) syntax analysis 4) lexical analysis A A-4, b-3, c-1 B A-3, b-4,c-2 C A-3,b-4,c-1 D A-3, b-2, c Which of the following statement is false about basic blocks? Page 17 of 87

18 A First statement is leader B Any statement that is the target of conditional or unconditional go to is leader 41. In labeling algorithm labeling can be done by C Both a & b D None of the above A Visiting nodes in top-down order B Visiting nodes in bottom-up order C Both a & b D None of the above 42. Synthesized attributes can be easily simulated by a A LL grammar B Ambiguous grammar C LR grammar D None of the above 43. is the most powerful & the most expensive A Simple LR B Canonical LR C Look ahead LR D Predictive parser 44. A transformation of a program is called if it can be performed by looking only at the statements in a basic block. A Global B Local C Regular D Irregular 45. A variable is live at a point in a program if its value can be used. A Frequently B currently C subsequently D Previously 46. Advantage of copy propagation is that it often turns the copy statement into. A live code B restore C dead code D usable code 47. moves code outside a loop. A Induction motion B Reduction C Compaction D Code motion replaces an expensive operation by a cheaper one such as a multiplication by an addition A Code motion B Compaction C Reduction in strength D Induction Page 18 of 87

19 49. When there are two or more induction variables in a loop, it may be possible to get rid of all by the process of. A Induction variable elimination B Code migration C Code motion D Compaction 50. We say node d of a flow graph node n, if every path from the initial node of the flow graph to n goes through d. A Migrates B Dominates C Captures D Acquires Assignments List of experiments/assignments to meet the requirements of the syllabus Assignment 1 Assignment Title Batch I CO308.1 Remove white spaces (space, tab) and comments from input and construct the symbol table for tokens and attributes. Batch II Batch III Batch IV Design and implement program for symbol table generation Write a program to implement data structure of assembly program Write program which consider input as assembly program and to generate a table for the symbols Assignment 2 Assignment Title CO308.2 Batch I Batch II Batch III Batch IV Eliminate Left Recursion from given input grammar. Design and implement LEX tools Design and implement YACC tools Design and implement LEX tools and its input specification Page 19 of 87

20 Assignment 3 Assignment Title CO308.3 Batch I Left factor the given input grammar to remove the ambiguity. Batch II Implement a program for Bottom up parsing of given input grammar. Batch III Implement a program for Top-down parsing of given input grammar. Batch IV Write a program for LR, SLR and LALR parsers of given input grammar. Assignment 4 Assignment Title CO308.4 Batch I Batch II Batch III Batch IV Write a program for S attributed definitions Write a program for L attributed definitions Construct syntax tree by using C language Implement a program for inherited attributes in syntax directed definitions Assignment 5 Assignment Title Batch I Batch II Batch III CO308.5 Write a program for storage allocation strategies in run time environments Implement program for dynamic storage allocations With the help of program demonstrate parameter passing mechanism Page 20 of 87

21 Batch IV Write program to implement token generation Assignment 6 Assignment Title CO308.5 Batch I Batch II Batch III Batch IV Write a program for intermediate languages Implement program for Boolean expressions With the help of program demonstrate back patching mechanism Write program to implement procedure calls Assignment 7 Assignment Title CO308.6 Batch I Batch II Batch III Batch IV Design a code generator using C language Implement program for flow graphs Construct register allocation strategy using object oriented programming Write program to implement DAG Assignment 8 Assignment Title CO308.6 Batch I Batch II Batch III Batch IV Write a program for peephole optimization techniques Demonstrate code improving transformation by using C language With the help of program demonstrate data flow analysis algorithm Write program to implement loops in flow graphs Page 21 of 87

22 Course Plan Course Code CS309 Course Operating Systems-II Prepared by Ms.P K Akulwar, Mr. M P Gaikwad Date 3/11/2017 Prerequisites This course requires the student to know about the basic concepts of UNIX operating systems, System calls, Assembly language & different types of signals related to UNIX. Course Outcomes At the end of the course the students should be able to: CO309.1 Explain 4 UNIX operating system kernel architecture & buffer cache management algorithms. CO309.2 Describe 2 internal file system organizations and related algorithms in UNIX. CO309.3 CO309.4 CO309.5 Write 6 various system calls for UNIX file system Discuss 2 process structure, creation and management in UNIX Demonstrate 3 architecture and explain algorithms of process scheduling. CO309.6 Mapping of COs with POs Discuss 2 memory management concepts, I/O subsystem architecture & algorithms COs POs a b c d e f g h i j k l m CO CO CO CO Page 22 of 87

23 CO CO Course Contents Unit Operating Systems-II of Hours 1. Introduction & The Buffer Cache General Overview of the System - History, System Structure, User Perspective, Operating System Services, Assumption About Hardware, Introduction to the KERNEL - Architecture of UNIX OS, Introduction to system concepts, Kernel Data Structure, System Administration. 10 The Buffer Cache Buffer headers, structure of the buffer pool, scenarios for retrieval of a buffer, reading and writing disk blocks, advantages and disadvantages of cache. 2. Internal Representation of Files 8 I-nodes, structure of the regular file, directories, conversion of a pathname to i-node, super block, i-node Experiment to a new file, allocation of disk blocks, other file types. 3. System calls for the file System 6 Open, Read, write, File and Record Locking, Adjusting the position of FILE I/O-LSEEK, Close, File Creation, Creation of Special File, Change Directory and Change Root, Change Owner and Change Mode, Stat and Fstat, Pipes, Dup, Mounting and Un-mounting file systems, Link, Unlink, File System Abstractions, File system maintenance. 4. The Structure of process 8 Process states and transitions, layout of system memory, the context of a process, Saving context of a process, manipulation of the process Page 23 of 87

24 address space. 5. Process Control & Scheduling 8 Process creation, signals, process termination, awaiting process termination, invoking other programs, the user id of a process, the shell, System Boot and the Init process. Process Scheduling and Time Process Scheduling, system call for time, clock. 6. Memory management & The I/O Subsystem 8 Reference Books: Swapping, Demand paging, a hybrid system with demand paging and swapping. The I/O Subsystem Driver interfaces, disk drives, terminal drivers, Streams. Sr. Title of Book Author Publisher/Edition Topics 1 The design of UNIX Operating System. 2 Linux System Programming Robert Love, Publisher 3 Unix concepts and administration. Maurice J. Bach 3 rd edition. PHI All Robert Love SPD O REILLY 1 Sumitabha Das 3rd Edition. TMGH 1 Evaluation scheme Examination Scheme Theory Term Work OE Total Max. Marks Contact Hours/ week 4 -- Page 24 of 87

25 Scheme of Marks Section Unit Title Marks I 1 Introduction & The Buffer Cache 16 2 Internal Representation of Files 16 3 System calls for the file System 16 II 4 The Structure of process 16 5 Process Control & Scheduling 16 6 Memory management & The I/O Subsystem 20 Weightage may differ Course Unitization CO Evaluation Notes CO309.1 CAT 1 All Questions compulsory CO309.2 CO309.3 CAT 2 All Questions compulsory CO309.4 CO309.5 CO309.6 CAT 3 All Questions compulsory Unit wise Lesson Plan Unit No Unit Title Planned Hrs. 1 Introduction & The Buffer Cache 10 Lesson schedule Page 25 of 87

26 Class Details to be covered 1 General Overview of the System History, System Structure, User Perspective. 2 Operating System Services, Assumption About Hardware. 3 Introduction to the KERNEL - Architecture of UNIX OS. 4 Introduction to system concepts, Kernel Data Structure. 5 System Administration, The Buffer Cache. 6 Buffer headers, structure of the buffer pool. 7 Scenarios for retrieval of a buffer. 8 Reading and writing disk blocks. 9 Advantages of cache. 10 Disadvantages of cache Review Questions Q1 Q2 Q3 Q4 Q5 Q6 Q7 Q8 Draw a neat diagram & explain the architecture of UNIX system in detail. Explain user perspective of the UNIX systems. What are the different types of operating system services? What are the different assumptions about the hardware with respect to UNIX systems? Draw & explain a block diagram of system kernel. Explain file system layout with a neat diagram. Explain system administration process. Draw a neat diagram & explain the buffer header in detail. CO309.1 Page 26 of 87

27 Q9 Q10 Q11 Q12 Q13 Explain structure of the buffer pool. What are the different scenarios for retrieval of a buffer? Explain algorithm for reading & writing disk block. Explain algorithm for block read ahead. List out different advantages & disadvantages of cache. Unit No Unit Title Planned Hrs. 2 Internal Representation of Files 8 Lesson schedule Class Details to be covered 1 I-nodes 2 Structure of the regular file 3 Directories, conversion of a pathname to i-node 4 Super block 5 i-node experiment to a new file, 6 Allocation of disk blocks 7 Other file types. 8 Represent a super block & i-node experiment to a new file. Page 27 of 87

28 Review Questions Q1 Q2 Q3 Q4 Q5 Q6 Q7 Q8 Define INODE & explain algorithm for allocation of In-Core Inodes. Explain an algorithm for releasing an Inode. Draw & explain direct & indirect blocks in inode. Explain algorithm for conversion of a path name to an inode. List different types of fields in a super block. Explain an algorithm for assigning new inodes & algorithm for freeing inode. Explain race condition in assigning inodes Explain an algorithm for allocating disk block. CO309.2 Unit No Unit Title Planned Hrs. 3 System calls for the file System 6 Lesson schedule Class Details to be covered 1 System calls for the file System, Open, Read, write, 2 Adjusting the position of FILE I/O-LSEEK, Close, File Creation, Creation of Special File. 3 Change Directory and Change Root, Change Owner and Change Mode. 4 Stat and Fstat, Pipes, Dup, Mounting and Un-mounting file systems. Page 28 of 87

29 5 Link, Unlink, File and Record Locking File System Abstractions, 6 File system maintenance. Review Questions Q1 Q2 Q3 Q4 Q5 Q6 Q7 Q8 Q9 Q10 Q11 Q12 Q13 Explain an algorithm for opening & reading a file. Explain a reader & writer process. Write a program with Lseek system call. Explain an algorithm for creating a file. Explain an algorithm for making a new node. Explain an algorithm for changing current directory of a file. Explain stat & fstat. Explain an algorithm for creation of unnamed pipes. Explain an algorithm for reading & writing a pipe & reading & writing a named pipe. Write a C program illustrating Dup. Explain mounting & unmounting file systems with algorithms. Explain an algorithm for linking & unlinking files. Explain deadlock scenario for linking & unlinking files. CO309.3 Unit No Unit Title Planned Hrs. 4 The Structure of process 8 Lesson schedule Page 29 of 87

30 Class Details to be covered 1 The Structure of process 2 Process states and transitions 3 layout of system memory 4 the context of a process 5 Saving context of a process 6 Manipulation of the process address space 8 Mapping of virtual addresses to physical addresses 9 System call interface with an algorithm Review Questions Q1 Q2 Q3 Q4 Q5 Q6 Q7 Q8 Draw & explain process state transition diagram. Explain process & regions with respect to layout of system memory. Explain mapping of virtual addresses to physical addresses. Explain how user mode is changed to kernel mode? Explain different components of the context of a process. Explain saving the context of a process. Explain algorithm for handling Interrupts. Explain how manipulation of the process address space is done? CO309.4 Unit No Unit Title Planned Hrs. 5 Process Control & Scheduling 6 Page 30 of 87

31 Lesson schedule Class Details to be covered 1 Process Control & Scheduling 2 Process creation, signals, process termination 3 Awaiting process termination, invoking other programs 4 The user id of a process 5 The shell 6 System Boot and the Init process. 7 Process Scheduling and Time 8 System call for time, clock Review Questions 1 Explain the sequence of process creation. 2 Explain algorithm for fork. 3 List all 19 signals in the UNIX System V. 4 Explain algorithm for handling signals. 5 Explain algorithm for exit, wait and exec. CO Explain the user id of a process. 7 Explain the concept of Shell. 8 Explain system boot & init process. 9 Explain algorithm for process scheduling. Page 31 of 87

32 10 Explain different scheduling parameters. 11 Draw & explain how a process moves on a priority queue. 12 Explain system calls for time. 13 Explain the functions of clock interrupt. 14 Write & explain program using alarm call. 15 Explain algorithm for clock handler. Unit No Unit Title Planned Hrs. 6 Memory management & The I/O Subsystem 8 Lesson schedule Class Details to be covered 1 Memory management & The I/O Subsystem 2 Swapping 3 Demand paging 4 A hybrid system with demand paging 5 Swapping. 6 The I/O Subsystem 7 Driver interfaces 8 Disk drives, terminal drivers, Streams Review Questions Q1 Q2 Q3 Explain algorithm for allocating space from maps. Explain how allocation of swap space is done. Explain mapping of virtual addresses to physical addresses. CO309.6 Page 32 of 87

33 Q4 Q5 Q6 Q7 Q8 Q9 Q10 Q11 Q12 Q13 Q14 Q15 Explain why a process is swapped out. Explain in short what demand paging is? Explain saving the context of a process. Explain the concept of page aging. Explain the concept of page fault. Explain what hybrid system with swapping & demand paging is? Explain algorithm for opening a device. Explain algorithm for closing a device. Write a program for reading disk data using block & raw interface. List different function of line discipline. Explain algorithm for writing data to a terminal. Explain the concept of stream. Model Question Paper Course Title : Operating Systems-II Duration 3 Hours Marks: 100 Instructions: 1] Attempt any three questions from each section. 2] Figures to the right indicate full marks. Section-I 1 a Explain the algorithm when the process opens the file Letc/ passwd to get its Inode. Marks 8 b If the super block free Inode list is empty & remembered Inode are 470. Explain the steps to fill the superblock free Inode list. 8 Page 33 of 87

34 2 a Write system call & example to create unnamed pipe. What is the inode reference count value when pipe was opened initially? Give reason for the same. 8 b Give & explain the syntax for the month system call. List the different entries from the mount table. 7 3 a Assume that a disk block contains 1024 bytes & there are 5 direct blocks & two single indirect blocks. Find the byte capacity of a file. 8 b Give the structure of buffer Header. Explain different conditions of status field? 7 4 Write short note (any three): [3*6] a. List the scenarios for retrieval of buffer & explain any one with example. b. Algorithm for releasing buffer. c. Block diagram of UNIX system kernel. d. Change directory of & change root. Section-II Marks 5 a Draw & explain complete set of process state & transitions. 8 b List the sequence of operation performed by forces system call. Explain in brief. 8 6 a Explain system boot & Init process. 8 b List the functions of clock interrupt handler. Explain each in brief. 7 7 a Explain malloc algorithm. 8 b Explain algorithm for opening device? 7 8 Write short note (any three): [3*6] a. Terminal drivers. b. Validity page fault handler c. Signals. Page 34 of 87

35 d. Attaching region to a process. Practical/ Assignments: Expt. Brief description about the experiment 1 To study the system structure of UNIX operating system 2 Study and execution of basic commands of UNIX 3 Implementation of file copy program by using different file system calls Use the previous programs (sr.no. 3 s) executable code to implement file copy program using parent and child processes. Study & Demonstration of user buffer I / O by writing and reading, to and from a file. (Use C file handling functions). Study and demonstration of Advanced file I/O. Write a simple program that uses mmap() to print a file chosen by the user to standard output. Study & Demonstration of Unix Process Management. From creation to termination. Write a program to implement two processes reading and writing to the same file simultaneously. Study & demonstration of the File and Directory Management. Write a program to change current working directory and display the inode details for each file in the new directory Study & demonstration of Signals. Write a simple program to show the handling of signals practically 10 Study & Demonstration of Time, Sleep and Clock Management. 11 Study of boot loader like Grub 12 Implementation of system call for UNIX/Linux. Page 35 of 87

36 Course Plan Course Code Course Database Engineering Prepared by Dr. Bhuvaneshwari Melinamath & Mr. Vinayak. N. Malavade. Date 03/11/2017 Pre-requisites This course requires the student to know about the basic concepts in database and object oriented programming(java) Course Outcomes At the end of the course the students should be able to: CO309.1 CO309.2 CO309.3 CO309.4 CO309.5 CO309.6 Describe 1 Fundamental Concepts and algorithms related to database. Demonstrate 2 the concepts of DBMS using SQL. Apply 3 normalization techniques to maintain the consistency. Describe 2 different types of indexing and hashing techniques. Explain 5 the various techniques of concurrency control. Identify 4 the reasons for system crash and recovery methodologies Mapping of COs with POs POs a b c d e f g h i j k l m COs CO CO CO CO CO CO Mild correlation 2 Moderate correlation 3 Strong correlation Page 36 of 87

37 Course Contents Unit Title of Hours 1. Unit 1: Introduction to databases [Text Book- 1 & 3 ] 1.1 Introduction 1.2 Traditional File based Systems 1.3 Database Approach 1.4 Roles in Database Environment 1.5 History of Database management systems 1.6 Advantages and Disadvantages of DBMS s. 1.7 Structure of Relational Databases 1.8 Database Schema 1.9 Keys 1.10 Schema Diagram 1.11 Relational Query Languages Relational Operations 2. Unit 2: Structured Query Language (SQL) [Text Book -2 & 3] 2.1 Introduction to SQL 2.2 Data Definition Commands 2.3 Data manipulation Commands 2.4 Queries 2.5 Advanced data management commands 2.6 More complex queries and SQL functions 08 Hours 08 Hours 3 Unit 3: Normalization [Text Book 1] 3.1 The purposes of Normalization 3.2 Data Redundancies and Update Anomalies 3.3 Functional Dependencies 3.4 The Process of Normalization 3.5 First Normal Form 3.6 Second Normal Form 3.7 Third Normal Form 3.8 Boyce-Codd Normal Form 3.9 Fourth Normal Form 3.10 Fifth Normal Form 4 Data Storage & Indexing [Text Book -3] 4.1 File Organization 4.2 Organization of records in File 06 Hours 07 Hours Page 37 of 87

38 4.3 Data Dictionary Storage 4.4 Database Buffer 4.5 Basic Concepts indexing & hashing 4.6 Ordered Indices 4.7 Multiple-Key Access 4.9 Static Hashing 4.10 Dynamic Hashing 4.11 Bitmap Indices 4.12 Index Definition in SQL 5 Transaction Management & Concurrency Control [Text Book 2 & 3] 5.1 What is a Transaction? 5.2 Concurrency Control 5.3 Concurrency Control with Locking Methods 5.4 Concurrency Control with Times tamping Methods 5.5 Concurrency Control with Optimistic Methods 6 Recovery System [Text Book-3] 6.1 Failure Classification 6.2 Storage 6.3 Recovery & atomicity 6.4 Recovery Algorithm 6.5 Buffer Management 6.6 Failure with loss of non- volatile Storage 10 Hours 06Hours Reference Books: Sr. Title of Book Author Publisher/Edition Topics 1 Database Systems- A practical approach to Design, Implementation and Management Thomas Connolly, Carolyn Begg Pearson Education, 3 rd Edition 1,3 2 Database Systems- Design, Implementation and Management Rob and Coronel 3 Database System Concepts A Silberschatz, H. F. Korth, S. Sudarshan Thomson Course Technology, 5 th edition Mc Graw Hill Education, 6 th edition 2,5 1,2,4,5,6 Page 38 of 87

39 Evaluation scheme Examination Scheme Theory Term Work POE Total Max. Marks Contact Hours/ week Scheme of Marks Section Unit Title Marks 1 Introduction to Databases 20 I 2 Structured Query Language 15 3 Normalization 15 4 Data Storage & Indexing 20 II 5 Transaction Management & Concurrency Control 15 6 Recovery System 15 Course Unitization Section Unit Course Outcomes of Questions in Title CAT-I CAT-II CAT-III 1 Introduction to Databases CO questions I 2 Structured Query Language CO Normalization CO Data Storage & Indexing CO309.4 questions II 5 Transaction CO questions Management & Concurrency Control 6 Recovery System CO309.6 Page 39 of 87

40 Unit wise Lesson Plan Unit No 1 Unit Title Introduction to Databases Planned Hrs. Lesson schedule Class Details to be covered 1 Introduction 2 Traditional File based Systems, Database Approach 3 Roles in Database Environment 4 History of Database management systems 5 Advantages and Disadvantages of DBMS s. 6 Structure of Relational Databases 7 Database Schema, Keys, Schema Diagram 8 Relational Query Languages, Relational Operations 08 Review Questions Q1 Explain the introduction to the database system. CO309.1 Q2 Describe different types of real time relational database systems. CO309.1 Q3 What are advantages and disadvantages of DBMS? CO309.1 Q4 What is key in database? explain what are different types of keys? CO309.1 Q5 Explain roles in database management? CO309.1 Q6 What are relational query languages? CO309.1 Q7 Explain Relational Operations. CO309.1 Unit Class 2 Unit Title Structured Query Language (SQL) Planned Hrs Lesson schedule Details to be covered 1 Introduction to SQL 2 DDL & DML 3 Data Definition Commands 4 Data manipulation Commands 5 Queries 6 Advanced data management commands 7 More complex queries 08 Page 40 of 87

41 8 SQL functions Review Questions Q1 What are functions of SQL? CO9.2 Q2 What is DDL and DML? CO9.2 Q3 Write different queries fired on hospital database management system. CO9.2 Q4 What are DDL and DML commands? CO9.2 Q5 What are advanced data management commands? CO9.2 Unit 3 Unit Title Normalization Planned Hrs 06 Lesson schedule Class Details to be covered 1 The purposes of Normalization, data Redundancies and Update Anomalies 2 Functional Dependencies, the Process of Normalization 3 First normal form, second normal form 4 Third normal form 5 Boyce-codd normal form 6 Fourth normal form, Fifth normal form Review Questions Q1 Explain the purpose of normalization in detail. CO9.3 Q2 What are different dependencies? CO9.3 Q3 Explain all types of normal form. CO9.3 Q4 What is difference between first normal form and second normal form? CO9.3 Q5 Explain concept of data redundancies. CO9.3 Unit 4 Unit Title Data Storage and Indexing Planned Hrs Lesson schedule Class Details to be covered 1 File organization 07 Page 41 of 87

42 2 File Organization, Organization of records in File 3 Data Dictionary Storage, Database Buffer 4 Basic Concepts indexing & hashing, Ordered Indices 5 Multiple-Key Access, Static Hashing 6 Dynamic Hashing, Bitmap Indices 7 Index Definition in SQL Review Questions Q1 Explain what is file organization system? CO9.4 Q2 Write a note on database buffer CO9.4 Q3 What is data dictionary storage? CO9.4 Q4 Explain in detail the indexing technique. CO9.4 Q5 What is Basic Concepts indexing & hashing? CO9.4 Q6 Write a note on Dynamic Hashing and Bitmap Indices. CO9.4 Unit No 5 Unit Title Transaction Management And Concurrency Control Lesson schedule Class Details to be covered 1 What is a Transaction 2 Concept of Concurrency Control 3 Need of concurrency control 4 Different methods of concurrency control 5 Concurrency Control with Locking Methods 6 Algorithm for Concurrency Control with Locking Methods 7 Concurrency Control with Times tamping Methods 8 Algorithm for Concurrency Control with Times tamping Methods 9 Concurrency Control with Optimistic Methods 10 Algorithm for Concurrency Control with Optimistic Methods Planned Hrs. 10 Review Questions Q1 Explain Algorithm for Concurrency Control with Optimistic Methods CO9.5 Q2 Explain Concept of Concurrency Control CO9.5 Q3 Explain Different methods of concurrency control CO9.5 Unit No 6 Unit Title Recovery System Planned Hrs. Lesson schedule Class Details to be covered 1 Failure Classification 06 Page 42 of 87

43 2 Storage 3 Recovery & atomicity 4 Recovery Algorithm 5 Buffer Management 6 Failure with loss of non- volatile Storage Review Questions Q1 Explain what is failure and its types? CO9.6 Q2 Explain what is buffer management? CO9.6 Q3 Write short note on crash recovery process. CO9.6 Model Question Paper Course Title : Database Engineering Duration 03 Hours Max. Marks Instructions: Question 4 and 5 are compulsory. Attempt any two questions from each Section Figures to the right indicate full marks. Assume suitable data if necessary Section-I 1 a Explain the distinction among the terms. i) Primary Key ii) Candidate Key iii) Super Key iv) Foreign Key Marks 8 b Distinguish database system versus file system. 8 2 a What do you understand by domain and tuple relational calculus? 8 Explain with examples. b Discuss the concept of generalization, aggregation and specialization. 8 3 a compute the closure of the following set F of function for relational schema R=(A'B'C'D'E) A->BC CD->E B->D E->A List the candidate keys for R 4 b using the functional dependencies of above example compute the canonical cover F 4 Page 43 of 87

44 c Explain about Sequential file organization with an example 6 4 Write a short note on (any three) t18l 18 a) Reducing E'R diagram to tables b) sql c) Data Dictionary Storage d) Normalization using Functional Dependency Section-II Marks 5 a Explain data structures used for dynamic hashing' 10 b What are the techniques used in searching record. 8 6 a Explain query evaluation using pipelining 8 b How to handle failure during data transfer 8 7 a What is log? How it is used for recovery. 8 b Explain timestamp ordering protocol 8 8 a Explain basis of evaluation of indices. 8 b Explain crash recovery system in detail. 8 Assignments List of experiments/assignments to meet the requirements of the syllabus Assignment Titles 1 Draw an E-R Diagram for any organization like Insurance Company, Library systems, College Management systems, Hospital Management systems etc. 2 Convert the Above mentioned E-R Diagram in Relational Tables 3 Installation & Demonstration of DBMS like My Sql, Oracle, IBM-DB2 etc., Draw the architectures of installed DBMS. 4 Write a program of Database connectivity with any object oriented language like Java, C++ etc. 5 Use DDL Queries to create, alter & drop Tables 6 Use DML Queries to insert, delete, update & display records of the tables. 7 Create tables using primary key & foreign key with all constraints. 8 Display the records using group by, order by, having and between clauses. 9 Display the records using Aggregate functions 10 Create Indexes & Views for the table. 11 Display the results of union, intersection, set difference, Cartesian product and Join operations of two different tables 12 Write a program to implement Static Hashing. Page 44 of 87

45 13 Write a program to implement to Dense Index. 14 View the contents of data dictionary from the DBMS and write the contents. 15 Find the FC and F+ of relation schema r (A, B, C, G, H, I) and F= {A _B, A _ C, CG_H, CG_I, B_H}. Page 45 of 87

46 Course Plan Course Storage Networks Course Code Examination Scheme Theory Term Work Oral Total Max. Marks Contact Hours/ week Prepared by Mr. P.S.Khot and Mr. G. A.Walikar Date : 07/11/17 Prerequisites This course requires the student to know about the Basic concepts Computer Networks, Database System Knowledge about File systems & Data structures, algorithms. Course Outcomes At the end of the course the students should be able to CO311.1 CO311.2 CO311.3 CO311.4 CO311.5 CO311.6 Explain 2 key challenges in information management Describe 2 Storage system architecture and data protection Illustrate 3 Storage Area Network- concepts, components and protocols Discuss 3 information about Network Attached Storage and concept of storage virtualization Apply 4 knowledge for business Continuity, Backup and Recovery Summarize 5 need of Replication, Replication techniques and Storage Security Page 46 of 87

47 Mapping of COs with POs POs COs a b c d e f g h i j k l m CO CO CO CO CO CO Mild correlation 2 Moderate correlation 3 Strong correlation Course Contents Unit Title of Hours Introduction to information storage: Evolution of storage technology and architecture, Data Center Infrastructure, Key challenges in Managing Information, Information Lifecycle. Components of Storage System Environment, Disk Drive Components, Disk Drive Performance, Laws governing disk Performance, Logical Components of Host, Application requirements and disk performance. 1 Intelligent Storage System, Direct Attached Storage and Data Protection: Components of Intelligent Storage System, Intelligent Storage Array. Direct Attached Storage types, benefits and limitation, Disk drive Interface, Introduction to parallel SCSI, SCSI command model. Data Protection (RAID):- Implementation of RAID, RAID array components, RAID levels, Comparison, RAID,Impact on disk 7 Page 47 of 87

48 performance, Hot Spares Storage Area Network: SAN Evolution, Components of SAN, Fibre Channel Protocol Stack- Links, ports and topologies, FC-0: Cables, plugs and Signal Encoding, FC-1: 8b/10b encoding, ordered sets and link control protocol, FC-2: data Transfer, FC-3: common Services, FC-4 and ULPs, Fibre Channel SAN point-to- point topology, Fabric topology, Arbitrated loop topology, Hardware components of Fibre channel SAN. IP SAN iscsi-components, connectivity, topology, protocol stack, discovery, names, session, PDU. Network -Attached Storage: Local File Systems, Network File System and File Servers, Benefits of NAS, NAS file I/O, Components of NAS, NAS Implementations, NAS File sharing Protocols, NAS I/O operations, Factors affecting NAS Performance. Case Study: Direct Access File System, Shared Disk File System Comparison: NAS, Fibre Channel SAN and iscsi SAN Storage Virtualization:Introduction, Virtualization in the I/O path, Limitations and requirements, Definition of Storage Virtualization, Implementation considerations, Storage Virtualization on block level, File level Virtualization, Storage Virtualization on various levels of the storage network, Symmetric and Asymmetric Storage Virtualization. Business Continuity, Backup and Recovery: Introduction, InformationAvailability, Cause of Information unavailability, Measuring information Availability, Consequences of down time, BC terminology, BC planning life cycle, Failure Analysis, BC Technology Solutions, Backup Purpose, Backup Considerations, Backup Granularity, Recovery Considerations, Backup Methods, Backup Process, Backup and Restore Operations, Backup Topology, Backup in NAS environment, Backup Technologies Replication and storage security: Local Replication, Uses of Local Replicas, Data Consistency, Local Replication Technologies, Restore and 6 Page 48 of 87

49 Restart Considerations. Storage Security: Storage Security Framework, Risk Triad, Storage Security Domains, Security Implementations in Storage Networking. Reference Books: Sr. Title of Book Author Publisher/Edition Topics 1 Information Storage and Management G. Somasudaram EMC Education Services (Wiley India Edition) 1,2,3,4,5,6 2 Storage Networks Explained Ulf Troppen, Rainer Erkens, Wolfgang Müller (Wiley India Edition) 3,4 Scheme of Marks Unit Title Marks 1 Introduction to information storage and Storage System Environment 20 2 Storage Area Network 15 3 Network Attached Storage 15 4 Storage Virtualization 20 5 Business Continuity, Backup and Recovery 15 6 Replication and storage security 15 Page 49 of 87

50 Course Unitization Unit Course Outcomes of Questions in Title CAT-I CAT-II CAT III 1 Introduction to information storage and Storage System Environment CO questions Storage Area Network CO questions Network Attached Storage CO questions - 4 Storage Virtualization CO questions - 5 Business Continuity, Backup and Recovery 6 Replication and storage security CO questions CO questions Unit wise Lesson Plan Unit No 1 Unit Title Section I Introduction to information storage Lesson schedule Planned Hrs. : 7 Class Details to be covered 1 Evolution of storage technology and architecture, Data Center Infrastructure, Key challenges in Managing Information 2 Information Lifecycle, Components of Storage System Environment, Disk Drive Page 50 of 87