Teaching plan

College of Engineering, Pune - 05 Department of Computer Engineering and Information Technology

IT-09001 Network Architecture and Wireless Protocols Teaching Scheme: Lectures- 3 Hrs/Week Examination Scheme: 100 marks

Continuous evaluation- Assignment/Quizzes – 40 marks

End Sem Exam - 60 marks

No. Unit Topic Count Total

1 I

Network layer services 1

8

Internetworking with IPv4 1 Problems with IPv4 1 strategies to bridge limitations (IP subnetting, CIDR, DHCP, NAT) 1 Network design with CIDR 1 IPV6, Dual stack 1 Addressing, Options 1 Extension headers, Packet forwarding 1

2 II

Routing algorithms: Unicast protocols 1

8 RIP, OSPF, BGP 3 multicast routing protocols 1 ICMP, , IGMP, DHCP 1 Enhancements to all protocols in V6 2

3 III

Transport Layer Services 1

6

Transport layer protocols, UDP, TCP, State Transition diagram 1 flow control, error control 1 TCP Timers, Queuing disciplines 1 TCP Congestion control 1 Quality of Service 1

4 IV

Wireless Networks: Link Layer: IEEE 802.11 1

6

WLAN protocols, CSMA/CA 1 Connecting Devices, Wireless Application Protocol 1 Mesh networks: limitations 1 Wireless Sensor Networks, Zigbee Protocol 1 Wireless Personal Area Networks 1

5 V

Infrastructure for Network Management 1

6 SNMP 2 SMI, MIB 1 Security and administration 1 ASN.1 1

6 VI

Domain Name System 1

6

Email Representation and Transfer 1 File Transfer & Remote file access 1 World wide web, Network configuration, Peer-to-Peer Networks 1 SSH 1 DHCP 1

Text Books • B. A. Forouzan and Firouz Mosharraf, Computer Networks, A Top-Down Approach, Tata

McGraw-Hill, 2012 • Pete Loshin, IPv6:Theory, Protocol, and Practice, Elsevier, 2004 • Vijay K Garg, Wireless Communications and Networking, Morgan Kaufmann, 2008 Reference Books • Larry L Peterson and B S Davie, Computer Networks: A Systems Approach, Elsevier,2012 • W. Richard Stevens, TCP/IP Illustrated, Vol. 1: The Protocols, 2nd Edition, Pearson • B. A. Forouzan, “Data Communications and Networking”, 4th Edition, Tata McGraw-Hill,

2010 • William Stallings, “Data and computer Communication”, 7th Edition, Pearson Education, • A S Tanenbaum, “Computer Networks”, 4th Edition, Pearson Education • Alberto Leon Garcia and Indra Widjaja, “Communication Networks, Fundamental Concepts

and Key Architectures”, 2nd Edition, Tata McGraw-Hill, 2004 • J.F. Kurose and K. W. Ross, “Computer Networking: A Top-Down Approach Featuring the

Internet” , 2nd Edition, Pearson, 2003

URls: http://www.scribd.com/doc/140096863/IP-Addressing-and-Subnetting-Including-IPv6-Syngress-2000 cci.drexel.edu/faculty/gbooker/info330/330ch4.ppt speed.cis.nctu.edu.tw/~ydlin/course/cn/mcn_writeup/2.../chapter4.pdf https://www.iith.ac.in/~tbr/teaching/docs/wireless_lans.pdf http://www.manageengine.com/network-monitoring/what-is-snmp.html www.rn.inf.tu-dresden.de/lectures/idup/lecture2.pdf Course outcomes 1. Understand TCP-IP Network stack, the interplay between multiple layers, issues and

functionality and socket programming functions 2. Design networks with ipV4 classful addressing, realize issues, design with

CIDR, IPV6 fields and benefits 3. Describe packet forwarding and routing in internet using appropriate protocols and usage

of other protocols in network layer 4. Solve problems in Transport Layer: connection management, flow control, congestion

control and QoS 5. Familiar with wireless networking concepts and network management solutions and

related protocol: SNMP, CSMA, IEEE 802.11 6. Identify, describe and give examples of the networking applications used in everyday tasks

such as email, WWW, HTTP, FTP

Questions: Test 1 Q1:Network layer services, Network Design With CIDR Q2:Basics of IPV4 and IPV6, IPV4 and IPV6 addressing Q3:Routing protocols

Test 2 Q4:Transport Layer services and protocols Q5:Link layer, WLAN protocols Q6:Wireless Sensor Networks and Wireless Personal Area Networks

End Semester Exam Q7: Internet protocols versions(IPv4, IPv6) and addressing Q8: Routing Protocols Q9: Transport Layer Protocols Q10:Wireless Networks and protocols, Mesh networks, Wireless sensor networks and Wireless Personal Area Networks Q11:Network Management Q12:Application layer and application layer protocols

Program Outcomes relevant to the Outcomes: Full listing on URL http://www.coep.org.in/index.php?pid=824 1. Graduates will demonstrate basic knowledge in fundamentals of Information

Technology and related programming technologies. 2. Graduates will demonstrate basic knowledge of networking with wireless technologies,

multimedia technology and distributed computing, software testing and topics of current relevance to IT industry.

4. Graduates will demonstrate the ability to design creative solutions to real life problems. 9. Graduates will demonstrate good performance at the competitive examinations

like GATE, GRE, CAT for higher education and / or seek employment. Mapping of Questions to CO’s: (Sequence of Questions as per item 7)

Questions CO’s

1 1,2 2 2 3 3 4 4 5 1,5 6 5 7 2 8 3 9 4 10 5 11 5 12 6

Mapping of CO’s to PO’s:

CO’s PO’s

1 1,9 2 1,2,4,9 3 1,2,4,9

4 1,2,4,9 5 2,9 6 2,9

Evaluation Scheme:

Examination Marks Date Quiz I 20 As per academic schedule Quiz II 20 As per academic schedule

End Sem Exam 60 As per academic schedule

(Dr J V Aghav) Head, Comp IT Dept

(Mr. S. S.Kumbhar) Course in charge

List of Assignments:

1. Implement a Client-Server communication between two machines

2. Simulate Sliding Window Go-back-N protocol

3. Capture and analyze Ethernet frames using Wireshark

4. Capture and analyze IP packet Fragmentation using Wireshark Course outcomes:

1. Implement client-server using UDP and TCP sockets

2. Create simulation of sliding window protocol

3. Install Wireshark and conduct experiments on Ethernet, IP, TCP, DNS

(Dr J V Aghav) Head, Comp IT Dept

(Mr. S. S.Kumbhar) Course in charge

College of Engineering, Pune - 05 Department of Computer Engineering and Information Technology

IT - 09004 :NETWORK ARCHITECTURE AND WIRELESS PROTOCOLS LABORATORY Teaching Scheme Examination Scheme:

Practical: 2 hrs/week Term work - 50 Oral -50

 

College of Engineering Pune 411005 Department of Computer Engineering and Information Technology

Course Plan: TY B Tech (Computer Engineering), 2014-2015, Semester V 

CT 303 : DATABASE MANAGEMENT SYSTEM

Teaching Scheme: Lectures- 3 hours/week Examination Scheme: Assignments/Quizzes- 40 Marks

End Semester Examination-60 Marks Objectives:

This course is one of the fundamental courses in Computer Engineering. This course helps students in understanding the Introduces the fundamental concepts

related to Database  It introduces the query languages that are essential for querying databases which

helps students in analyzing the user requirements.  Introduces the various data models which describes the structure of the database

and. Introduces various types of File Systems. Database design helps in applying the practical aspects of a problem/project

SN Unit Topic Lectures

Total

01 I Basic concepts, Advantages of DBMS over file-processing systems 01 03 Data abstraction, Data Models and data independence, Components of DBMS and overall structure of DBMS

01

Data Modeling, entity, attributes, relationships, constraints, keys E-R diagrams, Components of E-R Model.

01  

 

02 II Relational Model: Basic concepts. Attributes and domains, concept of integrity and referential constraints, schema diagram

02 04

Relational Query Languages: Relational Algebra and Relational Calculus: Tuple relational and domain relational calculus.

02

 03 III Introduction to SQL, Characteristics and advantages of SQL, SQL

Data Types and Literals, DDL 02 08

Tables: Creating, modifying, deleting, Views: Creating, dropping, Updation using Views

02

DML,SQL Operators, SQL DML queries, SELECT query and clauses, Set Operations, Predicates and Joins

02

Set membership, Tuple variables, set comparison, ordering of tuples, aggregate functions, nested queries,

02

       

 

04 IV Database modification using SQL Insert, Update and Delete queries, Dynamic and Embedded SQL and concept of stored procedures, Query-by-example.

03 06

Storage and File Systems,Secondary Storage, RAID, File Organization, Indices, Static and Dynamic Hashing, B-trees

03

 

04 V Relational Database Design, Notion of normalized relations 01 06

Functional dependency, decomposition and properties of decomposition

02

Normalization using functional dependency, Multi-valued dependency and Join dependency

03

 06 VI Query Management and Transaction Processing,Measures of

query cost, Selection operation, sorting and join operation 03 09

Transaction Concept, Components of transaction management, Concurrency and recovery system, Different concurrency control protocols such as timestamps and locking, validation, Multiple granularity, Deadlock handling

03

    Different crash recovery methods such as log-based recovery, shadowpaging, Buffer management and Remote backup system.

03

      Total 36 Text Books: · Abraham Silberschatz, Henry F. Korth, S. Sudarshan, “Database system concepts”, 5th Edition, McGraw Hill International Edition. · Raghu Ramkrishnan, Johannes Gehrke, “Database Management Systems”, Second Edition, McGraw Hill International Editions. Reference Books: · Rob Coronel, “Database systems : Design implementation and management”, 4th Edition, Thomson Learning Press. · Ramez Elmasri and Shamkant B. Navathe, “Fundamental Database Systems”, Third Edition, Pearson Education, 2003.

Outcomes:

1.Understand various components of DBMS and enforcement of key constraints on database. 2.Analyse requirements and Construct ER model for given application. 3.Create basic and advance SQL queries. 4.Understand and analyse the atabase design and apply normalization. 5.Understand different file organization techniques. 6.Learn concurrency control ,failure and recovery of databases. 7.Connect high level programming language with database through JDBC. 8.Design client/server model for database application.

Evaluation Procedure:

Examination Marks Dates (Academic Calendar)

Quiz I 20 As per Academic calendar Quiz II 20 As per Academic calendar End Sem Exam 60 As per Academic calendar

(Dr Vahida Attar/ Dr S U Ghumbre) Head

Subject In charge Dept. of Computer Engg. and IT

 

College of Engineering, PUNE - 05 Department of Computer Engineering and Information Technology

Course Plan Course: CT-09007 - Database Management System Lab

Schedule: 3 hrs/week

List of Assignments: 

Assignment 1: Basic SQL a. Write the following simple SQL Queries on the given Schema.  b. Create a schema for given case using the DDL commands. Insert sample data using the command in the file Try inserting more data into these tables.

Assignment 2: More SQL a. Intermediate SQL: Aggregates and grouping and ordering b. Nested Subqueries and SQL Updates Assignment 3: SQL DDL and updates Assignment 4: Schema creation and constraints Create the schema and constraints on the relations. Assignment 5: Indexing and Query Processing Assignment 5: JDBC Assignment 6: Servlets Books: Abraham Silberschatz, Henry F. Korth, S. Sudarshan, “Database system concepts”, 5th Edition, McGraw Hill International Edition. 

Rob Coronel, “Database systems : Design implementation and management”, 4th Edition, Thomson Learning Press.

Outcomes:

1.Understand various components of DBMS and enforcement of key constraints on database.

2.Create basic and advance SQL queries.

3. Understand and analyse the database design.

4.Connect high level programming language with database through JDBC.

5.Design client/server model for database application.

Evaluation Scheme Continues Assessment – 50 marks Final Practical /Oral –50 marks

(Dr Vahida Attar/ Dr S U Ghumbre) Head

Subject In charge Dept. of Computer Engg. and IT

College of Engineering, Pune - 05 Department of Computer Engineering and Information Technology

IT - 09002: SYSTEM PROGRAMMING AND OPERATING SYSTEM

Teaching Scheme: Lectures- 3 Hrs/Week Examination Scheme: 100 marks: Continuous evaluation-

Assignment/Quizzes – 40 marks End Sem Exam - 60 marks

Teaching plan No. Unit Topic Count Total

1 I

Introduction to System software and Operating Systems structures 1

6

Evolution of operating system, Batch, Timesharing, Multiprogramming and Multi tasking Systems

1

Distributed and Real time Systems. Introduction to Assembler 1 Introduction to Linker and Loader, Fundamentals: System concepts, System components & architecture

1

Booting process, O.S. Services 1 System Calls, System Programs, System Structures, Virtual Machines 1

2 II

Memory Management: Memory Hierarchy, Cache Memory, Cache Mapping, Multilevel Cache, Split cache

1

6 Contiguous and Non-Contiguous Allocation 1 Paging, Segmentation – concepts 1 Virtual memory, Management of Virtual memory: Demand paging 1 Performance of demand paging 1 Page replacement algorithms, Thrashing 1

3 III

Processes And Threads: Concepts and structures in process managements 1

6 Process scheduling, Scheduling Concept of threads 1 User level threads 1 System level threads 1 Application programming primitives for process and thread management 2

4 IV

Concurrent Programming and Synchronization: Need for Inter process Synchronization

1

6

Race conditions Mutual Exclusion and Critical section problems 1 Process synchronization mechanisms - Semaphores 1 Process synchronization mechanisms -Locks, Monitors 1 Deadlock problems and solutions 1 Classical problems in concurrent programming: Producer/Consumer, Readers/Writers.

1

5 V

Inter process Communication: Introduction to open MP and MPI Streams and pipes, Shared memory

2

6 Asynchronous communication, Signals, Operating system interfaces for application programming using openMP

2

Operating system interfaces for application programming using MPI, pipes, shared memory, Signal handling

2

6 VI

File Management : File Organization, concept of files & directories 1

6 Hierarchical structure of file 1 Space allocation 1 Free space management 1 Security issues and Protection mechanism 2

Total 36

Text Books :

1. D. M. Dhamdere : “Systems programming and operating system”, Tata McGraw Hill. 2. Abranhan Silberschatz, Peter B Galvin ; Operating System Concepts, Addition Wesley Publishing

Company. References :

1. Milenkovic ; Operating System Concepts and Design; McGraw Hills. 2. Andrew Tanenbaum “ Operating Systems: Design and Implementation “ PHI

Useful URLs: http://www.cs.uic.edu/~jbell/CourseNotes/OperatingSystems/

http://www.cs.nyu.edu/courses/fall00/G22.2250-001/class-notes.html http://nptel.iitm.ac.in/courses/Webcourse-contents/IISc-BANG/Operating systems/New_index1.html http://www.cse.sc.edu/~matthews/Courses/510/Lectures.html

Course Outcomes:

1. CO-1: Introduce the knowledge of basic issues with fundamental of operating systems mechanism. 2. CO-2: Develop an awareness of the function and complexity of linkers, loaders and assemblers. 3. CO-3: Give students the knowledge of process management, memory management which covers a

broad range of engineering aspects. 4. CO-4: Learn concurrent programming and synchronization mechanisms and introduce concept of

files & directories 5. CO-5: Provide a thorough coverage of the basic issues in programs interacting directly with

operating systems. Questions:

Test 1 Q1 –Fundamental of operating systems mechanism. Q2 - About assemblers loaders and linkers. Q3 –Memory management and page replacement algorithms. Test 2 Q4 – Concepts and structures in process managements and in threads. Q5 – How to resolve issues with Concurrent programming and synchronization Q6 – Deadlock problems and solutions End Semester Exam

Q7 – Introduction to System software ,Operating Systems structures and memory management.

Q8 – On process and threads scheduling Q9 – On semaphores, locks, monitors and classical problem of concurrent programming Q10 - Based on Inter process Communication Q11 - Concept of files & directories Program Outcomes relevant to the Outcomes:

1. PO-a: Graduates will demonstrate basic knowledge in fundamentals of programming,

algorithms and programming technologies. 2. PO-c: Graduates will have knowledge of the best practices in software development in industry. 3. PO-e: Graduates will demonstrate capability to work in teams and in professional work

environments 4. PO-f: Graduates will be able to communicate technical topics in written and verbal forms. 5. PO-h: Graduates will demonstrate their ability to use the state of the art technologies and tools

including Free and Open Source Software (FOSS) tools in developing software. 6. PO-i: Graduates will demonstrate good performance at the competitive examinations like GATE,

GRE, and CAT for higher education. 7. PO-k: Graduates will be able to develop the capability for self-learning.

Mapping of Questions to CO’s:

Questions CO’s 1 1 2 2 3 3 4 3 5 4 6 4 7 1,2,3 8 3 9 4 10 4,5 11 4,5

Mapping of CO’s to PO’s:

CO’s PO’s 1 a, i 2 a, c, e, h, i 3 a, f, i 4 a, f, i 5 k

Evaluation Procedure

Examination Marks Dates (As per Academic Calendar) Quiz I 20 August 25-28, 2014 Quiz II 20 September 22-25, 2014 End Sem Exam 60 November 19 – December 02, 2014

(Aparna Santra Biswas) Head

Subject In charge Dept. of Computer Engg. and IT

IT - 09005 SYSTEM PROGRAMMING & OPERATING SYSTEM LABORATORY Teaching Scheme Practical : 2 hrs/week

Examination Scheme Practical –50 marks Term Work – 50 marks

List of Assignments:

1 Designing a simple assembler for hypothetical machine. 2 Design simple macro processor 3 Implementation of CPU scheduling algorithms. 4 Process creation and inter process communication using openMP and MPI programming. 5 Deadlock handling-Bankers' algorithm. 6 Demand paging implementation-using algorithms like LRU, LFU,etc. 7 Implementation of first-fit, best-fit and worst fit algorithms for memory allocation. Outcomes: After completing this course the students should be able to

a) Implement translators (assembler, macro pre-processor) in a high level programming language like C, C++

b) Implement different programs in compiler generation tools like FLEX & c) Implement intermediate code generation d) Implement code optimization techniques e) Students will be technically more familiar with Computer Systems.

(Aparna Santra Biswas) Head Subject In charge Dept. of Computer Engg. and IT

Department of Computer Engineering and Information TechnologyCourse Plan

Course Code: IT-9003 Course: Graphics and MultimediaTeaching Scheme: Lectures- 3 Hrs/Week Examination Scheme: Quizzes- 40 Marks

ESE-60 Marks Class: T Y (IT) Semester: V Academic Year: 2014-15

Teaching Learning Interaction

Page 1 of 3

S N Unit Topic Lectures Total

01 I

Introduction to computer graphics, lines, line segments, vectors, pixels and frame buffers, vector generation, DDA Line generation Algo. 01

05Bresenham’s Line generation Algorithm, antialiasing. 01Circle drawing algorithms 01Polygon representation, entering Polygons, Polygon filling: Seed fill

01

Edge fill, scan conversion algorithm. 01

02 II

Introduction, matrices, homogeneous coordinates, 2D transformation, Composite Transformation. 01

07

Problems on 2D Transformation. 023-D Transformations: 3-D geometry, primitives, transformations, Rotation about an arbitrary axis. 01

Problems on 3D Transformation. 01Concept of parallel and perspective projections, problems on projection 01Problems on projection, Viewing parameters 01

03 III

Segments and Animation: Introduction, segment table, segment creation, closing, deletion, renaming.

01

05Image transformations, raster techniques, Devices for producing animation. 01Computer assisted animation, video formats, real time animation. 01Frame-by-frame animation, method for controlling animation, animation

software02

04 IV

Multimedia basic concepts, Multimedia building blocks, multimedia applications design considerations; goals and objectives; architectural support for multimedia processing.

01

05Multimedia Authoring Fundamentals: authoring fundamentals, card/page

based 01

Multimedia Authoring Fundamentals: time based, icon based 01Multimedia Authoring Fundamentals: frame based and object based

authoring01

Interactive multimedia software authoring basics 01

05 V

Multimedia audio: Basic sound concepts, audio capture, sound processor 01

06WAV file format for sound, MIDI standard 02audio coding: PCM encoding, Linear Predictive coding , ADPCM 03

06 VI

Image and Video:Image: Representation of image in digital format . BMP, TIFF file formats

02

08Image Compression: Need of Image Compression, Image Compression

techniques Huffman coding , run length coding, JPEG.02

Video technology , Video capture, video, processing, NTSC, PAL, SECAM television standards,

02

HDTV, Video Compression based on motion compensation H .261, MPEG1 02

Total 36

Text Book:

1. D. Hearn, M. Baker, “Computer Graphics – C Version”, 2nd Edition, Pearson Education2. J. Foley, Van Dam, S. Feiner, J. Hughes, “Computer Graphics Principles and Practice”, 2nd Edition, Pearson

Education, 20033. Ze - Nian Li, Mark S. Drew, “ Fundamentals of Multimedia “, Pearson education

Reference Book:

1. D. Rogers, “Procedural Elements for Computer Graphics”, 2nd Edition, TATA Mc-Graw-Hill Publication, 20012. F. Hill, “Computer Graphics: Using OpenGL”, 2nd Edition, Pearson Education, 2003 3. S. Harrington, “Computer Graphics”, 2nd Edition, McGraw-Hill Publications, 1987

Online Course Resources:

• https://docs.google.com/file/d/0B_YZ665nBRhlYmNiOTU5ZDItMmU2OC00YTVmLThiNmMtMjg3Y2E3ZTgwZ DYw/edit?hl=en_US

• http://ptgmedia.pearsoncmg.com/images/9780321399526/samplepages/0321399528.pdf

• http://eng.uok.ac.ir/mohammadi/UOK/courses/Multimedia/Fundamentals_of_Multimedia.pdf

• http://nptel.iitm.ac.in/video.php?subjectId=106106090

• http://nptel.iitm.ac.in/courses/Webcourse-contents/IIT-Delhi/Computer%20Graphics/csmain.htm • http://www.cs.rit.edu/~icss571/filling/

• http://en.wikipedia.org/wiki/2D_computer_graphics

• http://ic.sjtu.edu.cn/ic/mm/wp-content/uploads/sites/14/2013/04/Fundamentals-of-Multimedia.pdf

List of Assignments:

1. Study and installation of Lib-graph

2. Study of different image formats and Audio-Video formats

3. Study of audio-video editing tools

Course Outcomes:

1. CO1-Makes students aware of basic concepts of computer graphics.2. CO2-Students learn various algorithms to draw various graphics primitives.3. CO-3 Students understand 2-D and 3-D transformation.4. CO-4 Insights to multimedia file formats that are useful in design of multimedia applications.5. CO-5 State of the art tools and environments for design of multimedia applications using basic components

viz. audio, image, and video with considering network protocols are covered.6. CO-6 This course makes student understand the fundamental concepts in multimedia that are useful in

design on modern information systems based on multimedia.

Questions:

Test 1Q1 – Basics of line line segments vectors Q2 - Different Algorithms of line and circleQ3 – Matrices Homogeneous Coordinates and Basics of 2D Transformations

Test 2Q4 – Rotation, Parallel and perspective projections Q5 – Viewing Parameters, 3D viewingQ6 – Image transformations and animation, Multimedia and building blocks, Authoring fundamentals

End Semester ExamQ7 – On Unit one and twoQ8 – On Unit three and fourQ9 – Basic sound concepts, audio capture, sound processor,Q10 - WAV file format for sound, MIDI standard, audio coding: PCM encoding, Linear Predictive coding ADPCM

Page 2 of 3

Q11 - Image: Representation of image in digital format . BMP, TIFF file formats, Video technology , Video capture, video processing

Program Outcomes relevant to the Outcomes:

1. PO1-Graduates will demonstrate basic knowledge in fundamentals of Information Technology and related programming technologies.

2. PO2-Graduates will demonstrate basic knowledge of networking with wireless technologies, multimedia technology and distributed computing, software testing and topics of current relevance to IT industry.

3. PO4-Graduates will demonstrate the ability to design creative solutions to real life problems.

4. PO7-Graduates will demonstrate an understanding of the problems of the IT industry.

5. PO8-Graduates will demonstrate their ability to use the state of the art technologies and tools including Free and Open Source Software (FOSS) tools in developing software.

6. PO10-Graduates will demonstrate their qualities of learning and demonstrating latest technology

7. PO11-Graduates will have developed the capability for self-learning.

Mapping of Questions to CO’s:

Questions CO’s1 12 23 34 35 36 47 1, 2, 38 1, 2, 39 5, 6

10 5, 611 5, 6

Mapping of CO’s to PO’s:

CO’s PO’s1 1, 22 2, 63 34 2, 35 2, 3, 4, 66 2, 3, 4, 7

Evaluation Scheme:

Examination Marks Dates (As per Academic Calender)

Quiz I 20 August 25-28, 2014Quiz II 20 September 22-25, 2014

End Sem Exam 60 November 19 – December 02, 2014

(Dr. J. V. Aghav) (A. D. Joshi) Head, Subject In charge

Dept. of Computer & IT

Page 3 of 3

Department of Computer Engineering and Information TechnologyCourse Plan

Course Code: IT-9006 Course: Graphics and Multimedia Laboratory Teaching Scheme: Lab - 3 Hrs/Week Examination Scheme: Term Work – 50 marks

Oral – 50 Marks

Class: T Y (IT) Semester: V Academic Year: 2014-15

Teaching Learning InteractionThe list of following assignments shall be executed as per the discussions in theory classes.

Sr. No. Assignments

1 Write a program to implement algorithm for line drawing

2 Write a program to implement algorithm for circle generation

3 Write a program to implement 2-D transformations

4 Write a program to implement 3-D transformations

5 Write a programto generate animation effect

6 Study of authoring tool – Director 8, to create presentation using multimedia files.

7 Parsing WAV sound files and reading it by programming in C/VC++

8 Designing Media player using MCI commands to play sound – WAV, MIDI, AVI filesetc.

9 Understanding standard Image file formats e.g. BMP, TIFF

10 Implementation of the Huffman coding algorithm

Text book:

1. D. Hearn, M. Baker, “Computer Graphics – C Version”, 2nd Edition, Pearson Education2. J. Foley, Van Dam, S. Feiner, J. Hughes, “Computer Graphics Principles and Practice”, 2nd Edition, Pearson

Education, 20033. Ze - Nian Li, Mark S. Drew, “ Fundamentals of Multimedia “, Pearson education

Reference books:

1. D. Rogers, “Procedural Elements for Computer Graphics”, 2nd Edition, TATA Mc-Graw-Hill Publication, 20012. F. Hill, “Computer Graphics: Using OpenGL”, 2nd Edition, Pearson Education, 2003 3. S. Harrington, “Computer Graphics”, 2nd Edition, McGraw-Hill Publications, 1987

Online Course Resources:

• https://docs.google.com/file/d/0B_YZ665nBRhlYmNiOTU5ZDItMmU2OC00YTVmLThiNmMtMjg3Y2E3ZTgwZDYw/ edit?hl=en_US

• http://ptgmedia.pearsoncmg.com/images/9780321399526/samplepages/0321399528.pdf

• http://eng.uok.ac.ir/mohammadi/UOK/courses/Multimedia/Fundamentals_of_Multimedia.pdf

• http://nptel.iitm.ac.in/video.php?subjectId=106106090

• http://nptel.iitm.ac.in/courses/Webcourse-contents/IIT-Delhi/Computer%20Graphics/csmain.htm • http://www.cs.rit.edu/~icss571/filling/

• http://en.wikipedia.org/wiki/2D_computer_graphics

• http://ic.sjtu.edu.cn/ic/mm/wp-content/uploads/sites/14/2013/04/Fundamentals-of-Multimedia.pdf

List of Assignments:

As per given in the above section Teaching Learning Interaction

Course Outcomes:

This course teaches the fundamental concepts in multimedia that are useful in design on modern information systems based on multimedia

1. CO1-Insight to multimedia file formats that are useful in design of multimedia applications

2. CO2-State of the art tools and environments for design of multimedia applications using basic components viz. audio, image, and video with considering network protocols.

3. CO3-Insights to Computer Graphics concepts and implementations

Questions:

As per given in the above section Teaching Learning Interaction, the external examiner will allow to take practical exam and give some modifications

Program Outcomes relevant to the Outcomes:

1. PO1-Graduates will demonstrate basic knowledge in fundamentals of Information Technology and related programming technologies.

2. PO2-Graduates will demonstrate basic knowledge of networking with wireless technologies, multimedia technology and distributed computing, software testing and topics of current relevance to IT industry.

3. PO4-Graduates will demonstrate the ability to design creative solutions to real life problems.

4. PO7-Graduates will demonstrate an understanding of the problems of the IT industry.

5. PO8-Graduates will demonstrate their ability to use the state of the art technologies and tools including Free and Open Source Software (FOSS) tools in developing software.

6. PO10-Graduates will demonstrate their qualities of learning and demonstrating latest technology

7. PO11-Graduates will have developed the capability for self-learning.

Mapping of Questions to CO’s:

Questions CO’s1 2, 32 2, 33 2, 34 2, 35 2, 36 1, 27 1, 28 1, 29 1, 2

10 1, 2

Mapping of CO’s to PO’s:

CO’s PO’s1 1, 2, 32 2, 3, 4, 5, 63 1, 5, 7

Evaluation Procedure:

Examination Marks DateFirst Practical Assessment 25 Immediately After Quiz I Second Practical Assessment 25 Immediately After Quiz II Final Practical Exam 50 Before End Sem Exam (In last lab session)

(Dr. J. V. Aghav) (A. D. Joshi) Head, Subject In charge

Dept. of Computer & IT