VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & … · 2017-03-12 · Assignment Questions : 1. Distinguish Reactive and Proactive Risks. 2. Explain RMMM Plan. 3. Explain Software Statistical

1

VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY

DEPARTMENT OF CIVIL ENGINEERING

III B. Tech, Semester I (Information Technology)

Subject : Software Engineering

Subject Code : 13CSE007

Academic Year : 2016 – 17

Number of working days : 90

Number of Hours / week : 5

Total number of periods planned : 60

Name of the Faculty Member : Mr. G Rajesh Kumar

III Year B. Tech CE – II Sem L T/P/D C

4 1 4

(13CSE007) SOFTWARE ENGINEERING

UNIT I

Introduction to Software Engineering: Changing nature of Software, Software Myths. A

Generic View Of Process:-Software engineering-A layered technology, The Capability

Maturity Model Integration (CMMI)

Process Models: The water fall model, Incremental process models, evolutionary process

models, the unified process.

Learning objectives :

After completion of the unit, students will be able to:

understand different aspects of Software Engineering

understand various Software Process Models

Analyze which process model is suitable to which application domain.

Lecture plan :

S.No. Description of Topic No. of Hrs. Method of

Teaching

1. Defining Software, Software Application Domains,

Legacy Softwares 2 Chalk & board

2. Software Engineering and defining Software

Process 2 Chalk & board

3. Software Myths, A Generic view of Software 1 Chalk & board

2

Process Model

4. A layered technology, The Capability Maturity

Model Integration (CMMI) 2 Chalk & board

5. The water fall model, Incremental process models 2 PPT, chalk & board

6. Evolutionary process models, The unified process 2 PPT, Chalk & board

7 Tutorial 1 Chalk & Board

Total = 12

Assignment Questions :

1. Explain about Software Myths.

2. Discuss with neat case study Waterfall, Incremental Process Model.

3. Identify the need of Evolutionary Process Model. Discuss with Neat examples.

UNIT II

Software Requirements: Functional and Non functional requirements, User requirements,

System requirements, Interface specification, The software requirements document.

Requirements Engineering Process: Feasibility studies, Requirements elicitation and

analysis, requirements validation, requirements management

Learning objectives:

After completion of the unit, the students will be able to:

know the importance of Software Requirements

Identify different types of Software Requirements

learn requirements collection can be engineered

Analyze the software requirements

Know how software requirements can be validated

Lecture plan :


Teaching

1. Functional and Non-functional requirements 1 PPT+Video

2. User requirements, System requirements 2 PPT

3. Interface specification 1 PPT

4. The software requirements document 2 PPT+ chalk &board

5 Feasibility studies 1 PPT, chalk & board

6 Requirements elicitation and analysis 2 PPT, Chalk & board

7 Requirements validation, Requirements 2 Chalk & board

3

management


Total = 12


1. Distinguish Software Functional Requirements and Non – Functional Requirements

2. Explain the contents of SRS Document with examples.

3. Explain Feasibility Study, Requirement Validation.

UNIT III

System models: context models, behavior models, data models, object models, structured

methods

Design engineering: design process and design quality, design concepts the design model

Creating an architectural design: software architecture, data design, architectural styles and

patterns, architectural design



know about various Software System Models

Learn how Process and Quality is being designed

Analyze Software architecture

Evaluate the Data Design

Carryout various architectural Styles

Lecture plan:


Teaching

1 Context Models, Behavior Models 1 PPT+Video

2 Data Models, Object Models 1 PPT

3 Structured Methods 1 PPT

4 Design Process, Design Quality 1 PPT+ chalk &board

5 Design Concepts, The Design Model 1 PPT, chalk & board

6 What is architecture ? Creating an architectural

Design 2 PPT

7 Architectural Styles, Patterns, Refinement 2 Chalk & board

8 Architectural Design 2 Chalk & board


4

Total = 12


1. Explain Software Object Models and Behaviour Models.

2. Explain Architectural Design and styles, Patterns, Refinement.

UNIT IV

Test Strategies: A strategic approach to software testing, Black box and White box Testing,

Validation Testing, System Testing.

Product Metrics ,Software Quality, Metrics for analysis model, Metrics for design model,

Metrics for source code, Metrics for testing, Metrics for maintenance Metrics for process and

products, Software measurement, Metrics for software quality


After completion of the unit, the students will be able to

learn about the types of test strategies

know about the metrics for software quality

know about the metrics for analysis model

carry out a simple metrics for software measurement

understand metrics for software quality

Lecture plan :


Teaching

1 A strategic approach to software testing –

verification and validation, Organizing for Testing

1 PPT+Video

2 Software Testing strategy – A Big Picture 1 PPT

3 Creteria for completion of Software Testing 1 PPT

4 Test Strategies for Conventional and Object

Oriented Software

1 PPT+ chalk &board

5 Black box and White box Testing, Validation

Testing, System Testing.

2 PPT,

6 Software Quality, Metrics for analysis model 1 PPT, Chalk & board

7 Metrics for design model, Metrics for source code,

Metrics for testing, Metrics for maintenance

2 Chalk & board

8 Metrics for process and products 1

9 Software measurement, Metrics for software

quality

2

5

10 Tutorial 1 Chalk & board

Total = 13


1. Explain with neat example Software Testing Strategy – a big picture.

2. Explain Software Metrics.

3. Explain with neat examples about different Software Tests.

UNIT V

Risk Management: Reactive vs proactive risk strategies, Software risks, Risk identification,

Risk projection Risk refinement, RMMM, RMMM plan

Quality Management: Quality concepts, Software quality assurance, Software reviews,

Formal technical reviews, Statistical Software Quality Assurance, Software reliability, ISO

9000 Quality standards



Understanding Risk Management

Know Reactive and Proactive Risk Strategies

Know how Risk identification is carried out

How Software quality assurance is given

What are Software Review Process, Formal Technical reviews.

Carry out Statistical Software Quality Assurance

Know Software Reliability, ISO 9000 Quality Standards

Lecture plan :


Teaching

1. Reactive vs proactive risk strategies, Software

risks, Risk identification

1 PPT

2. Risk projection Risk refinement 1 PPT

3. RMMM, RMMM plan 1 PPT

4. Quality concepts, Software quality assurance 2 PPT+ chalk &board

5. Software reviews, Formal technical reviews 1 PPT, Video

6 Statistical Software Quality Assurance, Software

reliability

3

6

7 ISO 9000 Quality standards 1


Total = 11


1. Distinguish Reactive and Proactive Risks.

2. Explain RMMM Plan.

3. Explain Software Statistical Quality Assurance.

TEXT BOOKS

1. Software engineering- Roger S.Pressman, A practitioner’s Approach, McGraw-

Hill International Edition, 5th edition, 2001.

2. Software engineering, Ian Sommerville, Pearson education Asia, 6th edition,

2000.

REFERENCE BOOKS

Books:

1. “An Integrated Approach to Software Engineering” - Pankaj Jalote- Springer Verlag,

1997.

2. “Software Engineering – An Engineering Approach”, James F Peters and Witold

Pedryez, John Wiley and Sons, New Delhi, 2000.

3. “Software Engineering Fundamentals”, Ali Behforooz and Frederick J Hudson,

Oxford University Press, New Delhi, 1996.

Journals:

1. IEEE Transactions on Software Engineering Bimonthly ISSN: 0098-5589

2. Journal of Statistical Software ISSN 1548-7660 Published by the Foundation for

Open Access Statistics

3. ACM Transactions On Software Engineering And Methodology

Quarterly ISSN: 1049-331X

4. ACM Transactions On Mathematical Software Quarterly ISSN: 0098-3500

Conferences :

1. ICSE - International Conference on Software Engineering.

7

2. FSE - ACM SIGSOFT Symposium on the Foundations of Software Engineering.

3. ICSM - International Conference on Software Maintenance.

4. ASE - IEEE/ACM International Conference on Automated Software Engineering.

8


(Autonomous)

DEPARTMENT OF INFORMATION TECHNOLOGY

III B. Tech, Ist Semester (Information technology)

Subject : Computer Graphics

Subject Code : 13CSE015



Number of Hours / week : 3 + 1

Total number of periods planned: 68

Name of the Faculty Member:M.Susmitha

Course Objectives: 1) To provide students with a foundation in graphics applications programming and to introduce students with fundamental concepts and theory of computer graphics 2) To give basics of application programming interface (API) implementation based on graphics pipeline approach• To provide students with an overview of the key concepts of digital production of animation and visual effects with reference to workflow, people and technology; 3) To give students knowledge of the issues pertaining to digital data and to give students practical experience in the production of 2D computer animation. 4) To provide students with an understanding of the algorithms and theories that forms the basis of computer graphics and modeling; 5) To enable students to acquire practical knowledge and experience of modeling technologies and techniques; 6) To give students skills necessary in the production of 3D models, lighting, and rendering. 7) To provide students with an understanding of the fundamental issues, technologies and techniques involved in postproduction work. 8) To provide students with an understanding of some techniques that can be used to enhance standard composite shots; 9) To enable students to appreciate the complexities of working with particle, lighting and 2D morphing effects; 10) To provide students with the necessary knowledge and skills to extend core compositing work using visual effects.

9

Course Outcomes (COs): Upon completion of this course, students should be able to:

CO-1: Learn the principles and commonly used paradigms and techniques of computer graphics CO-2:Apply with the relevant mathematics of computer graphics and able to write basic graphics application programs CO-3:Understand the basic aspects of 2D image representations and transformation CO-4: Write basic graphics application programs including animation

UNIT : I

Syllabus:

INTRODUCTION Introduction: Usage of Graphics and their applications, Presentation Graphics-Computer Aided Design- Computer Art- Entertainment- Education and Training-Visualization- Image Processing- Graphical User Interfaces Over view of Graphics systems: Video Display Devices- Raster Scan systems-random scan systems-Graphics monitors and workstations-Input devices-hard copy devices-Graphics software Output primitives: Points and Lines-Line Drawing Algorithms- Loading the Frame buffer- Line function- Circle- Generating Algorithms- Ellipse Generating Algorithms-Other Curves- Parallel Curve Algorithms-Curve Functions-Pixel Addressing- Filled Area Primitives-Filled Area Functions- Cell Array- Character Generation Attributes of Output Primitives: Line and Curve Attributes-Color and Gray scale levels- Area Fill Attributes- Character Attributes-Bundled Attributes- Inquiry Functions-Ant aliasing

LEARNING OBJECTIVES:-At the end of unit-I student must be able to

Summarize the various Application areas of Computer Graphics.

Explain the overview of Computer Graphics.

Identify different types of video display devices.

Distinguish raster-scan systems and random-scan systems.

Describe graphics monitors and workstations.

Describe various types of input devices.

Draw point and lines.

Compute different types of line drawing algorithms.

10

Comare mid-point circle and ellipse algorithms.

Differentiate Scan line polygon fill algorithm,boundary fill and flood-fill

algorithms.

Lecture Plan

S.No. Description of Topic No. of Hrs. Method of Teaching

1. Introduction to computer graphics 1 PPT + Video

2. Application areas of computer graphics 1 Black board + Video

3. Classification of video display devices 1 Black board

4. Raster-scan systems 1 Black board + Video

5. Random-scan systems 1 Black board

6. Graphic monitors 1 Black board + PPT

7. Work stations 1 Black board + Video

8. Points and lines,line drawing algorithms 1 Black board

9. :mid-point circle algorithm 1 Black board + Video

10. Ellipse algorithms 1 Black board

11. Filled area primitives 1 Black board

12. Scan line polygon fill algorithm 1 PPT

13. Boundary fill and flood fill algorithms 1 PPT

Assignment – 1

1.Write short notes on the application areas of Computer Graphics.

2.Mention different types of video display devices.

3.Define scan conversion.

4.List the advantages of interactive graphics.

5.Explain the classification of use of computer graphics

6.Write a brief note on output primitives.

7.Explain various types of line drawing algorithms.

8.Write a brief note on Filled area primitives.

9.Explain boundary-fill and flood-fill algorithms

UNIT : II

Syllabus:

TWO DIMENSIONAL GEOMETRICALTRANSFORMATION AND VIEWING Two dimensional geometric transformations - Matrix representations and homogeneous coordinates, composite transformations; Two dimensional viewing - viewing pipeline, viewing coordinate reference frame; widow-to-viewport coordinate transformation, Cohen -Sutherland-and Cyrus-beck line clipping algorithms,Southerland-Hodgeman polygon clipping algorithm.

LEARNING OBJECTIVES:-

11

Derive 2-D geometric transforms(Translation,Scaling,Rotation and Shear

Transformations).

Generate matrix representations and homogeneous coordinates.

Describe transformations between coordinate systems.

Identify 2-D viewing pipeline, window to view-port coordinate transformation,

viewing functions.

Describe Cohen-Sutherland and Cyrus-beck line clipping algorithms.

Compute Sutherland and Hodgeman polygon clipping algorithm.

Lecture Plan


1. 2-D geometrical transforms: Translation,

Scaling, Rotation

1 PPT + Video

2. 2-D geometrical transforms: Reflection and

Shear transformations

1 Black board

3. Matrix representations & Homogeneous

coordinates.

2 Black board + Video

4. Transformations between coordinate systems 1 Black board

5. 2-D viewing pipeline & 2-D viewing

coordinate reference frame

2 Black board

6. 2-D viewing functions 1 Black board + PPT

7. Cohen-Sutherland and Cyrus-beck line

clipping algorithms.

1 Black board

8. Sutherland-Hodgeman polygon clipping

algorithm


Assignment - 2

1) Write a short note on 2-D geometrical transforms.

2) Write a short note on matrix representation of 2-D geometric transforms.

3) Write a short note on homogeneous coordinates .

4) Write a C program to implement Exec() system call

5) Explain the transformations between coordinate systems.

12

6) Explain the inverse transformation. Derive the matrix for inverse transformation

7) Write a short note on window to view-port coordinate transformation.

8) Write a short note on 2-D viewing functions..

9) Explain Cohen-Sutherland and Cyrus-beck line clipping algorithms.

10) Write Sutherland-Hodgeman polygon clipping algorithm.

11) What is windowing and clipping.

12) Distinguish between viewport and window

13) What do you mean by normalization transformation? Why it is needed?

14)What is polygon clipping.

UNIT : III

Syllabus:

THREE DIMENSIONAL OBJECT REPRESENTATION Three dimensional concepts; Three dimensional object representations - Polygon surfaces - Polygon tables - Plane equations - Polygon meshes; Curved Lines and surfaces, Quadratic surfaces; Blobby objects; Spline representations - Bezier curves and surfaces - B-Spline curves and surfaces. Learning Objectives: After completion of the unit, the student must able to:

Overview of 3-D object representation.

Describe Polygon surfaces, quadratic surfaces.

Differentiate Bezier curve and B-Spline curves.

Differentiate Bezier curve and B-Spline surfaces

Learn Basic illumination models .

Define polygon rendering methods.

Lecture Plan


1. Polygon surfaces, quadratic surfaces 1 Black board + Video

2. Spline representation 1 Black board + Video

3. Bezier curve and B-Spline curves 1 Black board + Video

13

4. Bezier curve and B-Spline surfaces 1 Black board + Video

5. Basic illumination models 1 Black board + Video

6. polygon rendering methods 1 Black board

7. Cohen-Sutherland and beck line clipping

algorithms. 1 PPT + Video

8. Sutherland-Hodgeman polygon clipping

algorithm


Assignment – 3

1) Write a short note on Polygon surfaces,quadratic surfaces.

2) Compare and contrast Bezier curve and B-Spline curves.

3) Mention the differences in between Bezier curve and B-Spline surfaces.

4) Derive the illumination model with combine diffuse and specular reflection

5) What is halfway vector? Where it is used?

6) Write a short note on 3-D geometrical transforms .

7) Mention the differences in between Cohen-Sutherland and Cyrus beck line clipping

algorithms.

8) Explain Sutherland-Hodgeman polygon clipping algorithm.

9) Describe the techniques to achieve realism in computer graphics.

10) Derive the transformation matrix for rotation about an arbitrary axis

UNIT : IV

Syllabus:

THREE DIMENSIONAL GEOMETRICAL TRANSFORMATION AND VIEWING Three dimensional geometric and modeling transformations - Translation, Rotation, Scaling, composite transformations; Three dimensional viewing - viewing pipeline, viewing coordinates, Projections, Clipping; Visible surface detection methods: Depth buffer, scan line, Depth sorting, BSP-tree methods, Area sud-division and octree methods Learning Objectives: After completion of the unit, the student must able to:

Derive 3-D geometric transforms(Translation,Scaling,Rotation and Shear

Transformations).

Describe composite transformations between coordinate systems.

Identify 3-D viewing pipeline,viewing coordinate reference frame.

14

Explain window to view-port coordinate transformation.

Identify Visible surface detection methods.

Classify Visible surface detection methods.

Differentiate depth-buffer and scan-line methods.

Explain BSP-tree method.

Compare and contrast area sub-division and octree methods.

Lecture Plan

S. No. Description of Topic No. of Hrs. Method of Teaching

1. 3-D geometrical transforms

Translation,scaling

1 Video

2. 3-D geometrical transforms : Reflection

and shear transformations 1 Black board + Video

3. 3-D viewing pipeline and viewing

coordinate reference frame

1 Black board

4. window to view-port coordinate

transformation,viewing functions

1 Black board

5. Classification of Visible surface detection

methods

1 PPT + Video

6. Usage of depth-buffer and scan-line

methods

1 Black board

7. BSP-tree method and area sub-division

method & octree methods.

2 PPT

Assignment - 4

1) Write a short note on Visible surface detection methods .

2) Mention the differences in between depth-buffer and scan-line methods.

3) Explain octree methods .

4) Explain the Z-buffer algorithm for hidden surface removal.

5) Explain the scanline algorithm for hidden surface removal.

6) Explain the painter algorithm for hidden surface removal

UNIT : V

Syllabus:

15

COMPUTER ANIMATION Design of Animation Sequence, General computer Animation functions, Raster animation, Computer animation languages, key frame systems, motion specifications Learning Objectives: After completion of the unit, the student must able to:

Discuss computer animation techniques.

Learn general computer animation functions.

Explain raster animation techniques.

Explain key frame systems, motion specifications.

Lecture Plan

S. No. Description of Topic No. of Hrs. Method of Teaching

1. Design of animation sequence 1 Black board + Video

2. General computer animation functions 1 Black board

3. raster animation, computer animation

languages

1 Video

4. key frame systems, motion specifications..

1 Video

Assignment - 5

1) Briefly explain computer animation techniques..

2) Write a short note on General computer animation functions.

3) Write a short note on key frame systems, motion specifications.

4) Explain various methods to specify the motion of the objects.

5) Write a short notes on animation languages

6) Explain the steps for designing animation sequences.

TEXT BOOKS: 1. Donald Hearn & M. Pauline Baker, "Computer Graphics", Pearson Education, 2nd

Edition, 2003

16

2. “Computer graphics principles &practice”, second edition in c, foley, VanDam, Feiner and Hughes, Pearson Education

3. Computer Graphics Peter Shirley & Steve Marschner Indian Edition CENGAGE Learning.

4. Computer Graphics C Version by Donald Hearn & M. Pauline Baker, Pearson Education, New Delhi, 2004

REFERENCE BOOKS:

1. “Procedural elements for Computer Graphics”, David Rogers, Tata McGraw hill,2nd edition

2. “Computer Graphics”, Steven Harington, TMH 3. “Principles of interactive Computer Graphics” Neuman and sproul,TMH

.

17


DEPARTMENT OF INFORMATION TECHNIOLOGY

III B. Tech, I Semester (IT)

Subject : Computer Networks

Subject Code : 13ITD006

Academic Year : 2015-16




Name of the Faculty Member: RAVI TENE

Course Description: This course is to provide students with an overview of the concepts and

fundamentals of data communication and computer networks. Topics to be covered include:

data communication concepts and techniques in a layered network architecture,

communications switching and routing, types of communication, network congestion,

network topologies, network configuration and management, network model components,

layered network models (OSI reference model) and their protocols, various types of networks

(LAN, MAN, WAN ).

Course Objectives: At the end of the course, the students will be able to:

1. Understand the fundamental concepts & basic taxonomy of computer networking.

2. Understand common offered layered services, examine protocols and algorithms used

to operate the network

3. Allow the student to gain expertise in some specific areas of networking such as the

design and maintenance of individual networks.

Learning Outcomes: After completing this course the student must demonstrate the

Knowledge and ability to:

1. Learn various network protocols

3. Become familiar with security risks threatening computer

networks.

2. Understand the Layered Architecture of Computer Networks

4. Understand the Layered Architecture of Computer Networks

5. Understand the operation of the main components of computer networks

6. Learn various network protocols

7. Become familiar with security risks threatening computer networks.

8. Independently understand basic computer network technology.

9. Understand and explain Data Communications System and its components.

10. Identify the different types of network topologies and protocols.

11. Enumerate the layers of the OSI model. Explain the function(s) of each layer.

12. Identify the different types of network devices and their functions within a network.

13. Understand and building the skills of sub netting and routing mechanisms.

18

14. Familiarity with the basic protocols of computer networks, and how they can be used

to assist in network design and implementation.

III Year B. Tech IT – I Sem L T/P/D C

4 1 4

(ITD1106) COMPUTER NETWORKS

UNIT – I

Data Communications: Components – Direction of Data flow – Networks – Components and Categories – Types of Connections – Topologies –Protocols and Standards – ISO / OSI model, Example Networks such as ATM, Frame Relay, ISDN Physical layer: Transmission modes, Multiplexing, Transmission Media, Switching, Circuit Switched Networks, Datagram Networks, Virtual Circuit Networks.



Understand the challenges & basics of network communication.

Understand the operation of the protocols , network connections & topologies

Uncover Multiplexing & Switching

Lecture plan :

S.No. Description of Topic No. of

Hrs.

Method of

Teaching

1. Introduction to Data Communications & Computer

Networks

1 PPT+Video

2. Components – Direction of Data flow – networks –

Components and Categories

2 PPT+Video

3. Types of Connections – Topologies 2 PPT

4. Protocols and Standards 2 PPT

5. ISO / OSI model 2 PPT, chalk &

board +Video

6. Digital transmission, multiplexing 1 PPT, Chalk &

board

7. Transmission media, circuit switched networks 2 PPT, Chalk &

board

8. Datagram networks, virtual circuit networks. 1 Chalk & board

Total = 13

UNIT – II

Data link layer: Introduction, Framing, and Error – Detection and Correction – Parity – LRC – CRC Hamming code, Flow and Error Control, Noiseless Channels, Noisy Channels, HDLC, Point to Point Protocols. Medium Access sub layer: ALOHA, CSMA/CD, LAN – Ethernet IEEE 802.3, IEEE 802.5 - IEEE 802.11, Random access, Controlled access, Channelization. Learning objectives:

19


Study the functions of data link layer and introduce IEEE standards employed in

computer networking

Analyse about multiple access

Lecture plan :

S.No. Description of Topic No.

of

Hrs.

Method of

Teaching

1. Framing, Error – detection and correction 2 PPT+Video

2. Parity – LRC – CRC – Hamming code, flow and error

control

2 PPT

3. Noiseless channels, noisy channels

2 PPT

4. HDLC, point to point protocols.

2 PPT+ chalk

&board

5 Medium Access sub layer -Random access, Controlled

access, Channelization

2 PPT, chalk &

board

6 LAN - Ethernet IEEE 802.3 -IEEE 802.5 - IEEE 802.11

3 PPT, Chalk

& board

Total = 13

UNIT – III

Network layer: Logical Addressing, Internetworking, Tunneling, Address mapping, ICMP, IGMP, Forwarding, Uni-Cast Routing Protocols, Multicast Routing Protocols.



know about logical addressing

learn about Internetworking & tunneling

understand about address mapping, error reporting and multicasting

analyze the forwarding techniques & routing protocols

Lecture plan:


Hrs.

Method of

Teaching

1 Logical addressing, 2 PPT+Video

2 Internetworking, tunneling, 3 PPT

3 Address mapping 2 PPT

4 ICMP 2 PPT+ chalk

& board

5 IGMP 2 PPT, chalk

20

& board

6 Forwarding, Uni-cast routing protocols, Multicast

routing protocols.

2 PPT

Total = 13

UNIT – IV

Transport Layer: Process to Process Delivery, UDP and TCP protocols, Data Traffic, Congestion, Congestion Control, QoS, Integrated Services, Differentiated Services, QoS in Switched Networks.



understand about the process to process delivery

interpret about the three protocols i:e UDP, TCP, SCTP.

learn about congestion control & quality of service

Lecture plan :


Teaching

1 Process to process delivery, 2 PPT+Video

2 UDP and TCP protocols, 2 PPT

3 SCTP, Data traffic, , 3 PPT

4 congestion, congestion control, 2 PPT+ chalk

&board

5 Qos, integrated services 2 PPT,

6 Differentiated services,QoS in switched networks 2 PPT, Chalk

& board

Total = 13

UNIT – V

Application Layer: Domain name space, DNS in internet, electronic mail, SMTP, FTP, WWW, HTTP, SNMP.



know about domain name space

use the FTP,WWW,SMTP

understand the electronic mail architecture

analyze the SNMP

learn about the concept of security

Lecture plan :

21


Teaching

1. Domain name space, DNS in internet,

3 PPT

2. Electronic mail, SMTP,,

3 PPT

3. FTP, WWW,

3 PPT

4. HTTP, SNMP,

3 PPT+ chalk

&board

Total = 12

TEXT BOOKS

1. Data Communications and Networking – Behrouz A. Forouzan , Fourth Edition

TMH,2006.

2. Computer Networks — Andrew S Tanenbaum, 4th Edition. Pearson education/PHI.

REFERENCES

1. Data communications and computer Networks, P.C .Gupta, PHI.

2. An Engineering Approach to Computer Networks-S.Keshav, 2nd Edition, Pearson

Education.

3. Understanding communications and Networks, 3rd Edition, W.A. Shay, Cengage

Learning.

4. Computer Networking: A Top-Down Approach Featuring the Internet. James F. Kurose &

Keith W. Ross,3rd Edition, Pearson Education.

5. Larry L.Peterson and Peter S. Davie, “Computer Networks”, Harcourt Asia Pvt. Ltd.,

Second Edition.

6. William Stallings, “Data and Computer Communication”, Sixth Edition, Pearson

Education, 2000.

22




Subject : Linux Programming






Name of the Faculty Member: Y.UshaRani

III Year B. Tech IT – I Sem L T/P/D C

4 1 4

(13ITD010)LINUX PROGRAMMING

UNIT – I

Linux Utilities-File handling utilities, Security by file permissions, Process utilities, Disk utilities,

Networking commands, Filters, Text processing utilities and Backup utilities, sed – scripts, operation,

addresses, commands, applications, awk – execution, fields and records, scripts, operation, patterns,

using system commands in awk.

Working with the Bourne again shell(bash): Introduction, shell responsibilities, pipes and input

Redirection, output redirection, running a shell script, the shell as a programming language, shell

meta characters, file name substitution, shell variables, command substitution, shell commands, the

environment, quoting, test command, control structures, arithmetic in shell, shell script examples,

interrupt processing, functions, debugging shell scripts.



This unit provides an overview of Linux utilities.

It focuses on the file handling utilities, text processing utilities and system commands.

To understand shell programming.

Be able to work with shell.

Lecture plan :


Hrs.

Method of

Teaching

23

1. File handling utilities 1 PPT+Video

2. Security by file permissions 1 PPT+Video

3. Process utilities, Disk utilities 1 PPT

4. Networking commands, Filters 1 PPT

5. Text processing utilities, Backup utilities

1 PPT, chalk &

board

6. sed-scripts, operation, addresses, commands, applications

2 PPT, Chalk &

board

7 awk-execution, fields and records, scripts, operation

2 PPT, Chalk &

board

8 patterns, actions, functions, using system commands in

awk

2 PPT+Video

9 Introduction, shell responsibilities 1 PPT+Video

10 Pipes, Redirection 1 PPT

11 here documents, running a shell script 1 PPT

12 shell meta characters, file name substitution, shell

variables, command substitution

2 PPT, chalk &

board

13 shell commands, the environment, quoting, test command

1 PPT, Chalk &

board

14 control structures, arithmetic in shell, shell script examples

2 PPT, Chalk &

board

15 interrupt processing, functions, debugging shell scripts 1 PPT+Video

16 Tutorial 1

Total = 21

UNIT – II

UNIT-II

Files: File Concept, File System Structure, Inodes, File Attributes, File types, Library functions,the

standard I/O and formatted I/O in C, stream errors, kernel support for files, System calls, file

descriptors, low level file access – File structure related system calls(File APIs), file and record

locking, file and directory management – Directory file APIs, Symbolic links & hard links.



To understand File and Directory structure of Linux operating system.

To know different file API’s.

S.No. Description of Topic No.

of

Hrs.

Method of

Teaching

24

1. File Concept, Files System Structure, Inodes 2 PPT+Video

2. File Attributes, File Types, Library functions 1 PPT

3. the standard I/O and formatted I/O in C 2 PPT

4. stream errors, kernel support for files 1 PPT+ chalk

&board

5 System calls, file descriptors 2 PPT, chalk &

board

6 File structure related system calls (File APIs), file and

record locking

2 PPT, Chalk

& board

7 Directory file APIs, Symbolic links & hard links 2 Chalk &

board

8

Tutorial 1

Total = 13

UNIT – III

Process – Process concept, Kernel support for process, process attributes, process control -

process creation, waiting for a process, process termination, zombie process, orphan process,

Process APIs. Signals– Introduction to signals, Signal generation and handling, Kernel

support for signals, Signal function, unreliable signals, reliable signals, kill, raise , alarm,

pause, abort, sleep functions.



To understand processes and signals.

Be able to know the kernel support for process & signals.

Lecture plan:


Hrs.

Method of

Teaching

1 Introduction, process structure& attributes, 2 PPT+Video

2 waiting for a process, process creation & termination 2 PPT

3 Zombie process, Orphan process 1 PPT

4 Process identifiers

fork,vfork,exit,wait,exec

2 PPT+ chalk

&board

5 Signal functions, reliable and unreliable signals 2 PPT, chalk

& board

6 Interuupted system calls

Kill,raise,alarm,pause,abort,system,sleep

2 PPT chalk

& board

7 Tutorial 1

Total = 12

25

UNIT – IV

Interprocess Communication: Introduction to IPC, Pipes, and FIFOs, Introduction to three types of

IPC-message queues, semaphores and shared memory. Message Queues- Kernel support for

messages, UNIX system V APIs for messages, client/server example.

Semaphores-Kernel support for semaphores, UNIX system V APIs for semaphores. Shared Memory-

Kernel support for shared memory, UNIX system V APIs for shared memory, semaphore and shared

memory example.



To understand IPC.

To understand how kernel supports messages queues.

To understand kernel support semaphores and shared memory.

To learn API’s for semaphores & shared memory.

Lecture plan :


Teaching

1 Introduction to IPC 1 PPT+Video

2 Pipes, FIFOs 2 PPT

3 Introduction to three types of IPC 1 PPT

4 Kernel support for messages 1 PPT+ chalk

&board

5 Unix system V APIs for messages 2 PPT,

6 client/server example 1 PPT, Chalk

& board

7 Kernel support for semaphores 1 PPT

8 Unix system V APIs for semaphores 2 PPT

9 Kernel support for shared memory 1 PPT+ chalk

&board

10 Unix system V APIs for shared memory 1 PPT,

11 semaphore and shared memory example 2 PPT, Chalk

& board

12 Kernel support for semaphores 1 PPT

7 Tutorial 1 Chalk &

board

Total = 17

UNIT – V

Sockets: Introduction to Sockets, Socket Addresses, Socket system calls for connection

oriented protocol and connectionless protocol, example-client/server programs.

26



To understand the concepts of socket.

Be familiar with socket programming.

Lecture plan :


Teaching

1. Introduction to sockets 2 PPT

2. Socket Addresses 2 PPT

3. Socket system calls for connection oriented protocol 2 PPT

4. Socket system calls for connectionless protocol 2 PPT+ chalk

&board

5. example client/server programs 2 PPT, Video

6 Tutorial 1 Chalk &

board

Total = 11

TEXT BOOKS: 1. Unix System Programming using C++, T.Chan, PHI.

2. Unix Concepts and Applications, 4th Edition, Sumitabha Das, TMH,2006.

3. Beginning Linux Programming, 4th Edition, N.Matthew, R.Stones,Wrox, Wiley India

Edition,rp-2008

REFERENCE BOOKS: 1. Linux System Programming, Robert Love, O’Reilly, SPD.

2. Advanced Programming in the UNIX environment, 2nd Edition, W.R.Stevens, Pearson

Education.

3. Unix Network Programming, W.R.Stevens, PHI.

4. Unix for programmers and users, 3rd Edition, Graham Glass, King Ables, Pearson

Education.

27




Subject : OPERATING SYSTEMS






Name of the Faculty Member: D. Srinivasa Rao

III Year B. Tech IT – I Semester L T/P/D C

4 1 4

(13ITD008) OPERATING SYSTEMS

UNIT I Computer System and Operating System Overview: Overview of Computer System hardware, Operating System Objectives and functions, Evolution of operating System, Example Systems. Operating System Services, System Calls, System Programs. Process Management: Process Description, Process Control, Process States, Cooperating Processes, Inter-process Communication. Learning objectives :


understand different aspects of operating system includes objectives and functions

understand various system calls and programs

Analyze process states, process control and cooperation

Illustrates various Inter-process Communication techniques

Lecture plan :


Hrs.

Method of

Teaching

1. Overview of Computer System hardware 1 Chalk & board and

Video

2. Operating System Objectives and functions 2 Chalk & board

3. Evolution of operating System, Example Systems 1 Chalk & board

4. Operating System Services 1 Chalk & board

5. System Calls, System Programs.

2 Chalk & board

+PPT

6. Process Description, Process Control 1 Chalk & board

7 Process States, Cooperating Processes, 2 PPT +Chalk &

board

8. Inter-process Communication 2 PPT+ Chalk &

board

9. Tutorial 1 Chalk & board

Total = 13

UNIT II

28

CPU Scheduling: Basic Concepts, Scheduling Criteria, Scheduling Algorithms and evaluation, Threads Overview, Threading issues. Concurrency: Principles of Concurrency, Mutual Exclusion, Software and hardware approaches, Semaphores, Monitors, Message Passing, Classic problems of synchronization. Learning objectives:


know about Concepts of Scheduling and evaluation

computing average waiting time, turnaround times for Scheduling Algorithms

learn about Threads and Threading issues. learn about Principles of Concurrency, Mutual Exclusion, Software and hardware

approaches of it. analyze the Semaphores, Monitors for mutual exclusion

learn about the Message Passing

analyze the Classic problems of synchronization. S.No. Description of Topic No.

of

Hrs.

Method of

Teaching

1. Basic Concepts, Scheduling Criteria 2 PPT+chalk

&board

2. Scheduling Algorithms and evaluation 2 PPT+chalk

&board

3. Threads Overview, Threading issues. 1 chalk &board

4. Principles of Concurrency, Mutual Exclusion 2 chalk &board

5 Semaphores, Monitors, Message Passing 3 PPT+chalk &

board

6 Classic problems of synchronization.

2 chalk & board

7 Tutorial 1 chalk &board

Total = 13

UNIT III Principles of deadlock: System Model, Deadlock Characterization, Methods for handling Deadlocks, Deadlock Prevention, Deadlock avoidance, Deadlock detection, Recovery from Deadlocks, Dining philosopher’s problem



know about Principles of deadlock

know about the Deadlock learn about various Methods for handling Deadlocks

learn about Recovery from Deadlocks, Dining philosopher’s problem

Lecture plan:

29


Hrs.

Method of

Teaching

1 System Model, Deadlock Characterization 2 PPT+chalk

&board

2 Deadlock Prevention, Deadlock avoidance, Deadlock detection

4 chalk &board

3 Recovery from Deadlocks 2 chalk &board

4 Dining philosopher’s problem 2 PPT+chalk

&board

7 Tutorial 1 chalk & board

Total = 11

UNIT IV Memory Management: Basic concepts, Swapping, Contiguous memory allocation, Paging, Segmentation, Virtual memory, Demand paging, Page-replacement algorithms, Thrashing. Secondary storage structure: Disk structure; Disk scheduling, Disk management, Swap-space Management, RAID structure, Stable-storage Implementation, Tertiary-Storage Structure I/O systems: I/O hardware, Application I/O interface, Kernel I/O subsystem, Transforming I/O request to hardware operations, STREAMS



learn about the types of Memory Management strategies

know about the Demand paging, Page-replacement algorithms, Thrashing carry out a concepts of Disk structure; Disk scheduling, Disk management issues

learn about RAID structure, Stable-storage Implementation, Tertiary-Storage

Structure

learn about I/O hardware, Application I/O interface, Kernel I/O subsystem

learn about Transforming I/O request to hardware operations, STREAMS Lecture plan :


Teaching

1 Swapping, Contiguous memory allocation, 1 chalk &board

2 Paging, Segmentation, Virtual memory 2 PPT+chalk

&board

3 Demand paging, Page-replacement algorithms, Thrashing

3 chalk &board

4 Disk structure; Disk scheduling, Disk management,

1 chalk &board

5 Swap-space Management, RAID structure, Stable-storage Implementation, Tertiary-Storage Structure

3 chalk &board

6 I/O hardware, Application I/O interface, Kernel 2 PPT+ Chalk

30

I/O subsystem glacis fall & board

7 Transforming I/O request to hardware operations, STREAMS

1 Chalk &

board

8 Tutorial 1 chalk &board

Total = 14

UNIT V File Management: File system-File concepts, Access methods, Directory structure, File system mounting, File sharing and Protection. Implementing file systems-File system structure and implementation, Directory implementation, Allocation methods, Free-space management, Efficiency and performance Security: Security threats, Protection, Intruders, Viruses, Trusted System. Learning objectives:


know about File system concepts, Access methods, Directory structure, File system mounting, File sharing and Protection

illustrates File system structure and implementation, Directory implementation know about Allocation methods, Free-space management, Efficiency and

performance analyzes Security threats, Protection, Intruders, Viruses, Trusted System.

Lecture plan :


Hrs. Method of

Teaching

1. File system features and types, Directory structure

2 PPT+chalk&board

2. File system mounting, File sharing and Protection. Implementing file systems

2 chalk&board

3. File system structure and implementation, Directory implementation,

2 chalk&board

4. Allocation methods, Free-space management, Efficiency and performance

2 chalk &board

5. Security threats, Protection, Intruders, Viruses, Trusted System.

2 chalk&board


Total = 13

TEXT BOOKS :

1. Operating System Concepts- Abraham Silberchatz, Peter B. Galvin, Greg Gagne 7th

Edition, John Wiley.

2. Operating systems- A Concept based Approach-D.M.Dhamdhere, 2nd Edition, TMH

REFERENCES :

1. Operating Systems’ – Internal and Design Principles Stallings, Fifth

Edition–2005, Pearson education/PHI

2. Operating System A Design Approach-Crowley, TMH.

3. Modern Operating Systems, Andrew S Tanenbaum 2nd edition

Pearson/PHI.

Documents

VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & … · 2017-03-12 · Assignment Questions : 1. Distinguish Reactive and Proactive Risks. 2. Explain RMMM Plan. 3. Explain Software Statistical