Government Polytechnic, Pune

'180 OB' – Scheme

Programme Diploma in ET/CE/EE//ME/MT/CM/IT/DDGM

Programme code 01/02/03/04/05/06/07/08/16/17/21/22/23/24/26

Name of Course Operating Systems

Course Code CM3101

Prerequisite course code and -
name
Class Declaration Yes

1. TEACHING AND EXAMINATION SCHEME

Teaching Total Examination Scheme

Scheme Credits Theory Practical Total
(In Hours) (L+T+P) Marks
L T P C ESE PA *ESE PA
Marks 80 20 25 25 150
04 0 02 06 Exam
3 Hrs 1 Hr 2 Hr
Duration
(*):OE (Oral Examination)
Legends: L- lecture, T-Tutorial/teacher guided theory practice, P-practical, ESE-End semester
examination, PA- Progressive Assessment.

2. RATIONALE
Operating Systems are system programs, which are very essential components of
Computer system. Two primary aims of operating systems are to manage resources (e.g.
CPU time, memory) and to control users and software. Operating system design goals are
often contradictory and vary depending on user, software, and hardware criteria. This course
describes the fundamental concepts behind operating systems, and examines the ways that
design goals can be achieved and practice the concept of Operating System design.

3. COMPETENCY
The aim of this course is to attend following industry identified competency through
various teaching learning experiences:
• Manage operations of Operating System.

G P Pune Page 1 of 7
 4. COURSE OUTCOMES (COs)
The theory, practical experiences and relevant soft skills associated with this course are
to be taught and implemented, so that the student demonstrates the following industry
oriented COs associated with the above mentioned competency:

1. Differentiate between types of operating systems.

2. Describe services of operating system.
3. Describe process management and execute related commands.
4. Describe various processor scheduling algorithms and deadlock handling techniques.
5. Explain different approaches to memory management.
6. Describe and manage structure and organization of the file system.

5. SUGGESTED PRACTICALS/ EXERCISES

The practical’s in this section are PrOs (i.e. sub-components of the COs) to be developed and
assessed in the student for the attainment of the competency:

Approx.
Sr. Practical Exercises Relevant
Unit Hrs.
No. (Learning Outcomes in Psychomotor Domain) CO
No. Required
1 1 Advanced Linux Installation: Network and Dual Boot CO1 02
2 2 Linux Disk Management using fdisk utility to create, delete and CO2 02
change the partitions on the disk.
3 Setting/Changing file and directory related permissions chmod CO2,CO6 02
and umask command.
4 Displaying File Information : inodes, inodes and directories, cp CO2,CO6 04
and inodes, mv and inodes, rm and inodes, ls –l
5 Working with Linux-supported File Systems: Mounting and CO2 02
Unmounting to be tested with external drives
6 3 Linux Process Management : Jobs: Background, Kills and CO3 04
Interruptions and setting process priority Get Process status,
Find Processes by Pattern or User, Display the Most Active
Processes,Kill processes, kill all processes(Executing commands
for process management –ps, fg, bg, kill ,killall, nice, at ,jobs)
7 3 System states :init Shutting down and changing Runlevels, CO3 04
Managing Users and Groups: Adding and Removing users with
adduser,usermod and userdel commands
8 Adding and Removing groups with groupadd,groupmod and CO3 02
groupdel commands, Superuser-The root User Desktop,System
Time and Date
9 4 Scheduling jobs with crontab : cron daemon, crontab options, CO4 02
The format of crontab file, Environment variable settings,
crontab command lines
10 5 Linux: Memory Management Practicing top, vmstat and free CO5 02
command
11 ALL Executing various Shell commands ALL 06
Creating shell variables , Writing shell scripts using decision
making and various control structures., Executing various shell
utilities, Using file test and string test conditions in scripts.,
Making use of Positional Parameters.
Configuring your own login shell.Using Functions in Shell
scripts.
Total 32

G P Pune Page 2 of 7
Sr.No. Performance Indicators Weightage in %
a. Installation/configuration of OS 40
b. Correctness of Executing various commands 30
c. Writing and executing programs to get desired output 10
d. Observations and Recording 10
e. Answer to sample questions 10
Total 100

6. MAJOR EQUIPMENT/ INSTRUMENTS REQUIRED

The major equipment with broad specification mentioned here will usher in uniformity in
conduct of practical, as well as aid to procure equipment by authorities concerned.

Sr. Experiment
Equipment Name with Broad Specifications
No. Sr.No.
a Computer Systems (Any Computer System with basic configuration) ALL
b Linux or alike OS such as Ubuntu,CentOS,RedHat etc. ALL

7. THEORY COMPONENTS
The following topics/subtopics should be taught and assessed in order to develop UOs for
achieving the COs to attain the identified competency.

Unit Outcomes (UOs) Topics and Sub-topics

(in cognitive domain)
SECTION I: UNIT 1: INTRODUCTION (Weightage-10 , Hrs- 10)
1a. Explain the functioning of 1.1 Operating System: Concepts, Components of OS,
given component of OS. And Operations of OS: Process Management,
1b.Explain characteristics of Memory Management, Storage Management,
the given type of operating
Protection and Security.
system.
1c. Identify type of operating 1.2 Views of OS: User View, System View
system suitable for the given 1.3 Operating System Operations: Dual Mode, Timer
type of application. 1.4 Special-Purpose Systems: Real-Time Embedded
1d. Execute command on Systems, Multimedia Systems,Batch OS,Time Shared
command line for the given OS,Distributed System,Mobile OS(Android,iOS)
task. 1.5 Open-Source Operating System: Linux, BSD Unix

UNIT 2. OS SERVICES AND COMPONENTS(Weightage-14 , Hrs- 14)

2a. Start, stop and restart the 2.1 Different Services of Operating System.
given service in Linux. 2.2 System Calls-Concept, types of operating system
2b. Explain use of given calls
system call of specified
2.3 OS component-Process Management, Main memory
OS.
2c. Explain process that Management, file Management, I/O system
follows in managing the management, secondary storage management
given resource. 2.4 Use of operating system tools, user management,
2d. Explain use of the given security policy.
operating system tool.

G P Pune Page 3 of 7
Unit Outcomes (UOs) Topics and Sub-topics
(in cognitive domain)
UNIT 3. PROCESS MANAGEMENT(Weightage-16 , Hrs- 08)
3a. Explain functions carried out 3.1 Process-Process states, Process Control Block (PCB).
in the given process state. 3.2 Process Scheduling- Scheduling Queues Schedulers,
3b. Describe the function of the Context switch.
given component of process 3.3 Operations on Process:Creation, Termination
stack in PCB. 3.4 Inter-Process Communication (IPC): Introduction,
3c. Explain the characteristics of shared memory system and message passing system.
the given multithreading 3.5 Multithreading Models
model. 3.6 Thread Libraries, Threading Issues
3d. Describe method of
executing the given process
command with example.
Section-II UNIT 4 CPU SCHEDULING AND DEADLICK(Weightage-16 , Hrs- 12)
4a. Justify the need and 4.1 Scheduling types-Scheduling objective, CPU and I/O
objective of given job burst cycles, Pre-emptive, Non-Per-emptive.
scheduling criteria with 4.2 Types of scheduling algorithms-First come first
relevant example. served (FCFS), shortest job first (SJF), Shortest
4b. Explain with example the Remaining Time (SRTN), Round Ribon(RR) Priority
procedure of allocating scheduling, multilevel queue scheduling.
CPU to the given process 4.3 Critical section problem.
using the specified OS. 4.4 Deadlock- system, Models, Necessary condition
4c. Calculate turnaround time leading to Deadlocks, Deadlock Handling-
and average waiting time of Preventions, avoidance and Recovery.
the given scheduling
algorithm.
4d. Explain functioning of the
given necessary condition
leading to deadlock.
UNIT 5. MEMORY MANAGEMENT(Weightage-14 , Hrs- 10)
5a. Describe the working of 5.1 Basic Memory Management-Partitioning, Fixed and
specified memory variable,
management function. 5.2 Free space management techniques-Bitmap, Linked
5b. Explain characteristic of the List.
given memory management 5.3 Introduction to page tables
techniques. 5.4 Segmentation, Fragmentation, Page Fault
5c. Write algorithm for the 5.5 Virtual memory-Introduction to paging, Demand
given page replacement Paging
technique. 5.6 Page replacement Algorithm-FIFO, LRU, Optimal.
5d. Calculate page fault for the
given page reference string.
UNIT 6 : FILE MANAGEMENT(Weightage-10 , Hrs- 10)

6a. Explain the structure of the 6.1 File-concept, Attributes, Operations, types and File
given file system with System Structure.
example. 6.2 Access Methods-Sequential, Direct, Swapping, File
6b. Describe mechanism of the Allocation Methods-Contiguous, Linked, Indexed.

G P Pune Page 4 of 7
 Unit Outcomes (UOs) Topics and Sub-topics
(in cognitive domain)
given file access method. 6.3 Directory Structure-Single level, two level, tree-
6c. Explain procedure to create structured directory, Disk organization and Disk
and access method. Structure-Physical structure, Logical structure, Raid
structure of Disk, RAID level 0 to 6.
6.4 File System Implementation: Partitions and
Mounting, Virtual File Systems

8. SUGGESTED SPECIFICATION TABLE FORQUESTION PAPER DESIGN

Teachin Distribution of Theory Marks

Unit g Hrs R Level U A and Total
Unit Title
No Level above Marks
Levels
1 Introduction 10 04 04 02 10
2 OS Services and components 14 02 06 06 14
3 Process Management 08 02 04 10 16
4 CPU Scheduling and Deadlock 12 02 04 10 16
5 Memory Management 10 04 04 04 14
6 File Management 10 04 04 02 10
Total 64 18 26 34 80

9. STUDENT ACTIVITIES
Other than the classroom and laboratory learning, following are the suggested student-related co-
curricular activities which can be undertaken to accelerate the attainment of the various
outcomes in this course:
a. Prepare Journal for practical’s
b. Undertake micro projects

10. SPECIAL INSTRUCTIONAL STRATEGIES (if any)

These are sample strategies, which the teacher can use to accelerate the attainment of the various
outcomes in this course:
a. Massive open online courses (MOOCs) may be used to teach various topics/sub topics.
b. ‘L’ in item No. 4 does not mean only the traditional lecture method, but different types of
teaching methods and media that are to be employed to develop the outcomes.
c. About 15-20% of the topics/sub-topics which is relatively simpler or descriptive in nature
is to be given to the students for self-directed learning and assess the development of the
LOs/COs through classroom presentations (see implementation guideline for details).
d. With respect to item No.10, teachers need to ensure to create opportunities and provisions
for co-curricular activities.
e. Guide student(s) in undertaking micro-projects.

11. SUGGESTED MICRO-PROJECTS

a. Study and present three Microsoft Device Drivers

b. Study and present HDFS configuration
c. Write a shell script that schedules a process and run the shell script at specific time.
d. Write a shell script that tests the connectivity of group of computers.

G P Pune Page 5 of 7
 e. Write a shell script that counts number of files and number of directories in a
directory.

12. LEARNING RESOURCES

Sr.
Title of Book Author Publication
No.
Operating System Silberschatz Galvin, Wiley and Sons, Ninth Edition, Galvin .
1 Concepts Gagne, John 2015, ISBN: 978-5 1-265-5427-0 2
Wisley& Sons ISBN-13: 978-0470128725
Operating Systems Achyut S. Godbole, Tata McGraw Hill Education, 2015,
2
Tata McGraw-Hill ISBN: 97800705911343
System Programming D. M. McGrawHill
3 & Operating System Dhamdhere,TMH Education;ISBN:9780074635797
Operating System Milan McGraw Hill Education
4 Concept & Design Milenkovic,TMH ISBN-10: 0074632728
ISBN-13: 978-0074632727

13. SOFTWARE/LEARNING WEBSITES

a) www.cs.wisc.edu/~ bart/537 lecture notes-University of Wisconsin Madison.
b) www.cs.kent.edu/osf 03/notes/index.html- ViliniusGediminas Technical University
c) http://www.howstuffworks.com/operating-system 1.htm
d) www.en.wikipedia.org/wiki/Operating system ay a

14. PO - COMPETENCY- CO MAPPING

CO/PO PO1 PO2 PO3 PO4 PO5 PO6 PO7

CO1 - - - 1 - 1 2
CO2 1 - - 1 - - 1
CO3 1 1 1 1 1 1 2
CO4 1 2 2 - - 1 3
CO5 1 1 1 - - 2 3
C06 1 1 1 - - 1 3

CO/PSO PSO1 PSO2

CO1 - -
CO2 - -
CO3 1 -
CO4 1 -
CO5 3 -
C06 3 -

G P Pune Page 6 of 7
 Sign: Sign:
Name: (Smt.N.P.Sarwade)
(Smt.A.B.Bhusagare) Name: Shri. U.V. Kokate
(Smt.A.M.Galshetwar) (Head of Department)
(Smt.N.R.Wagh)
(Course Expert /s)

Sign: Sign:

Name: Shri. U.V. Kokate Name: Shri A.S.Zanpure

(Program Head ) (CDC )
(Computer Engineering Dept.)

G P Pune Page 7 of 7
 Government Polytechnic, Pune
‘180 OB’– Scheme

Programme Diploma in ET/CE/EE//ME/MT/CM/IT/DDGM

Programme code 01/02/03/04/05/06/07/08/16/17/21/22/23/24/26

Name of Course Java Programming-I

Course Code CM3102

Prerequisite course code and --
name
Class Declaration No

1. TEACHING AND EXAMINATION SCHEME

Teaching Total Examination Scheme

Scheme Credits Theory Practical Total
(In Hours) (L+T+P) Marks
L T P C ESE PA *ESE PA
Marks 80 20 25 25 150
03 00 02 05 Exam
3 Hrs 1 Hr 2 Hr
Duration
(*):POE (Practical&Oral Examination)
Legends: L- lecture,T-Tutorial/teacher guided theory practice, P-practical, ESE-End
semester examination, PA- Progressive Assessment.

2. RATIONALE

Java is platform independent, open-source object oriented programming language

enriched with free and open source libraries. In current industrial scenario java has
broad industry support and is prerequisite with many allied technologies like advanced
java, java server pages, and Android Application Development. Thus current industrial
trends necessitate acquiring Java knowledge for Computer engineering and
Information technology graduates. This course develops necessary skills in students to
apply object oriented programming techniques in java so that students will be able to
develop complete applications using core java.

3. COMPETENCY

The aim of this course is to attend following industry identified competency through
various teaching learning experiences:
● Build applications using Java.

G P Pune
Page 1 of 8
4. COURSE OUTCOMES (COs)

The theory, practical experiences and relevant soft skills

associated with this course are to be taught and implemented, so that the student
demonstrates the following industry oriented COs associated with the above
mentioned competency:

a. Develop programs using Object Oriented methodology in Java.

b. Develop programs to apply all access modifiers, array and string.
c. Implement Interface and Develop program using multithreading.
d. Implement Exception Handling.
e. Develop program using graphics & applet.
f. Develop programs for handling I/O and file streams.

5. SUGGESTED PRACTICALS/ EXERCISES

The practical’s in this section are PrOs (i.e. sub-components of the COs) to be developed and
assessed in the student for the attainment of the competency:

Sr.No Unit Practical Exercises Relevant CO Approxim

No. (Outcomes in Psychomotor Domain) ate Hours
required
Setup a Java Programming development CO1
environment by using:
a. Command prompt. (Class path and path
1 setup
b. Any IDE (Eclipse, J creator etc.)
Test the JDE setup by implementing a
I small program.
04
Develop programs to demonstrate use of
2
different control statements.
Develop programs to demonstrate use of
3 ‘for’ , ‘while’ and ‘do-while’ looping
Statements
Develop programs for implementation of
4
implicit and explicit type casting in JAVA.
Develop programs for implementation a) CO2
5 Constructer
b) multiple Constructers
a) Develop a program to accept input using
command line argument.
6
b)Develop programs for implementation
II
of Arrays in JAVA 10
Develop programs for implementation of
7 different function of String and
StringBuffer Class.
Develop programs for implementation of
8 a) Vector
b) HashMap

G P Pune
Page 2 of 8
 c) Wrapper
Develop a program for implementation of
9 a) method overriding.
b) method overloading.
Develop programs for implementation of CO3
10 a) Single inheritance
b) multiple inheritance
Develop programs for implementation of
multilevel inheritance by applying various
11 III 06
access controls to its data members and
methods.
Develop programs for creating classes in a
12 package, accessing a package, importing a
class from other package.
Develop a program for implementation of CO3,CO4
13
Multithreading Operation.
IV Develop programs for implementation of 04
14 a)exception handling
b) User defined exception handling.
Develop minimum two basics Applets. CO5
Display output with applet viewer and
browser.
15
Develop a program on basic applet
Develop program using control loops in
applets.
Develop a Program to draw following
V 04
shapes , Graphics and Applets
a. Cone
b. Cylinders
16
c. Cube
d. Square inside a circle
e. Circle inside a Square

Develop programs for implementation of CO6

17 VI a) I/O classes 04
b) file stream classes
TOTAL HOURS : 32
MINI PROJECT: Implement mini project using all the JAVA concepts

Sr.No. Performance Indicators Weightage in %

a. Correctness of algorithm 40
b. Debugging ability 20
c Quality of input and output displayed (messaging and 10
formatting)
d. Preparing assignments (write-ups, program and output). 20
e. Submit assignment on time. 10
Total 100

G P Pune
Page 3 of 8
6. MAJOR EQUIPMENT/ INSTRUMENTS REQUIRED

The major equipment with broad specification mentioned here will usher in uniformity in
conduct of practical, as well as aid to procure equipment by authorities concerned.

Sr. Equipment Name with Board Specification Pro

no. Sr. no.

1. Computer with JDK 1.8 or above All

2. Any IDE for JAVA Programming such as Eclipse ,Jcreator or All
any other

7. THEORY COMPONENTS

The following topics/subtopics should be taught and assessed in order to develop UOs for
achieving the COs to attain the identified competency.

Unit Outcomes (UOs) Topics and Sub-topics

(in cognitive domain)
Unit- I Basics of JAVA(Weightage-09, Hrs- 06)
1a. State Features of Java. 1.1 Java Features.
1b. Write Programs to create 1.2 Defining a class, Fields declaration, Methods declaration,
classes and object for given Creating object, Accessing class members.
problem. 1.3 Java tokens and data types, constants and symbolic
1c. Enlist different data types & Constant, variables, Dynamic initialization, Data types, array
Operators in Java. and string, Scope of Variable, typecasting and standard
1d.Constuct the expressions using default value.
implicit and explicit type 1.4 Operators and Expressions, Type conversions in
conversions to solve the given expressions, Mathematical functions- min(), max(), sqrt(),
problems. pow(), exp(), round(), abs().
1e.Develop the programs using 1.5 Decision making and looping: If statement, if else
relevant control structure to solve statement, nested if else statement, if else if ladder, the switch
the given problems. statement, nested switch statement, The ?: operator, the while
statement, the ‘for’ statement, break, continue and return
statement, nested loops ,labeled loops, for-each version of the
for loop.

UNIT 2 Derived Syntactical Constructs in JAVA(Weightage- 13 , Hrs- 08)

2a. Use constructors for the given 2.1Constructors and methods type of constructors, nesting of
programming problem. methods, argument passing the ‘this’ keyword, command line
2b. State different visibility arguments, garbage collection, finalize() method, the object
controls. class.
2c. Write the programs by
implementing array to solve the 2.2Visibility Control Public, Private Protected, Default,
given problems. friendly protected access.
2d. Develop programs using
vectors, wrapper and HashMap 2.3Arrays and Strings: Types of arrays, creating an array,

G P Pune
Page 4 of 8
classes for the given problem. strings, string classes and string buffer, vector, wrapper
classes, HashMap. Enumerated types.

UNIT 3 Inheritance , interface and package(Weightage- 19 , Hrs- 10)

3a. Describe Inheritance. 3.1 Inheritance: concept of inheritance, Types of Inheritance.

3b. Enlist different types of 3.2 Single Inheritance, multilevel Inheritance, Hierarchical
Inheritance. Inheritance, method and constructors overloading and
3c. Differentiate between overriding. Dynamic method dispatch, final variables final
overloading and overriding for methods, use of super, abstract methods and classes, static
given example. members.
3d. Develop program using the 3.3 Interfaces: Define Interface, implementing interface,
specified interface. accessing interface variables.
3e. Create user defined package 3.4 Package: Define package, types of package, naming and
for the given problems. creating packages, accessing packages, import package, static
3f. Add class and interface to the imports, adding class and interfaces to a package.
given package.
UNIT 4 Exception handling and Multithreading(Weightage- 13 , Hrs- 08)

4a. Define Exception,Errors& its 4.1 Errors and Exception: Types of errors, exceptions, syntax
types. of exception handling code, build-in exceptions, chained
4b. Develop program for handling exceptions, creating own exception (throw clause).
the given exception. 4.2 Multithreaded Programming Creating a Thread: By
4c. Develop a program for extending thread class and by implementing Runnable
throwing our own Exceptions. interface, lifecycle of thread, Thread Methods: wait(), sleep(),
4d. Explain the function of the notify(), resume(), suspend(), stop().
specified phase in thread life Synchronization, inter-thread communication, deadlock.
cycle using the given example.
UNIT 5 JAVA applets and Graphics Programming(Weightage- 18 , Hrs- 08)

5a. Describe the given phase of 5.1 Introduction to applets: Applet, Applet life cycle
applet life cycle using a typical (skeleton), Applet tag, Adding Applet to HTML file, passing
example. parameter to applet, embedding <applet> tags in java code,
5b. Develop programs using adding controls to applets.
applet implementation for the 5.2 Graphics Programming: Graphics classes, lines,
given problem. rectangles, ellipse, circle, arcs, polygons, color and fonts, font
5c. Develop a Program for class, variable defined by font class, font methods.
passing Parameters to Applets
5d. Develop program for
implementing different font
methods.
UNIT 6 Managing I/O Files in JAVA(Weightage- 08 , Hrs- 08)
6a. Use I/O stream classes in a 6.1 Introduction and concept of streams.
program to solve the given problem. 6.2 Stream classes.
6b. Write Program for reading and 6.3 Byte Stream classes: Input stream classes, Output
writing character stream to and from stream classes.
the given files. 6.4 Character stream classes, using streams.
6c. Write Programs for reading and 6.5 Using file class: I/O Expressions, Creation of files,
writing bytes to and from given files. Reading/Writing characters, Reading/Writing bytes,

G P Pune
Page 5 of 8
6d. Write program to demonstrate Handling primitive Data types.
use of primitive data types with the
specified stream.

8. SUGGESTED SPECIFICATION TABLE FOR QUESTION PAPER DESIGN

Unit Unit Title Teaching Distribution of Theory Marks

No. Hours R U A Total
Level Level Level Marks
I Basics of JAVA 06 2 2 5 9
Derived Syntactical Constructs
II 08 2 2 9 13
in JAVA
Inheritance , interface and
III 10 4 5 10 19
package
Exception handling and
IV 08 4 3 6 13
Multithreading
JAVA applets and Graphics
V 08 5 4 9 18
Programming
Managing
VI 08 3 1 4 8
I/O Files in JAVA
Total 48 20 17 43 80

9. SUGGESTED STUDENT ACTIVITIES

Other than the classroom and laboratory learning, following are the suggested student-related
co-curricular activities which can be undertaken to accelerate the attainment of the various
outcomes in this course: Students should conduct following activities in group and prepare
reports of about 5 pages for each activity, also collect/record physical evidences for their
(student’s) portfolio which will be useful for their placement interviews:
a. Prepare journal based on practical performed in laboratory.
b. Follow Coding Standards.
c. Give seminar on relevant topic
d. Undertake micro-projects.
e. Develop variety of program to improve logical skills.
f. Develop Application oriented real world programs.

10. SUGGESTED SPECIAL INSTRUCTIONAL STRATEGIES (if any)

These are sample strategies, which the teacher can use to accelerate the attainment of
the various outcomes in this course:
a. Massive open online courses (MOOCs) may be used to teach various topics/sub
topics.
b. About 15-20% of the topics/sub-topics which is relatively simpler or descriptive in
nature is to be given to the students for self-directed learning and assess the
development of the COs through classroom presentations (see implementation
guideline for details).
c. With respect to item No.8, teachers need to ensure to create opportunities and
provisions for co-curricular activities.

G P Pune
Page 6 of 8
 d. Guide student(s) in undertaking micro-projects.
e. Correlate subtopics with major topics and concepts.
f. Use proper equivalent analogy to explain different concepts.
g. Use Flash/Animations to explain various components and operation.
h. Teacher should ask the students to go through instruction and Technical manuals.

11. SUGGESTED MICRO-PROJECTS

MINI PROJECT: Implement mini project using all the Java concepts studied in the above
units.

(Only for Class Declaration Courses)

Only one micro-project is planned to be undertaken by a student that needs to be assigned to
him/her.In the first four semesters, the micro-projects are group-based. However, in the fifth
and sixth semesters, it should be preferably be individually undertaken to build up the skill
and confidence in every student to become problem solver so that s/he contributes to the
projects of the industry. In special situations where groups have to be formed for micro-
projects, the number of students in the group should not exceed three.
The micro-project could be industry application based, internet-based, workshop-
based, laboratory-based or field-based. Each micro-project should encompass two or more
COs which are in fact, an integration of PrOs, UOs and ADOs. Each student will have to
maintain dated work diary consisting of individual contribution in the project work and give a
seminar presentation of it before submission. The total duration of the micro-project should
not be less than 16 (sixteen) student engagement hours during the course. The student ought
to submit micro-project by the end of the semester to develop the industry oriented COs.

12. SUGGESTED LEARNING RESOURCES

S.
Title of Book Author Publication
No.
1 Programming with Java E. Balagurusamy, Tata McGraw Hill
2 The Complete Reference Herbert Schildt, Tata McGraw Hill,5th Edition
Java2
3 The Complete IDIOT’s Michael Morrison PHI,2 edition
Guide To JAVA 2

13. SOFTWARE/LEARNING WEBSITES

1. http://www.nptel.ac.in
2.https://www.tutorialspoint.com/javaprogramming
3. https://onlinecourses.nptel.ac.in

G P Pune
Page 7 of 8
14. PO - COMPETENCY- CO MAPPING

CO/PO
PO1 PO2 PO3 PO4 PO5 PO6 PO7

CO1
2 2 2 1 1 1 2

CO2
3 2 3 2 1 2 2

CO3
3 2 3 3 1 2 2

CO4
3 2 3 3 1 2 1

CO5 3 2 3 3 1 2 2
CO6 3 2 3 3 1 2 2

15. PSO - COMPETENCY- CO MAPPING

PSO1 PSO2
CO1 - 3
CO2 - 2
CO3 - 2
CO4 - 2
CO5 - 3
CO6 - 2

Sign: Sign:

Name: Smt.H S Pawar Name: Shri. U. V. Kokate

Name: Smt.S P Panchakshari (Head of Department)
Name: Smt. K S Gaikwad (Computer Engineering)
(Course Expert /s)

Sign: Sign:

Name: Shri. U V Koakte Name: Shri A.S.Zanpure

(Program Head )
(Computer Engineering) (CDC )

G P Pune
Page 8 of 8
 Government Polytechnic, Pune
(An Autonomous Institute of Govt. of Maharashtra)
Scheme: 180 OB

Programme Name : Diploma Programme in CO/IT

Programme Code : 06/07
Course Title : Data Structures
Course Code : CM3103
Prerequisite : CM2101- Programming in 'C'
course code and
name
Class Declaration : YES

1. TEACHING AND EXAMINATION SCHEME

Teaching Total Examination Scheme

Scheme Credits Theory Practical Total
(In Hours) (L+T+P) Marks Marks Marks
L P T C ESE PA *ESE PA
Marks 80 20 25 25 150
3 2 1 6
Exam Duration 3 Hrs 1 Hr 2 Hrs
(*):POE ( Practical & Oral Examination)
Legends: L-lecture, T-Tutorial/teacher guided theory practice, P-practical, ESE-End
semester examination, PA- Progressive Assessment.

2. RATIONALE
Data structures are an important aspect of Computer Engineering and Information
technology. Data structures are mathematical and logical model of storing and
organizing data in a particular way in computer. After studying this course, student
will be able to understand and identify different types of data structures, use
algorithms with appropriate data structures to solve real life problems.

3. COMPETENCY
The aim of this course is to attend following industry identified competency through
various teaching learning experiences:
• Implement relevant algorithms using Data Structures.

4. COURSE OUTCOMES (COs)

The theory, practical experiences and relevant soft skills associated with this course
are to be taught and implemented, so that the student demonstrates the following
industry oriented COs associated with the above mentioned competency:

1. Describe Data structures, Complexity and Array operations.

2. Use algorithms for searching and sorting techniques with Arrays.
3. Implement programs for Stack, Queue and Recursion using Arrays.
4. Write programs to perform operations on Linked List.
5. Write algorithms to implement Tree data structure.
6. Describe Graph and its traversing methods.

1
 Government Polytechnic, Pune
(An Autonomous Institute of Govt. of Maharashtra)
Scheme: 180 OB

5. PRACTICALS/ EXERCISES
The practicals in this section are PrOs (i.e. sub-components of the COs) to be developed and
assessed in the student for the attainment of the competency:
Approx.
Sr. Unit
Practical Outcomes (PrOs) Hrs.
No. No.
Required
1. Implement Programs based on: Structures & Dynamic Memory I 02
allocation
2. Implement Program to perform insertion and deletion operations on I 02
One Dimensional Array.
3. Implement Program for matrix operations using Multidimensional I 02
Arrays. (Eg. Matrix Addition, Subtraction and Multiplication)
4. Implement programs for following search techniques. II 04
i. Linear search ii. Binary Search
5. Write Programs to implement sorting algorithms. (Bubble sort, II 04
Selection sort, Insertion sort, Merge sort, Radix sort, Shell sort)
6. Write Program to perform Push and Pop operations on Stack using III 02
array.
7. Write Program to perform Insert and Delete operations on Linear
III 02
Queue using array.
8. Write Program to implement Tower of Hanoi. III 02
9. Write Programs to traverse singly linked list. IV 02
10. Write Programs to search in sorted and unsorted linked list. IV 04
11. Write Programs to perform following operations on Singly linked IV 04
list.
i. To insert a node at beginning and at given location.
ii. To delete a node.
12. Write Program to create Binary Search Tree and perform Inorder, V 02
Preorder and Postorder traversal.
Total 32
Following is the list of extra practical that can be given to Fast learner student.
1. Write Program to traverse Doubly link list.
2. Write Program to perform Insert and Delete operations on Doubly
link list.
3. Write Program to perform Insert and Delete operations on Linear
Queue using link list.
4. Write Program to perform Insert and Delete operations on Circular
Queue using array.
5. Write Program to perform Insert and Delete operations on Circular
Queue using link list.
6. Write Programs to perform Search, Insert and Delete operations on
BST.
7. Write Program to implement Heap Sort algorithm.

2
 Government Polytechnic, Pune
(An Autonomous Institute of Govt. of Maharashtra)
Scheme: 180 OB

Sr. No. Performance Indicators Weightage in %

a. Use of Appropriate tool to solve the problem (Process) 40
b. Quality of output achieved (Product) 30
c. Complete the practical in stipulated time 10
d. Observations and Recording 10
e. Answer to sample questions 10
Total 100
6. MAJOR EQUIPMENTS/ INSTRUMENTS REQUIRED

The major equipment with broad specification mentioned here will usher in uniformity in
conduct of practical, as well as aid to procure equipment by authorities concerned.

Sr. Experiment
Equipment Name with Broad Specifications
No. Sr.No.
1 Hardware: Personal computer Pentium IV, 2 GHz minimum (i3-i5 For all
preferable), RAM minimum 2 GB. experiments
2 C/C++ Compiler.

7. THEORY COMPONENTS
The following topics/subtopics should be taught and assessed in order to develop UOs for
achieving the COs to attain the identified competency.
Unit Unit Outcomes (UOs) Topics and Sub-topics
(in cognitive domain)

SECTION-I
UNIT I 1a. Define data structure 1.1 Introduction, Basic Terminology, Elementary
Introducti terminologies. data structure, Organization, Classification of
on to data 1b. Enlist various data data structure.
structures structure Operations. 1.2 Operations on data structures: Traversing,
and 1c. Differentiate Inserting, deleting, Searching, sorting, and
Arrays between various merging.
complexities. 1.3 Complexity: Time Complexity, Space
1d. Use dynamic Complexity, Big ‘O’ Notation.
memory allocation in 1.4 Dynamic memory Allocation.
programs. 1.5 Arrays: Introduction, Representation of
1e. Write algorithms to linear arrays in memory.
perform operations on 1.6 Traversing linear Arrays, Inserting and
array. Deleting.
1.7 Multidimensional Arrays.
UNIT-II 2a. Write algorithm 2.1 Searching: Basic search techniques, Linear
Searching and programs for Search, Binary search.
and various searching and 2.2 Hashing: Hash functions, Collision Resolution,
Sorting sorting techniques Linear probing, Chaining.
Technique 2b. Apply Hashing 2.3 Sorting: General background.
s techniques to store 2.4 Sorting Techniques: Bubble sort,
and retrieve Selection sort, Insertion sort, Merge sort,
element from given Radix sort, Shell sort.

3
 Government Polytechnic, Pune
(An Autonomous Institute of Govt. of Maharashtra)
Scheme: 180 OB

Unit Unit Outcomes (UOs) Topics and Sub-topics

(in cognitive domain)
data set.
2c.Use sorting
methods to sort
dataset.
UNIT III 3a. Implement Stack 5.1 Stacks: Concept, representing stacks in ‘C’,
Stacks, and Queue data Applications of stacks.
Queues & structure to carry out 5.2 Polish Notations (Prefix, postfix, Infix), Quick
Recursion various data structure sort.
operation. 5.3 Recursion: Recursive definitions and processes,
3b. Use stack and Recursion in ‘C’, writing recursive programs
queues to solve various factorial, Fibonacci.
problem (like prefix to 5.4 Tower of Hanoi, Implementation of recursive,
postfix conversion, procedures by means of stack.
evaluation of 5.5 Queues: The queue and its sequential
expression, Tower of representation, concept of queues, circular
Hanoi, etc). queues, priority queues.
3c. Differentiate
between stack and
queue.

SECTION-II
UNIT IV 4a. Implement linked 4.1 Introduction, Singly link list Representation of
Linked list data structure to link list in memory.
Lists carry out various data 4.2 Creating, Traversing, Searching in Sorted and
structure operations. Unsorted Linked List.
4b. Use Linked list to 4.3 Memory allocation, garbage Collection.
implement other data 4.4 Inserting into linked list, Deleting from a linked
structures. list.
4.5 Header links list, Two-way list, Implementation
of link list.
UNIT V 5a. Draw binary tree 5.1 Tree Terminologies: Degree of node, level of
Trees for given data set. node, leaf node, Depth/Height of tree, In-degree
5b. Write algorithm for and Out-degree, path, Ancestor and Descendant
binary tree traversal. node.
5c. Write algorithms to 5.2 Tree Types: General Trees, Binary trees, Binary
perform given Search Trees
operation on Binary 5.3 Binary Tree Traversal methods: Inorder,
Search Tree. Preorder, Postorder traversal using stack.
5d. Create Heap tree 5.4 Binary search tree (BST), searching and
for given dataset. inserting BST, deleting from BST.
5.5 Heap: Inserting into a Heap, Deleting the root
of Heap, Heap sort.

4
 Government Polytechnic, Pune
(An Autonomous Institute of Govt. of Maharashtra)
Scheme: 180 OB

Unit Unit Outcomes (UOs) Topics and Sub-topics

(in cognitive domain)
UNIT VI 6a. Define 6.1 Introduction, Graph Terminologies: Graph,
Graphs terminologies related to Node(Vertices), Arcs(Edges), Directed Graph,
Graph. Undirected Graph, In-degree and Out-degree,
6b. Represent graph Adjacent, Successor, Predecessor, relation,
using adjacency list path, sink.
and adjacency matrix 6.2 Linear Representation of Graph: Adjacency
6c. Solve problems to List, Adjacency Matrix of directed graph.
find out shortest path 6.3 Warshall’s Algorithm; Shortest Paths. Linked
using Warshall's representation of graph, traversing a graph
algorithm. (BFS,DFS).
6d. Write algorithm to 6.4 Applications of Graph.
traverse the given
graph.

8. SPECIFICATION TABLE

Teaching Distribution of Theory Marks

Unit Hrs R U A and Total
Unit Title
No Level Level above Marks
Levels
1 Introduction to data structures 06 4 6 2 12
and Arrays
2 Searching and Sorting 08 2 4 8 14
Techniques
3 Stacks, Queues & Recursion 10 2 4 8 14
4 Linked Lists 08 2 4 8 14
5 Trees 10 2 4 8 14
6 Graphs 06 2 4 6 12
Total 48 14 26 40 80

9. STUDENT ACTIVITIES
Other than the classroom and laboratory learning, following are the suggested student-related
co-curricular activities which can be undertaken to accelerate the attainment of the various
outcomes in this course: Students should conduct following activities in group and prepare
reports of about 5 pages for each activity, also collect/record physical evidences for their
(student’s) portfolio which will be useful for their placement interviews:
a. Prepare journal of practicals.

10. SPECIAL INSTRUCTIONAL STRATEGIES (if any)

These are sample strategies, which the teacher can use to accelerate the attainment of the
various outcomes in this course:
a. Massive open online courses (MOOCs) may be used to teach various topics/sub
topics.
b. About 15-20% of the topics/sub-topics which is relatively simpler or descriptive in
nature is to be given to the students for self-directed learning and assess the

5
 Government Polytechnic, Pune
(An Autonomous Institute of Govt. of Maharashtra)
Scheme: 180 OB

development of the COs through classroom presentations (see implementation

guideline for details).
c. With respect to item No.8, teachers need to ensure to create opportunities and
provisions for co-curricular activities.
d. Guide student(s) in undertaking micro-projects.
e. Use proper equivalent analogy to explain different concepts.
f. Use Flash/Animations to explain various components, operation and
g. Teacher should ask the students to go through instruction and Technical manuals.

11. SUGGESTED MICRO-PROJECTS

(Only for Class Declaration Courses)
Only one micro-project is planned to be undertaken by a student that needs to be assigned to
him/her.In the first four semesters, the micro-project are group-based. However, in the fifth
and sixth semesters, it should be preferably be individually undertaken to build up the skill
and confidence in every student to become problem solver so that s/he contributes to the
projects of the industry. In special situations where groups have to be formed for micro-
projects, the number of students in the group should not exceed three.
The micro-project could be industry application based, internet-based, workshop-
based, laboratory-based or field-based. Each micro-project should encompass two or more
Cos which are in fact, an integration of PrOs, Uos and ADOs. Each student will have to
maintain dated work diary consisting of individual contribution in the project work and give a
seminar presentation of it before submission. The total duration of the micro-project should
not be less than 16 (sixteen) student engagement hours during the course. The student ought
to submit micro-project by the end of the semester to develop the industry oriented Cos.
A suggestive list of micro-projects is given here. Similar micro-projects could be
added by the concerned faculty:
A) Write menu driven program to incorporate all the data structures.
B) Write menu driven program to implement all operations on Singly and Doubly Linked
lists.

12. LEARNING RESOURCES

Sr.
Title of Book Author Publication
No.
1 Data Structures Lipschultz McGraw Hill Education, New
Schaum Outline Series Delhi.2013, ISBN-13: 978-0070701984
2 Data Structures Using ISRD Group McGraw Hill Education, New
'C' Delhi.2013,ISBN-13:978-12590006401
3 Dr. Rajendra Devraj Publications
Data Structures Kawale

13. SOFTWARE/LEARNING WEBSITES

a. https://www.w3schools.in/data-structures-tutorial
b. https://www.geeksforgeeks.org/data-structures/
c. https://www.tutorialspoint.com/data_structures_algorithms/index.htm

6
 Government Polytechnic, Pune
(An Autonomous Institute of Govt. of Maharashtra)
Scheme: 180 OB

14. PO – COMPETENCY-CO MAPPING

PO1 PO2 PO3 PO4 PO5 PO6 PO7
Describe Data structures,
Complexity and Array 2 2 3 1 1 1 3
operations.
Use algorithms for
searching and sorting 2 2 3 2 1 2
1
techniques with arrays.
Implement programs for
Stack, Queue and 2 3 3 1 1 1 2
Recursion using Arrays.
Write programs to
perform operations on 2 3 3 2 1 1 2
Linked List.
Write algorithms to
implement Tree data 2 3 3 1 1 1 2
structure.
Describe Graph and its
2 3 3 1 1 1 2
traversing methods

PSO - COMPETENCY- CO MAPPING

PSO1 PSO2
Describe Data structures,
Complexity and Array 1 2
operations.
Use algorithms for
searching and sorting 2 3
techniques with arrays.
Implement programs for
Stack, Queue and 2 3
Recursion using Arrays.
Write programs to perform
2 3
operations on Linked List.
Write algorithms to
implement Tree data 2 3
structure.
Describe Graph and its
2 3
traversing methods

7
 Government Polytechnic, Pune
(An Autonomous Institute of Govt. of Maharashtra)
Scheme: 180 OB

(Smt.H.F.Khan/ S. B. Nikam) (Mr.U.V.Kokate)

Signature of Course Experts Signature of Head of the Department
(Computer Engineering)

(Mr. U. V. Kokate) (Mr. A.S. Zanpure)

Signature of Programme Head Signature of CDC In-charge

8
 Government Polytechnic, Pune
‘180 OB’ – Scheme

Programme Diploma in ET/CE/EE//ME/MT/CM/IT/DDGM

Programme code 01/02/03/04/05/06/07/08/16/17/21/22/23/24/26

Name of Course Object Oriented Programming : C++

Course Code CM3104

Prerequisite course code and -- --
name
Class Declaration Yes

1. TEACHING AND EXAMINATION SCHEME

Teaching Total Examination Scheme

Scheme Credits Theory Practical Total
(In Hours) (L+T+P) Marks
L T P C ESE PA *ESE PA
Marks 80 20 25 25 150
03 01 02 06 Exam
3 Hrs 1 Hr 2 Hr
Duration
(*): POE (Practical & Oral Examination)
Legends: L- lecture, T-Tutorial/teacher guided theory practice, P-practical, ESE-End
semester examination, PA- Progressive Assessment.

2. RATIONALE

This subject intends to teach the students the basic concepts of object-oriented
programming (OOP) using C++ programming language. Object-Oriented
Programming offers a new and powerful way to cope with the programming
complexities wherein programs are prone to error and software errors can get
expensive. Its goal is clearer, more reliable, more easily maintained programs. This
subject will act as backbone for all other subjects that are based on Object Oriented
concept.

3. COMPETENCY

The aim of this course is to attend following industry identified competency through
various teaching learning experiences:
● Build logical and cognitive thinking for solving real time problems.

G P Pune
Page 1 of 9
4. COURSE OUTCOMES (COs)

The theory, practical experiences and relevant soft skills associated with this course
are to be taught and implemented, so that the student demonstrates the following
industry oriented COs associated with the above mentioned competency:

1. Know the difference between procedural language and object oriented language.
2. Understand the basic concepts of object oriented programming.
3. Learn reusability of code with the help of functions in C++.
4. Understand the key feature of object oriented programming like polymorphism.
5. Understand and implement the concept of inheritance.
6. Handle exceptions and implement files.

5. SUGGESTED PRACTICALS/ EXERCISES

The practicals in this section are PrOs (i.e. sub-components of the COs) to be developed and
assessed in the student for the attainment of the competency:

Sr.No Unit Practical Exercises Relevant CO Approximate

No. (Outcomes in Psychomotor Domain) Hours
required
Write a simple C++ program to print CO1 - Know the
“HELLO” on the output screen difference between
procedural language
1 I 02
and object oriented
language.

Write a program to perform simple CO2 - Understand

2
mathematical operations. the basic concepts of
Write a program to implement class object oriented
3
and object concept. programming.
II 04
Write programs to implement all the
4
control structures in C++.
Write programs to implement
5
various access specifiers.
Write a simple program to CO3 - Learn
6
implement functions in C++ reusability of code
Write a program to implement call with the help of
7 by reference and return by value functions in C++.
concept.
Write a program to implement
III following concepts: 06
a) Inline functions
8 b) Friend functions
c) Static function
d) Object as a function argument
and returning object
9 Write a program on nesting of

G P Pune
Page 2 of 9
 functions.
Write a program to perform
following string operations using
pre-defined string functions and
without using pre-defined string
functions :-
10
a) String concatenation
b) String Comparison
c) Find position of an character in a
given string
d) String reversing
Write a program to implement CO4 - Understand
11
operator overloading the key feature of
Write a program to implement object oriented
12 IV 06
operator overriding (polymorphism). programming like
Write a program to implement type polymorphism.
13
conversion concept.
Write a program to implement CO5 - Understand
following types of inheritances and implement the
using various access specifiers :- concept of
a) Single inheritance inheritance.
14
b) Multilevel inheritance
V
c) Multiple inheritance
d) Hierarchical inheritance
08
e) Hybrid inheritance
Write a program to implement
15
pointers concepts
Write a program to implement
following concepts:
16
a) Virtual functions
b) Pure virtual function
Write a program to perform various CO6 - Handle
17
operations using File concepts exceptions and
VI 06
Write programs to handle pre- implement files.
18
defined and user-defined exceptions.
TOTAL HOURS : 32
MINI PROJECT: Implement mini project using all the
C++ concepts

Sr.No Performance Indicators Weightage in %

a. Drawing the flowchart for the given problem statement 20
b. Writing an algorithm for the given problem statement 20
c. Writing the code 10
d. Observations and error handling 10
e. Interpretation of result and Conclusion 20
f. Answer to sample questions 10
g. Submission of report in time 10
Total 100

G P Pune
Page 3 of 9
6. MAJOR EQUIPMENT/ INSTRUMENTS REQUIRED
The major equipment with broad specification mentioned here will usher in uniformity in
conduct of practical, as well as aid to procure equipment by authorities concerned.

Sr.No. Major Equipment/ Instruments Required PrO. No.

1 Basic configuration systems with editor supporting ALL
C++ language program execution.

7. THEORY COMPONENTS
The following topics/subtopics should be taught and assessed in order to develop UOs for
achieving the COs to attain the identified competency.

Unit Outcomes (UOs) Topics and Sub-topics

(in cognitive domain)
UNIT 1. INTRODUCTION TO OBJECT OREIENTED PROGRAMMING
(Weightage-12, Hrs- 06)
1.1 Procedural programming
1a. Define procedural and object What is procedural programming? Features of procedural
oriented programming language. programming. Drawbacks of procedural programming.
1b. Differentiate between
procedural and object oriented 1.2 Object Oriented Programming
programming language. Definition on Object Oriented Programming, Object Oriented
1c. Explain the features of Programming paradigm, basic concepts of Object Oriented
object oriented language. Programming, benefits of Object Oriented Programming,
1d. Write a simple program to Object Oriented languages, applications of Object Oriented
learn source file, compilation Programming.
and linking of various files
together. 1.3Beginning with C++
What is C++, C++ program structure, object, class, example of
object and class, creating the source file, compiling and linking

UNIT 2 BASICS OF OBJECT ORIENTED PROGRAMMING (Weightage- 14 , Hrs- 10)

2a. Understand various basic2.1
concepts of C++ language. 2.1 Tokens, Expressions and Control Structures
2b. Define class and object. Tokens, keywords, identifiers, constants and symbolic
2c. Understand memory constants, data types and its classifications, type casting,
allocation concepts. Variables: introduction, declaration, dynamic initialization,
2d. Differentiate between reference.
constructors and destructor. Operators : introduction, scope resolution operator, type cast
operator, memory management operators, operator precedence,
Expressions: introduction, types, special assignment
expressions.
Access Specifiers: introduction, why there is need of access
specifiers, types of access specifiers.
Control structures : introduction, types of control structures
like sequence structure, selection structure, loop structure,
example of all the types of structures like if-else, while, do-

G P Pune
Page 4 of 9
 while, for, switch with its syntax and usage.

2.2 Classes and Objects

Classes: Introduction, use of classes in OOP, syntax to declare
class, local classes.
Objects: introduction, memory allocation for objects, static
data members, array of objects, objects as function arguments,
returning objects.

2.3 Constructors and Destructors

Constructors : introduction, syntax, concept of memory
allocation using constructors, types of constructors,
constructors with default arguments, dynamic initialization of
objects, dynamic constructors
Destructors : introduction, syntax, concept of memory
de- allocation using destructors, example.
UNIT 3 FUNCTIONS IN C++ (Weightage- 12 , Hrs- 08)

3a. Define function and 3.1 Introduction

implement function prototypes. The main function, function prototype, call by reference, return
3b. Understand various types of by reference, inline functions, default arguments, const
functions. arguments
3c. Implement string functions
and perform various operations 3.2 More on function
on the same. Function overloading, friend functions, virtual functions, pure
virtual functions, inline functions, making outside function
inline, nesting of member functions, private member functions,
static member functions, object as a function argument,
returning an object.

3.3 String functions

Introduction, library string functions, creating string objects,
manipulating string objects, string characteristics, accessing
characters in strings, user defined functions to implements
library string functions.
UNIT 4 OPERATOR OVERLOADING,POLYMORPHISM AND TYPE CONVERSION
(Weightage- 14 , Hrs- 06)
4a. Explain the concept of 4.1 Operator Overloading :
operator overloading. Introduction, defining operator overloading, overloading unary
4b. Understand and implement operators, overloading binary operators, overloading binary
object oriented programming operators using friends, manipulation of strings using
language key feature like operators, rules of overloading operators.
polymorphism. 4.2 Polymorphism :
4c. Implement type conversion Introduction, why polymorphism is useful, syntax and
for various data types. example.
4.3 Type Conversion :
Introduction, basic to class type, class to basic type, one class
to another type, data conversion example.

G P Pune
Page 5 of 9
 UNIT 5 INHERITANCE AND POINTERS (Weightage- 14 , Hrs- 08)

5a. Define inheritance. 5.1 Introduction :

5b. Explain the need of Definition of inheritance, defining derived classes, concept of
inheritance. base class and sub class, types of inheritance, making private
5c. Implement various types of member inheritable, single inheritance, multilevel inheritance,
inheritances. multiple inheritance, hierarchical inheritance, hybrid
5d. Describe pointers in C++ inheritance,
5.2 More on inheritance :
virtual base class, virtual functions, abstract classes,
constructors in derived classes, member classes using nesting
of classes.
5.3 Pointers :
Introduction, definition, syntax to declare pointer, pointers to
objects, this pointer, pointers to derived classes, example on
pointers

UNIT 6 FILES AND EXCEPTION HANDLING (Weightage- 14 , Hrs- 08)

6a. Define files in C++. 6.1 Files:
6b. Implement various Introduction, classes for file stream operations, opening and
operations that can be closing a file, detecting end of file, more about open(), file
performed on files. modes, file pointers and their manipulations, sequential input
6c. Execute a program to handle and output operations, updating a file, random access of file,
exceptions in the programs. error handling during file operations, command line
arguments.

6.2 Exception Handling :

Introduction, basics of exception handling, types of exceptions,
structure to handle an exception, exception handling
mechanism, throwing mechanism, catching mechanism,
re-throwing an exception, specifying exceptions.

8. SUGGESTED SPECIFICATION TABLE FOR QUESTION PAPER DESIGN

Uni Unit Title Teaching Distribution of Theory Marks

t Hours R U A Total
No. Level Level Level Marks
I INTRODUCTION TO OBJECT
OREIENTED PROGRAMMING 06 4 6 2 12

II BASICS OF OBJECT ORIENTED

10 4 6 4 14
PROGRAMMING
III FUNCTIONS IN C++ 08 4 6 2 12
IV OPERATOR
06 4 6 4 14
OVERLOADING,POLYMORPHISM

G P Pune
Page 6 of 9
 AND TYPE CONVERSION
V INHERITANCE AND POINTERS 08 4 6 4 14
VI FILES AND EXCEPTION
10 4 6 4 14
HANDLING
Total 48 24 36 20 80

9. SUGGESTED STUDENT ACTIVITIES

Other than the classroom and laboratory learning, following are the suggested student-related
co-curricular activities which can be undertaken to accelerate the attainment of the various
outcomes in this course: Students should conduct following activities in group and prepare
reports of about 5 pages for each activity, also collect/record physical evidences for their
(student’s) portfolio which will be useful for their placement interviews:
a. Prepare journals based on practical performed in laboratory.
b. Search information about more object oriented programming concepts.

10. SUGGESTED SPECIAL INSTRUCTIONAL STRATEGIES (if any)

These are sample strategies, which the teacher can use to accelerate the attainment of
the various outcomes in this course:
a. Massive open online courses (MOOCs) may be used to teach various topics/sub
topics.
b. About 15-20% of the topics/sub-topics which is relatively simpler or descriptive in
nature is to be given to the students for self-directed learning and assess the
development of the COs through classroom presentations (see implementation
guideline for details).
c. With respect to item No.8, teachers need to ensure to create opportunities and
provisions for co-curricular activities.
d. Guide student(s) in undertaking micro-projects.
e. Correlate subtopics with major topics and concepts.
f. Use proper equivalent analogy to explain different concepts.
g. Use Flash/Animations to explain various components, operation and
h. Teacher should ask the students to go through instruction and Technical manuals

11. SUGGESTED MICRO-PROJECTS

MINI PROJECT: Implement mini project using all the C++ concepts studied in the
above units.
Following are some of the examples for micro-projects:
(a) Railway reservation system
(b) Payroll management system
(c) Supermarket billing system
(d) Telephone directory system

Only one micro-project is planned to be undertaken by a student that needs to be assigned to

him/her. In the first four semesters, the micro-projects are group-based. However, in the fifth
and sixth semesters, it should be preferably be individually undertaken to build up the skill
and confidence in every student to become problem solver so that s/he contributes to the
projects of the industry. In special situations where groups have to be formed for micro-
projects, the number of students in the group should not exceed three.
The micro-project could be industry application based, internet-based, workshop-
based, laboratory-based or field-based. Each micro-project should encompass two or more

G P Pune
Page 7 of 9
COs which are in fact, an integration of PrOs, UOs and ADOs. Each student will have to
maintain dated work diary consisting of individual contribution in the project work and give a
seminar presentation of it before submission. The total duration of the micro-project should
not be less than 16 (sixteen) student engagement hours during the course. The student ought
to submit micro-project by the end of the semester to develop the industry oriented COs.
12. SUGGESTED LEARNING RESOURCES

S.N Author, Publisher, Edition and Year

Title ISBN Number
. of publication
Object Oriented
E Balagurusamy, Tata McGraw ISBN 10: 0070473390 ISBN 13: 9780070473
1 Programming
Hill 393
with C++
Beginning C++
2 - The complete Ivor Horton , Shroff Publishers ISBN 978-1-4302-4882-8
Language
Object Oriented
ISBN-10: 8176351865; ISBN-13: 978-
3 Programming Robert Lafore, BPB
8176351867
in C++
Teach Yourself Herbert Schildt, Tata McGraw ISBN 10: 007070368X ISBN 13:
4
C++ Hill 9780070703681.

The C++ Bjarne Stoustrup, Addison-

5 Programming ISBN 978-0321992789
Wesley 2000
Language

13. SOFTWARE/LEARNING WEBSITES

1. www.nptel.com
2. https://www.quora.com
3. https://www.softwaretestinghelp.com
4. https://www.geeksforgeeks.org
5. https://www.tutorialspoint.com

14. PO - COMPETENCY- CO MAPPING

PO1 PO2 PO3 PO4 PO5 PO6 PO7

CO1 3 2 1 2 - - -
CO2 3 2 2 2 - 1 -
CO3 2 2 3 2 - 2 -
CO4 2 2 3 2 - 2 -
CO5 2 2 3 2 - 2 -
CO6 2 2 3 2 - 2 -

PSO1 PSO2
CO1 - 1
CO2 - 2
CO3 - 3

G P Pune
Page 8 of 9
 CO4 - 3
CO5 - 3
CO6 - 3

Sign: Sign:

Name: Mrs. G. B. Garud Name: Mr. U. V. Kokate

Mrs. S. P. Panchakshari (Head of Department )
(Course Experts) (Computer Dept.)

Sign: Sign:

Name: Mr. U. V. Kokate Name: Mr. A. S. Zanpure

(Programme Head ) (CDC )
(Computer Dept.)

G P Pune
Page 9 of 9
 Course Code:CM

Government Polytechnic, Pune

'180OB' – Scheme

Programme Diploma in Computer Engineering

Programme code 06/26
Name of Course Principles of Digital Techniques and Microprocessor
Programming
Course Code CM3105
Prerequisite course code and (No Pre-requisite)
name

1. TEACHING AND EXAMINATION SCHEME

Teaching Total Examination Scheme

Scheme Credits Theory Practical Total
(In Hours) (L+T+P) Marks
L T P C ESE PA *ESE PA
Marks 80 20 25 150 25
04 00 02 06 Exam
3 Hrs 1 Hr 2 Hr
Duration
(*):POE (Practical&Oral Examination)
Legends: L- lecture,T-Tutorial/teacher guided theory practice, P-practical, ESE-End
semester examination, PA- Progressive Assessment.

2. RATIONALE
As computer engineering student, it is essential to know fundamentals of digital
electronics to understand the concept of microprocessor and its application.
Microprocessor is challenging, to meet challenges of growing advanced
microprocessor technology. The student should be conversant with microprocessor
programming.

3. COMPETENCY
The aim of the course is to attend following industry identified competency through
various teaching learning experiences:
• Simplify logic circuit using Boolean algebra.
• Develop assembly language code

4. COURSE OUTCOMES (COs)

After completing this course students will be able to
1. Perform arithmetic operations with various number systems.
2. Differentiate various logic gates and apply the logic using Boolean algebra.
3. Test combinational logic circuits of Multiplexer and De-Multiplexer.
4. Construct K-MAP using logic functions and vice versa.
5. Describe Microprocessor architecture.
6. Write, debug and execute 8086 programs

G P Pune
Page 1 of 6
 Course Code:CM

5. SUGGESTED PRACTICALS/ EXERCISES

The practicals in this section are PrOs (i.e. sub-components of the COs) to be developed and
assessed in the student for the attainment of the competency:
Practical Specific Learning Outcomes Course
Unit Hours.
No. (Psychomotor Domain) Outcome
Know the Digital Lab
1.IC Tester
1. 2.Multimeter -- 02
3.Bread Board
4.Trainer Kit
Number System, Study of Basic Gates ICs (7400, 7404,
Codes & Logic Gates 7408, 7486, 7432) and verification of
2. CO2 02
and Truth tables by monitoring the output of
Boolean Algebra ICs on Bread Board.
To derive AND, OR, NOT gates using
3. universal gates by forming circuits on CO2 02
Bread Board.
Verify De-Morgan’s Theorem by forming
4. CO2 04
the circuit on Bread Board.
Standard
representation for Minimization and realization of function
5. logic function & using K-maps and its implementation by CO4 02
Sequential Logic constructing the circuit on bread board.
Design
Combinational logic
6. design using MSI Verify of Multiplexer & De-multiplexer. CO3 02
circuit
Microprocessor,
Microprocessor Introduction to Assembler, it’s interface,
7. Architecture & and steps to write, debug and execute CO6 02
Microcomputer assembly language programs using IDE
Systems
Addition and subtraction of two 16-bit
8. CO6 02
numbers.
Multiplication and division of 8-bit/16-
9. CO6 04
bit/32-bit signed/ unsigned numbers.
Sum of given series of numbers (8-bit /
10. CO6 02
16-bit)
8086Assembly Find the smallest and greatest number
11. CO6 02
Language from the given series.
Programming Arrange the given numbers in ascending
12. CO6 02
and descending order.
13. String related programs (any 5) CO6 02

Programs using Procedure, Macros – 2 of

14. CO6 02
each

Total Hours 32

G P Pune
Page 2 of 6
 Course Code:CM

Sr.No. Performance Indicators Weightage in %

a. Correctness of algorithm 40
b. Debugging ability 20
c Quality of input and output (messaging and formatting) 10
d. Preparing assignments (write-ups, program and output). 20
e. Assignment submission (on-time) 10
Total 100

6. MAJOR EQUIPMENT/ INSTRUMENTSREQUIRED

The major equipment with broad specification mentioned here will usher in uniformity in
conduct of practical, as well as aid to procure equipment by authorities concerned.
Sr.no. Equipment Name with Board Specification PRO’s (Sr. no.)
1. Computer with any assembler and debugger All

7. THEORY COMPONENTS
The following topics/sub topics should be taught and assessed in order to develop UOs for
achieving the COs to attain the identified competency.
Unit Outcomes (UOs)
Topics and Sub-topics
(in cognitive domain)
Units 1: Number System, Codes & Logic Gates and Boolean Algebra(Weightage-15 , Hrs-
12)
1a. Convert codes from one 1.1 Introduction to Number systems: Decimal, Binary,
number system to another. Octal, Hexadecimal
1b. Perform arithmetic 1.2 Binary arithmetic: Addition, subtraction,
operations with different multiplication, Division
number systems. 1.3 One’s complement, Two’s Complement, Signed
1c. Differentiate various Numbers, Codes, Error code.
logic gates and apply the 1.4 Logic Gates: Introduction, Working principals and
logic on Boolean algebra. Truth of AND, OR, NOT, NOR, NAND, EX-OR,
1d. Explain theorems for EX-NOR Gates, Universal Gates
Boolean algebra. 1.5 Boolean Algebra: Basic Boolean Operations, Basic
1e. Create simplified logic Laws of Boolean Algebra, Duality Theorem, De-
circuits. Morgan’s Theorems
Unit 2:Standard representation for logic function & Sequential Logic Design(Weightage-12 ,
Hrs- 10)
2a. Construct K-MAP using 2.1 KARNAUGH map representation, Simplification of
logic functions and vice logic function using K-MAP
versa. 2.2 Minimization of logical function specified in
2b. Simplify equations in the minterms/maxterms or truth table
minterms/maxterms. 2.3 Don’t care conditions
Unit 3: Combinational logic design using MSI circuit(Weightage-13, Hrs- 10)
3a. Design Multiplexer and
De-Multiplexer. 3.1 Multiplexer and their use in combinational, logic
3b. Implement combinational design
logic design with 3.2 De-multiplexer/decoders and their use in
multiplexers. combinational logic design
3c. Implement combinational 3.3 De-multiplexer: 4 to 16-line DEMUX. Demux
logic design with design using sop method. 1:4, 1:8, 1:16 DEMUX.
demultiplexers.

G P Pune
Page 3 of 6
 Course Code:CM

Unit 4: Microprocessor, Microprocessor Architecture & Microcomputer

Systems(Weightage-14 , Hrs- 12)
4.1 Microprocessor – Introduction, Features, and its
4a. Describe Microprocessor
Operations
architecture.
4.2 Memory & I/O Devices
4b. Understand 8086
4.3 8086 Microprocessor - Introduction, Architecture,
registers and instruction
and Working,Pin configuration
format.
4.4 Memory segmentation in 8086
4c. Draw timing diagram for
4.5 Minimum mode and Maximum mode configuration
read/write memory cycle.
of 8086
4.6 Instruction timing
Unit 5: 8086 Assembly Language Programming(Weightage-15 , Hrs- 10)
5a. Write and execute 8086 5.1 Instruction format and Addressing modes in 8086
programs for addition, 5.2 8086 Instructions set and classification of
subtraction. instructions - Arithmetic, Logical, Data transfer,
5b. Write programs String, Bit manipulation, Flag manipulation,
implementing branching. Branching, Machine Control
Unit 6: Procedure and Macro in Assembly Language Program, and
Interrupts(Weightage-11 , Hrs- 10)
6.1 Procedures - Defining Procedure, Directives used,
6a. Write and execute FAR and NEAR, CALL and RET instructions, Reentrant
assembly language program and Recursive procedures, Assembly Language
using procedures Programs using Procedure.
6b. Write and execute 6.2 Macros - Defining Macros, Assembly Language
assembly language program Programs using Macros, Directives used.
using macros 6.3 8086 interrupts – Introduction, Interrupt Service
Routines (ISR)

8. SUGGESTED SPECIFICATION TABLE FORQUESTION PAPER DESIGN

Distribution of Theory Marks
Unit Teaching
Unit Title R U A Total
No. Hours
Level Level Level Marks
Number System, Codes & Logic
I 12 05 04 06 15
Gates and Boolean Algebra
Combinational logic design
II 10 03 03 06 12
using MSI circuit
Standard representation for logic
III function & Sequential Logic 10 03 03 07 13
Design
Microprocessor, Microprocessor
IV Architecture & Microcomputer 12 04 04 06 14
Systems
8086 Assembly Language
V 10 03 04 08 15
Programming
Procedure and Macro in
VI Assembly Language Program, 10 03 04 04 11
and Interrupts
Total 64 22 24 34 80

G P Pune
Page 4 of 6
 Course Code:CM

9. SUGGESTED STUDENT ACTIVITIES

Other than the classroom and laboratory learning, following are the suggested student-
related co-curricular activities which can be undertaken to accelerate the attainment of the
various outcomes in this course: Students should conduct following activities in group and
prepare reports of about 5 pages for each activity, also collect/record physical evidences for
their (student’s) portfolio which will be useful for their placement interviews:
a. Prepare journal based on practical performed in laboratory.
b. Follow Coding Standards.

10. SUGGESTED SPECIAL INSTRUCTIONAL STRATEGIES (if any)

These are sample strategies, which the teacher can use to accelerate the attainment of the
various outcomes in this course:
a. Massive open online courses (MOOCs) may be used to teach various topics/sub
topics.
b. About 15-20% of the topics/sub-topics which is relatively simpler or descriptive in
nature is to be given to the students for self-directed learning and assess the
development of the COs through classroom presentations (see implementation
guideline for details).
c. With respect to item No.8, teachers need to ensure to create opportunities and
provisions for co-curricular activities.
d. Guide student(s) in undertaking micro-projects.
e. Use proper equivalent analogy to explain different concepts.
f. Use of PowerPoint slides and videos, numerical exercises to understand basics of
number system, digital techniques, and basic processor functionalities
g. Self-learning through online tutorials to develop solution using assembly code
h. Use of simulator to demonstrate assembly code

11. SUGGESTED MICRO-PROJECTS

NA

12. SUGGESTED LEARNING RESOURCES

Sr.
Title of Book Author Publication
No.
1 Modern Digital Electronics R P Jain McGraw Hill Education; 4th edition
Microprocessors and
2 Interfacing: Programming Douglas Hall McGraw-Hill Education; 2ndedition
and Hardware, Intel Version

13. SOFTWARE/LEARNING WEBSITES

1. http://www.nptel.ac.in
2.https://www.tutorialspoint.com/
3. http://www.nptel.ac.in
4.https://www.tutorialspoint.com/

G P Pune
Page 5 of 6
 Course Code:CM

14. PO - COMPETENCY- CO MAPPING

PO1 PO2 PO3 PO4 PO5 PO6 PO7

CO1 - 1 3 2 - 1 -
CO2 - 2 1 2 - - 1
CO3 1 2 3 3 - 1 1
CO4 - 1 2 3 - 1 1
CO5 - 3 3 3 1 1 2

PSO1 PSO2
CO1 3 -
CO2 3 -
CO3 3 -
CO4 3 -
CO5 3 -

Sign: Sign:

Name: 1) Smt M.G.Yawalkar Name: (Mr. U. V. Kokate)

2) Smt. A. S. Paike Head of the Department
(Course Expert /s) (Computer Engineering)

Sign: Sign:

Name: (Mr. U. V. Kokate) Name: Shri A.S.Zanpure

Programme Head (CDC In-charge)
(Computer Engineering)

G P Pune
Page 6 of 6
 Government Polytechnic, Pune
'180 OB' – Scheme

Programme Diploma in ET/CE/EE//ME/MT/CM/IT/DDGM

Programme code 01/02/03/04/05/06/07/08/16/17/21/22/23/24/26

Name of Course Computer Graphics using C

Course Code CM3106

Prerequisite course code and -
name

1. TEACHING AND EXAMINATION SCHEME

Teaching Total Examination Scheme

Scheme Credits Theory Practical Total
(In Hours) (L+T+P) Marks
L T P C ESE PA *ESE PA
Marks 80 20 150
25 25
03 01 02 06 Exam
3 Hrs 1 Hr
Duration
(*): POE(Practical & Oral Examination)
Legends: L- lecture-Tutorial/teacher guided theory practice, P-practical, ESE-End
semester examination, PA- Progressive Assessment.

2. RATIONALE
Computer graphics is the discipline of generating images with the aid of
computers. Today, computer graphics is a core technology in digital photography,
film, video games, cell phone and computer displays, and many specialized
applications. This course provides an introduction to the principles of computer
graphics. In particular, the course will consider methods for object design,
transformation, scan conversion, visualization and modeling of real world and
enables student to create impressive graphics easily and efficiently.

3. COMPETENCY

The aim of this course is to attend following industry identified competency

through various teaching learning experiences:
Develop Programs using graphics concepts.

G P Pune
Page 1 of 7
4. COURSE OUTCOMES (COs)
The theory, practical experiences and relevant soft skills associated with this course
are to be taught and implemented, so that the student demonstrates the following
industry oriented COs associated with the above mentioned competency:

1. Manipulate visual and geometric information of images.

2. Develop programs in C/ C++ applying standard graphics algorithms.
3. Perform and demonstrate basic and composite graphical transformations on given
object.
4. Implement various clipping algorithms.
5. Develop programs to create curves.
6. Recognize types of projections.

5. SUGGESTED PRACTICALS/ EXERCISES

The practicals in this section are PrOs (i.e. sub-components of the COs) to be developed and
assessed in the student for the attainment of the competency:

Relevant Approxim
Sr. Unit Practical Exercises
CO ate Hours
No. No. (Outcomes in Psychomotor Domain)
Required.
1 Write program to draw various graphics objects 1 02
1 (Pixel, Circle, Line, Ellipse, Rectangle, Triangle,
Polygon)
2 Write a program to draw line using DDA algorithm 2 02
3 Write a program to draw line using Bresennham’s 2 02
algorithm
4 2 Write a program to draw Circle using Bresennham’s 2 02
algorithm
5 Implement Flood fill algorithm for Polygon filling. 2 02
6 Implement Boundary fill algorithm for Polygon 2 02
filling.
7 Write a program for 2 D Translation, Scaling and 3 04
Rotation.
8 3 Write a program for 2 D Reflection and Shear. 3 02
9 Write Program for 3-D Translation, Scaling and 3 04
Rotation.
10 Write Program for Line Clipping. 4 04
4
11 Write Program for Polygon Clipping. 4 04
12 5 Implement Bezier curve. 5 02
Total Hrs 32

G P Pune
Page 2 of 7
S.No. Performance Indicators Weightage
in %
1 Use graphics software tool for programming to create, edit, compile 20
the programs/applications.
2 Write program to draw graphics objects. 30
3 Debug, test and execute the programs/applications 30
4 Able to answer oral questions. 10
5 Submission of assignment in time. 10
Total 100

6. MAJOR EQUIPMENT/ INSTRUMENTS REQUIRED

The major equipment with broad specification mentioned here will usher in uniformity in
conduct of practical, as well as aid to procure equipment by authorities concerned.

Sr.No. Major Equipment/ Instruments Required PrO. No.

1 Hardware: Personal computer, (i3-i5 preferable), RAM
minimum 2 GB onwards.
Operating system: Windows XP/Windows 7/LINUX
2 ALL
onwards.
3 Software: turbo C with dosbox or Emulated C.

7. THEORY COMPONENTS
The following topics/subtopics should be taught and assessed in order to develop UOs for
achieving the COs to attain the identified competency.

Specific Learning Outcomes

Topics and subtopics
(Cognitive Domain)
UNITS 1 : COMPUTER GRAPHICS SYSTEMS (Weightage-10 , Hrs- 06)
1a. Describe working of Raster 1.1 Raster scan display
scan display 1.2 Primitive operations: - moveto, lineto
1b. Write syntax and use of 1.3 Graphics Software
Primitive operations 1.4 Coordinate representations
1c. Describe Coordinate 1.5 Graphics file formats: Basics, advantages,
representation. disadvantages – BMP – GIF – JPEG – TIFF – PCX
1d. Select and use various graphics 1.6 Graphics Functions & Standards: Text
file formats. mode, Graphic mode Shapes, colors,
1e. Use different graphics functions Graphics standards.
and standards.

UNIT 2: RASTER SCAN GRAPHICS (Weightage-20 , Hrs- 12)

G P Pune
Page 3 of 7
2a. Apply line drawing algorithms 2.1 Line Drawing Algorithms
to generate line. 2.2 Digital Differential Analyzer
2b. Apply circle drawing 2.3 Bresenham’s Algorithm
algorithms to generate circle. 2.4 Circle Generation- Symmetry of circle, Bresenham’s
2c. Describe scan conversion. Algorithm.
2d. Describe different Character 2.5 Scan conversion
Generation Methods. 2.6 Character Generation Methods
2e. Describe Frame Buffer 2.7 Frame Buffer
2f. Apply Polygon filling 2.8 Polygon Filling : Seed fill algorithms: Flood fill,
algorithms to generate Polygon. Boundary fill, scanline algorithm .
2g. Describe Antialiasing 2.9 Antialiasing technique
technique

UNIT 3: 2-DIMENSIONAL AND 3-DIMENSIONAL

TRANSFORMATIONS(Weightage-20 , Hrs- 10)
3a. Perform various 3.1 Basic Transformations: Translation, Scaling,
transformations on given Rotation
graphics object 3.2 Matrix representations & homogeneous coordinates
3b. Use composite transformations. 3.3 Composite Transformations
3c. Write need of homogeneous 3.4 Three dimensional transformation
coordinates 3.5 Other transformations :Reflection, Shear

UNIT 4: WINDOWING & CLIPPING TECHNIQUES (Weightage-16 , Hrs- 10)

4a. Define Windowing and 4.1 Windowing concepts.
Clipping. 4.2 Clipping algorithms
4b. Apply clipping algorithms for 4.3 Area clipping
area, text and line. 4.4 Line clipping: Cohen Sutherland clipping algorithm,
4c. Describe Window to-viewport Cyrusbeck , Liang Barsky, Mid point subdivision
transformation. 4.5 Polygon clipping: Sutherland Hodgeman polygon
clipping
4.6 Text clipping
4.7 Window to-viewport transformation
UNIT 5: HIDDEN SURFACE ELIMINATION AND CURVES(Weightage-14 , Hrs- 10)
5a. Implement hidden line and 5.1 Hidden line elimination & hidden surface
surface algorithms. elimination (back face removal, z-buffer, painters
5b. Draw various curves using algorithm and Warnock’s algorithms)
curve generation algorithms. 5.2 Bezier and B-Spline curves, Hilbert’s Curve, Koch
5c. Identify different types of curve
projections. 5.3 Projections: Perspective and parallel Projection and
its types

G P Pune
Page 4 of 7
8. SUGGESTED SPECIFICATION TABLE FOR QUESTION PAPER DESIGN

Uni Unit Title Teaching Distribution of Theory Marks

t Hours R U A Total
No. Level Level Level Marks
I Computer Graphics Systems 06 04 04 02 10
II Raster Scan Graphics 12 04 08 08 20
III 2-Dimensional and 3-
10 04 08 08 20
Dimensional Transformations
IV Windowing & Clipping
10 04 06 06 16
Techniques
V Unit 5: Hidden surface
10 02 06 06 14
Elimination and Curves

Total 48 18 32 30 80

9. SUGGESTED STUDENT ACTIVITIES

Other than the classroom and laboratory learning, following are the suggested student-
related co-curricular activities which can be undertaken to accelerate the attainment of the
various outcomes in this course: Students should conduct following activities in group and
prepare reports of about 5 pages for each activity, also collect/record physical evidences for
their (student’s) portfolio which will be useful for their placement interviews:
a. Prepare journals based on practical performed in laboratory.

10. SUGGESTED SPECIAL INSTRUCTIONAL STRATEGIES (if any)

These are sample strategies, which the teacher can use to accelerate the attainment of
the various outcomes in this course:
a. Massive open online courses (MOOCs) may be used to teach various topics/sub
topics.
b. About 15-20% of the topics/sub-topics which is relatively simpler or descriptive in
nature is to be given to the students for self-directed learning and assess the
development of the COs through classroom presentations (see implementation
guideline for details).
c. With respect to item No.8, teachers need to ensure to create opportunities and
provisions for co-curricular activities.
d. Guide student(s) in undertaking micro-projects.
e. Correlate subtopics with power plant system and equipments.
f. Use proper equivalent analogy to explain different concepts.
g. Use Flash/Animations to explain various components, operation and
h. Teacher should ask the students to go through instruction and Technical manuals

11. SUGGESTED MICRO-PROJECTS

(Only for Class Declaration Courses)
Only one micro-project is planned to be undertaken by a student that needs to be assigned to
him/her.In the first four semesters, the micro-project are group-based. However, in the fifth
and sixth semesters, it should be preferably be individually undertaken to build up the skill
and confidence in every student to become problem solver so that s/he contributes to the

G P Pune
Page 5 of 7
projects of the industry. In special situations where groups have to be formed for micro-
projects, the number of students in the group should not exceed three.
The micro-project could be industry application based, internet-based, workshop-
based, laboratory-based or field-based. Each micro-project should encompass two or more
COs which are in fact, an integration of PrOs, UOs and ADOs. Each student will have to
maintain dated work diary consisting of individual contribution in the project work and give
a seminar presentation of it before submission. The total duration of the micro-project should
not be less than 16 (sixteen) student engagement hours during the course. The student ought
to submit micro-project by the end of the semester to develop the industry oriented COs.
A suggestive list of micro-projects is given here. Similar micro-projects could be
added by the concerned faculty:
a. Develop program for moving object.
b. Implement Snake Game.
c. Design Smile Face.
d. Design Clock.
e. Any other micro projects suggested by subject faculty on similar line

12. SUGGESTED LEARNING RESOURCES

S.N Title Author, Publisher, Edition and Year

ISBN Number
. of publication
Computer Graphics Donald Hearn and M Pauline
1
Baker, Prentice-Hall
Procedural Elements for David F.Rogers, McGraw-Hill
2
Computer Graphics
Principles of Interactive William M. Newman
3 Computer Graphics Robert F. Sproull, McGraw-Hill
Computer Graphics Zhigang Xiang
4
Roy Plastock, Schaum O Series

13. SOFTWARE/LEARNING WEBSITES

1. https://nptel.ac.in/courses/106106090/
2. https://www.javatpoint.com/computer-graphics-programs
3. https://www.tutorialspoint.com/computer_graphics/index.htm

14. PO - COMPETENCY- CO MAPPING

PO1 PO2 PO3 PO4 PO5 PO6 PO7

CO1 2 2 3 2 - - 2
CO2 3 3 3 3 2 2 3
CO3 3 3 2 2 1 1 2
CO4 2 3 2 3 2 2 3
CO5 2 3 3 3 1 2 2
CO6 1 2 2 1 - - 1

G P Pune
Page 6 of 7
 PSO1 PSO2
CO1 - 2
CO2 - 3
CO3 - 3
CO4 - 3
CO5 - 3
CO6 - 1

Sign: Sign:

Name: 1. Smt. S.B.Gosavi Name: Mr. U.V.Kokate

2.Smt. A.M.Galshetwar
(Head of Department)
(Course Expert /s)

Sign: Sign:

Name: Mr. U.V.Kokate Name: Shri A.S.Zanpure

(Programme Head) (CDC )

G P Pune
Page 7 of 7
 Government Polytechnic, Pune
'180 OB' – Scheme

Programme Diploma in Computer Engineering

Programme code 06/26

Name of Course Computer Peripherals & Hardware Maintenance

Course Code CM3107

Prerequisite course code and Nil
name

1. TEACHING AND EXAMINATION SCHEME

Teaching Total Examination Scheme

Scheme Credits Theory Practical Total
(In Hours) (L+T+P) Marks
L T P C ESE PA *ESE PA
Marks 40 10 25 10025
03 00 02 05 Exam
2 Hrs 1 Hr 2 Hr
Duration
(*): Practical & Oral Examination
Legends: L- lecture, T-Tutorial/teacher guided theory practice, P-practical, ESE-End
semester examination, PA- Progressive Assessment.

2. RATIONALE

For the smooth functioning of computer system it is required to maintain, repair,

troubleshoot and do preventive maintenance of the computer system and its peripheral
devices. Therefore it is essential for the students to acquire skills in the area of
computer maintenance and troubleshooting and its preventive maintenance. This
course is focused on developing skills in assembling desktop computers, interfacing
input output devices, installation and configuration of Operating systems, loading and
configuring various device drivers and troubleshoots various hardware components.

G P Pune
Page 1 of 6
3. COMPETENCY

The aim of this course is to help the students to attain the following industry
identified competency through various teaching learning experiences.

 Assemble Desktop computer system and maintain computer peripheral

equipment’s.

4. COURSE OUTCOMES (COs)

1. Identify and compare different types of computer systems.

2. Select appropriate motherboard and processor for computer systems.
3. Configure various memory and storage devices.
4. Distinguish various power supply and UPS.
5. Assemble computer system with operating system installation and troubleshoot its
common problems.

5. SUGGESTED PRACTICALS/ EXERCISES

The practical’s in this section are PrOs (i.e. sub-components of the COs) to be developed and
assessed in the student for the attainment of the competency:

Unit Approximate
Sr. Practical Exercises Relevant
No. Hours
No. CO
Required.
Identify various computer systems according to its 1 2
1 1
specifications.
Identify various components of motherboard and 2 4
2 2 troubleshoot its common problems.

Configure BIOS Settings 2 2

3 3

Installing Hard Disk, Manage and format hard disk 3 4

4 4 using various file system.
Install operating system (Windows and Linux 5 4
5 4
Family)
Installing SMPS and troubleshooting its common 4 2
6 5
problems.
Install Local printer (Driver installation and Printer 5 4
7 6
settings) and troubleshoot common problems.
Installation of Optical Drive(CD / DVD Drives) and 5 2
8 6 Troubleshooting Common problems
Assembling and disassembling Desktop computer 5 4
9 1-6 system.
Use diagnostic software for fault finding and 5 4
10 6
preventive maintenance of PC
Total 32

G P Pune
Page 2 of 6
Sr.No. Performance Indicators Weightage in %
a. Effective practical implementation within specific time 50
b. Handling of hardware components 20
c. Answer to questions 20
d. Submission of assignment with in time 10
Total 100

6. MAJOR EQUIPMENT/ INSTRUMENTS REQUIRED

The major equipment with broad specification mentioned here will usher in uniformity in
conduct of practical, as well as aid to procure equipment by authorities concerned.

Sr.No. Major Equipment/ Instruments Required PrO. No.

Computer system with all necessary components like
1 Motherboard,Processor,RAM,Harddisk,CD/DVD All
Drive,Hard disk.
2 Operating System 5
3 Power Supply (SMPS) All
4 Printer (any) 7
Diagnostic software (Freeware )for fault finding and
5 preventive maintenance tools like Vacuum 10
cleaner/Blower

7. THEORY COMPONENTS
The following topics/subtopics should be taught and assessed in order to develop UOs for
achieving the COs to attain the identified competency.

Unit Outcomes (UOs) Topics and Sub-topics

(in cognitive domain)
UNIT 1. Introduction to computer Hardware (Weightage-4, Hrs-4)
1a. List different types of 1.1 Basic Computer Hardware Structure.
computer system. 1.2 Different types of computer systems.
1b. Explain features of desktop 1.3 Features of computer systems : Desktop systems, server
system. computers, Laptops, Tablets
1c. Describe laptop features.

UNIT 2. Motherboard (Weightage-8, Hrs-10)

2a. List components of 2.1 Features of Motherboards, Components of Motherboard,
motherboard. Form Factor of motherboards, Motherboard Controller
2b.Explain form factor of 2.2 Memory Support, Graphics Support, BIOS, IDE and SATA
motherboard. Connectors
2c. Describe external device 2.3 Power Supply Connectors, External Devices Interfaces,
interfaces. Buses and Expansion Slots
G P Pune
Page 3 of 6
2d. Explain buses and 2.4 Selection of Motherboards.
expansion slots.
2e.Describe selection criteria of
motherboard.

UNIT 3. Processing Units (Weightage-6, Hrs-8)

3a. Explain developmental 3.1 Processor Features, Developmental Stages of CPU
stages of CPU. 3.2 Towards Multiple Core Processors, Processor
3b.Describe CPU overheating Specifications, CPU Overheating Issues
issues. 3.3 Processor: Common Problems and Solutions, Graphics
3c. Explain core processors. Processing Units
3d. List Common problem in
processors.
3e. State the use of GPU?

UNIT 4. Memory and storage (Weightage-8, Hrs-8)

4a. List types of computer 4.1 Features of Computer Memory, Types of Computer
memory. Memory, Working of Computer Memory, Memory common
4b. Explain working of hard problems and solutions.
disk. 4.2 Hard Disks Details , Working of Hard Disks, Features of
4c. Explain the use of solid state Hard Disks, Hard Disk Specifications, Partitioning and
drives and blue ray discs. formatting hard disks.
4d. Describe external storage 4.3 Solid state drives, Blue-ray Discs, External Storage
devices. devices.

UNIT 5 Power supply and UPS (Weightage-6, Hrs-8)

5a. List specification for SMPS. 5.1 Features of SMPS, Types of SMPS, Specification for
5b. State the selection criteria of SMPS, Selecting SMPS and Computer Cabinets
SMPS and computer cabinet. 5.2 Uninterrupted Power Supply: Working of UPS, Types of
5c. Describe working of UPS. UPS, UPS Features and Specifications, UPS Batteries.
5d. List UPS features and
specifications.

UNIT 6 Troubleshooting and Maintenance (Weightage-8, Hrs-10)

6a. Describe troubleshooting 6.1 Introduction to I/O devices with its troubleshooting tips
tips for printer. :Computer Monitor, Keyboard and Mouse, printer, optical
6b. Describe POST? drives
6c. Explain how to diagnosis 6.2 Safety Precautions, Power on self test, Devices and Drivers
general problems. 6.3 Working with windows registry, overclocking the system
6d. Explain overclocking the 6.4 Diagnosing general problems, Flashing Bios, Preventive
system? Maintenance
6e. Explain safety precautions.

G P Pune
Page 4 of 6
8. SUGGESTED SPECIFICATION TABLE FOR QUESTION PAPER DESIGN

Uni Unit Title Teaching Distribution of Theory Marks

t Hours R U A Total
No. Level Level Level Marks
I Introduction to computer
4 2 2 -- 4
Hardware
II Motherboard 10 2 4 2 8
III Processing Units 8 2 2 2 6
IV Memory and storage 8 2 4 2 8
V Power supply and UPS 8 2 2 2 6
VI Troubleshooting and
10 2 2 4 8
Maintenance
Total 48 12 16 12 40

Legends: R = Remember; U = Understand; A = Apply and above levels (Bloom’s Revised

Taxonomy)
9. SUGGESTED STUDENT ACTIVITIES

1. Survey of various computer systems like desktop, laptops, servers and peripherals available in
the Institute and Industry.
2. Prepare comparative Specification charts of the above survey.
3. Industry visit to understand the industry standard maintenance workflow.
4. Presentation on latest technology used in computer hardware.

10. SUGGESTED SPECIAL INSTRUCTIONAL STRATEGIES (if any)

1. Massive open online courses (MOOCs) can be used to teach various topics.
2. Group Discussions on various peripherals and computer systems and its relevant use.
3. Power point presentation to explain functioning of various devices and components.

11. SUGGESTED LEARNING RESOURCES

Author, Publisher, Edition

Sr.No. Title ISBN Number
and Year of publication
The Complete PC Upgrade Mark Minasi, BPB ISBN-13: 978-
&maintenance Publication 0782114980
1
Guide ISBN-10: 0782114989

The computer hardware K.L. James ISBN-10: 8120347986

2 installation, interfacing, Prentice Hall India Learning ISBN-13:978-
troubleshooting and maintenance Private Limited 8120347984
D Balasubramanian, 0070591180 · 978007059
Computer Installation and McGraw-Hill ,2nd Edition, 1189
3 Servicing July 15, 2005

G P Pune
Page 5 of 6
12. SOFTWARE/LEARNING WEBSITES

1. https://computer.howstuffworks.com/computer-hardware-channel.htm
2. https://www.computerhope.com
3. https://www.tutorialspoint.com/computer_fundamentals/computer_hardware.htm

13. PO - COMPETENCY- CO MAPPING

PO1 PO2 PO3 PO4 PO5 PO6 PO7

CO1 2 1 3 - 2 2 3
CO2 1 1 3 - 1 3 3
CO3 1 - 3 1 2 3 3
CO4 - - 2 1 3 2 3
CO5 2 3 3 1 2 3 3

PSO1 PSO2
CO1 3 -
CO2 3 -
CO3 3 -
CO4 2 -
CO5 3 -

Sign: Sign:

Name: T.P. Sharma Name: Shri U.V. Kokate

Name: S.P. Ambavane
(Head of Department)
(Course Expert /s)

Sign:

Name: Shri A.S.Zanpure

(CDC )

G P Pune
Page 6 of 6
 Government Polytechnic, Pune
'180 OB' – Scheme

Programme Diploma in Computer Engineering

Programme code 06/26

Name of Course Computer Networks

Course Code CM3108

Prerequisite course code and Nil
name

1. TEACHING AND EXAMINATION SCHEME

Teaching Total Examination Scheme

Scheme Credits Theory Practical Total
(In Hours) (L+T+P) Marks
L T P C ESE PA *ESE PA
Marks 80 20 25 25 150
04 00 02 06 Exam
3 Hrs 1 Hr 2 Hr
Duration
(*): Oral Examination
Legends: L- lecture-Tutorial/teacher guided theory practice, P-practical, ESE-End
semester examination, PA- Progressive Assessment.

2. RATIONALE

One of the major components of computer based information systems is computer

networks. Through computer networks we can share hardware, Software, Processing,
Data and Applications besides getting global connectivity for internet based
communication and services. For diploma students it is important to understand the
function of computer networks and obtain requisite knowledge about hardware and
software requirements of networks and acquire skills to establish a network using
necessary hardware & software tools and configure various services over it. The
objectives of this course are to make students learn the technology of designing,
building and maintaining computer networks.

G P Pune
Page 1 of 6
3. COMPETENCY

The aim of this course is to help the students to attain the following competency
through various teaching learning experiences.
Use Software and hardware technology to design, establish and maintain
computer networks.

4. COURSE OUTCOMES (COs)

1. Identify and classify various types of computer network.

2. Select relevant transmission media and switching technique as per requirements.
3. Establish network using wireless technology.
4. Configure various network control devices and design a small network.
5. Classify & describe IP addressing and TCP/IP protocols using standard network
model.

5. SUGGESTED PRACTICALS/ EXERCISES

The practical’s in this section are PrOs (i.e. sub-components of the COs) to be developed and
assessed in the student for the attainment of the competency

Unit Approximate
Sr. Practical Exercises Relevant
No. Hours
No. CO
Required.
1 1 Identify Components of network in your Computer 1 2
Network Lab.
2 2 Create network cables (Straight and crossover) and 2 4
test it using suitable equipment.

3 3 To connect and understand different network control 4 2

devices used in LAN

4 2-4 Connect computer in star topology using wired and 3,4 4

wireless medium.
5 4-5 Configure IP address (Statically and Dynamically) 5 2
6 4-5 Run network diagnostic commands : ipconfig, ping 5 2
,tracert, netstat, route, arp
7 4-5 Share file, folder, and printer in peer to peer network. 4 4
8 4-5 Configure router (Home or Small office home office 4 4
Device)
9 5 Create a network based on IPV6 address using a 5 4
simulator.
10 5 Install wireshark software and configure it as a 5 4
packet sniffer
Total 32
G P Pune
Page 2 of 6
Sr.No. Performance Indicators Weightage in %
a. Effective practical implementation within specific time 60
b. Handling of networking components 10
c. Answer to questions 20
d. Submission of assignment with in time 10
Total 100

6. MAJOR EQUIPMENT/ INSTRUMENTS REQUIRED

The major equipment with broad specification mentioned here will usher in uniformity in
conduct of practical, as well as aid to procure equipment by authorities concerned.

Sr.No. Major Equipment/ Instruments Required PrO. No.

1 Computer Systems (NIC Installed) All
2 Network control devices and transmission media All
3 Crimping Tool,RJ45 Connector 2
4 Wireshark sniffer software 10

7. THEORY COMPONENTS
The following topics/subtopics should be taught and assessed in order to develop UOs for
achieving the COs to attain the identified competency.

Unit Outcomes (UOs) Topics and Sub-topics

(in cognitive domain)
UNIT 1. Fundamentals of computer network (Weightage-14, Hrs-10)
1.1 Fundamentals of Computer Network- Definition Need of
Computer Network, Applications, Component of Computer
1. List the benefits and applications Network.
of Computer Networks. 1.2 Network Benefits: Sharing Information (File Sharing, E-
2. Classify computer network mail), Sharing Resources (Printer Sharing, Application
according to its geography. Services), Maintaining the Network, Backing up data.
3. Select appropriate network 1.3 Computer Network Classifications- Classification of
architecture according to the
Network by their Geography.- LAN, MAN, WAN.
requirements.
1.4 Classification of Network by their Component Role--Peer-
to-Peer Network, client-Server-Based Network

UNIT 2. Transmission Media (Weightage- 14 , Hrs-12)

1. Explain guided and unguided 2.1 Guided Media: Types of Cable-Twisted
media. Pair Cable, Co-axial Cable, Fiber Optic Cable.
2. Select appropriate media for 2.2 Unguided media: Microwave Communication, Radio
network implementation. wave Communication, Satellite Communication
3.Differentiate between circuit 2.3 Switching Basics: Circuit Switched Networks and
switched and datagram network Datagram Networks.

G P Pune
Page 3 of 6
 UNIT 3. Wireless Communication (Weightage-16, Hrs-12)
1. Describe IEEE Standards. 3.1 Overview of wireless network
2.Establish wireless LAN 3.2 IEEE Standards : 802.1,802.2,802.3,802.4,802.5
3. Create a Bluetooth enabled 3.3 Bluetooth: Piconet and Scatternet.
network. 3.4 802.11 Wireless LAN: Challenges in wireless LAN,
Access Point (AP), and 802.11 Protocol Stack.

UNIT 4. Network Topologies and Networking Devices (Weightage-16, Hrs-14)

1. Compare and use relevant 4.1 Network Topologies :

topologies in LAN. i) Bus ii) Ring iii) Star iv) Mesh v) Tree vi)
2. Design a small network using Hybrid.
network control devices. 4.2 Network Control / Connecting Devices :
Hub, Repeater, Bridges, Switches,
Router, Gateway, Modem, Firewall.
UNIT 5 OSI Reference Model & TCP/IP Model (Weightage-20, Hrs-16)

1. Identify the protocols 5.1 Layers of the OSI Reference Model (Functions of each
working in a layered Layer &Protocols used) – Physical Layer, Data-Link Layer,
architecture. Network Layer, Transport Layer, Session Layer, Presentation
2. Troubleshoot the network Layer, Application
using standard network model. Layer.
3. Distinguish between IPV4 5.2 Layered Structure of the TCP / IP Model – Host-to-
and IPV6 addresses. Network, Internet, Transport, and Application.
4. Explain various LAN 5.3 Comparison between OSI and TCP / IP Network Model
technologies and protocols. 5.4 IP Addressing – IP Address classes, classless IP
5. Configure nodes with addressing. Subnetting, Supernetting and masking,
appropriate IP addresses. Introduction to IPV6 address.
5.5 Introduction to Dynamic Host Configuration
Protocol(DHCP) and Network Address Translation (NAT)
5.6 Ethernet : Introduction , Properties of Ethernet, CSMA/CD,
Ethernet Addresses
5.7 Virtual LAN( VLAN) ,Fast and Gigabit Ethernet, Token
Ring

8. SUGGESTED SPECIFICATION TABLE FOR QUESTION PAPER DESIGN

Uni Unit Title Teaching Distribution of Theory Marks

t Hours R U A Total
No. Level Level Level Marks
I Fundamentals of computer
10 6 4 4 14
network
II Transmission Media 12 4 6 4 14
III Wireless Communication 12 4 6 6 16
IV Network Topologies and
14 4 6 6 16
Networking Devices
V OSI Reference Model & TCP/IP
16 6 6 8 20
Model
Total 64 24 28 28 80
G P Pune
Page 4 of 6
9. SUGGESTED STUDENT ACTIVITIES

1. Identify type of Network in your Department.

2. Design a Network for your Institute.
3. Visit server room and various places where Racks and servers are installed, identify
various Network components; collect information about of necessary hardware and
software.
4. Prepare Charts of Network Topologies.

10. SUGGESTED SPECIAL INSTRUCTIONAL STRATEGIES (if any)

1. Demonstration of local area network installation in the institute and its technology.
Give an environment to establish, configure and troubleshoot a small network by
giving hands on practice.
2. Massive open online courses (MOOCs) can be used to teach various topics.

11. SUGGESTED MICRO-PROJECTS

Not Applicable

12. SUGGESTED LEARNING RESOURCES

S.N Author, Publisher, Edition

Title ISBN Number
. and Year of publication
Data Communication A S Godbole, McGraw-
1 and Networking Hill, 2nd Edition, June 13, 0071077707 ,9780071077705
2011
Andrew S. Tanenbaum
2 Computer Networks , Prentice Hall, 5th 978-9332576223
Edition, January 2010
Data Communication Behrouz A. Forouzan,
and Networking McGraw-Hill Higher
3 978-0072967753
Education, 4th Edition,
January 2007
Networking The Bobbi Sandberg, Tata
4 Complete Reference McGraw Hill, 3rd Edition, 9339222199 ,9789339222192
June 24, 2015

13. SOFTWARE/LEARNING WEBSITES

1. www.nptel.ac.in

2. www.tutorialspoint.com

G P Pune
Page 5 of 6
14. PO - COMPETENCY- CO MAPPING

PO1 PO2 PO3 PO4 PO5 PO6 PO7

CO1 1 3 1 1 1 1 1
CO2 2 2 2 1 1 1 1
CO3 1 2 2 2 2 2 1
CO4 1 2 2 2 2 3 1
CO5 1 2 1 1 1 1 1

PSO1 PSO2
CO1 2 -
CO2 2 -
CO3 1 2
CO4 1 2
CO5 1 3

Sign: Sign:

Name: T.P. Sharma Name: Shri U.V. Kokate

Name: A.A. Shaikh
(Head of Department)
(Course Expert /s)

Sign:

Name: Shri A.S.Zanpure

(CDC )

G P Pune
Page 6 of 6