Post on 15-Mar-2018
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING AND TECHNOLOGY
Department of Computer Science and Engineering
III B.Tech. II Semester (CSE)
ACADEMIC PLAN
1. Microprocessors and Interfacing
2. Cryptography & Network Security
3. Mobile Computing
4. Computer Graphics and Animation
5. LINUX Programming
6. Green IT
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
(Autonomous)
DEPARTMENT OF COMPUTER SCIENCE ENGINEERING
III B. Tech, II Semester (CSE)
Subject : CRYPTOGRAPHY AND NETWORK SECURITY
Subject Code : (13CSE013)
Academic Year : 2016 – 17
Number of working days : 90
Number of Hours / week : 3 + 1
Total number of periods planned : 60
Name of the Faculty Member : N.Sandeep Chaitanya, Tejaswi Potluri,
S.Kranthi Kumar, S.Swathi
Course Objectives:
1. Discuss security concepts, threats, attacks, services and mechanisms.
2. Describe various cryptosystems- symmetric key cryptography, public key
cryptography.
3. Comprehend and apply authentication services and mechanisms, and Email security.
4. Discuss the concepts of IP Security, web security, viruses and firewalls
Course Outcomes:
Upon completion of this course, students should be able to:
1. Define fundamentals of network security and demonstrate available networking solutions.
2. Analyze cryptographic techniques and encryption algorithms for secure communication.
3. Discriminate threats, attacks and possible types of firewall implementations.
4. Design secure mails and apply authentication techniques available.
UNIT-I
1.1. SYLLABUS
INTRODUCTION:
Security Attacks, Services Mechanisms, A model for Internetwork security, Classical Encryption
techniques, Fiestel Cipher Structure, Data Encryption Standard, Block Cipher Design Principles
and Modes of Operation, Triple DES, IDEA, BLOWFISH, RC-4, Evaluation criteria for AES,
AES Cipher, Placement of Encryption Function, Traffic Confidentiality.
1.2. Learning Objectives:
After studying this unit, Student is able to know:
Various Security Attacks, Security Mechanisms
Asymmetric Encryption Algorithms
Modes of Operation
Traffic Confidentiality
1.3. Lesson Plan: Total no. of classes: 14
No. of
classes
Topic covered No. of Hrs. Method of Teaching
1 Security Attacks 1st hour Black board
2 Services Mechanisms, A model
for Internetwork security,
Classical Encryption techniques,
2nd
& 3rd
hour Black board
3 Fiestel Cipher Structure,
Data Encryption Standard,
Block Cipher Design Principles
and Modes of Operation,
4th
hour, 5th
hour & 6th
hour
Black board + Video+
PPT
2 Triple DES, IDEA 7th
hour & 8th
hour Black board
2 BLOWFISH, RC-4, 9th
hour & 10th
hour Black board + PPT
2 Evaluation criteria for AES,
AES Cipher
11th
hour & 12th
hour Black board + Video
2 Placement of Encryption
Function, Traffic
Confidentiality.
13th
hour & 14th
hour Black board+ PPT
1.4. Assignment:
1) Define and differentiate the terms Threat & Attack
2) Classify Different Security Attacks.
3) Differentiate Symmetric and Asymmetric Cryptography
4) Explain DES and AES in detail, Justify which one is better and why?
5) Write a short note on Modes of Operations.
6) Briefly explain Traffic Confidentiality in detail.
UNIT-II
2.1. SYLLABUS
PUBLIC KEY CRYPTOGRAPHY: Confidentiality using Symmetric Encryption – Principles
of Public key Cryptosystems, RSA algorithm, Key Management, Diffie-Hellman key Exchange,
Elliptic Curve Cryptography. Buffer overflow, TCP session hijacking, ARP attacks, route table
modification, and UDP hijacking and man-in-the-middle attacks.
2.2. Learning Objectives:
After studying this unit, Student is able to know:
Various Symmetric Encryption Algorithms
Key Management
Diffie-Hellman Key Exchange
Elliptic Curve Cryptography
Different types of Attacks
2.3. Lesson Plan: Total no. of classes: 12
No. of
classes
Topic covered No. of Hrs. Method of Teaching
1 Principles of Public key
Cryptosystems
15th
hour Black board +ppt
2 RSA algorithm 16th
& 17th
hour Black board
3 Key Management, Diffie-Hellman
key Exchange
18th
hour, 19th
hour &
20th
hour
Black board + Video+
PPT
1 Elliptic Curve Cryptography 21st hour Black board+ PPT
3 Buffer overflow, TCP session
hijacking, ARP attacks, route
table modification
22nd
hour , 23rd
hour, &
24th
hour
Black board + PPT
2 UDP hijacking and man-in-the-
middle attacks
25th
hour & 26th
hour Black board + Video
2.4. Assignment:
1 Explain RSA Algorithm with an example
2 Explain Diffie-Hellman Key Exchange Algorithm.
3 Define Buffer overflow, TCP session Hijacking
4 Determine how to generate a key in Elliptic Curve Cryptography.
5 Justify Which cryptographic technique is best for faster key generation.
6 Define UDP Hijacking, Man-in-the Middle Attacks
UNIT-III
3.1.SYLLABUS
AUTHENTICATION AND HASH FUNCTIONS: Authentication requirements,
Authentication functions, Message Authentication Codes, Hash Functions, Security of Hash
Functions and MACs, MD5 message Digest algorithm , Secure Hash Algorithm, RIPEMD,
HMAC Digital Signatures, Authentication Protocols, Digital Signature Standard,
Authentication Applications: Kerberos – X.509 Authentication Service
3.2 Learning Objectives:
After studying this unit, Student is able to know:
Authentication functions,
Security of Hash Functions and MACs,
MD5 message Digest algorithm,
Secure Hash Algorithms, Digital Signatures
Authentication Protocols
Kerberos, Authentication Service
3.3 .Lesson Plan: Total no. of classes: 13
No. of
classes
Topic covered No. of Hrs. Method of Teaching
2 Authentication requirements,
Authentication functions,
Message Authentication
Codes, Hash Functions
27th
hour & 28th
hour Black board + Video
1 Security of Hash Functions
and MACs, MD5 message
Digest algorithm
29th
hours Black board + PPT
2 Secure Hash Algorithm,
RIPEMD, HMAC Digital
Signatures
30th
hour, 31st hour Black board + PPT
3 Authentication Protocols,
Digital Signature Standard
32nd
hour, 33rd
hour &
34th
hour
Black board
3 Kerberos 35th
hour , 36th
hour &
37th
hour
Black board + PPT
2 X.509 Authentication Service 38th
hour & 39th
hour Black board + PPT
3.4.Assignment:
Explain about HMAC,
Illustrate about Digital Signature Standard
Write about RIPEMD,
Discuss about Hash Functions
Compare and contrast Kerberos version 4 and Kerberos version 5
Explain about X.509 Authentication Service
UNIT-IV
4.1. SYLLABUS
NETWORK SECURITY: Email Security and Web Security Electronic Mail Security – PGP/
SMIME, IP security- Architecture, Authentication Header, Encapsulating Security Payload, Key
Management, Web Security- Secure Socket Layer, Transport Layer Security and Secure
Electronic Transaction
4.2. Learning Objectives:
After studying this unit, Student should is able to know:
PGP
S/MIME
IP Security
Web-Security
4.3.Lesson Plan: Total no. of classes: 11
No. of
classes
Topic covered No. of Hrs. Method of Teaching
2 PGP 40th
hour & 41th
hour Black board
2 S/MIME 42nd
hour, 43rd
hour Black board+PPT
2 IP Security 44th
hour & 45th
hour Black board + PPT
2 Key Management 46th
hour, 47th
hour Black board
3 Web Security-SSL, TLS and
SET
48th
hour , 49th
hour &
50th
hour
Black board + PPT
4.4. Assignment:
1 What are the PGP Operations, Explain in detail
2. Mention Different Header Fields of MIME Header.
3. Draw and Explain Authentication Header Format and Encapsulating Header format.
4. Explain SSL, TLS and SET.
UNIT-V
5.1 SYLLABUS
SYSTEM LEVEL SECURITY: Intrusion detection – password management – Viruses and
related Threats – Virus Counter measures – Firewall Design Principles – Trusted Systems.
5.2 Learning Objectives:
After studying this unit, Student is able to know:
Intrusion Detection,
Password Management,
Viruses and related threats, Virus Counter measures
Firewall Design principles- Trusted Systems
5.3 Lesson Plan: Total no. of classes: 10
No. of
classes
Topic covered No. of Hrs. Method of Teaching
2 Intrusion detection 51st hour, 52
nd hour Black board +PPT
1 password management 53rd
hour Black board+ PPT
2 Viruses and related Threats 54th
hour , 55th
hour Black board + PPT
2 Virus Counter measures 56th
hour, 57th
hour Black board+ PPT
3 Trusted Systems. 58th
hour ,59th
hour &
60th
hour
Black board + PPT
5.4 Assignment:
1. Elaborate different Intrusion Detection methods.
2. Describe the life cycle of viruses.
3. Write a short note on Password Management with examples.
4. List out different Firewall Design Principles
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
(Autonomous)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
III B. Tech, II Semester (Computer Science & Engineering)
Subject : Mobile Computing
Subject Code : 13ITD019
Academic Year : 2016 – 17
Number of working days :
Number of Hours / week : 3 + 1
Total number of periods planned: 60
Name of the Faculty Member: Priya Bhatnagar
Course Objectives: 1. Recognize the need of Mobile communications and Mobile computing and WLAN Techniques.
2. Identify the need of Mobility management at IP and Transport Layers.
3. Differentiate between Audio and Video broad casting and to know the role of scripting in Mobile
environment
4. State the Role of Database and it’s Management in Mobile Environment role security in wireless
environment.
Course Outcomes (COs): Upon completion of this course, students should be able to:
CO-1: Demonstrate differences between wired and wireless communications and categorize MAC protocols
used in Wireless Communication, GSM.
CO-2: Describe the need of Mobile IP and illustrate about Encapsulation, MANET’s and Mobile Transport
Layer.
CO-3: Apply DAB and DVB in real life and develop scripting codes needed for mobile environment
CO-4: Models Different Hoarding Techniques and Updating Database in Mobile Environment and construct
the security features to suite for mobile environment.
UNIT : I
Syllabus:
UNIT – I Introduction to Mobile Communications and Computing: Mobile Computing
(MC) introduction to MC, novel applications, limitations, and architecture.
GSM: Mobile services, System architecture, Radio interface, Protocols, Localization and
calling, Handover, Security, and New data services.
Learning Objectives: After completion of the unit, the student must able to:
Basic concepts of mobile communications & computing
System Architecture of GSM
Radio Interface of GSM.
Protocols used in GSM.
Handover & security in GSM.
Lecture Plan
S.No. Description of Topic No. of Hrs. Method of Teaching
1. Introduction to Mobile Communications and
Computing
1st hour Black board+PPT
2. Mobile Computing (MC) introduction to MC,
novel applications
2nd
& 3rd
hour Black board +PPT
3. limitations, and architecture 4th
& 5th
hour Black board+PPT
4. GSM: Mobile services, System architecture 6th
& 7th
hour Black board + PPT
5. Radio interface, Protocols 8th
& 9th
hour Black board
6. Localization and calling, 10th
& 11th
hour Black board + PPT
7. Handover, Security, and New data service 12th
-14th
hour Black board + Video
Assignment – 1
7) Explain about mobile computing & novel applications
8) Differentiate radio frequency and Infrared services.
9) Illustrate GSM architecture with neat diagram.
10) Discuss about radio interface of GSM.
11) Describe about handovers in GSM.
UNIT : II
Syllabus: (Wireless) Medium Access Control: Motivation for a specialized MAC (Hidden and
exposed terminals, near and far terminals), SDMA, FDMA, TDMA, CDMA, MAC protocols for
GSM.
Learning Objectives: After completion of the unit, the student must able to:
Various time division multiple access technologies
Learn about Hidden & Exposed Terminal Problems
Difference between FDMA & SDMA
Learn about CDMA
MAC protocols for GSM.
S.No. Description of Topic No. of Hrs. Method of Teaching
1. (Wireless) Medium Access Control 15th
hour PPT+Blackboard
2. Motivation for a specialized MAC (Hidden
and exposed terminals, near and far
terminals)
16th
&17th
hours Black board
3. SDMA, FDMA 18th
hours Black board
4. TDMA 19th
-21st hours Black board
5. CDMA 22nd
& 23rd
hours
6. MAC protocols for GSM 24th
& 25th
hours Black board
Assignment – 2
7 Explain about Wireless Medium Access Control
8 Illustrate different types of TDMA techniques.
9 Differentiate between SDMA and FDMA.
10 Describe CDMA with an example.
11 Write about MAC protocols for GSM
UNIT : III
Syllabus: Mobile Network Layer: Mobile IP (Goals, assumptions, entities and terminology, IP
packet delivery, agent advertisement and discovery, registration, tunneling and encapsulation,
optimizations), Dynamic Host Configuration Protocol (DHCP)
Learning Objectives: After completion of the unit, the student must able to:
Mobile Network Layer
Mobile Internet Protocol
IP packet delivery, agent advertisement and discovery, registration
Tunneling and encapsulation, optimizations
Dynamic Host Configuration Protocol (DHCP)
Lecture Plan
S.No. Description of Topic No. of Hrs. Method of Teaching
1. Mobile Network Layer 26th
& 27th
hour Black board
2. Mobile IP (Goals, assumptions, entities and
terminology)
28th
-30th
hours Black board
3. IP packet delivery, Agent advertisement 31st -33
rd hour Black board
4. Agent discovery, Registration, Tunneling and
Encapsulation
34th
-36th
hour Black board +PPT
5. Route optimizations 37th
-38th
hours Black board
6. Dynamic Host Configuration Protocol
(DHCP)
39th
-40th
hours Black board
Assignment – 3
1. Write MIP in detail with goals , assumptions, entities and terminology used
2. Describe process involved in Agent Advertisement & discovery
3. Justify Route Optimization with an example
4. Explain Dynamic Host Configuration Protocol (DHCP)
UNIT : IV
Syllabus:
Mobile Transport Layer : Traditional TCP, Indirect TCP, Snooping TCP, Mobile TCP, Fast
retransmit/fast recovery, Transmission /time-out freezing, Selective retransmission, Transaction
oriented TCP.
Learning Objectives: After completion of the unit, the student must able to:
Mobile Transport Layer
Traditional TCP, Indirect TCP, Snooping TCP
Mobile TCP, Fast retransmit/fast recovery
Transmission /time-out freezing, Selective retransmission
Transaction oriented TCP
Lecture Plan
S. No. Description of Topic No. of Hrs. Method of Teaching
1. Mobile Transport Layer 41st & 42
nd hours Black board
2. Traditional TCP, Indirect TCP, Snooping
TCP
43rd
&44th
hours Black board
3. Mobile TCP, Fast retransmit/fast recovery 45th
&46th
hours Black board
4. Transmission /time-out freezing, Selective
retransmission
47th
& 48th
hours Black board
5. Transaction oriented TCP 49th
& 50th
hours Black board
Assignment – 4
1. Write about Mobile Transport Layer
2. Compare and contrast Traditional TCP, Indirect TCP, Snooping TCP
3. Describe Mobile TCP, Fast retransmit/fast recovery.
4. Explain about Transaction oriented TCP
5. Describe Transmission /time-out freezing, Selective retransmission.
UNIT : V
Syllabus:
Database Issues: Hoarding techniques, caching invalidation mechanisms, Data Dissemination:
Communications asymmetry, classification of new data delivery mechanisms, push-based
mechanisms, pull-based mechanisms, hybrid mechanisms, selective tuning (indexing)
techniques.
Learning Objectives: After completion of the unit, the student must able to:
Database Hoarding Techniques
Caching invalidation mechanisms
Data Dissemination: Communications asymmetry,
Push-based mechanisms,
Pull-based mechanisms,
Hybrid mechanisms,
Selective tuning (indexing) techniques.
Lecture Plan
S. No. Description of Topic No. of Hrs. Method of Teaching
1. Database Hoarding Techniques 51st &52
nd hour Black board + PPT
2. Caching invalidation mechanisms 53rd
&54
thhours Video + Blackboard
3. Data Dissemination: Communications
asymmetry,
55th
&56th
hours Black board + PPT
4. Push-based mechanisms, 57th
hour Black board + PPT
5. Pull-based mechanisms, 58th
hour Black board + PPT
6. Hybrid mechanisms, 59th
hour Black board + PPT
7. Selective tuning (indexing) techniques.
60th
hour Black board + PPT
Assignment - 5
1. Describe Database Hoarding Techniques
2. Explain Caching invalidation mechanisms
3. Write about Data Dissemination & Communications asymmetry
4. Differentiate between Push-based mechanisms, Pull-based mechanisms & Hybrid
mechanisms,
5. Describe Selective tuning (indexing) techniques.
TEXT BOOKS 1. “Handbook of Wireless Networks and Mobile Computing”, Stojmenovic and Cacute, Wiley,
2002,
2. “Mobile Communications”, Jochen Schiller, Addison-Wesley, Second Edition, 2004
REFERENCES 1. “Mobile Computing Principles: Designing and Developing Mobile Applications with UML and
XML“, Reza Behravanfar, Cambridge University Press, Oct2004.
2. ”Mobile Computing”, Raj Kamal, Oxford University Press ,2007
3. “Mobile and Wireless Design Essentials”, Martyn Mallick, Wiley DreamTech, 2003.
4. “Principles of Mobile Computing”, Hansmann, Merk, Nicklous, Stober, 2nd
edition Springer
2003.
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY (Autonomous)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
ACADEMIC PLANNER
Computer Graphics and Animation S.NO CONTENT
(1) - Course Objectives
(2) - Course Outcomes
(3) - CO – PO Mapping
(4) - Syllabus
(5) - Text books
(6) - References
(7) - Useful Subject Links
(8) - Expert Details
(9) - Journals
III B.Tech II SEMESTER (COMPUTER SCIENCE AND ENGINEERING)
Subject: Computer Graphics and Animation
Subject Code : 13CSE015
Academic Year: 2016 – 17
Number of working days: 90
Number of Hours / week: 4 + 1
Total number of periods planned: 62
Faculty Members: Dr.P.Neelakantan, R. KranthiKumar, M. RaviKanth, L.Indira
(1) Course Objectives:
Explain fundamental concepts and the theory of computer graphics and animation.
Outline the algorithms and theories that form the basis of computer graphics and
modeling.
Construct application programming interface based on graphics algorithms.
Devise practical knowledge and experience on modeling technologies and techniques.
(2) Course Outcomes:
Upon completion of the course, the students are expected to:
CO-1: Analyze the theory and practical knowledge on computer graphics and animation.
CO-2: Build algorithms on computer graphics.
CO-3: Describes the basics of graphics application programs including animation.
CO-4: Explain the principles and commonly used paradigms and techniques of computer
graphics.
(3) CO – PO Mapping:
STRENGTH OF CORRELATION BETWEEN CO - PO
PO-a PO-b PO-c PO-d PO-e PO-f PO-g PO-h PO-i PO-j PO-k PO-l
CO-1 2 2 1 1 1 1
CO-2 1 1 2 2 1 1
CO-3 1 1 2 2 1
CO-4 1 1 1 2 1 1
(4) Syllabus
UNIT – I
Syllabus:
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-Anti aliasing
LEARNING OBJECTIVES:-
After completion of the unit, the 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.
Compare mid-point circle and ellipse algorithms. Differentiate Scan line polygon fill algorithm, Boundary fill and flood-fill algorithms.
Lecture Plan: 18 Hours
S.No Topic
NO. OF
LECTURES
REQUIRED
Method of
teaching
1 Introduction to computer graphics, Usage of
graphics and their applications L1 PPT , video
2 Application areas of computer graphics. L2 PPT
3 Classification of video display devices. L3 Black board ,
video
4 Raster-scan systems L4 Black board
5 Random-scan systems. L5 Black board
6 Graphics monitors and workstations L6 Black board
7 Input devices, Hard copy devices-Graphics
software L7, L8,L9 PPT
8 Points and lines, line drawing algorithms.
L10 Black board
9 Mid-point circle algorithm.
L11 Black board
10 Ellipse algorithms. L12 Black board
11 Filled area primitives.
L13 Black board
12 Scan line polygon fill algorithm.
L14 Black board
13
Boundary fill and flood fill algorithms
L15 Black board,
video
14
Line and Curve Attributes-Color and Gray scale
levels- Area Fill Attributes-
L16 PPT
15
Character Attributes-Bundled Attributes- Inquiry
Functions-Anti aliasing
L17,L18 Black board,
PPT
ASSIGNMENT – I:
1. What are the most popular alternatives to the raster scan CRT. Distinguish the merits and
limitations of the video display devices.
2. What are the major components of CRT device? Explain their role in the graphical
display?
3. Write short notes on the application areas of Computer Graphics.
4. Mention different types of video display devices.
5. Distinguish merits and demerits of scan line algorithm and flood fill algorithm.
6. Discuss about the super sampling approach followed for antialiasing.
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:- After completion of the unit, the student must be able to:
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: 12 Hours
S.No Topic
NO. OF
LECTURES
REQUIRED
Method of
teaching
1
2-D geometrical transforms: Translation,
Scaling, Rotation.
L19,L20 Black board,
video
2
2-D geometrical transforms: Reflection and
Shear transformations.
L21 Black board,
video
3 Matrix representations.
L22 Black board
4 Homogeneous coordinates.
L23 Black board
5 Transformations between coordinate systems.
L24 Black board
6 2-D viewing pipeline.
L25 Black board
7
2-D viewing coordinate reference frame.
L26 Black board
8
Window to view-port coordinate
transformation.
L27 Black board
9 2-D viewing functions.
L28 Black board
10
Cohen-Sutherland and Cyrus-beck line clipping
algorithms.
L29 Black board
11
Sutherland-Hodgeman polygon clipping
algorithm.
L30 Black board
ASSIGNMENT –II:
1. What is meant by composite transformation 2. Write a short note on 2-D geometrical transforms.
3. Write a short note on matrix representation of 2-D geometric transforms.
4. Write a short note on homogeneous co-ordinates.
5. Explain the transformations between coordinate systems.
6. Discuss the steps involved in mid- point subdivision algorithm.
7. What are the limitations of mid -point sub division algorithm? 8. Write a short note on window to view-port coordinate transformation.
9. Write a short note on 2-D viewing functions..
10. Explain Cohen-Sutherland and Cyrus-beck line clipping algorithms.
11. Write Sutherland-Hodgeman polygon clipping algorithm.
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 be able to:
Overview of 3-D objects 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: 11 hours
S.No Topic
NO. OF
LECTURES
REQUIRED
Method of
teaching
1 Overview of 3-D concepts.
L31,L32 PPT , video
2 Polygon surfaces - Polygon tables - Plane
equations - Polygon meshes L33,L34 Black board
3 Curved Lines and surfaces, Quadratic surfaces L35,L36 Black board,
PPT
4 Blobby objects L37 Black board,
PPT
5 Spline representations - Bezier curves and
surfaces L38,L39
Black board,
PPT
6 B-Spline curves and surfaces
L40,L41
Black board,
PPT
ASSIGNMENT –III:
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. Write brief notes about hermit curve.
5. How the plane equation is defined in 3D space? Expalin the steps involved in the
transformation for mirror reflection about an arbitrary plane.
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 sub-division and octree methods.
LEARNING OBJECTIVES:-
At the end of this unit student must be able to
Derive 3-D geometric transforms and transformations.
Describe composite transformations between coordinate systems.
Identify 3-D viewing pipeline, viewing coordinate reference frame.
Explain window to view-port coordinate transformation.
Explain 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: 14 hours
S.No Topic
NO. OF
LECTURES
REQUIRED
Method of
teaching
1
3-D geometrical transforms: Translation,
Scaling, Rotation, Reflection and Shear
L42,L43,L44 Black board,
PPT
2 composite transformations L45 Black board
3 3-D viewing pipeline and viewing coordinates L46,L47 Black board
4 Projections L48,L49 Black board,
PPT
5 Clipping L50,L51 Black board,
PPT
6
Visible surface detection methods: Depth buffer,
scan line, Depth sorting, BSP-tree methods, Area
sub-division and octree methods.
L52,L53,L54,L55 Black board,
PPT
ASSIGNMENT –IV:
1. Discuss about the following
a) parametric functions
b) mach band effect
c) surface normal
2. Write a short note on 3-D geometrical transformations.
3. Mention the differences in between Cohen-Sutherland and Cyrus beck line clipping
algorithm.
4. Explain Sutherland-Hodgeman polygon clipping algorithm.
5. Write a short note on visible surface detection methods .
6. Mention the differences in between depth-buffer and scan-line methods.
7. Explain Octree method.
UNIT – V
Syllabus:
COMPUTER ANIMATION
Design of Animation Sequence, General computer Animation functions, Raster animation,
Computer animation languages, key frame systems, motion specifications
LEARNING OBJECTIVES:
At the end of this unit student must be able to
Design of animation sequence and general computer animation.
Explain computer animation languages.
Design Key frame system for a given object.
LECTURE PLAN: 7 hours
S.No Topic
NO. OF
LECTURES
REQUIRED
Method of
teaching
1 Design of Animation Sequence L56 Black board,
video
2 General computer Animation functions L57 Black board
3 Raster animation L58 Black board
+video
4 Computer animation languages L59 PPT
5 key frame systems L60,L61 Black board
+video
6 Motion specifications L62 Black board
+video
ASSIGNMENT –V:
1) Briefly explain about key frame systems.
2) Explain about raster animation.
3) What is meant by animation?
4) Discuss the characteristics of key frame animation.
(5) TEXT BOOKS
1. Donald Hearn & M. Pauline Baker, "Computer Graphics", Pearson Education, 2nd
Edition, 2003
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
(6) REFERENCES
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
(7) USEFUL SUBJECT LINKS
1. www.slideshare.net/akbrightfuture/computer-graphics-hearn-baker
2. www.ddegjust.ac.in/studymaterial/mca-3/ms-13.pdf
3. www.gobookee.net/computer-graphics-hearn-and-baker-4-ed/
4. caig.cs.nctu.edu.tw/course/CG07/Lectures/CG_0Overview_S07.pdf
5. www.examsadda.com/2011/.../computer-graphics-by-hearn-and-baker.ht.
6. www.graphics.rwth-aachen.de/research/
(8) EXPERT DETAILS
1. Donald Hearn & M. Pauline Baker
2. Foley, Vandam, Friner, Hughes
3. Zhigand xiang, Roy plastock, Schaum’s outlines
4. Pradeep K. Bhatia
5. lan Watt and Mark Watt
(9) JOURNALS
1. International Journal of Computer Graphics (IJCG)
2. International Journal of Creative Interfaces and Computer Graphics (CIGI)
3. An International Journal of Systems & Applications in Computer Graphics.
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
(Autonomous)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
Linux Programming
III B. Tech, 2nd
Semester (CSE)
Subject : LINUX PROGRAMMING
Subject Code : 13ITD010
Academic Year : 2016 – 17
Number of Hours / week : 3 + 1
Total number of periods planned: 60
Name of the Faculty Member: Mr.I.PAVAN KUMAR
Course Objectives:
1. Understand the fundamentals of shell scripting/Programming and Linux system
Administration.
2. Learn the basic principles of file system architecture to organize the file system.
3. Apply the core concept of Processes and implement in the Linux Environment by handling
signals.
4. Implementing Inter-Process communication and Client-Server Application techniques in
Linux environment and analyze their differences.
Course Outcomes:
Upon completion of this course, students should be able to:
1. Understand the fundamentals of shell scripting/Programming and Linux system
Administration.
2. Learn the basic principles of file system architecture to organize the file system.
3. Apply the core concept of Processes and implement in the Linux Environment by
handling signals.
4. Implementing Inter-Process communication and Client-Server Application techniques in
Linux environment and analyze their differences.
UNIT – I
Linux Utilities:-I
File Handling Utilities, security by file permissions, Process utilities, disk utilities, networking
commands, filters, Text Processing utilities and back up utilities,
Working with Bourne again shell(bash): Introduction, shell responsibilities, pipes and input redirection, output redirection, here
documents, running a shell script, the shell as 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.
Learning Objectives:At the end of this unit the student will be able to know
Explain the architecture of UNIX with the help of neat diagram
Define 3 shells – Borne, Korn, C
Identify different types of editors and must handle Vi editors easily
Explain UNIX file structure with neat diagram
Execute file permissions like READ, WRITE, and EXECUTE and modify these
permissions
Execute process commands like PS, PS-a, PS-I , etc.,
Execute disk commands basically to find amount of used and unused space
Execute networking commands to access a file from remote system
Execute directory commands like MKDIR, RMDIR etc.,
Learn how to execute AWK command
Learn the concept of linking , unlinking , mounting and unmounting files
Execute text processing utilities and view file utilities
Learn about disk utilities and back up utilities
Executing commands like
cat,tail,head,sort,nl,uniq,grep,egrep,fgrep,cut,paste,join,tee,pg,comm.,cmp,diff etc.
Use of Shell
Shell programming language constructs
Writing Shell Scripts
Lecture Plan:
S.No Topic No. Of Classes
1 File Handling Utilities 2
2 security by file permissions 1
3 Process utilities 1
4
5
disk utilities
networking commands, filters
1
6 Text Processing utilities 1
7 back up utilities 1
8 Introduction, shell responsibilities 1
9 pipes and input redirection, output redirection, here
documents
1
10
running a shell script, the shell as programming language
file name substitution, shell variables
command substitution, shell commands
2
13 the environment, quoting 1
14 test command, control structures 1
15 arithmetic in shell, shell script examples, 1
16 interrupt processing, functions, debugging shell scripts 1
Total 15
Assignment-I
1. Write short notes on the following UNIX commands
i) umount ii) telnet iii) du, df
2. Write and explain about a minimum of 25 Vi editor commands with examples.
3. Write short notes on the following
a) awk b) grep c) tar, cpio d)filters
4. Explain the following commands with syntax.
a) cat b) tail c) head d)unig
5. What is a process. List and Explain various process utilities with suitable examples.
6. Explain basic file attributes. Discuss the appropriate commands associated with these
attributes.
7. "Operating systems like UNIX provide services both for programs and users". Justify
this statement with suitable examples.
8. Explain the significance of the following commands. i. ls - ld ii. ls - l.
9. Give a note on vi editor
10. What is an operating system? Explain How UNIX fulfills more than that role. Discuss
suitable examples.
11. Explain various commands available in UNIX for networking. Discuss suitable
examples.
12. Write short notes on:
(a) Unix system services
(b) Shell responsibilities
(c) Inode block.
13. Define Shell and kernel. Differentiate them.
14. Illustrate the cycle of command execution by Unix. 1. (a) What is the difference between
the text editing provided by ‘ed’ & ‘vi’ text editors.
15. What are the two operational modes of vi editor? What is the use of each?
16. . What is a shell? What are the responsibilities of a shell?
17. What are the different types of shells available in UNIX
18. . Write a shell script which gets executed the moment the user logs in.It should display
the message "good morning/good afternoon/good evening" depending upon the time at
Which the user logs in.
19. Explain about here documents with an example.
20. .Explain following
(a) Shell Meta characters
(b) Shell types in UNIX
UNIT – II
Files: File concept, file system structure, Inodes, file attributes,file types,library functions,
standard I/O and formatted I/O in C,stream errors,kernel support for files,system calls,file
descriptors,low levelfile access-file structure related system calls(file APIs),file and record
locking, file and directory management –directory file APIs,symbolic links & hard links.
Learning Objectives:
Understanding the Unix file system structure
Understanding different file attributes
Know about file descriptor concepts
Understanding Kernel support for files
Understanding concept of system call and kernel support
Know about Directory Management
Lecture Plan:
S.No Topic No. Of Classes
1 File concept, file system structure 1
2 Inodes, file attributes,file types,library functions 1
3 standard I/O and formatted I/O in C 1
4 stream errors 1
5 kernel support for files, system calls 1
6 file descriptors, low level file access-file structure related
system calls(file APIs)
2
7 file and record locking 1
8 file and directory management –directory file APIs 2
9 Symbolic links & hard links.
1
Total classes 11
Assignment-II
Write a C program to print the type of specified file (Regular, device, directory)
2. Write and Explain about hard and symbolic links.. give an example for each.
3. Explain about file descriptors & i-node?
4. Write the difference between fgetc and getc system calls.
5. Write the syntax of fflush system call give an example.
6. Write about ulink system call and give an example.
7. Write about Write system call and illustrate with an example.
8. Explain the differences between fgets, gets system call.
9. Explain link, unlink, remove and rename functions with syntaxes.
10. What are fflush and fseek functions? Explain.
11. Explain in detail about lseek function.
12. What is fcntl function? What is the purpose of using it?
13. Write the syntax of creat function. Explain, how this function is equivalent to open function.
14. Explain in detail, how an opened file can be positioned.
15. What are stat, fstat and lstat functions? Explain.
16. Give the syntaxes for chmod and fchmod functions and state their importance.
17. Write the syntax of following system calls. open creat read Write chmod chown .
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
API.
Signals: Introduction to signals, signal generation and handling, kernel
supportforsignals,signalfunction,unreliablesignals,reliablesignals,kill,raise,alaram,pause,abort,sle
ep functions.
Objectives: At the end of this unit the student will be able to know
Different types of process
Different types of signals
Lecture Plan:
S.No Topic No. Of Classes
1 Process concept, kernel support for process, process
attributes
1
2 process control-process creation, waiting for a process,
process termination
2
3 Zombie process, orphan process, process API 1
4 Introduction to signals, signal generation and handling 1
5 kernel support for signals, signal function 1
6 Unreliable signals, reliable signals 1
7 Kill,raise,alaram,pause,abort,sleep functions.
1
Total classes 08
Assignment-III
1. Write a program to illustrate the vfork function call.
2. Write a program for signal implementation.
3. Write a program which used both kill and raise functions.
4. Write a program which uses abort function.
5. Write a program which used both kill and raise functions.
6. Write the differences between wait and waitpid system calls.
7. Explain threads.
8. Write the system calls for process termination in detail.
9. Explain process creation and process termination in detail.
10. What is a process? Explain waiting for a process in detail.
11. What are the uses of fork function?
12. Write a short note on zombie process.
13. What are the different properties that are inherited by the child from its parent. Explain.
14. What are the differences between parent and child processes.
15. What are the differences between sleep and abort functions? Explain.
16. What is a zombie process? Explain.
17. What are the various properties that are inherited by the child from their parent?
18. Differentiate between parent and child processes.
19. Write the syntax of following functions. Explain each argument.
* kill
* raise
* alarm
* exit
UNIT – IV
IPC: Introduction to IPC, Pipes, FIFOs, Message queues, Semaphores, 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,
semaphores and shared memory example.
Objectives: At the end of this unit the student will be able to know about
Pipes
Fifos
Message queues
Semaphores
semaphores
shared memory
Client server example
Lecture Plan:
S.No Topic No. Of Classes
1 Introduction to IPC, Pipes 1
2 FIFOs 2
3 Message queues 2
4 Semaphores, 1
5 shared memory 3
6 Message Queues 2
6 kernel support for messages 1
7 Unix system V APIs for messages, client server example. 4
Total classes 16
Assignment-IV:
1. Write about system call pipe . Give an example which uses pipe system call.
2. Explain the logic for opening or creating an IPC channel
3. Explain the following concepts about pipes
* Pipes between two process
* Pipes among three process in a shell
4. Explain the concept of IPC between two processes on a single system. Give Example.
5. What is the data stored by the kernel when a semaphore is created.
6. What is the system call that is used to create a shared memory segment and Explain each field
in detail. [8+8]
7. The syntax of msgget system call is int msgget(key t key, int flag)
* Explain type of key
* Explain What value it returns
* What is the use of flag
8. Explain the following concepts
* Pipes in single process
* Pipes in single process, immediately after fork
9. Explain the concept of IPC between two processes on a single system. Give Example
10. What are the advantages and disadvantages of system v IPC?
11. What is a FIFO? Why FIFOs are called as named pipes? Explain
12. Write a program to create a pipe and to execute it on the client.
13. Mention the rules for writing information into the pipe.
14. Compare the IPC functionality provided by pipes and message queues. What are the
advantages and drawbacks of each? When is one more suitable than the other.
15. Define Inter Process Communication? Explain IPC between two processes on different
systems.
16. What is a pipe? Using pipe, how IPC can be implemented.
17. What is a semaphore? Using semaphore, how IPC can be implemented.
18. What is a shared memory? Using shared memory, how IPC can be implemented.
19. What is a Message Queue? Using Message Queues, how IPC can be implemented
UNIT – V
Sockets: Introduction to sockets, socket Addresses, socket system calls for connection oriented
protocol and connection less protocol example client/server programs
Objectives: At the end of this unit the student will be able to know about
Sockets
Socket address structure
Socket System call for TCP & UDP
Client server example
Lecture Plan:
S.No Topic No. Of Classes
1 Introduction to sockets, 2
2 socket Addresses, socket system calls for connection
oriented protocol
2
3 socket system calls for connection less protocol 2
4 example client/server programs
4
Total classes 10
Assignment-V:
1. What is a socket?
2. Explain the socket address structure.
3. Explain socket system calls for TCP and UDP?
4. Explain the client-server Programming using TCP and UDP.
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
References:
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
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
(Autonomous)
DEPARTMENT OF COMPUTER SCIENCE ENGINEERING
III B. Tech, IIst Semester (Computer Science Engineering)
Subject : Green IT
Subject Code : 13ITD011
Academic Year : 2016 – 17
Number of working days : 90
Number of Hours / week : 3 + 1
Total number of periods planned: 65
Name of the Faculty Member: T.L. Priya Darshini, B.Swetha, V.P.Hara Gopal
Course Objectives:
1. Acquire knowledge on basics of trends and reasons to go green
2. Apply methods for minimizing power usage and reducing cooling costs
3. Apply techniques to virtualize servers and storage
4. Apply methods for reducing the servers usage by using cloud computing and to establish
green data center.
Course Outcomes:
CO-1: Able to understand the issues on recycling process and reduce the impact of electronic
waste
CO-2: Able to understand and apply power consumption techniques
CO-3: Able to build data center, virtualize servers and justify the process
CO-4: Able to optimize server usage by cloud techniques and build green data center
UNIT : I
Syllabus:
Trends and Reasons to Go Green:
Overview and Issues, Problems, Cost savings, Current Initiatives and standards, Global
Initiatives
Learning Objectives: After studying this unit, Student should be able to:
Understand the importance of Green IT.
Explore energy issues and problems in computing.
State the objectives and functions of Green IT.
Explore various types of cost saving mechanisms in computing.
Learning global initiatives for electronic waste management.
Lecture Plan
S.No Topic No. Of Classes
1 Overview and Issues 1
2 Toxins, power consumption 1
3 Solutions to power consumption 1
4 Equipment Disposal 1
5 Recycling Process 2
6 Company’s carbon footprint 2
7 Cost Saving 2
8 Current Initiatives and Standards 5
9 Total classes 15
Assignment – 1
1. What is Recycling Process? Discuss issues regarding Recycling Process?
2. Discuss some initiatives and standards to Go Green?
UNIT: II
Consumption Issues
Minimizing Power Issues, Cooling, Changing the way we work, Going Paper less, Recycling,
Hardware Considerations.
Learning Objectives: After completion of the unit, the student must able to:
How to Lessen the power usage in Data Centers and IT Departments.
Green IT Initiatives.
Alternatives to cool data centers instead of air conditioners.
Things to be done to change the Business Process for betterment.
Lecture Plan
S.No Topic No. Of Classes
1 Minimizing the Power Usage 4
2 Cooling Costs, Reducing Cooling costs 2
3 Optimizing Airflow, Data center Design 2
4 Tele Workers and outsourcing, Going Paperless 2
5 EDI, Recycling 2
6 Energy star, servers, Hardware considerations 2
7 Remote Desktop 1
Total Classes 15
Assignment - 2
1. Explain different Power reducing techniques?
2. Discuss Reducing Cooling Costs?
3. How to Reduce impact of IT Organizations on Planet?
UNIT : III
Syllabus:
The Greening Process
Data Center Design and Redesign, Greening your Information Systems, Staying Green.
Learning Objectives: After completion of the unit, the student must able to:
Swapping of company’s Hardware and initiatives to be made in Organization
How to keep both IT Department and Company in Green
To justify whether we are using the best equipment and use the least amount of power.
Lecture Plan
S.No Topic No. Of Classes
1 Data Center Design and Redesign 3
2 Greening your Information System 4
3 Staying Green 3
Total classes 10
Assignment – 3
1. Explain how you can make the most efficient decisions and plans for your datacenter?
2. How to change Business Processes?
UNIT : IV
Syllabus:
Virtualization:
Virtual Server Implementation Plan, Desktop Virtualization, Benefits, Desktop access,
Virtual Printing.
Learning Objectives: After completion of the unit, the student must able to:
Know how to virtualize servers and storage.
Learn use of intelligent SANs to save money.
Lecture Plan
S.No Topic No. Of Classes
1 Server Virtualization 2
2 Solutions to Server Virtualization 2
3 Storage Virtualization 2
4 Virtualization Types 2
5 Storage Virtualization Solutions 2
6 Savings 2
Total classes 12
Assignment – 4
1) Explain the Solutions to Server Virtualization?
2) Discuss in detail the Savings?
UNIT : V
Syllabus:
Data Replication and Disk Technology Advancements:
Data Replication Methods, Disk Technology Advancements, The Green data Center,
Cloud Computing, Remote Monitoring
Learning Objectives: After completion of the unit, the student must able to:
Know How to reduce the usage of servers by using cloud counting.
Establish Green data center.
Lecture Plan
S.No Topic No. Of Classes
1 Data Replication Methods 3
2 Disk Technology Advancements 2
3 The Green data Center 2
4 Cloud Computing 3
5 Remote Monitoring 3
Total classes 13
Assignment - 5
1) Explain different Data Replication methods?
2) Briefly explain what is cloud computing?
TEXT BOOKS
1. Green IT-Reduce your information system’s Environmental Impact while adding to the
bottom line Toby J Velte, Anthony T Velte, Robert Elsenpeter – McGrahill
Publications, 2008
2. Foundation Of Green It, Consolidation, Virtualization, Efficiency, And Roi In The Data
Center, Marty Poniatowski- Prentice Hall Publications
REFERENCES
1. Green Computing and Green IT Best Practices on Regulations and Industry Initiatives,
Virtualization, Power Management, Materials Recycling and Telecommuting By Jason
Harris.
2. Green IT for Sustainable Business Practice- Mark G. O’ Neil, BCS The chartered
institute for IT
3. The Greening of IT: How Companies Can Make a Difference for the Environment, John
P. Lamb, Kindle Edition, IBM Press 2009