computer science & engineering - mvjce science & engineering ... part - a 1. overview 6 hrs...

NNeeaarr IITTPPBB,, BBaannggaalloorree--556600 006677

WWeebbssiittee:: wwwwww..mmvvjjccee..eedduu..iinn

CCOOMM PPUUTTEERR SSCCII EENNCCEE && EENNGGII NNEEEERRII NNGG

CCOOUURRSSEE DDII AARRYY (ACADEMIC YEAR 2011-12)

VV SSEEMM EESSTTEERR Name : _____________________________________________ USN : _____________________________________________ Semester & Section : _____________________________________________

The Mission

“The mission of our institutions is to provide

world class education in our chosen fields and

prepare people of character, caliber and vision

to build the future world”

MVJCE

DEPT OF COMPUTER SCIENCE AND ENGINEERING 2

INDEX

S.No Sub.code Subject Pageno

1 06CS51 Software Engineering 2

2 06CS52 System Software 12

3 06CS53 Operating Systems 18

4 06CS54 Database Management Systems 31

5 06CS55 Computer Networks I 40

6 06CS56 Formal Languages and Automata Theory 56

7 06CSL57 Database Applications Laboratory 65

8 06CSL58 Algorithms Laboratory 70

MVJCE


SOFTWARE ENGINEERING

06IS51

MVJCE


SOFTWARE ENGINEERING

SYLLABUS Subject Code: 06IS61 I.A. Marks : 25 Hours/Week : 04 Exam Hours: 03 Total Hours : 52 Exam Marks: 100

PART - A 1. Overview 6 Hrs Introduction: FAQ's about software engineering, Professional and ethical responsibility. Socio-Technical systems: Emergent system properties; Systems engineering; Organizations, people and computer systems; Legacy systems. 2. Critical Systems, Software Processes 6 Hrs Critical Systems: A simple safety-critical system; System dependability; Availability and reliability. Software Processes: Models, Process iteration, Process activities; The Rational Unified Process; Computer-Aided Software Engineering. 3. Requirements 7 Hrs Software Requirements: Functional and Non-functional requirements; User requirements; System requirements; Interface specification; The software requirements document. Requirements Engineering Processes: Feasibility studies; Requirements elicitation and analysis; Requirements validation; Requirements management. 4. System models, Project Management 7 Hrs System Models: Context models; Behavioral models; Data models; Object models; Structured methods. Project Management: Management activities; Project planning; Project scheduling; Risk management.

PART - B 5. Software Design 7 Hrs Architectural Design: Architectural design decisions; System organization; Modular decomposition styles; Control styles.Object-Oriented design: Objects and Object Classes; An Object-Oriented design process; Design evolution. 6. Development 6 Hrs Rapid Software Development: Agile methods; Extreme programming; Rapid application development.Software Evolution: Program evolution dynamics; Software maintenance; Evolution processes; Legacy system evolution. 7. Verification and Validation 7 Hrs Verification and Validation: Planning; Software inspections; Automated static analysis; Verification and formal methods. Software testing: System testing; Component testing; Test case design; Test automation. 8. Management 6 Hrs Managing People: Selecting staff; Motivating people; Managing people; The People Capability Maturity Model. Software Cost Estimation: Productivity; Estimation techniques; Algorithmic cost modeling, Project duration and staffing.

MVJCE


Text Books: 1. Ian Sommerville: Software Engineering, 8th Edition, Person Education Ltd., 2007. (Chapters-: 1, 2, 3, 4, 5, 6, 7, 8, 11, 14, 17, 21, 22, 23, 25, 26) Reference Books: 1. Roger.S.Pressman: Software Engineering-A Practitioners approach, 7th Edition,McGraw-Hill, 2007. 2. Pfleeger: Software Engineering Theory and Practice, 2nd Edition, Pearson Education, 2001. 3. Waman S Jawadekar: Software Engineering Principles and Practice, Tata McGraw Hill, 2004.

MVJCE


M.V.J. COLLEGE OF ENGINEERING

Department of Computer Science & Engineering LESSON PLAN

Subject: 06IS51– Software Engineering Hours / Week: 5 Total Hours: 62 IA Marks: 25 Total marks: 100

Sl. No.

Chapter Hour No.

Topics to be covered

1. OVERVIEW 1 Introduction: FAQ's about software engineering 2 Professional and ethical responsibility. 3 SocioTechnical systems: Emergent system properties

4 Systems engineering

5 Organizations

6 People and computer systems

7 Legacy systems

8 Legacy systems

2. CRITICAL SYSTEMS, SOFTWARE PROCESSES

9 Critical Systems: A simple safety-critical system

10 System dependability

11 Availability and reliability.

12 Software Processes: Models

13 Process iteration

14 Process activities

15 The Rational Unified Process

16 Computer-Aided Software Engineering

3. . REQUIREMENTS 17 Software Requirements: Functional and Non

functional requirements

18 User requirements; 19 System requirements

20 Interface specification

21 Requirements Engineering Processes

22 The software requirements document

23 Feasibility studies

24 Requirements elicitation and analysis

MVJCE


25 Requirements validation; Requirements management

4. System models,

Project Management

26 System Models: Context models

27 Behavioral models

28 Data models; Object models; 29 Structured methods 30 Project Management 31 Management activities

32 Project planning; 33 Project scheduling

34 Risk management

5. Software Design 35 Architectural Design: Architectural design decisions

36 System organization;

37 Modular decomposition styles;

38 Control styles

39 Object-Oriented design: Objects and Object Classes

40 An Object-Oriented design process

41 Design evolution

6. Development 42 Rapid Software Development: Agile methods

43 Extreme programming;

44 Rapid application development.

45 Software Evolution: Program evolution dynamics

46 Software maintenance; Evolution processes

47 Legacy system evolution

7. Verification and Validation

48 Verification and Validation: Planning;

49 Software inspections; Automated static analysis 50 Verification and formal methods.

51 Software testing: System testing

52 Component testing;

53 Test case design

54 Test automation.

MVJCE


8. Management 55 Managing People: Selecting staff; Motivating people

56 Managing people; The People 57 Capability Maturity Model. 58 Software Cost Estimation

59 Productivity

60 Estimation techniques 61 Algorithmic cost modeling 62 Project duration and staffing.

MVJCE


M.V.J. COLLEGE OF ENGINEERING Department of Computer Science & Engineering

QUESTION BANK

Class: VI Semester Hours / Week: 4 Subject: 06IS51– Software Engineering Total Hours: 52 IA Marks: 25 Total marks: 100

1. What is Requirement Engineering? 2. What are Functional and Non Functional Requirements in Software Engineering ? 3. What is SRS? 4. What are the Different types of Architectures in Software Engineering? 5. What are use cases and class diagrams in Software Engineering? 6. What are sequence diagram? What are package diagram? What are collaboration diagram? 7. What is a Good Software Design? 8. What are Design patterns? 9. What are the characteristics of good design? Name some Design Tools? 10. What is SDLC? What are the various SDLC models? Explain them 11. What is RUP and PSP? 12. What are the Different types of Testing? How to design a Test Case? 13. With a neat diagram explain the different stages of Requirement Engineering process. 14. Why elicitation and analysis a difficult process. Explain giving reasons. 15. Explain in detail about View Point Oriented Elicitation. 16. Explain with examples the different types of functional and non-functional requirements. 17. Write the differences between Evolutionary and Throw-away Prototyping. 18. What is Prototyping? What are the benefits of developing a prototype? 19. Give description about the following: 1.domain requirements 2.Enduring requirements 3. Data Dictionary 4.Design abstractions 5. S/W reliability 20. Can you name some limitations of a web environment vs. a Windows environment? 21. What is rapid prototyping technique? Explain the different types of rapid prototyping techniques. 22. Explain different types of user interaction styles. Give advantages, disadvantages. 23. Write in detail about object oriented design process. 24. What are the two approaches to control models at the Architectural level? 25. What is modular decomposition? Explain dataflow model of an invoice processing system. 26. Draw and explain sequence diagram and state diagram for typical weather station. 27. What are the guidelines to be followed while using color in a user interface? 28. With an example describe the repository model and give its advantages and disadvantages. 29. Explain the structure of s/w requirement s document. 30. Illustrate with two examples for object and object class. 31. What is CASE workbench? Describe the tools included in an analysis and design workbench. 32. Write a note about user interface design principles. 33. Describe an s/w process with Throwaway prototyping. What are the problems with this approach? 34 Define Bug Life Cycles? What is Metrics? 35 What is a Test procedure? 36 What is the difference between SYSTEM testing and END-TO-END testing? 37 What is Tractability Matrix? Is there any interchangeable term for Traceability Matrix? Are Tractability Matrix and Test Matrix same or Different? 38 What is the difference between an exception and an error? 39 Correct bug tracking process - Reporting, Re-testing, Debugging?

MVJCE


40 What is the difference between bug and defect? 41 How much time is/should be allocated for testing out of total Development time based on industry standards? 42 What are test bugs? 43 Define Quality - bug free, Functionality working or both? 44 What is the purpose of software testing’s - Bug removal, System’s functionality working, quality or all? 45 What is the major difference between Web services & client server environment? 46 What is Scalability testing? Which tool is used? 47 What's your favorite Design Pattern? 48 What is custom object? What it contains. Difference between custom & standard objects. 49 Which debugging window allows you to see the methods called in the order they were called? 50 What is the difference between shadow and override? 51 What is class? What is object explain it. Describe the principles of OOPS.What is OOPS? 52 Which items do you normally place under version control? 53 How can you make sure that team members know who changed what in a software project? 54 Do you know the differences between tags and branches? When do you use which? 55 How would you manage changes to technical documentation, like the architecture of a product? 56 How do you deal with changes that a customer wants in a released product? 57 Are there differences in managing versions and releases? 58 How many of the three variables scope, time and cost can be fixed by the customer? 59 Who should make estimates for the effort of a project? Who is allowed to set the deadline? 60 Which kind of diagrams do you use to track progress in a project? 61What is the difference between iteration and an increment?

MVJCE


MVJCE


SYSTEM SOFTWARE 06CS52

MVJCE


SYSTEMS SOFTWARE

Subject Code: 06CS52 I.A. Marks : 25 Hours/Week : 04 Exam Hours: 03 Total Hours : 52 Exam Marks: 100

PART - A 1. Machine Architecture 6 Hrs Introduction, System Software and Machine Architecture, Simplified Instructional Computer (SIC) - SIC Machine Architecture, SIC/XE Machine Architecture, SIC Programming Examples. 2. Assemblers -1 6 Hrs Basic Assembler Function - A Simple SIC Assembler, Assembler Algorithm and Data Structures, Machine Dependent Assembler Features - Instruction Formats & Addressing Modes, Program Relocation. 3. Assemblers -2 6 Hrs Machine Independent Assembler Features – Literals, Symbol-Definition Statements, Expression, Program Blocks, Control Sections and Programming Linking, Assembler Design Operations - One-Pass Assembler, Multi-Pass Assembler, Implementation Examples – MASM Assembler. 4. Loaders And Linkers 8 Hrs Basic Loader Functions - Design of an Absolute Loader, A Simple Bootstrap Loader, Machine-Dependent Loader Features – Relocation, Program Linking, Algorithm and Data Structures for a Linking Loader; Machine-Independent Loader Features - Automatic Library Search, Loader Options, Loader Design Options - Linkage Editor, Dynamic Linkage, Bootstrap Loaders, Implementation Examples - MS-DOS Linker.

PART - B 5. Editors And Debugging Systems 6 Hrs Text Editors - Overview of Editing Process, User Interface, Editor Structure, Interactive Debugging Systems - Debugging Functions and Capabilities, Relationship With Other Parts Of The System, User- Interface Criteria 6. Macro Processor 8 Hrs Basic Macro Processor Functions - Macro Definitions and Expansion, Macro Processor Algorithm and Data Structures, Machine-Independent Macro Processor Features - Concatenation of Macro Parameters, Generation of Unique Labels, Conditional Macro Expansion, Keyword Macro Parameters, Macro Processor Design Options - Recursive Macro Expansion, General-Purpose Macro Processors, Macro Processing Within Language Translators, Implementation Examples – MASM Macro Processor, ANSI C Macro Processor. 7. Lex and Yacc – 1 6 Hrs Lex and Yacc - The Simplest Lex Program, Recognizing Words With LEX, Symbol Tables, Grammars, Parser-Lexer Communication, The Parts of Speech Lexer, A YACC Parser, The Rules Section, Running LEX and YACC, LEX and Hand- Written Lexers, Using LEX – Regular Expression, Examples of Regular Expressions, A Word Counting Program, Parsing a Command Line.

MVJCE


8. Lex And Yacc - 2 6 Hrs Using YACC – Grammars, Recursive Rules, Shift/Reduce Parsing, What YACC Cannot Parse, A YACC Parser - The Definition Section, The Rules Section, Symbol Values and Actions, The LEXER, Compiling and Running a Simple Parser, Arithmetic Expressions and Ambiguity, Variables and Typed Tokens. Text Books: 1. Leland.L.Beck: System Software, 3rd Edition, Addison-Wesley, 1997. 2. John.R.Levine, Tony Mason and Doug Brown: Lex and Yacc, O'Reilly, SPD, 1998. Reference Books: 1. D.M.Dhamdhere: System Programming and Operating Systems, 2nd Edition, Tata McGraw - Hill, 1999.

MVJCE


M.V. J. COLLEGE OF ENGINEERING Department of Computer Science & Engineering

SYSTEMS SOFTWARE

Lesson Plan Subject Code: 06CS52 I.A. Marks : 25 Hours/Week : 05 Exam Hours: 03 Total Hours : 62 Exam Marks: 100

S.No Chapter Hour

Topics to be covered

1. PART- A

Machine Architecture

1 Introduction 2 System Software and Machine Architecture 3 Simplified Instructional Computer (SIC) 4 SIC Machine Architecture 5 SIC/XE Machine Architecture 6 SIC/XE Machine Architecture 7 SIC Programming Examples

2.

Assemblers-1

8 Basic Assembler Function 9 A Simple SIC Assembler 10 Assembler Algorithm and Data Structures 11 Assembler Algorithm and Data Structures 12 Machine Dependent Assembler Features 13 Instruction Formats 14 Addressing Modes 15 Program Relocation

3.

Assemblers-2

16 Machine Independent Assembler Features 17 Literals, Symbol-Definition Statements 18 Expression, Program Blocks 19 Control Sections and Programming Linking 20 Assembler Design Operations, 21 One-Pass Assembler 22 Multi-Pass Assembler, Implementation

Examples – MASM Assembler 4.

Loaders

And Linkers

23 Basic Loader Functions - Design of an Absolute Loader

24 A Simple Bootstrap Loader, Machine-Dependent Loader Features- Relocation

25 Program Linking, Algorithm and Data Structures for a Linking Loader

26 Machine-Independent Loader Features - Automatic Library Search

27 Loader Options, Loader Design Options 28 Linkage Editor 29 Dynamic Linkage, Bootstrap Loaders 30 Implementation Examples - MS-DOS

Linker

MVJCE


5.

PART- B

Editors and Debugging Systems

31 Text Editors 32 Overview of Editing Process 33 User Interface 34 Editor Structure 35 Interactive Debugging Systems 36 Debugging Functions and Capabilities 37 Relationship With Other Parts Of The System 38 User- Interface Criteria

6.

Macro Processor

39 Basic Macro Processor Functions - Macro Definitions and Expansion

40 Macro Processor Algorithm and Data Structures 41 Machine-Independent Macro Processor Features 42 Concatenation of Macro Parameters 43 Generation of Unique Labels 44 Conditional Macro Expansion 45 Keyword Macro Parameters 46 Macro Processor Design Options - Recursive

Macro Expansion 47 General-Purpose Macro Processors 48 Macro Processing Within Language Translators 49 Implementation Examples – MASM Macro

Processor, ANSI C Macro Processor 7

Lex and Yacc -1 50 Lex and Yacc- The Simplest Lex program 51 Recognizing Words With LEX, Symbol Tables 52 Grammars, Parser-Lexer Communication, The

Parts of Speech Lexer 53 A YACC Parser, The Rules Section 54 Running LEX and YACC, , LEX and Hand-

Written Lexers 55 Using LEX – Regular Expression, Examples of

Regular Expressions 56 A Word Counting Program, Parsing a Command

Line 57 Using YACC – Grammars, Recursive Rules

8 Lex and Yacc -2

58 Shift/Reduce Parsing, What YACC Cannot Parse, A YACC Parser

59 The Definition Section, The Rules Section, Symbol Values and Actions

60 The LEXER, Compiling and Running a Simple Parser

61 Arithmetic Expressions and Ambiguity 62 Variables and Typed Tokens

MVJCE


M.V.J. College of Engineering

Department of Computer Science& Engineering

Model Question Paper Class: B.E. V Semester Total Hours: 52 Subject: Systems Software Hours / week:04 Subject Code: 06CS52 IA Marks: 25

1. Explain the concept of System Software and Machine Architecture 2. Briefly explain SIC Machine Architecture 3. Briefly explain SIC/XE Machine Architecture 4. Write the instruction format of Traditional (CISC) Machines 5. Briefly explain VAX Architecture & Pentium Pro Architecture 6. Differentiate between JSUB and RSUB. 7. Write the instruction format RISC Machines with example 8. With a diagram explain Ultra SPARC Architecture 9. With a diagram explain Cray T3E Architecture. 10. Write a short note on basic assembler function 11. Briefly explain about A Simple SIC Assembler 12. With a neat example explain Assembler Algorithm and Data Structures 13. Write a short note on Machine Dependent Assembler Features 14. What is Instruction Formats & Addressing Modes in assemblers 15. With a neat diagram Explain Program Relocation 16. Write a Short on Machine Independent Assembler Features 17. Explain Literals, Symbol-Definition Statements Expression with example 18. How Program Blocks, Control Sections and Programming Linking in Assembler will work give

example 19. Briefly Explain One-Pass Assembler 20. What is Multi-Pass Assembler 21. Explain about MASM Assembler, SPARC Assembler 22. Write a short note on Basic Loader Functions – 23. Explain Design of an Absolute Loader 24. Write a algorithm for a Simple Bootstrap Loader and Explain detail 25. Write Machine-Dependent Loader Features 26. What is Relocation 27. What is Program Linking 28. Write Machine-Independent Loader Features 29. Explain Automatic Library Search 30. Explain Linkage Editor 31. Explain briefly Bootstrap Loaders 32. Explain Basic Macro Processor Functions 33. Briefly explain Macro Definitions and Expansion 34. Explain Macro Processor Algorithm and Data Structures 35. Explain features of Machine-Independent Macro Processor 36. Explain with example Concatenation of Macro Parameters 37. How to Generate of Unique Labels 38. Explain with example Conditional Macro Expansion 39. Describe General-Purpose Macro Processors 40. Explain Macro Processing Within Language Translators 41. Write Lex Program to find vowels and consonants

MVJCE


42. Define Symbol Tables 43. What is Grammars 44. Explain Parser-Lexer Communication 45. Define YACC Parser 46. Explain the sections in YAAC Parser 47. How to Run LEX and YACC 48. Explain - Regular Expression Using LEX, with Examples 49. Write a program to count words in a command line 50. What is Shift/Reduce Parsing,

MVJCE


MVJCE


OPERATING SYSTEMS 06CS53

MVJCE


OPERATING SYSTEM

Syllabus Subject Code: 06CS53 I.A. Marks : 25 Hours/Week : 04 Exam Hours: 03 Total Hours : 52 Exam Marks: 100

PART – A 1. Introduction to Operating Systems, System structures 6 Hrs What operating systems do; Computer System organization; Computer System Architecture; Operating System structure; Operating System operations; Process Management; Memory management; Storage management; Protection and security; Distributed system; Special-purpose systems; Computing environments. Operating System Services; User - Operating System interface; System calls; Types of system calls; System programs; Operating System design and implementation; Operating System structure; Virtual machines; Operating System generation; System boot. 2. Process Management 7Hrs Process concept; Process scheduling; Operations on processes; Inter-process Communication. Multi-Threaded Programming: Overview; Multithreading models; Thread Libraries; threading issues. Process Scheduling: Basic concepts; Scheduling criteria; Scheduling algorithms; Multiple-Processor scheduling; Thread scheduling. 3. Process Synchronization 7 Hrs Synchronization: The Critical section problem; Peterson’s solution; Synchronization hardware; Semaphores; Classical problems of synchronization; Monitors. 4. Deadlocks 6 Hrs Deadlocks: System model; Deadlock characterization; Methods for handling deadlocks; Deadlock prevention; Deadlock avoidance; Deadlock detection and recovery from deadlock.

PART - B 5. Memory Management 7Hrs Memory Management Strategies: Background; Swapping; Contiguous memory allocation; Paging; Structure of page table; Segmentation. Virtual Memory Management: Background; Demand paging; Copy-on-write; Page replacement; Allocation of frames; Thrashing. 6. File System, Implementation of File System 7 Hrs File System: File concept; Access methods; Directory structure; File system mounting; File sharing; Protection. Implementing File System: File system structure; File system implementation; Directory implementation; Allocation methods; Free space management. 7. Secondary Storage Structures, Protection 6 Hrs Mass storage structures; Disk structure; Disk attachment; Disk scheduling; Disk

MVJCE


management; Swap space management. Protection: Goals of protection, Principles of protection, Domain of protection, Access matrix, Implementation of access matrix, Access control, Revocation of access rights, Capability-Based systems. 8. Case Study: The Linux Operating System 6 Hrs Linux history; Design principles; Kernel modules; Process management; Scheduling; Memory management; File systems, Input and output; Inter-process communication. Text Books: 1. Abraham Silberschatz, Peter Baer Galvin, Greg Gagne: Operating System Principles, 7th edition, Wiley-India, 2006. (Chapters: 1, 2, 3.1 to 3.4 , 4.1 to 4.4, 5.1 to 5.5, 6.1 to 6.7, 7, 8.1 to 8.6, 9.1 to 9.6, 10, 11.1 to 11.5, 12.1 to 12.6, 17.1 to 17.8, 21.1 to 21.9) Reference Books: 1. D.M Dhamdhere: Operating systems - A concept based Approach, 2nd Edition, Tata McGraw- Hill, 2002. 2. P.C.P. Bhatt: Operating Systems, 2nd Edition, PHI, 2006. 3. Harvey M Deital: Operating systems, 3rd Edition, Addison Wesley, 1990.

MVJCE


M.V.J COLLEGE OF ENGINEERING DEPT OF COMPUTER SCIENCE & ENGINEERING

LESSON PLAN - OPERATING SYSTEMS

SUBJECT CODE: 06CS53 IA MARKS: 25 HOURS/WEEK: 5 EXAM HOURS: 3 TOTAL HOURS: 62 EXAM MARKS: 100

SL NO CHAPTER

HOUR NO

TOPICS TO BE COVERED

1 Introduction to Operating Systems, System structures

1 Introduction to OS, What is an OS, Main frame systems, Desktop systems

2 Multiprocessor systems, Distributed system

3 Clustered systems, Real-time systems, Batch systems, concepts of multiprogramming & time sharing

4 Handheld system, Feature migration, computing Environments

5 Operating system structures :Operating system components and services

6 System calls, System programs

7 System structure

8 Virtual machines

2 Process Synchronization

9 Process concept, Process scheduling, operation on processes

10 Introduction to co-operating processes

11 Inter process communication

12 Threads overview, Multi threading models, Threading Issues

13 P Threads, Java Threads

14 Introduction to CPU scheduling criteria

15 Scheduling algorithms

16 Multi-processor scheduling

17 Real time scheduling,

18 Algorithm & evaluation

3 Deadlocks

19 The critical section problem

20 Synchronization hard ware

21 Semaphores

22 Semaphores

23 Classical problems of synchronization

24 Critical regions

25 Monitors

26 Dead locks- system model

27 Dead lock characterization

MVJCE


28 Methods for handling deadlocks

29 Dead lock prevention

30 Avoidance & detection

31 Recovery from dead lock

4 Memory management

32 Combined approach to dead lock handling 33 Memory management- logical & physical address space.

34 Swapping schemes

35 Contiguous allocation schemes

36 Paging & segmentation concepts

37 Segmentation with paging

38 Virtual memory- demand paging & its performance

39 Process creation

40 Page replacement algorithms 41 Allocation of frames

42 thrashing

5 File System, Implementation of File System

43 File systems concept, access methods

44 Directory structure

45 File system mounting

46 File system Implementation

47 Allocation methods

48 Directory the implementation

49 Free space management

6

Secondary Storage Structures, Protection

50 Mass storage structures: Disk structure, Disk scheduling methods

51 Disk management, swap-space management

52 Protection and Security: Goals of protection

53 Domain of protection

54 Access matrix, Implementation of Access Matrix

55 Revocation of access Rights.

56 The security problem, Authentication 57 Program threats System threats

58 Securing system and facilities, Intrusion Detection, Cryptography

7

Case Study: The Linux Operating System

59 Case study- Linux Os: design principals

60 Kernel modules, process management

61 Scheduling memory management

62 File systems, I/O IPC

MVJCE


06CS53 OPERATING SYSTEM

QUESTION BANK

1. What is an Operating system? What are the functions of OS? Explain. 2. Define the essential properties of the following types of operating systems:

i. Main Frame ii. Desktop iii. Real-time iv. Multi Processor v. Distributed

vi. Clustered vii. Hand-held

3. What are the five major activities of an operating system in regard to process management? 4. What are the three major activities of an operating system in regard to memory management? 5. What are the three major activities of an operating system in regard to secondary-storage

management? 6. What are the five major activities of an operating system in regard to File management? 7. What is the purpose of command interpreter? Why is it usually separate form the Kernel? 8. List out the services provided by the operating system. 9. Explain the different types of CPU schedulers? 10. What are the differences between user-level threads and kernel supported threads. 11. What is purpose of system calls and system programs? 12. Describe the differences among short-term, medium-term and long term scheduling. 13. Describe the actions taken by a kernel to switch context between processes. 14. Describe the process states with the help of process transition diagram. 15. What are the benefits and demerits of each of the following?

i. Direct and indirect communication ii. Symmetric and asymmetric communication iii. Automatic and explicit buffering iv. Fixed size and variable size messages. v. Send by copy and send by reference

16. Explain multithreading with examples that improve performance over single threaded solutions.

17. What are the two differences between user –level threads and Kernel level threads? Under what circumstances is one type better than the other?

18. What resources are used when a thread is created? How do they differ from those used when a process is created?

19. Define the actions taken by kernel to context switch between kernel level threads. 20. Give the differences between pre-emptive and non-preemptive scheduling. 21. What is CPU scheduling and also explain CPU scheduler 22. Explain the differences in the degree to which the following scheduling algorithms

discriminate in favor of short process. i. FCFS

ii. RR Multilevel Feed back Queues

23. Explain priority scheduling and shortest job first scheduling with an example.

MVJCE


24. What are called as co-operating processes? Explain the necessity of mutual exclusion with an example.

25. What is the meaning of term busy waiting? What other kinds of waiting are there in an operating system.

26. What do you mean by deadlock? Give three general examples not related to computer system

environment. 27. Is it possible to have a deadlock involving only one process? Explain. 28. Define deadlock. List and elaborate the necessary conditions for deadlock to occur. 29. What is semaphore? Explain. 30. Explain the producer consumer problem related to cooperating processes 31. What are monitors? Explain. 32. Explain the Dining Philosophers Problem with respect to Monitors. 33. Explain the differences between Physical and Logical addresses. 34. Write a brief note on overlays. 35. Explain the differences and the internal and external fragmentation. 36. Describe the following allocation algorithms.

i. First-fit ii.Best fit iii.Worst fit 37. Why are segmentation and paging sometimes combined into one scheme? 38. Explain demand paging in detail. 39. Describe a mechanism by which one segment could belong to the address space of two

different processes. 40. Explain why it is easier to share a re-entrant module using segmentation than it is to so when

pure paging is used. 41. What is banker’s algorithm? Explain. 42. Explain the 4 necessary conditions for Deadlock to occur 43. Explain Deadlock Detection Algorithm with an Example. 44. Explain the steps involved in Deadlock Recovery. 45. Discuss the following page replacement algorithm with an example.

i. Optimal ii LRU 46. Explain with neat diagram the internal and external fragmentation. 47. Define file systems? Explain the different directory structure. 48. Discuss the different file protection schemes? 49. What are the different file access methods? Explain. 50. What is disk scheduling? Explain any three disk scheduling methods with e.g.? 51. Explain process and memory management in Linux? 52. Explain the design principles of Linux Operating System.

MVJCE


MVJCE


DATABASE MANAGEMENT SYTEMS 06CS54

MVJCE



DATABASE MANAGEMENT SYSTEMS

Syllabus

Subject Code : 06CS54 IA Marks : 25 No. of Lecture Hrs./ Week : 04 Exam Hours : 03 Total No. of Lecture Hrs. : 52 Exam Marks : 100 PART - A

UNIT – 1 6 Hours

INTRODUCTION: Introduction; An example; Characteristics of Database approach; Actors on the

screen; Workers behind the scene; Advantages of using DBMS approach; A brief history of database

applications; when not to use a DBMS. Data models, schemas and instances; Three-schema architecture

and data independence; Database languages and interfaces; The database system environment;

Centralized and client-server architectures; Classification of Database Management systems.

UNIT – 2 6 Hours

ENTITY-RELATIONSHIP MODEL : Using High-Level Conceptual Data Models for Database

Design; An Example Database Application; Entity Types, Entity Sets, Attributes and Keys; Relationship

types, Relationship Sets, Roles and Structural Constraints; Weak Entity Types; Refining the ER Design;

ER Diagrams, Naming Conventions and Design Issues; Relationship types of degree higher than two.

UNIT – 3 8 Hours

RELATIONAL MODEL AND RELATIONAL ALGEBRA: Relational Model Concepts; Relational

Model Constraints and Relational Database Schemas; Update Operations, Transactions and dealing with

constraint violations; Unary Relational Operations: SELECT and PROJECT;

Relational Algebra Operations from Set Theory; Binary Relational Operations : JOIN and DIVISION;

Additional Relational Operations; Examples of Queries in Relational Algebra; Relational Database

Design Using ER- to-Relational Mapping.

UNIT – 4 6 Hours

SQL - 1: SQL Data Definition and Data Types; Specifying basic constraints in SQL; Schema change

statements in SQL; Basic queries in SQL; More complex SQL Queries.

MVJCE


PART - B

UNIT – 5 6 Hours

SQL - 2: Insert, Delete and Update statements in SQL; Specifying constraints as Assertion and Trigger;

Views (Virtual Tables) in SQL; Additional features of SQL; Database programming issues and

techniques; Embedded SQL, Dynamic SQL; Database stored procedures and SQL / PSM.

UNIT – 6 6 Hours

DATABASE DESIGN - 1: Informal Design Guidelines for Relation Schemas; Functional

Dependencies; Normal Forms Based on Primary Keys; General Definitions of Second and Third Normal

Forms; Boyce-Codd Normal Form.

UNIT – 7 6 Hours

DATABASE DESIGN: Properties of Relational Decompositions; Algorithms for Relational Database

Schema Design; Multivalued Dependencies and Fourth Normal Form; Join Dependencies and Fifth

Normal Form; Inclusion Dependencies; Other Dependencies and Normal Forms.

UNIT - 8

TRANSACTION MANAGEMENT 8 Hours

The ACID Properties; Transactions and Schedules; Concurrent Execution of Transactions; Lock- Based

Concurrency Control; Performance of locking; Transaction support in SQL; Introduction to crash

recovery; 2PL, Serializability and Recoverability; Lock Management; Introduction to ARIES; The log;

Other recovery-related structures; The write-ahead log protocol; Checkpointing; Recovering from a

System Crash; Media Recovery; Other approaches and interaction with concurrency control.

Text Books: 1. Elmasri and Navathe: Fundamentals of Database Systems, 5th Edition, Pearson Education, 2007.

(Chapters 1, 2, 3 except 3.8, 5, 6.1 to 6.5, 7.1, 8, 9.1, 9.2 except SQLJ, 9.4, 10) 2. Raghu Ramakrishnan and Johannes Gehrke: Database Management Systems, 3rd

Edition, McGraw-Hill, 2003. (Chapters 16, 17.1, 17.2, 18) Reference Books: 1. Silberschatz, Korth and Sudharshan: Data base System Concepts, 6th Edition, Mc-GrawHill, 2010. 2. C.J. Date, A. Kannan, S. Swamynatham: An Introduction to Database Systems, 8th Edition, Pearson Education, 2006.

MVJCE



DATABASE MANAGEMENT SYSTEMS

Lesson Plan

Subject Code: 06CS54 I.A. Marks : 25 Hours/Week : 04 Exam Hours: 03 Total Hours : 52 (62*50mins) Exam Marks: 100

Sl.No Chapter Hour Topics to be covered

1. INTRODUCTION

1

Introduction; An example; Characteristics of Database approach; Actors on the screen; Workers behind the scene

2 Advantages of using DBMS approach; A brief history of database applications; when not to use a DBMS

3 Data models, schemas and instances

4 Three-schema architecture and data Independence; Database languages and interfaces

5 The database system environment 6 Centralized and client-server architectures 7 Classification of Database Management systems

2. ENTITY-RELATIONSHIP MODEL

8 Using High-Level Conceptual Data Models for Database Design; An Example Database Application

9 Entity Types, Entity Sets, Attributes and Keys 10 Relationship types, Relationship Sets 11 Roles and Structural Constraints 12 Weak Entity Types; Refining the ER Design 13 ER Diagrams 14 Naming Conventions and Design Issues 15 Relationship types of degree higher than two

3.

RELATIONAL MODEL AND RELATIONAL ALGEBRA

16 Relational Model Concepts

17 Relational Model Constraints and Relational Database Schemas

18 Update Operations 19 Transactions and dealing with constraint violations 20 Unary Relational Operations: SELECT and PROJECT 21 Relational Algebra Operations from Set Theory 22 Binary Relational Operations : JOIN and DIVISION

23 Additional Relational Operations; Examples of Queries in Relational Algebra

24 Relational Database Design Using ER- to-Relational Mapping

4. SQL - 1

25 SQL Data Definition and Data Types 26 Specifying basic constraints in SQL 27 Schema change statements in SQL 28 Basic queries in SQL 29 Basic queries in SQL 30 More complex SQL Queries

MVJCE


5. SQL - 2

31 Insert, Delete and Update statements in SQL 32 Specifying constraints as Assertion and Trigger 33 Views (Virtual Tables) in SQL 34 Additional features of SQL 35 Database programming issues and techniques 36 Embedded SQL, Dynamic SQL 37 Database stored procedures and SQL / PSM.

6. DATABASE DESIGN - 1

38 Informal Design Guidelines for Relation Schemas 39 Informal Design Guidelines for Relation Schemas 40 Functional Dependencies 41 Normal Forms Based on Primary Keys 42 General Definitions of Second 43 Third Normal Forms 44 Boyce-Codd Normal Form

7. DATABASE DESIGN

45 Properties of Relational Decompositions 46 Algorithms for Relational Database Schema Design 47 Multivalued Dependencies 48 Fourth Normal Form 49 Join Dependencies and Fifth Normal Form 50 Inclusion Dependencies 51 Other Dependencies and Normal Forms.

8. TRANSACTION MANAGEMENT

52 The ACID Properties; Transactions and Schedules 53 Concurrent Execution of Transactions 54 Lock- Based Concurrency Control

55 Performance of locking 56 Transaction support in SQL; Introduction to crash recovery 57 2PL, Serializability and Recoverability 58 Lock Management 59 Introduction to ARIES; The log

60 Other recovery-related structures; The write-ahead log protocol

61 Checkpointing; Recovering from a System Crash

62 Media Recovery; Other approaches and interaction with concurrency control.

MVJCE



Model Questions

Class: B.E. V Semester Total Hours: 52 Subject: Data base management systems Hours / week: 04 Subject Code: 06CS54 IA Marks: 25

51. Write the general architecture of typical DBMS. What are the effects of data independence in

DBMS?

52. What are the different levels of abstraction of a DBMS?

53. Write an ER diagram for a typical bus reservation system.

54. What is cardinality ratio? What are the different types of cardinality ratio in a binary

relationship?

55. Define primary key.

56. Define weak entity.

57. Explain Multi valued attribute.

58. What do you mean integrity w.r.t. database? Explain entity integrity and referential integrity.

59. Define Different set operations in relation algebra. Given on example for each.

60. List of aggregate functions commonly used in relational algebra.

61. Bring out different clauses of SELECT –FROM WHERE statement.

62. What is the significance of views in SQL?

63. Give the example of SQL statement to update data.

64. Use the schema shown in question 3.b and answer the queries SQL.

65. What are the anomalies if the proper design of a database Is not carrier out?

66. Illustrate them with an example for each type.

67. Give different inference rules of functional dependencies.

68. Give the algorithm to check dependency preservation and loss less join.

69. Define the terms: 4NF, BCNF.

70. Define inclusion dependency, DKNF, template dependency, 5NF.

71. Compare discretionary access control with mandatory access control.

72. Explain how strict 2-phase locking is implemented. Show them with an example.

73. What are the 3 properties of a transaction specified in SQL for locking? Define each of them.

74. Illustrate with an example how concurrency is controlled using a B+ tree.

75. Highlight different activities involved in system crash recovery.

76. Explain ER relation mapping

77. Define Embedded SQL.

MVJCE


78. ACID properties

79. Write note on ahead lock

80. Explain Concurrency Control and Performance of locking?

81. Define Transaction support in SQL?

82. Explain Recovering from the System Crash and Media.

83. Illustrate the interaction with concurrency control.

84. Define SQL Data Definition and Data Types.

85. Given the basic constraints in SQL?

86. Write note more complex. Queries

87. List all types of SQL Queries.

88. Illustrate the Database Languages and interface.

89. Classification of Database Management systems.

90. Give note on Centralized and client-server architectures

91. Explain Timestamp ordering with an example

92. Discuss about dead lock and starvation

93. Explain database Recovery technique based on deferred update

94. Discuss discretionary access control based on granting/revoking of privileges

95. Explain the different relational model constraints and possible violation during update operations

96. What is multi valued dependency? What type of constraints does it specify? When does it arise?

97. Why null values are considered bad?

98. Define join dependency and fifth normal form.

99. Explain two phase locking with algorithms

100. Describe the shadow paging recovery technique. Under what circumstances does it not

require a log?

MVJCE


MVJCE


COMPUTER NETWORKS 06CS55

MVJCE


M.V.J COLLEGE OF ENGINEERING Department Of Computer Science & Engineering

SYLLABUS— Computer Networks I

Subject Code :06CS55 IA Marks : 25

No. of Lecture Hrs./ Week : 04 Exam Hours : 03

Total No. of Lecture Hrs. : 52 Exam Marks : 100

PART – A

UNIT – 1 6 Hours

INTRODUCTION: Data Communications; Networks; the Internet; Protocols and Standards; Layered

tasks; The OSI Model and the layers in the OSI model; TCP / IP Protocol Suite.

UNIT – 2 8 Hours

DATA, SIGNALS, AND DIGITAL TRANSMISSION: Analog and digital signals; Transmission

impairment; Data rate limits; Performance; Digital-to-Digital conversion; Analog-to-Digital conversion;

Transmission modes.

UNIT – 3 6 Hours

ANALOG TRANSMISSION AND MULTIPLEXING: Digital - to -Analog conversion; Analog - to -

Analog conversion; Multiplexing; Spread spectrum.

UNIT – 4 6 Hours

TRANSMISSION MEDIA, ERROR DETECTION AND CORRECTION : Twisted pair cable,

Coaxial cable, Fiber-Optic cable, Radio waves, Microwaves, Infrared. Introduction to error detection /

correction; Block coding; linear block codes; Cyclic codes, Checksum.

PART – B

UNIT – 5 7 Hours

DATA LINK CONTROL: Framing; Flow and Error control; Protocols; Noiseless channels; Noisy

channels; HDLC; Point-to-point Protocol-framing, transition phases.

UNIT – 6 7 Hours

MULTIPLE ACCESS, ETHERNET: Random Access; Controlled Access; Channelization. Ethernet:

IEEE standards; Standard Ethernet and changes in the standard; Fast Ethernet; Gigabit Ethernet.

UNIT – 7 6 Hours

WIRELESS LANS AND CONNECTION OF LANS: IEE 802.11; Bluetooth. Connecting devices;

Backbone Networks; Virtual LANs.

MVJCE


UNIT – 8 6 Hours

OTHER TECHNOLOGIES: Cellular telephony; SONET / SDH: Architecture, Layers, Frames; STS

multiplexing. ATM: Design goals, problems, architecture, switching, layers.

TEXT BOOKS:

1. Data Communications and Networking – Behrouz A. Forouzan, 4th Edition, Tata McGraw-Hill, 2006.

REFERENCE BOOKS:

1. Communication Networks: Fundamental Concepts and Key Architectures - Alberto Leon, Garcia and

Indra Widjaja, 3rd Edition, Tata McGraw- Hill, 2004.

2. Data and Computer Communication, William Stallings, 8th Edition, Pearson Education, 2007.

3. Computer Networks: A Systems Approach - Larry L. Peterson and Bruce S. David, 4th Edition,

Elsevier, 2007.

4. Introduction to Data Communications and Networking – Wayne Tomasi, Pearson Education, 2005.

5. Computer and Communication Networks – Nader F. Mir, Pearson Education, 2007.

MVJCE



LESSON PLAN— Computer Networks I

SUBJECT CODE: 06CS55 IA MARKS: 25 HOURS/WEEK: 4 EXAM HOURS: 3 TOTAL HOURS: 52[50min *62 classes] EXAM MARKS: 100

SL NO

CHAPTER HOUR

NO TOPICS TO BE COVERED

1

Introduction

1 Data communication, Networks

2 Internet

3 Protocol and Standard

2

Network Models

4 Layered tasks

5 OSI Model

6 Layers in OSI model

7 TCP/IP Protocol Suite

8 Revision

3 Data and Signals 9 Analog and Digital

10 Digital Signals

11 Transmission Impairment

12 Data rate limits

13 Performance

14 Revision

4

Digital Transmission

15 Digital to Analog Conversion

16 Analog to Digital Conversion

17 Transmission Modes

5

Analog Transmission

18 Digital to Analog Conversion

19 Analog to Analog Conversion

20 Revision

6 Bandwidth Utilization:

Multiplexing and

Spreading

21 Multiplexing

22 Spread Spectrum

23 Revision

MVJCE


7 Transmission Media 24 Guided Media

25 Unguided Media: Wireless

26 Revision

8 Error Detection and

correction

27 Introduction

28 Block Coding

29 Linear Block Codes

30 Cyclic codes

31 Checksum

9 Data link control 32 Framing

33 Flow & Error Control

34 Protocols

35 Noiseless channels

36 Noisy Channels

37 HDLC

38 Point to point control

39 Revision

10 Multiple Access 40 Random Access

41 Controlled Access

42 Channelization

43 Revision

11 Wired LANs: Ethernet 44 IEEE Standards

45 Standard Ethernet

46 Changes in the standard

47 Fast Ethernet

48 Gigabit Ethernet

49 Revision

12 Wireless LANs 50 IEEE 802.11

51 Bluetooth

13 Connecting LANs,

Backbone Networks,

and Virtual LANs

52 Connecting devices

53 Backbone networks

54 Virtual LANs

14 Wireless WANs 55 Cellular Telephony

56 Satellite Networks

MVJCE


15 SONET/SDH 57 Architecture

58 SONET Layers

59 SONET Frames

60 STS Multiplexing

16 ATM 61 ATM

62 Revision

MVJCE


COMPUTER NETWORKS-I: QUESTION BANK

1. Besides bandwidth and latency, what other parameter is needed to give characterization of the

quality of service offered by a network used for digitized voice traffic?

2. List two ways in which the OSI reference model and the TCP/IP reference model are the same. Now

list two ways in which they differ?

3. Why does ATM use small, fixed-length cells?

4. List two advantages and two disadvantages of having international standards for network protocols?

5. What signal-to noise ratio is needed to put a 1 carrier on a 50-kHz line?

6. How much bandwidth is there in 0.1 micron of spectrum at a wavelength of 1micron?

7. In a constellation diagram, all the points lie on a circle centered on the origin. What kind of

modulation is being used?

8. How many frequencies does a full-duplex QAM-64 modem use?

9. Compare the maximum data rate of a noiseless 4-kHz channel using

(a)Analog encoding (e.g., QPSK) with 2 bits per sample.

(b)The T1 PCM system.

10. What is the difference, if any, between the demodulator part of a modem and the coder part of a

CODEC/(after all, both convert analog signals to digital ones.)

11. Consider a different way of looking at the orthogonality property of CDMA chip sequences. Each bit

in a pair of sequences can match or not match. Express the orthogonality property in terms of

matches and mismatches.

12. The following data fragment occurs in the middle of a data stream for which the byte– stuffing

algorithm described in the text is used: A B ESC C ESC FLAG FLAG D. What is the output after

stuffing?

13. A block of bits with n rows and k columns uses horizontal and vertical parity bits for error detection.

Suppose that exactly 4 bits are inverted due to transmission errors. Derive an expression for the

probability that the error will be undetected.

14. Data link protocols almost always put the CRC in a trailer rather than in a header. Why?

15. Frames of 1000 bits are sent over a 1-Mbps channel using a geostationary satellite whose

propagation time from the earth is 270msec. Acknowledgements are always piggybacked onto data

frames. The headers are very short. Three-bit sequence numbers are used. What is the maximum

achievable channel utilization for Stop-and-wait protocol?

16. A 100-km-long cable runs at the T1 data rate. The propagation speed in the cable is 2/3 the speed of

light in vacuum. How many bits fit in the cable?

MVJCE


17. What is the minimum overhead to send an IP packet using PPP? Count only the overhead

introduced by PPP itself, not the IP header overhead.

18. Consider the delay of pure ALOHA versus slotted ALOHA at low load. Which one is less? Explain

your answer?

19. Sketch the differential Manchester encoding for the bit stream of the previous problem. Assume the

line is initially in the low state.

20. How many frames per second can gigabit Ethernet handle? Think carefully and take into account all

the relevant cases. Hint: the fact that it is gigabit Ethernet matters.

21. Give two reasons why networks might use an error-correcting code instead of error detection and

retransmission.

22. Bluetooth supports two types of links between a master and a slave. What are they and what is each

one used for?

23. Explain packets switching?

24. Explain shortest path routing?

25. Explain multicast routing?

26. Explain routing in Ad Hoc networks?

27. Explain in detail about the congestion control Algorithm?

28. Explain the elements of Transport Protocols?

29. Explain UDP?

30. Explain in detail about TCP?

31. Explain in detail about Electronic mail?

32. Explain in detail about the World Wide Web?

33. Explain in detail about cryptography?

34. What is a Cipher text

35. What is a Transposition cipher?

36. What is Symmetric key Algorithm?

37. What is crypt Analysis?

38. What are public and private keys?

39. What is a Substitution Cipher?

40. Explain Triple DES?

41. Explain RSA algorithm?

42. Explain frequency shift keying with neat diagram.

43. Explain the various Digital to analog conversion techniques with neat diagrams.

MVJCE


44. Why do we need Analog to analog conversion? Explain the various analog to analog conversion

techniques with neat diagram

45. What is multiplexing? Explain the various multiplexing techniques with a neat diagram.

46. Explain the application of Frequency Division multiplexing and time division multiplexing with neat

diagram.

47. What is spreading? Explain the various spread spectrum techniques?

48. What is framing? Explain the various techniques of framing with neat diagram.

49. Explain bit stuffing and unstuffy in bit-oriented protocol with examples.

50. What is the difference between noisy and noiseless channel? Explain.

51. Explain stop and wait protocol for noiseless channel.

52. Explain stop and wait ARQ protocol for noisy channels. What are its disambiguates if frames are

unnumbered? Find a solution to the same.

53. Explain Go-Back-N ARQ protocol. What are its disadvantages and how are these disadvantages

overcome by Selective Repeat ARQ? Explain with neat diagrams and algorithms.

54. Explain HDLC protocol with its frame format.

55. Explain Point to point protocol with framing and transition phases.

56. Explain pure ALOHA and derive an equation for throughput S.

57. Explain the term persistent CSMA and non persistent CSMA.

58. Explain the following with example:

a. Reservation

b. Slotted ALOHA

c. CSMA/CA

d. CDMA

e. Polling

f. Channelization

59. Explain the frame format for IEEE 802.3 frame.

60. Explain the various implementations of standard Ethernet at physical layer

61. Explain Fast Ethernet

62. Explain briefly the architecture, frame format, address mechanism and various implementation of

IEEE 802.11 at the physical layer

63. What is blue tooth? Explain its architecture and frame format.

64. Explain back bone network.

65. Explain FDDI and its applications.

66. Explain Virtual LANs.

MVJCE


67. What are transparent bridges? Explain ‘loop problem’ and how is it overcome using various

techniques?

68. How are Hubs different from switches?

69. Write the differences between router, repeater, bridges and gateways.

70. Write a short note on DSL.

71. Explain distance vector routing algorithm by considering an example.

72. Compare data grams and virtual circuits? List the difference between them.

73. What are the different types of routing algorithm? Explain Bellman-ford algorithm with example.

74. Explain flooding algorithm with diagram.

75. Explain with sketches different scheduling approaches to MAC.

76. Explain the classification of LAN based on topology and switching techniques.

77. Describe the token ring LAN structure network along with frame structure.

78. How bridges are used for implementing LANS?

79. Write Short note on DNS.

80. What is the minimum number of bits in a PN sequence if we use FHSS with a channel bandwidth of

B=5 khz and Bss=120 khz

81. If the input slot is 16 bits long (no framing bits) what is the bit stream in each output? The bits arrive

at the demultiplexer as shown below:

82. Define the type of the following destination addresses:

a. 4B:30:10:21:10:1A

b. 46:20:1B:2E:08:EE

c. FF:FF:FF:FF:FF:FF

83. A slotted ALOHA network transmits 200bit frames using a shared channel with 200KBPS

bandwidth. Find the throughput if the system produces:

a. 1000 frames/sec

b. 500 frames/sec

c. 250 frames/sec

84. A radio system uses a 9600B/sec channel for sending call setup requests to a base station the packets

are 120 bits long the time out is 20ms and back-off is uniformly distributed between 1 and 7. What is

10100000 1010101010100000 0111000001111000

TDM

MVJCE


the Smax possible with ALOHA and slotted ALOHA? What is the average delay in each case when

the load is 30% of maximum S of the ALOHA.

MVJCE


MVJCE


FINITE AUTOMATA AND FORMAL LANGUAGES 06CS56

MVJCE


M.V.J. COLLEGE OF ENGINEERING

Department of Computer Science & Engineering

FORMAL LANGUAGES AND AUTOMATA THEORY

SYLLABUS (Common to CSE & ISE)

Sub. Code: 06CS56 IA Marks: 25 Hrs/Week: 04 Exam Hours: 03 Total Hours: 52 Exam Marks: 100

PART – A

Unit I 7 Hrs Introduction to Finite Automata: Introduction to Finite Automata; The central concepts of Automata theory; Deterministic finite automata; Nondeterministic finite automata. Unit II 7 Hrs Finite Automata, Regular Expressions: An application of finite automata; Finite automata with Epsilon-transitions; Regular expressions; Finite Automata and Regular Expressions; Applications of Regular Expressions. Unit III 6 Hrs Regular Languages, Properties of Regular Languages: Regular languages; Proving languages not to be regular languages; Closure properties of regular languages; Decision properties of regular languages; Equivalence and minimization of automata. Unit IV 6 Hrs Context-Free Grammars And Languages: Context –free grammars; Parse trees; Applications; Ambiguity in grammars and Languages.

PART - B Unit V 7 Hrs Pushdown Automata: Definition of the Pushdown automata; the languages of a PDA; Equivalence of PDA’s and CFG’s; Deterministic Pushdown Automata. Unit VI 6 Hrs Properties of Context-Free Languages: Normal forms for CFGs; The pumping lemma for CFGs; Closure properties of CFLs.

MVJCE


Unit VII 7 Hrs Introduction To Turing Machine: Problems that Computers cannot solve; The turning machine; Programming techniques for Turning Machines; Extensions to the basic Turning Machines; Turing Machine and Computers. Unit VIII 6 Hrs Undecidability : A Language that is not recursively enumerable; An Undecidable problem that is RE; Post’s Correspondence problem; Other undecidable problems. Text Books: 1. John E.. Hopcroft, Rajeev Motwani, Jeffrey D.Ullman: Introduction to Automata Theory, Languages and Computation, 3rd Edition, Pearson education, 2007. (Chapters:1.1, 1.5, 2.2 to 2.5, 3.1 to 3.3, 4, 5, 6, 7, 8.1 to 8.4, 8.6, 9.1, 9.2, 9.4.1, 9.5) Reference Books: 1. Raymond Greenlaw, H.James Hoover: Fundamentals of the Theory of Computation, Principles and Practice, Morgan Kaufmann, 1998. 2. John C Martin: Introduction to Languages and Automata Theory, 3rd Edition, Tata McGraw- Hill, 2007. 3. Daniel I.A. Cohen: Introduction to Computer Theory, 2nd Edition, John Wiley & Sons, 2004. 4. Thomas A. Sudkamp: An Introduction to the Theory of Computer Science, Languages and Machines, 3rd Edition, Pearson Education, 2006

MVJCE



LESSON PLAN FORMAL LANGUAGES AND AUTOMATA THEOR Y


Sl.No Unit Hr. No TOPICS TO BE COVERED

1 Introduction to Finite

Automata

1 Introduction to Finite Automata 2 Important Terminologies in Finite Automata 3 The central concepts of automata theory 4 Deterministic Finite Automata (Concept) 5 Deterministic Finite Automata (Solving Example) 6 Nondeterministic Finite Automata (Concept) 7 Nondeterministic Finite Automata (Solving Example) 8 Revision & Solving Exercise Questions

2 Finite Automata,

Regular Expressions

9 An application of finite automata 10 Finite automata with Epsilon-transitions 11 Finite automata with Epsilon-transitions (contd) 12 Regular expressions 13 Finite Automata and Regular Expressions 14 Finite Automata and Regular Expressions (contd) 15 Applications of Regular Expressions 16 Revision & Solving Exercise Questions

3

Regular Languages,

Properties of Regular Languages

17 Regular languages; Proving languages not to be regular languages

18 Closure properties of regular languages 19 Closure properties of regular languages (contd) 20 Decision properties of regular languages 21 Equivalence and minimization of automata 22 Equivalence and minimization of automata(contd) 23 Revision & Solving Exercise Questions

4

Context-Free Grammars And

Languages

24 Context –free grammars 25 Context –free grammars (contd) 26 Parse trees 27 Parse trees 28 Applications 29 Ambiguity in grammars and Languages 30 Revision & Solving Exercise Questions

5

Pushdown Automata

31 Definition of the Pushdown automata 32 The languages of a PDA 33 The languages of a PDA (contd) 34 Equivalence of PDA’s and CFG’s

MVJCE


35 Equivalence of PDA’s and CFG’s (contd) 36 Equivalence of PDA’s and CFG’s (contd) 37 Deterministic Pushdown Automata 38 Revision & Solving Exercise Questions

6

Properties of Context-Free Languages

39 Normal forms for CFGs 40 Normal forms for CFGs 41 The pumping lemma for CFGs;

42 The pumping lemma for CFGs(contd)

43 Closure properties of CFLs 44 Closure properties of CFLs(contd) 45 Revision & Solving Exercise Questions

7

Introduction To Turing Machine

46 Problems that Computers cannot solve 47 The turning machine 48 The turning machine (contd) 49 Programming techniques for Turning Machines 50 Extensions to the basic Turning Machines 51 Extensions to the basic Turning Machines(contd) 52 Turing Machine and Computers 53 Revision & Solving Exercise Questions

8 Undecidability

54 A Language that is not recursively enumerable; 55 An Undecidable problem that is RE 56 Post’s Correspondence problem 57 Post’s Correspondence problem 58 Other undecidable problems 59 Other undecidable problems. 60 Revision & Solving Exercise Questions 61 Solving University Questions 62 Solving University Questions

Signature of Staff Signature of H.O.D

MVJCE



QUESTION BANK FORMAL LANGUAGES AND AUTOMATA THEOR Y


1. What is DFA.Define DFA mathematically. 2. Define Finite Automata.Metion the applications of Finite Automata. 3. Differentiate NFA,DFA, & ∈-NFA. 4. Obtain DFA to accept strings starting with the ab. 5. Obtain a DFA to accept string of ‘0’s and ‘1’s ending with the string 011. 6. Obtain a DFA to accept strings of a’s and b’s with the substring aab. 7. What is equivalence of DFA’s and NFA’s?Explain. 8. Write the algorithm for converting NFA to an equivalent DFA. 9. Convert the following NFA into an DFA

0 1 0,1 0,1

10. Consider the following ∈-NFA ∈ a b c

p {q,r} φ {q} {r} q φ {p} {r} {p,q}

*r φ φ φ φ i) Compute the ∈-closure of each state. ii) Give all the strings of length three or less accepted by the automata. iii) Convert the automata to DFA. 11. Write the procedure to minimize the states of DFA. 12. Define regular expression. 13. Obtain the RE

i) To accept add number 0’s and 1’s. ii) To accept even number of a’s and b’s.

14. Explain the eqivalence relation between Finite automata and regular Expression.

15. Construct an NFA for the expression 01*1. 16. Explain pumping Lemma for regular sets. 17. Explain decision algorithms for regular sets. 18. Explain Context free grammar and context free languages. 19. Explain L(G) for the following

Q0 Q1

Q2

MVJCE


V={S},T={a,b] and p={S->Sb,S->ab} 20. Find L(G) for the grammar

G= ({S},{a},{S->Ss},s} 21. Differentiate leftmost derivation and rightmost derivation. 22. Define context free grammar. 23. What are useless symbols? 24. Explain different normal forms. 25. Explain Chomsky classificaion of languages. 26. For the following grammar find an equivalent grammar in CNF

G=({S,A,B},{a,b},P,S) where P is S->bA/aB A->bAA/aS/a B->aBB/bS/b

27. What is a pushdown automaton? 28. Obtain a pda to accept the language l(M)={WCW R} 29. Is the pda to L(M)={anbn/n>=1} is deterministic or not? 30. Explain the concept of Turing machines with a neat diagram. 31. Obtain TM to accept the language L={w/w(-(0+1)*} containing the substring . 32. State and prove pumping Lemma. 33. What are distinguishable and indistinguishable states? 34. Minimize the following DFA using table –filling algorithm 35. Write DFA to accept w which is string of 0’s and 1’s and is w mod 3=0. 36. What language is accepted by TM? 37. What is multi-tape turing machine?Show how it can be simulated using single tape Turing machine. 38. Obtain a TM to accept the language L={ww r|wΣ(a+b)*} 39. What are the applications of Pumping Lemma? 40. What is an instantaneous description?Expain with respect to PDA. 41. What is the procedure to convert to CFG to PDA? 42. for the grammar S �aABB | aAA A �aBB|a B �bBB|A C �a. Obtain the corresponding PDA. 43. Is the foowing grammar ambiguous? S �aSb|SS|ε 44. Remove the unit production from the grammar S �A|B|Cc

0 1 A B E B C F *C D H D E H E F I *F G B G H B H I C *I A E

MVJCE


A �aBb|B B �aB|bb C �Cc|B 45. Draw a CFG to generate a language consisting of equal number of a’s and b’s

MVJCE


MVJCE


DATABASE APPLICATIONS LAB 06CSL57

MVJCE



SYLLABUS— Database Applications Laboratory

Subject Code: 06CSL57 I.A. Marks : 25 Hours/Week : 03 Exam Hours: 03 Total Hours : 42 Exam Marks: 50 I. Consider the Insurance database given below. The primary keys are underlined and the data types are specified. PERSON (driver – id #: String, name: string, address: strong) CAR (Regno: string, model: string, year: int) ACCIDENT (report-number: int, date: date, location: string) OWNS (driver-id #: string, Regno:string) PARTICIPATED (driver-id: string, Regno:string, report-number:int, damage amount:int) (i) Create the above tables by properly specifying the primary keys and the foreign keys. (ii) Enter at least five tuples for each relation. (iii) Demonstrate how you a. Update the damage amount for the car with a specific Regno in the accident with report number 12 to 25000. b. Add a new accident to the database. (iv) Find the total number of people who owned cars that were involved in accidents in 2008. (v) Find the number of accidents in which cars belonging to a specific model were involved. (vi) Generate suitable reports. (vii) Create suitable front end for querying and displaying the results. II. Consider the following relations for an order processing database application in a company. CUSTOMER (cust #: int , cname: string, city: string) ORDER (order #: int, odate: date, cust #: int, ord-Amt: int) ORDER – ITEM (order #: int, Item #: int, qty: int) ITEM (item # : int, unit price: int) SHIPMENT (order #: int, warehouse#: int, ship-date: date) WAREHOUSE (warehouse #: int, city: string) (i) Create the above tables by properly specifying the primary keys and the foreign keys. (ii) Enter at least five tuples for each relation. (iii) Produce a listing: CUSTNAME, #of orders, AVG_ORDER_AMT, where the middle column is the total numbers of orders by the customer and the last column is the average order amount for that customer. (iv) List the order# for orders that were shipped from all the warehouses that the company has in a specific city. (v) Demonstrate how you delete item# 10 from the ITEM table and make that field null in the ORDER_ITEM table. (vi) Generate suitable reports. (vii) Create suitable front end for querying and displaying the results.

MVJCE


III. Consider the following database of student enrollment in courses & books adopted for each course. STUDENT (regno: string, name: string, major: string, bdate:date) COURSE (course #:int, cname:string, dept:string) ENROLL ( regno:string, course#:int, sem:int, marks:int) BOOK _ ADOPTION (course# :int, sem:int, book-ISBN:int) TEXT (book-ISBN:int, book-title:string, publisher:string, author:string) (i) Create the above tables by properly specifying the primary keys and the foreign keys. (ii) Enter at least five tuples for each relation. (iii) Demonstrate how you add a new text book to the database and make this book be adopted by some department. (iv) Produce a list of text books (include Course #, Book-ISBN, Book-title) in the alphabetical order for courses offered by the ‘CS’ department that use more than two books. (v) List any department that has all its adopted books published by a specific publisher. (vi) Generate suitable reports. (vii) Create suitable front end for querying and displaying the results. IV. The following tables are maintained by a book dealer. AUTHOR (author-id:int, name:string, city:string, country:string) PUBLISHER (publisher-id:int, name:string, city:string, country:string) CATALOG (book-id:int, title:string, author-id:int, publisher-id:int, category-id:int, year:int, price:int) CATEGORY (category-id:int, description:string) ORDER-DETAILS (order-no:int, book-id:int, quantity:int) (i) Create the above tables by properly specifying the primary keys and the foreign keys. (ii) Enter at least five tuples for each relation. (iii) Give the details of the authors who have 2 or more books in the catalog and the price of the books is greater than the average price of the books in the catalog and the year of publication is after 2000. (iv) Find the author of the book which has maximum sales. (v) Demonstrate how you increase the price of books published by a specificpublisher by 10%. (vi) Generate suitable reports. (vii) Create suitable front end for querying and displaying the results. V. Consider the following database for a banking enterprise BRANCH (branch-name:string, branch-city:string, assets:real) ACCOUNT (accno:int, branch-name:string, balance:real) DEPOSITOR (customer-name:string, accno:int) CUSTOMER (customer-name:string, customer-street:string, customer-city:string) LOAN (loan-number:int, branch-name:string, amount:real) BORROWER (customer-name:string, loan-number:int) (i) Create the above tables by properly specifying the primary keys and the foreign keys (ii) Enter at least five tuples for each relation (iii) Find all the customers who have at least two accounts at the Main branch. (iv) Find all the customers who have an account at all the branches located in a specific city. (v) Demonstrate how you delete all account tuples at every branch located in a specific city. (vi) Generate suitable reports. (vii) Create suitable front end for querying and displaying the results.

MVJCE


Instructions: 1. The exercises are to be solved in an RDBMS environment like Oracle or DB2. 2. Suitable tuples have to be entered so that queries are executed correctly. 3. Front end may be created using either VB or VAJ or any other similar tool. 4. The student need not create the front end in the examination. The results of the queries may be displayed directly. 5. Relevant queries other than the ones listed along with the exercises may also be asked in the examination. 6. Questions must be asked based on lots.

MVJCE



LESSON PLAN— Database Applications Laboratory

SUBJECT CODE: 06CSL57 IA MARKS: 25 HOURS/WEEK: 03 EXAM HOURS: 03 TOTAL HOURS: 42 EXAM MARKS: 50

SL NO

Programs to be implemented HOUR NO

1 Introduction- Creating tables & inserting values 1

2 Introduction-Updation, deletion 2

3 Introduction-Report generation 3

4 Insurance database creating & updating tables 4

5 Insurance database, solving queries & report generation 5

6 Company database creating & updating tables 6

7 Company database, solving queries & report generation 7

8 Student database creating & updating tables 8

9 Student database, solving queries & report generation 9

10 Book database creating & updating tables 10

11 Book database, solving queries & report generation 11

12 Bank database creating & updating tables 12

13 Bank database, solving queries & report generation 13

14 Revision 14

MVJCE


ALGORITHMS LAB 06CSL58

MVJCE



ALGORITHMS LABORATORY

SYLLABUS Sub Code : 06CSL58 IA Marks : 25 Hrs/Week : 03 Exam Hours : 03 Total Hrs : 42 Exam Marks : 50 Implement the following using C/C++ Language.

1. Implement Recursive Binary search and Linear search and determine the time required to search an element. Repeat the experiment for different values of n, the number of elements in the list to be searched and plot a graph of the time taken versus n.

2. Sort a given set of elements using the Heapsort method and determine the time required to sort the elements. Repeat the experiment for different values of n, the number of elements in the list to be sorted and plot a graph of the time taken versus n.

3. Sort a given set of elements using Merge sort method and determine the time required to sort the elements. Repeat the experiment for different values of n, the number of elements in the list to be sorted and plot a graph of the time taken versus n.

4. Sort a given set of elements using Selection sort and determine the time required to sort elements. Repeat the experiment for different values of n, the number of elements in the list to be sorted and plot a graph of the time taken versus n.

5. Implement 0/1 Knapsack problem using dynamic programming.

6. From a given vertex in a weighted connected graph, find shortest paths to other vertices using Dijkstra's algorithm.

7. Sort a given set of elements using Quick sort method and determine the time required sort the elements. Repeat the experiment for different values of n, the number of elements in the list to be sorted and plot a graph of the time taken versus n.

8. Find Minimum Cost Spanning Tree of a given undirected graph using Kruskal's algorithm.

9. a. Print all the nodes reachable from a given starting node in a digraph using BFS method.

b. Check whether a given graph is connected or not using DFS method.

10. Find a subset of a given set S = {sl,s2,.....,sn} of n positive integers whose sum is equal to a given positive integer d. For example, if S= {1, 2, 5, 6, 8} and d = 9 there are two solutions{1,2,6}and{1,8}.A suitable message is to be displayed if the given problem instance doesn't have a solution.

MVJCE


11. a. Implement Horspool algorithm for String Matching.

b. Find the Binomial Co-efficient using Dynamic Programming.

12. Find Minimum Cost Spanning Tree of a given undirected graph using Prim’s algorithm.

13. a. Implement Floyd’s algorithm for the All-Pairs- Shortest-Paths problem.

b. Compute the transitive closure of a given directed graph using Warshall's algorithm.

14. Implement N Queen's problem using Back Tracking.

Note: In the examination questions must be given on lots. Each student must be given one questions.

MVJCE



LESSON PLAN

ALGORITHMS LABORATORY

Sub Code : 06CSL58 IA Marks : 25 Hrs/Week : 03 Exam Hours : 03 Total Hrs : 42 Exam Marks : 50 Sl no

Programs to be implemented Hour no

1 Implement Recursive Binary search and Linear search and determine the time required to search an element. Repeat the experiment for different values of n, the number of elements in the list to be searched and plot a graph of the time taken versus n.

1 – 3

2 Sort a given set of elements using the Heapsort method and determine the time required to sort the elements. Repeat the experiment for different values of n, the number of elements in the list to be sorted and plot a graph of the time taken versus n.

4 – 6

3 Sort a given set of elements using Merge sort method and determine the time required to sort the elements. Repeat the experiment for different values of n, the number of elements in the list to be sorted and plot a graph of the time taken versus n.

7 – 9

4 Sort a given set of elements using Selection sort and determine the time required to sort elements. Repeat the experiment for different values of n, the number of elements in the list to be sorted and plot a graph of the time taken versus n.

10 – 12

5 Implement 0/1 Knapsack problem using dynamic programming. 13 – 15

6 From a given vertex in a weighted connected graph, find shortest paths to other vertices using Dijkstra's algorithm.

16 – 18

7 Sort a given set of elements using Quick sort method and determine the time required sort the elements. Repeat the experiment for different values of n, the number of elements in the list to be sorted and plot a graph of the time taken versus n.

19 – 21

8 Find Minimum Cost Spanning Tree of a given undirected graph using Kruskal's algorithm.

22 – 24

9 a. Print all the nodes reachable from a given starting node in a digraph using BFS method.

b. Check whether a given graph is connected or not using DFS method.

25 – 27

10 Find a subset of a given set S = {sl,s2,.....,sn} of n positive integers whose sum is equal to a given positive integer d. For example, if S= {1, 2, 5, 6, 8} and d = 9 there are two solutions{1,2,6}and{1,8}.A suitable message is to be displayed if the given problem instance doesn't have a solution.

28 – 30

11 a. Implement Horspool algorithm for String Matching.

b. Find the Binomial Co-efficient using Dynamic Programming.

31 – 33

12 Find Minimum Cost Spanning Tree of a given undirected graph using Prim’s algorithm.

34 – 36

MVJCE


13 a. Implement Floyd’s algorithm for the All-Pairs- Shortest-Paths problem.

b. Compute the transitive closure of a given directed graph using Warshall's algorithm.

37 – 39

14 Implement N Queen's problem using Back Tracking. 40 – 42

Signature of Staff Signature of H.O.D

computer science & engineering - mvjce science & engineering ... part - a 1. overview 6 hrs...

Documents