Vision

Transcending the process of integrating intelligence to Technology

Products and Processes by architectural and algorithmic solution

building procedures resulting in autonomous entities which shall

surpass collective human intelligence

Mission

Engage learners to develop competency in algorithmic

approaches in resolving complexities of real time problems.

Help pupils to develop competency in creative and

architectural solution building processes tor bullding

efficiencies
Initiate the learners to intuitive/ creative solution building

processes as a complimentary skil set

Scaling up the process of creating digital learning content in the

realm of Al & DS underpinning the theorles of cognitive science

and virtual / Augmented reality techniques

Design and create a supply chain of human capital with high

degree of intellectual/ emotional and spiritual quotient to man

the evolving National economies

Equip students with multi-disciplinary skill sets to offer

solutions to real time problems through initiating them to the

process of research and innovation

To create an academic environment for higher learning. lifelong

learning, academic excellence, and research endeavours

o
Design ways and means of initiating learners to acquire high
level of mathematical integrity and analytical competency

Training the learners to develop emotional integrity,

interpersonal Intelligence, and Intrapersonal intelligence to

make them evolve as a Human capital for the society at large

Sensitising learners about sustainable development process,

resillence of systems, and desirability of influencing the

evolving worid order to optimise wealth and value creation for

the mankind
 HCademiC Laiendd

Programme Educational Objectives (PEO'S)

Artificial Intelligence and Data Science graduates will be able to:

PEO1: Graduate shall develop actionable competency in the

realm of Artificial Intelligence & Machine Learning. Data

Analytics, and Blockchain

PEOZ Graduates shall be inducted in the supply cnain of

human capital to transend current level of research in Al and

Data Sclence
PEO3: Graduates shall be industry ready to man the ever

increasing & accelerated demand of Intormation Technology

behemoths in the national and global space to build intelligent

SOutons in tne technolOEy marketplace

PEO4: Graduate will exhibit professional ethics and moral value

with capability of working as an individual and as a team to

contribute to further the cause of industry and society at large

Program Specific Outcomes (PSOs)

PSO1: The ability to conceptualise, formulate, design., analyse

and create solutions underpinning tne knowledge of numan

cognition, Digital-Computational technologies, Artificial

Inteligence and Data Science in terms of rea-world problems

to contribute to sustainable progress of mankind at large

PSO2 Ine ability to apply knowledge of basic SCience,

probability & statistics, computational algorithms to carryout

research to contribute the body of knowledge in the realm of

computer science/ engineering and Artificial Intelligence & Data

Science

Program outcomes (POs)

Engineering Graduates will be able to:

PO1. Engineering knowledge: Apply the knowledge of

mathematics, science, engineering fundamentals, and an

engineering specialization to the solution of complex

engineerin8 problems.
PO2. Problem analysis: Identify, formulate, review research

literature, and analyze complex engineering problems reaching

substantiated conclusions using first principles of mathematics,

natural sclences, and englneering sclences

PO3. Design/development of solutions: Design solutions tor

complex engineering problems and design system components

or processes that meet the specified needs with appropriate

consideration for the public health and safety, and the cultural,

5ocietal, and environmental considerations.

P04. Conduct investigations of complex problems: Use

research-Dased knowledge and research methods Including

design of experiments, analysis and interpretation of data, and

synthesis of the information to provide valid conclusions.

POS. Modern tool usage: Create, select, and apply appropriate

techniques, resources, and modern engineering and IT tools

Including prediction and modelling to complex engineering

activities with an understanding of the limitations.

PO6. The engineer and society: Apply reasoning informed by

tne contextual knowiedge to as5ess societal, nealtn, safety,

legal and cuitural issues and the consequent responsibilities

relevant to the protessional engineering practice.

PO7. Environment and sustainability: Understand the impact

of the professional engineering solutions in societal and

environmental contexts, and demonstrate the knowledge of,

and need tor sustainable development.

PO8. Ethics: Apply ethical principles and commit to

professional ethics and responsibilities and norms of the

engineering practice

PO9. Individual and team work: Function effectively as an

individual, and as a member or leader in diverse teams, and in

multidisciplinary settings.
PO10. Communication: Communicate effectively on complex

engineering activities with the engineering community and with

society at large, such as, being able to comprehend and write

effective reports and design documentation, make effective

presentations, and give and recelve clear instructions.

PO11. Project management and finance: Demonstrate

knowledge and understanding of the engineering and

management principles and apply these to one's own work, as

a member and leader in a team, to manage projects and in

multidisciplinary environments.

PO12. Life-long learning: Recognize the need for, and have

the preparation and ability to engage in independent and life-

long learning in the broadest context of technological change.

 09:08

Sem-l.pdf cund Year Computes

ERSITY OF MUMBAI (With Effect fram 2

Teaching Scheme
Cou Credits Assigned
(Contact Hours)
Course Naie
Theory Pract Theory Pract. Tut. Total

CSC301
CSC302
S0
screte Structures and
Giraph 11heosy

CSC303 DataStructure
CSCs04 Digital
Logic &Computer
Architecture
CSC305Computer Graphics
CSL301Data Structure Lab
CSL302 A oputer

CSL303Computer Graphics Lab

CSL.S0
eramming with Java
CSM30lMini Proiect-1 A

5
Eamination Scheti
Theory Ter Total
C'ourse
Code Coute Name ntes Assessment
EndExam
Sem. Duration
Exam| inHrs)
Tet
CSC301 ng Mathematics 125
screte Structures and
|CSC302 Graph Theory
100
CSCS03 Data Structure
CSC304A ital Logic&onpuler
CSC305 Computer Graphics 00

CSL.0 Data Structure Lab

CSL302 g t a Logic & Computer

ArchitectureLD
CSL303
Skill
Computer Graphics Lab
base Lab course
25
CSL304Object Oriented
Progranming with Java
CSM301 Mini Project- 1A
Total 100 775

"Should be conducted batch wise and

S indicates workload of Learner (Not Faculty). Students can fom groups with minimum 2 (Two)
and not more than 4 (Four), Faculty Load: 1 hour per week per four groups

Program Structure for Second Year Computer Engineering

UNIVERSITY OF MUMBAI (With Efect from 2020-2021)
Semester IV

ou
Teaching Scheme Credits Assigned
(Contact Hours)
Cle Course Name
Theory Pract. Theory Pract. Tut. Total
CSC401 neering Mathematics
CSCA02Analysis of Agorihn
SC403 eanagement

CSC404 Operating System

CSC405 Microproces
CSLAO1 Analysis of Algorithm Lab
et AO Database Management
CSL402 Sy
ystem L
CSLAO3Operating System Lab
CSLA04Microprocessor Lab
Skill Base Lab Course
CSLADSPython Programming.
CSM401 Mini Project 1-B
Total

Examination Schem

Theory TermPratTotal
Work& oral Total

Coune End Eam.

Code Course Name InterhalASesn uration
Exam. (in Hrs)

CSC401 gMathematics 125

CSC402Analysis of Algorithm 100

CSC403Databa Managemient 100

CSC404 Operatng D
CSC405 | Microprocessor
CSLA01Analysis of Algorithm Lab
CSLA02 tabase Mar ement

CSLA03 03 Operating Systen Lao

_CSLA04 MicroprOcessor Lab

CSL405 Base Lab Course:
Python Pzog
CSM4OIMini Project 1-B
Total
100 400 175 100 775
*Should be conducted batchwise and
S indicates workload of Learner (Not Faculty), Students can form groups with minimum 2 (Two)
and not more than 4 (Four), Faculty Load: 1 hour per week per four groups.
CSC403 s e Management
System
CSC404Operatng >yste 2 20
CSC405 Microprocessor

CSLADIAalysis of Algorithm Lab

CSL402 e Nanagement
AOZSystem Lab
CSLA03OperatingSyalem ao
CSLAO4Microprocessor Lab
Skill Base Lab Course:
CSLA0S Python Program
CSM401Mini Project
100 400 175 10075
"Should be conducted batchwise and
S indicates workload of Learner (Not Faculty), Students can form groups with minimum 2 (Two)
and not more than 4 (Four), Faculty Load: I hour per week per four groups

Course Code Course Name Credits

CSC301 Engineering Mathematics-III

Pre-requisite: Engineering Mathematics-I, Engineering Mathematics-II

Course Objectives: The course aims:
TTo lean the Laplace Transform, Inverse Laplace Transform of various functions, its
applications.
2 To understand the concept of Fourier Series, its complex form and enhance the problem-
lin
3 To understand the concept of complex variables, C-R equations with applications.
4 To understand the basic techniques of statistics like correlation, regression, and curve

fitting for data analysis, Machine learning, and AL_

5 To understand some advanced topics of probability, random variables with their
distributions and expectations.
CourseUnderstand
Outcomes:theOnconcept
successful completion, ofcourse,learner/student will beable to:
of Laplace transform and its application to solve the real integrals
inengncering problems.
2Understand the concept of inverse Laplace transtorm of various functions and its
applicationsin engineering problems.
3 Expand the periodic function by using the Fourier series for real-life problems and
complex engineeringE problems.
4Understandcomplex variable theory, application of harmonic conjugate to get orthogonal
trajectoriesand analytic functions.
SApply the concept of Correlation and Regression to the engineering problems in data
NCICnCe,machine learning. and Al
6 Understand the concepts of probability and expectation for getting the spread of the data
n ddistribution of probabilities.

Module Detailed Contents Hours

Laplace Transform 7
1.1 Definition of Laplace transform, Condition of Existence of Laplace
transform.
1.2 Laplace Transform (L) of standard functions like
, DD(O, D0DRD, DODROD Jand 20
1.3 Properties of Laplace Transform: Linearity, First Shifting Theorem,
of Scale,
econd shifting Theorem, Change Multiplication by
t,
Division by 1, Laplace Transform of derivatives and integrals
eropCTties witnouE pitoo
14Evaluation of real improper integrals by using Laplace 1ranstormation.
1.5| Self-learning Topics: Laplace Transform: Periodic functions,
Heaviside's Unit Step function, Dirac Delta Function, Special functions

2
|(Eror and Bessel)
InverseLaplace Transtorm
2.1 Definition of Inverse Laplace Transform, Linearity property, Inverse
Laplace Transform of standard functions, Inverse Laplace transform
using derivatives.
22 Partial fractions method to find Inverse Laplace transtorm
2.3 Inverse Laplace transform using Convolution theorem (without proof)
2.4 Self-learning Topics: Applications to solve initial and boundary
value

problems involving ordinary differential equations.

Fourier Series:
5.1Drichlet s conditions, LDetinition of Fourner s

Ounct Senes Ol cEn and odd iuncdos

3.4 Half range Sine and Cosine Series.
 Course Name Credits
Course Code
CSC302 Discrete Structures and Graph Theory

P're-requisite: Basic Mathematics

Course Objectives: The course ams:
Cultivate clear thinking and creative problem solving
2 Thoroughly train in the construction and understanding of mathematical proofs. Exercise
common mathematical arguments and proof strategies.
1o pply graph theory in solving practical problems.
4 Thoroughly prepare for the mathematical aspects of other Computer Enggineering courses
Course Outcomes: On successful completion,ofcourse, learner'student will beable to:_
Understand the notion of mathematical thinking. mathematical proofs and to apply them

proDem soivin cally

3Abilityto understand relations, functions, Diagraph and Lattice
4Abiltyto understand and apply concepts of graph theory in solving real world probiems
S|Understand use of groups and codes in Encoding-Decoding
6 Analyze a complex computing problem and apply principles of discrete mathematics to
1dentitysolutions
Module Detailed Contents Hours
Logic 6
1.1Propositional Logic, Predicate Logic, Laws of Logic, Quantifiers
Normal Foms, Inference Theory of Predicate Calculus, |
|Mathematical Induction.
Relations and Functions
21BasSiC
22
concepts of Set Theory
Relations: Definition, Types of Relations, Representation of
Relations, Closures of Relations, Warshall's algorithm, Equivalence
relations and Equivalence Classes
Functions: Definition, Types of functions, Composition of

functions, ldentity and Inverse function

P'osets and Lattice
3.1 Partial Order Relations, Poset, Hasse Diagram, Chain and Anti

chains, Lattice, Types of Lattice, Sublattice

Counting
Basic Counting Principle-Sum Rule, Product Rule, Inclusion-
ENCIUsIOn Frincipie. geonnoue rnncipieelations
KECurence relatonsS, SOiving TEcurenCe Tetattons
AlgebraiC Structures
Algebraic structures with one Abelian
binary operatio: Semi group
Monoid, Giroups, Subgroups, Group. CyclicC group.
Isomorphism
5.2Algebraicstructures with two binary operations: Ring
.5CodingTheory: Coding. binary information and error detection,
| decoding and error correction
Graph 1heory
Types of graphs, Giraph Representation, Sub graphs, Operations on
Graphs, Walk, Path, Circuit, Connected Graphs, Disconnected
Graph, Components, Homomorphism and Isomorphism of Graphs,
|Euler and Hamiltonian Graphs, Planar Graph, Cut Set,Cut Vertex,
 COurse C0de Course N n e
Credit
C303 Data Structure 03

Terequisite: C Programming

Course Objectives: The course aims:

o understand the need and signilicance oT Data structures asS a computer Proressional.
O teacn concept und pictnetntalon ot ncdr and NOnnca datd structrcs.
1 o analyze varnous data structures and seiect thne approprrale one toO Solve a specilic real

|world problem._
1o introduce varnous techniques for representation ot the data in the real world.
|To teach various searching techniques.
Course Outcomes:
Students will be able to implement Linear and Non-Linear data structures.
Students will be able to handle various operations lhke searching, insertion, deletion and
traversals on various data structures.
3 Studentswill be able to explain various data structures, related teminologies and its types.
Students will be able to choose appropriate data structure and apply it to solve problems in
various domains.
Students will be able to analyze and Implement appropriate searching techniques lor a given
problem
6| Students will be able to demonstrate the ability to analyze, design, apply and use data
structures to solveengincering problems and evaluatetheir solutions.
Module Detailed Content
Introduction to Data Structurs 13/49
ntroduction to Data Structures, Concept ot ADT, Types of Data Stn
Linear and Nonlinear, Operations on Data Structures.
Stack and Queues
|2.1 Introduction, ADT of Stack, Operations on Stack, Array Implementation of|
Stack, Applications of Stack-Well form-ness of Parenthesis, Infix to Postfi
Conversion and Postix Evaluation, Recursion.
Introduction, ADT of Queue, Operations on Queue, Array Implementation of
Queue, Types of Queue-Circular Queue, Priority Queue, Introduction of Double
Ended Queue, Applications of Queue
Linked Lst

Introduction, Representation of Linked List, Linked List v/s ArTay. Types of

|Linked List Singly Linked List, Circular Linked List, Doubly Linked List.
Operations on Singly Linked List and Doubly Linked List, Stack and Queue
using Singly Linked List, Singly Linked List Application-Polynomial
Representation and Addition
4 Trees
|4.1 Types
ntroduction, Tree Terminologies, Binary 1ree, Binary Tree Representation.
of Binary Tree, Binary Tree Traversals, Binary Search Tree, Operations
on Binary Search Tree, Applications of Binary Tree-Expression Tree. Huffman
Encoding. Search Trees-AVL, rotations in AVL Tree, operations on AVL Tree.
Introduction of BTree, B+ Tree._
Gaphs

s.1 Introduction, Graph Terminologies, Representation of Giraph, Graph Traversals-

Depth First Search (DFS) and Breadth First Search (BES), Graph Application-
Topological Sorting
6 Searching Techniques

6Linear Search, Binary Search, Hashing-Concept, Hash Functions, Collision

Lresolution Techniques
 Course Code Course Name Credit
CSC304 Digital Logic & Computer Organization and Architecture

Pre-requisite: Knowledge on number systems

Course Objective:
T To have the rough understanding of the basic structure and operation of basic digital circuits
and digital computer.
2To discuss in detail anthmetic operations in digital system.
3 To discuss generation of control signals and different ways of communication with VO
de
4 To study the hierarchical memory and principles of advanced computing.
Course Outcome:
1olearn diferent number systems and basic struCture ot computer system.
2To demonstrate the arithmetic algorithms.
3|To understand the basicconcepts of digital componentsand processor organization.
* 0unacstand tne generaation of control sgnals of computer.
0 denonstrlte thic tnenogy orgnizaaton
6| To describe the concepts of parallel processing and different Buses.

Module Detailed Conten Hours

T Computer Fundamentals
1.1ntroductionto Number System and Codes
umber Systems: Binary, Octal, Decimal, Hexadecimal,
L.3Codes: Grey, BCD, Excess-3, ASCI, Boolean Algebra
|L4LogicGates: AND, OR, NOT, NAND, NOR, EX-OR_
OverView ot computer organization and architecture.
1.6|Basic Organization of Computer and Block Level functional Units, Von
Neumann Model.

2 Data Representation and Arithmeticalgorithms

2.1 Binary Arithmetic: Addition, Subtraction, Multiplication, Division using Sign
Magnitude, I 's and 2s compliment, BCD and Hex Arnthmctic Operation
2.2 Booths Multiplication Algorithm, Restoring and Non-restoring Division

Algorithm.
2.3|EEE-754 Floating point Representation.
3 |Processor Organization and Architecture
Introduction: Half adder, Full adder, MUX, DMUX, Encoder, Decoder(IC
leve).
3.2 Introduction to Flip Flop: SR, JK, D, T(Truth table).
3.3 Register Organization, Instruction Formats, Addressing modes, Instruction
Cycle, Interpretation and scyueneing-E
Control Unit Design
4.1Hardwired Control Unit:State 1Table Method, Delay Element Methods.
4.2 Microprogrammed Control Unit: Micro Instruction-Format, Sequencing and
execution, Micro operations,Examples of microprograms
MemoryOrganization
5.1|ntroduction and characteristics of memory, Types of RAM and ROM, Memory

Hierarchy, 2-level Memory Characteristic,

5.2Cache Memory: Concept, locality of reference, Design problems based on

mapping techniques, Cache coherence and write policies.

Enterleaved and Associative Memory
|Principles of Advanced Processor and Buses
6.1 Basic Pipelined Data path and control, data dependencies, data hazards, branch
hazards, delayed branch, and branch prediction, Performance measures-CPL
eedup, Efficiency, throuipu hal's lav
ahitecture
6.2Flynn's Classification, lntroduction to multicore architecture.
2ses: 1SA. PCL USB. Bus Contention and Arh
 Credits
Course Code Course ame

CSC305 Computer Graphics 3

Prerequisite: Knowledge of CProgramming and Basic Mathematics.

Course
1
Objectives
To equip students with the fundamental knowledge and basic technical competence in the
field of Computer Giruphics.
2To emphasize on implementation aspect of Computer Graphics Algorithms._
3 To prepare the student for advance areas and professional avenues in the field of Computer
Graphics
CourseOutcomes: At the end of the course, thestudents should beable to
Descnbe the basiC Concepts t Computer Gmphics.
2Demonstrate vanious algorithms for basiC graphics primitives.
SAPply Z-D geometnc transtormations on graphiCal objects.
4Use various Cupping algonthms on graphical objects
5 | Explore 3-D geometric transtormations, curve representation techniques and projections
methods
6 Explain visible surface detection techniques and Animation.

Module Detailed Content Hours

1 Introductionand Overview of Graphies System:
.Definition and Representative uses of computer graphics, Overview of
system, Deiition o scan conversion, Tastenzation ana
cOordinate
etdetin
1.2 Kaster scan & random scan displays, Architecture of raster graphics

system with display processor, Architecture of random scan systems.

Output P'rimitives:
2.1 Scan conversions of point. line, circle and ellipse: DDA algorithm and
Bresenham algorithm for line drawing, midpoint algorithm for circle,
for drawing (Mathematical derivation for
midpoint algorithm ellipse
above algorithms isexpected)
2.2| Aliasing. Antialiasing techniques like Pre and post filtering, super

Sampling, and pixel phasing).

23 Filled Area Primitive: Scan line Polygon Fill algorithm, inside outside
tests,Boundary Filland Flood fill algorithm.
3 Two Dimensional Geometrie Transformations
3.1| Basic transtormations: Translation, Scaling, Rotation

S.3Composite transtormation
3.4 Other transtormations: Retlection and Shear
w-Dimensional Viewing and Cupping
4.1 Viewing transformation pipeline and Window to Viewport coordinate
transformation
.2 Clipping operations: Point clipping. Line clipping algorithms: Cohen-
Sutherland, Liang: Barnky, Polygon Clipping Algorithms: Sutherland-
Hodgeman, Weiler-Atherton.
ThreeDimensional Geometric Transtormations, Curves and
Fractal eneri
ratio
ation, Rotation,
5.1 3D Transtormations: Translation, Rotation, Scaling
Scaling anand Retlection

2Composite transtormations: Rotation about an arbitrary axis

5.3 Projections-Parallel,Perspective.(Matrix Representation)
5.4| Bezier Curve, B-Spline Curve, Fractal-Geometry: Fractal Dimension,
Koch Curve.
Visible Surface Detectionand Animation
6.1 Visible Surface Detection: Classification of Visible Surface Detection
algorithm, Back Surface detection method, Depth Butfer method, Area
iieionsmethOd
Subdivision
6.2| Animation: Introduction to Animation, Traditional Animation
Techniques, Frincipies ot Animaton, Ney Traming Character and
Facial Animation., Deformation. Motion capture
Lab Code Lab Name Credit
CSL30 Data Structures Lab

Prerequisite: CProgramming Language.

Lab Objectives:
To implement basic data structures such as arrays, linked lists, stacks and queues
2Solve problem involving graphs, and trees
3 To develop application using data structure algorithms
4 Compute the complexity of Vanous algonthms.
Lab Outcomes:
Students will be able to implement linear data structures & be able to handle operations like

2
insertion, deletion, searchingand traversing on them.
Students will be able to implement nonlinear data structures & be able to handle operations

ike insertion,deletion, searchingand traversing on them

Students will be able to choose appropriate data structureand apply it in various problems
4 Students will be able to select appropriate searching techniques for given problems

SuggestedExperiments: Studentsare required to complete at least 10 experiments.

Star ) marked experiments are compuisOsy.
Sr. No.Name of the Experiment
1 Implement Stack ADT using artay
Convert an Intix expression to Postfix expression using stack ADI.
Evaluate Postfix Expression using Stack ADT.
PPcaOnS OT Stack ADI.
mpiement LAnear Queuc ADI Uusing array.
mplement Circular Queue ADI using array.
Implement Priority Queue ADT using array.
mpiement Singly Linked List ADT
Implement Circular Linked List ADT._
Implement Doubly Linked List ADT._
mplenment Stack/Linear Queue ADT using Linked List.
pucnictt Dinay Dcarch 1ree ADI using Linked List.
Implement Giraph Traversal techniques:) Depth First Search b) Breadth First Search_
Applications of Binary Search Technique.

Useful Links:_
wwW IEetcooe.cOm
2 www.hackerrank.com
3www.Cs.usfca.edu-galles/visualization/Algorithms.htm
4 www.codechet.com
Term Work:

EPoulal nnust ncude a Icst E aSSgnicns.

3 The final certification and acceptance of term work ensures that satisfactory performance of
aboratory work and minimum passing marks in term work
4 Total 25 Marks (Experiments: 15-marks, Attendance Theory & Practical: 05-marks,

Asignments: 05-marks)_
Oral&Practical exam
Based on the entire syllabus of CSL301and CSC303
 Lab Code LabNName
| Credit
CSL3022 Digital Logic & Computer Organization and Architecture Lab 1

P'rerequisite: C Programming Language.

Lab Objectives:
TTo implement operations of the arthmetic unit using algornthms.
Design and simulate ditferent dagital Circuits.
3Todesign memory subsystem including cache memory.
4|Todemonstrate CPU and ALU design.
Lab Outcomes:
o understand the basics otdigital components
2 Design the basIc building blocks ot a computer: ALU, registers, CPU and memory
0recogize ne portace or digitau Systenis tn con pute rctecture
1 0 1mpiemment varfous algontnms tor annmetIc opctauos.

List of Experiments:
Sr. No. Name of the Experiment
Toverify the truth table of various logic gates using ICs.
To realize the gates using universal gates
Code conversion.
ize half adder
adkler and
and full
full adder.
To realize half adder
paeent toC Operaton using MUX IC
O plecnt loc o petation decoder 1C.
Studyof tlip tlop IC
Toimpiement ripple Carry adder.
O mpiement carry look ahead adder.
Toimplement Booth'salgorithm.
To implement restoring division algorithm.
To implement non restoring division algorithm.
1o implement AL0 design.
on
Toinmplement PU design
To implement memorydesign.
O pienent tnemosy design.
| 10 mpicnent cacne netnOy diesig

Note:
1Any Four experimentsfrom Exp. No.1to Exp. No. 7 using hardware
2 Any Six experiments from Exp. No. 8 to Exp. No. 16 using Virtual Lab, expect Exp. No
10,11 and 12
3 Exp. No. 10 to Exp. No. 12 using Programming languaa ge
Digital Material:
Manual to use Virtual Lab.simulator for Computer Organization and Architecture developed by the
Department of esE IT Kharagpur
2|Lunk httpcse10-itkQD, VITUa-iabs5.ac.in
Term Work:
Term work should consist of 10experiments.
2 Journal must include at least 2 assignments on content of theory and practical of "Digital
Logic &Computer Organization and Architecture
3 The final certification and acceptance of term work ensures that satisfactory performance of
Llaboratory work and minimum passing marks in term work

4 Total 25 Marks (Experiments: 15-marks, Attendance Theory& Practical: 05-marks,

Assignments: arks)
 Course Code Lab
Name Credits
LCSL303 Computer Graphics Lab
Prerequisite: CProgranmming Language
Lab Objectives:
Understand the need of developing graphiCs application
2Learn algorithmic development of graphics primitives like line, circle, polygon etc.
3Learn the representation and transformation of graphical imagesand pictures
LabOuteomes: At the end of the course, the students should be able to
1Implement various output and filled area primitive algorithms
2Apply transformation, projection and clipping algorithms on graphical objects.
eOt curvc and tactl genetratiOn nethos.
4Develop a Graphical application Animation based on learned concept

Content:
Scan conversions: lines, circles, ellipses. Filling algorithms, clipping algorithms. 2D and 3D
transformation Curves Visible surface determination. Simple animations Application of these
through exercises in CC
List of Suggested Experiments:
Sr.No.Name of the Experiment
ImplementDDA Line Drawing algornthm (dotted'dashed/thick )
Implement Bresenham's Line algorithm(dotted'dashed thick)_
Implement midpoint Circle algorithm.
Implement midpoint Elipse algorithm.
Implement Area Filling Algorithm: Boundary Fil,Flood Fill.
Implement Scanline Polygon Filling algorithm.
ImplementCurve: Bezierfor ncontrol points, BSpline (UniformXat leastone)
Implement Fractal generation method (anyone)
Character Generation: Bit Map method and Stroke Method
Implement 2D Transformations: Translation, Scaling. Rotation, Reflection, Shear.
ImplementLine Clipping Algorithm: Cohen Sutheriand7 LIang Barsky._
lmpiement polygon clipping algorithm (at least one)
PTOgram to pertom 3D transtomation.
Pertorm projection of a 3D object on Projection Plane: Parallel and PerspectiveC
Perform Animation (Such as Rising Sun, Moving Vehicle,Smileys, Screen saver ctc.) ]
Term Work:
Term work should consist of 10 experiments.
2Journal must include at least 2 assignments
3 Mini Project to perform using C/C++Java OpenGiL/Blender/ any other tool (25 students per
upOssiDie decas: Animation using multiple objects, Game development, Graphics
cditor: Like Paint brush, Text edntOE CtC
4 The tinal certification and acceptance of term work ensures that satistactory pertormance ot

laboratory work and minimum passing marks in term work.

|5 Total 25 Marks (Experiments: 10-marks, Attendance Theory& Practical: 05-marks,
Assignments: 05-marks, Mini Project: 5-marks)
Oral &Practical examn
Based on the above contentsand entire syllabus of CSC305

Lab Code Lab Name Credits

CSL304 Skill based Lab C'ourse: Object Oriented Programming with Java 2

Prerequisite: Structured Programming Approach

Lab Objectives:
LTo leam the basic concepts of object-oriented programming
21o study JA VA programming language
3 To study various concepts of JAVA programming like multithreading. exception Handling.
HAgCS, ctc.
4|To explain components of GUT based programming
Lab Outcomes: At the end of the course, the studentsshould be able to
Toapply fundamental programming constructs.
2 To illustrate the concept of packages, classes and objects._
B1ocaborate the econcept
concent
OTofStings, araysco4Fm
inboritonco
and vectots.
4 To implement the conccpl ot a a
Oral &Practical examn
LBased on the above contents and entire syllabus of CSC305

Lab Name
Lab Code Credits
CSL304| Skill based Lab Course: Object Oriented Programming with Java 2

Prerequisite: Structured Programming Approach

Lab Objectives:
O ICam the DaESIC COncepts or oDjectorienicu programming_
21ostudy JAVA programming languag
3 To study various concepts of JAVA programming like multithreading, exception Handling.
Pckges, etc.
4|To explain components of GUT based programming
Lab Outcomes: At the end of the course, the students should be able to
Toapply fundamental programming constructs.
2 To illustrate the concept of packages, classes and objects.

To implement the concept of exception handling and multithreading,

6| To develop GUT based application.
Module Detailed Content Hours
1 ntroduction to Object Oriented Programming
1.1 O0P concepts: Objects, class, Encapsulation, Abstraction, Inheritance,
Ppols
O pstn, essagC passing.
1.2 Java Virtual Machine
1.3 Bastc programming constructs: variabies, data types, operators,

unsigned right shift operator, eNpressions, branchingand looping

2.1
Class, Object, Packages and Inputoutput
Class, object, data members, member functions
Constructors, types, static members and functions
Method overloading
Packages in java, types, user defined packages
Input and output functions in Java,
Bufferedreader class,scanner class
Array, String and Vector
1|Array, Strings, String Buffer
Inheritance
Types of inheritance, Method overriding. super, abstract class and
abstract method, final, Multiple inheritance using interface, extends
keyword
Exception handling and Multithreading
Exception handling using try, catch, finally, throw and throws, Multiple
try and catch blocks, user defined exception
Thread lifecycle, thread class methods, creating threads using extends
and implements keyword.
GUT programming in JAVA
Applet and applet life cycle, creating applets, graphics class functions,
parameter passing to appiet, Font and color class.
Event handling using event class
AWT: working with windows, using AWT controls for GUI design
| Swingclassin JAVA

ntroduction to JDBC.JDBC-ODBC connectivity, JDBC architecture.

TextbookS:
Herbert Schildt, "JAVA:The Complete Reference, Ninth Edition. OraclePress
2 E. Balagurusamy,"Programming with Java', MeGraw Hill Education.
References:
1Ivor Horton, "Beginning JAVA", Wiley India
2 Dietaland Dietal, "Java:How to Program",8"Edition, PHI.
3 "JAVA
Programming,Black Book, Dreamtech Press.
4TLearn to Master Java programming",Staredu solutions
Digital material:
Lwww.nptelvideas.In
WANSNenOOS.com
3 www.tutorialspoint.com
4htps/starcertification org Certifications Cetificate/securejava
SuggestedList of Programming Assignmentslaboratory Work:
Sr. No. Name of the Experiment
Programs on Basic programming constructs like branching and looping