AC.

10/02/2012
ItemNo.4.42

UniversityofMumbai

S.Y.B.Sc.ComputerScienceSyllabus
Credit,GradeandSemesterSystem

Tobeintroducedfromthe
AcademicYear
20122013.

UNIVERSITY OF MUMBAI



Syllabus for S.Y.B.Sc.
Program: S.Y.B.Sc.
Course: Computer Science

(Credit Based Semester and Grading System with
effect from the academic year 20122013)

S.Y.B.Sc.ComputerScienceSyllabus
RestructuredforCreditBasedSemesterandGradingSystem
TobeimplementedfromtheAcademicyear20122013
SemesterI
COURSE
CODE
COURSE/PAPER
LECTURES
/WEEK
CREDITS
USCS101
USCS102
USCS103
USCSPG1
DiscreteMathematics
C++Programming
DataBaseManagementSystemsI
PracticalI
3
3
3
9
2
2
2
3

PracticalI:3lectureperiodspercourseperweekperbatch.Allthreelectureperiodsofthepractical
shallbeconductedinsuccessiontogetheronasingleday.
SEMESTERI

CourseCode Title Credits

THEORY
USCS101 DISCRETEMATHEMATICS 2Credits(45lectures)
UnitI UNITI:Relations:
Relations: Definition and examples. Properties of relations,
Partial Ordering sets, Linear ordering Hasse Daigrams ,
MaximumandMinimumelements,Lattices
Recurrence Relation: Definition of recurrence relations,
Formulating recurrence relations, Solving recurrence relations
Back tracking method, Linear homogeneous recurrence
relations with constant coefficients. Solving linear
homogeneous recurrence relations with constant coefficients
of degree two when characteristic equation has distinct roots
and only one root, Particular solutions of non linear
homogeneous recurrence relation, Solution of recurrence
relation by the method of generation functions, Applications
Formulate and solve recurrence relation for Fibonacci
numbers, Tower of Hanoi, Intersection of lines in a plane,
SortingAlgorithms.
15lectures

UnitII GraphsandTrees:
(a) Graphs : Definition and elementary results, Adjacency
matrix, path matrix, Representing relations using
diagraphs[R6.3] Warshalls algorithm shortest path ,
Linkedrepresentationofagraph,Operationsongraphwith
algorithms searching in a graph; Insertion in a graph,
Deleting from a graph, Traversing a graph BreadthFirst
searchandDepthFirstsearch.
(b) Trees: Definition and elementary results. Ordered rooted
tree, Binary trees, Complete and extended binary trees,
representing binary trees in memory, traversing binary
trees, binary search tree, Algorithms for searching and
insertinginbinarysearchtrees,Algorithmsfordeletingina
binarysearchtree

15lectures

UnitIII CountingPrinciples,LanguagesandFiniteStateMachine:
(a) Permutations and Combinations: Partition and
Distribution of objects, Permutation with distinct and
indistinct objects, Binomial numbers, Combination with
identities: Pascal Identity, Vandermondes Identity, Pascal
triangle, Binomial theorem, Combination with indistinct
objects.
(b) Counting Principles: Sum and Product Rules, Tree diagram
for solving counting problems, Pigeonhole
Principle(without proof); Simple examples, Inclusion
ExclusionPrinciple(Sieveformula)(Withoutproof).
(c) Languages, Grammars and Machines: Languages , regular
Expression and Regular languages, Finite state Automata,
grammars, Finite state machines, Gdel numbers, Turing
machines.

15lectures

References:
1. ElementsofDiscreteMathematics:C.L.Liu,TataMcGrawHillEdition.
2. DiscreteMathematicsanditsapplications:KennethH.Rosen,ThirdEdition,McGrawHillInc.
3. Concrete Mathematics (Foundation for Computer Science): Graham, Knuth, Patashnik Second
Edition,PearsonEducation.
4. DataStructuresSeymourLipschutz,Schaumsoutlines,McGrawHillInc.
5. DiscreteMathematics:SemyourLipschutz,MarcLipson,Schaumsoutlines,McGrawHillInc.

AdditionalReferences:
1. NormanL.Biggs:DiscreteMathematics,RevisedEdition,ClarendonPressOxford1989.
2. K.D.Joshi:FoundationsinDiscreteMathematics,NewAgePublication,NewDelhi.
3. EdwardR.Scheinerman,Mathematics,Thompsonlearning

USCS102 C++Programming 2Credits(45lectures)

UnitI ConceptofOOPandintroductiontoC++
(a) ConceptofOOP:ProcedureOrientedProgramming,Object
Oriented Programming (OOP), Basic Concept of OOP,
BenefitsofOOP.
(b) Data Types : Basic data types, User defined data types,
Deriveddatatypes.
(c) Variables: Declaration of variables, Dynamic Initialization
ofvariables,Referencevariables.Comments.
(d) Introduction to C++ : Parts of C++ program, cout and cin
objects, #include Directive, Variables and Constants,
Comments.
(e) Operators: Arithmetic, Relational & Logical Operators,
Type cast Operator, Scope resolution operator, Memory
ManagementOperators.
(f) Control Structures: Loops: for, dowhile, while. Decision:
ifelse,switchcase.
(g) Functions: main function, Function Prototyping, Call by
reference, Return by reference, Inline functions, Default
arguments,constarguments,Functionoverloading.
(h) Classes & Objects : Defining a class, Defining member
Functions, making an Outside function Inline, Nesting of
Member Functions, Access Specifiers, Memory Allocation
for Objects, Static Data Members, Static Member
Functions, Arrays of Objects, Objects as Function
Arguments,Friendfunctions.
(i) Constructors and Destructors : Constructors,
Parameterized constructors, Multiple constructors in a
class, Constructors with default arguments, Dynamic
initialization of Objects, Copy constructor, Dynamic
Constructors, Constructing Twodimensional Arrays, const
Objects,Destructors.
15lectures

UnitII

Manipulators, Operator Overloading, Inheritance,

Polymorphism:
(a) Manipulators : C++ Streams, C++ Stream Classes,
Unformatted I/O Operations, Formatted Console I/O
Operations,ManagingO/PwithManipulators.
(b) Operator Overloading : Introduction, Defining Operator
Overloading, Overloading Unary and Binary Operators,
Overloading Unary and Binary Operators using Friend
functions,RulesforOverloadingOperators.
(c) Inheritance:Introduction,DefiningDerivedclasses,Single,
Multilevel, Multiple, Hybrid Inheritance, Virtual Base
classes,Abstractclass,Constructorsinderivedclasses.
(d) Polymorphism: Introduction, Pointer to Objects, Pointers
to Derived Classes, Virtual Functions, Pure Virtual
Functions.

15lectures

UnitIII File handling, Templates, Exceptions, Standard Template

Library
(a) File handling : Introduction, Classes for File Stream
Operations, Opening and Closing a File, Detecting End of
File, More about Open(), File pointers and their
Manipulations, Updating a file, Error Handling during File
Operations,Commandlinearguments.
(b) Templates:Introduction,ClassTemplates,ClassTemplates
with multiple parameters, Function Templates, Function
Templates with multiple parameters, Overloading of
Template Functions, Member Function Templates, Non
TypeTemplateArguments.
(c) Exceptions: Introduction, Basics of Exception Handling,
Exception Handling Mechanism, Throwing Mechanism,
CatchingMechanism,RethrowinganException,Specifying
Exceptions.
(d) Standard Template Library: Introduction, Components of
STL, Containers, Algorithms, Iterators, Applications of
Containerclasses.

15lectures

MainReference:
1. ObjectOrientedProgrammingwithC++,2e,E.Balguruswamy,TMH.
2. StartingoutwithC++,3e,T.Gaddis,Dreamtech.
AdditionalReferences:
1. CompleteReferenceC++,H.Schildt,TMH.
2. ObjectOrientedProgrammingwithC++,Y.Kanitkar,BPB.

USCS103 DatabaseManagementSystemsI 2Credits(45lectures)

UnitI RelationalModel
(a) Overview: Overview of database management system,
limitations of data processing environment, database
approach, data independence, three level of abstraction,
DBMSstructure.
(b) Entity Relation Model: Entity, attributes, keys, relations,
cardinality, participation, weak entities, ER diagram,
Generalization, Specialization and aggregation, conceptual
designwithERmodel,entityversusattribute,entityversus
relationship, binary versus ternary relationship, aggregate
versusternaryrelationship.
(c) Relational Structure: Introduction to relational model,
integrityconstraintsoverrelations.
(d) Schema refinement and Normal forms: Functional
dependencies, first, second, third, and BCNF normal forms
15Lectures
basedonprimarykeys,losslessjoindecomposition.

UnitII QueryLanguages
(a) Relational Algebra: select and projection, Set operations
like union, intersection, difference, cross product, Joins
conditional,equijoinandnaturaljoins,division,examples.
OverviewofrelationalCalculus.
(b) Creatingandalteringtables:ConversionofERtorelations
with and without constraints; CREATE statement with
constraints like KEY, CHECK, DEFAULT, ALTER and DROP
statement.
(c) Handling data using SQL: selecting data using SELECT
statement, FROM clause, WHERE clause, HAVING clause,
ORDER BY, GROUP BY,DISTINCT and ALL predicates,
Adding data with INSERT statement, changing data with
UPDATEstatement,removingdatawithDELETEstatement
(d) Functions:AggregatefunctionsAVG,SUM,MIN,MAXand
COUNT,Datefunctions:DATEADD(),DATEDIFF(),
GETDATE(),DATENAME()YEAR,MONTH,WEEK,DAY,String
functionsLOWER(),UPPER(),TRIM(),RTRIM(),
PATINDEX(),REPLICATE(),REVERSE(),RIGHT(),LEFT()
(e) Joiningtables:Inner,outerandcrossjoins,union.
(f) Sub queries: sub queries with IN, EXISTS, sub queries
restrictions, Nested sub queries, correlated sub queries,
queries with modified comparison operations, SELECT
INTO operation, UNION operation. Sub queries in the
HAVINGclause.

15Lectures
UnitIII ImplementingIndexes,Viewsandprocedures
(a) File Organization and Indexing: Cluster, Primary and
secondary indexing, Index data structure: hash and Tree
based indexing, Comparison of file organization: cost
model, Heap files, sorted files, clustered files. Creating,
droppingandmaintainingindexesusingSQL.
(b) Views: Meaning of view, Data independence provided by
views, creating, altering dropping, renaming and
manipulatingviewsusingSQL.
(c) Stored Procedures: Types and benefits of stored
procedures, creating stored procedures using SQL,
executing stored procedures: Automatically executing
stored procedures, altering stored procedures, viewing
storedprocedures.
(d) Triggers:Conceptoftriggers,ImplementingtriggersinSQL:
creatingtriggers,Insert,delete,andupdatetriggers,nested
triggers, viewing, deleting and modifying triggers, and
enforcingdataintegritythroughtriggers.

15Lectures

References:
1. DatabaseManagementSystemsRamakrishnam,Gehrke,McGrawHill.
2. SQL,PL/SQLTheProgramminglanguageofOracleBayross,B.P.B.Publications.
3. ProfessionalSQLserver2000ProgrammingRobVieira,WroxPressLtd,Shroff.
AdditionalReferences:
1. SQLserver2000blackbookPatrickDaltonandPaulWhitehead,DreamtechPress.
2. ElsmasriandNavathe,FundamentalsofDatabaseSystems,PearsonEducation.
3. PeterRobandCoronel,DatabaseSystems,Design,ImplementationandManagement,Thomson
Learning
4. C.J.Date,Longman,IntroductiontodatabaseSystems,PearsonEducation.
5. JeffreyD.Ullman,JenniferWidom,AFirstCourseinDatabaseSystems,PearsonEducation.
6. MartinGruber,UnderstandingSQL,B.P.B.Publications.

USCSPG1

PRACTICAL 3Credits
Units
ItoIIIP
(I)PracticalListforDiscreteMathematics
1. Examplesofpartialorderingsets,Hassediagram.
2. ExamplesonLattices.
3. Formulateandsolverecurrencerelation.
4. Develop Warshalls and Shortest Path algorithm and
implementusingC.
5. ImplementoperationsongraphinC.
6. DevelopBreadthandDepthFirstsearchalgorithmsand
implementusingC.
7. Createalinklist,insertingitemsintoalinklist,deleting
anitemfromalinklist
8. Implement in C for searching and inserting in binary
searchtreesanddeletinginabinarysearchtree.
9. Examplesbasedondifferentcountingprinciples.
10. Examples based on Finite state Automata, and Finite
statemachines.

(II)PracticalListforC++Programming.
1. WriteprogramsthatillustratesthesimpleC++concepts
withoutclasses.
2. WriteC++programstoillustratetheconceptspointers,
functionsandfunctionoverloading.
3. WriteC++programstoillustratetheconcepts:classes,
friendfunctions.
4. WriteC++programstoillustratetheconcepts:
constructors,constructoroverloadinganddestructors.
5. WriteC++programstoillustratetheconcepts:operator
overloading(bothUnaryandBinary).
6. WriteC++programstoillustratetheconcepts:Simple,
Multiple,Multilevelinheritance.
7. WriteC++programstoillustratetheconcepts:
45Lectures
Polymorphism(Virtualfunctions,PureVirtual
functions).
8. WriteprogramstoillustratethefilehandlinginC++.
9. WriteprogramstoillustratethetemplatesinC++.
10. WriteprogramstoillustratetheexceptionsinC++.

(III)PracticalListforDatabaseManagementSystemsI
1. Creatingasingletablewithoutconstraintsandfiring
queries.
2. Queriescontainingaggregate,stringanddatefunctions
firedonasingletable.
3. Creatingsingletablewithconstraintsandexecuting
queries.
4. Updatingtables,alteringtablestructureanddeleting
tableCreatingandalteringasingletableandexecuting
queries.
5. Joiningtablesandprocessingqueries.
6. ForgivenscenariodrawERdiagramandconvert
entitiesandrelationshipstotable.Writerelational
algebraqueriesandconverttoSQLqueriesonthese
tables.
7. Creating,droppingandmaintainingindexes.
8. Createandmanageviewsandprocessquerieson
views.
9. Creatingstoredprocedures,executingprocedures,
deletingprocedures.
10. Creatingwithorwithoutenforcingdataintegrity
throughtriggers,nestedtriggers,viewing,modifying
anddeletingtriggers.

SEMESTERII

COURSE
CODE
COURSE/PAPER
LECTURES
/WEEK
CREDITS
USCS201
USCS202
USCS203
USCSPG2
ComputerGraphics
JavaProgramming
DataBaseManagementSystemsI
PracticalII
3
3
3
9
2
2
2
3

PracticalII:3lectureperiodspercourseperweekperbatch.Allthreelectureperiodsofthepractical
shallbeconductedinsuccessiontogetheronasingleday.
USCS201 ComputerGraphics 2Credits(45lectures)
UNITI IntroductiontoComputerGraphics
(a) Introduction to Computer graphics and its applications,
ElementsofgraphicsDisplays.
(b) ScanConversionoflines:DigitalDifferentialAnalyzer(DDA)
algorithm,BresenhamsLinedrawingalgorithm
(c) ScanConversionof acircle:BresenhamsmethodofCircle
drawing, Midpoint Circle Algorithm, Midpoint Ellipse
Algorithm.
(d) IntroductiontoComputerGraphicslibrariesinC.
15lectures
UnitII

DesignandVisualization
(a) ViewingandClipping
Introduction to Viewing and Clipping, Window to Viewport
mapping
2D Clipping system: Point clipping, InsideOutside Test,
Introduction to Line Clipping MidPoint Subdivision
ClippingAlgorithm,CohenSutherlandClippingalgorithm.
Introduction to Polygon Clipping: SutherlandHodgeman
Algorithm.CharacterClipping

(b) CurvesandObjectdesign
IntroductiontoModeling ofobjectprimitives,SpaceCurve
representation Cubic Splines, Bezier curves, Properties of
Beziercurves,BSplinecurves,comparisonofBeziercurves
andBSplinecurves
SurfaceGenerationandObjectDesign:Wireframemodel,
Surface of Revolution, Sweep surface design, Quadric
Curvedsurfaces.
15lectures

UnitIII AdvancedComputerGraphics
(a) ObjectRendering
VisibleandHiddenSurfaces:Introductiontohiddenlines
andsurfaces,ImageandObjectspacealgorithm,Floating
HorizonAlgorithm,Paintersalgorithm,ZBufferalgorithm
Object Rendering Models: Introduction to object
rendering,IlluminationModel,
Shading Techniques: Gouraund Shading, Phong Shading.
Transparencyeffect, Introduction to shadows,
Texturemapping

(b) AnimationandVirtualReality
Animation and Virtual reality: Introduction to Computer
AnimationandMultimedia systems: Components of
Animation system, Keyframing, Kinematics and Inverse
Kinematics,IntroductiontoMorphing
IntroductiontoVirtualRealityandSpecialEffects
15lectures

References:
1. ProceduralelementsofComputerGraphics,DavidF.Rogers,TataMcGrawHill.
2. ComputerGraphics,DonaldHearn,MP.Baker,PHI.
3. ComputerGraphics:AprogrammingApproach,StevenHarrington,McGrawHill.

AdditionalReferences:
1.ComputerGraphics:AprogrammingApproach,StevenHarrington,McGrawHill.
2.TheoryandProblemsofComputerGraphics,ZhigangXiang,Roy,plastock,Schaumsoutlineseries,
McGrawHill.

USCS202 JavaProgramming 2Credits(45Lectures)

UnitI IntroductiontoJavaProgramming
Introduction: History of Java, Java features, different types of
Javaprograms,DifferentiateJavawithCandC++,JVM,JITand
JRE.
Java Basics: Variables and data types, declaring variables,
literals: numeric, Boolean, character and string literals,
keywords, type conversion and casting. Standard default
values.
15lectures

Java Operators: Arithmetic, relational, logical, assignment,

increment and decrement, conditional, bitwise, precedence
and order of evaluation, statement and expressions, string
arithmetic.
Loops and Controls: Control statements for decision making:
select statements (if statement, if else statement, if else
if statement, switch statement), goto statement, looping
(while loop, do while loop and for loop), nested loops,
breakingoutofloops(breakandcontinuestatements),labeled
loops.
Arrays and Strings: one and two dimensional array, creating
anarray,strings,stringbuffer.
IntroductiontoClasses:Definingaclass,creatinginstanceand
class members: creating object of a class, accessing instance
variables of a class, creating methods, naming methods of a
class,accessingmethodsofaclass,constructor,parameterized
constructor, this keyword, garbage collection, finalize()
method, methods overloading, constructor overloading,
nestedandinnerclasses,staticmember.
Visibility control: public access, friendly access, protected
access,privateaccess,privateprotectedaccess.
UnitII Inheritance,InterfaceandPackages
Inheritance: Various types of inheritance, super and
subclasses, keywords extends, super, constructor chaining,
method overriding, final variables and methods, final classes,
abstractmethodandclasses,dynamicmethoddispatch.
Interface: Defining interfaces, extending interfaces,
implementinginterfaces
Packages: System packages, using system package, naming
conventions, creating packages, accessing a package, using a
package,addingaclasstoapackage
Exception Handling: Exceptionhandling fundamentals,
Exception types, Uncaught exceptions, Using try and catch,
Multiple catch clauses, Nested try statements, use of throw,
throws and finally keywords, Javas Builtin exceptions, User
definedexception,ChainedException.
StreamsandFileI/O:Conceptofstreams,streamclasses,byte
stream classes: InputStream, and OutputStream, character
15lectures

stream classes: Reader and Writer, Difference between byte

streamclasses and character stream classes, other I/O classes,
Fileclass,Reading/writingbytes/characters,randomaccessfile,
serialization.
UnitIII JavaAppletsandGraphicsProgramming
Applets:Differenceofappletandapplication,creatingapplets,
appletlifecycle,passingparameterstoapplets.
Graphics, Fonts and Color: The graphics class, painting,
repainting and updating an applet, sizing graphics. Font class,
draw graphical figures lines and rectangle, circle and ellipse,
drawing arcs, drawing polygons. Working with Colors: Color
methods,settingthepaintmode.
AWT package: Window fundamentals: Component, Container,
Panel, Window, Frame, and Canvas. AWT Controls: labels,
buttons, textfield, textarea, checkboxes, checkboxgroup,
choice, and list. Layout Managers: FlowLayout, BorderLayout,
GridLayout.
EventHandling:TheDelegationEventModel,Eventclasses
(ActionEvent,FocusEvent,InputEvent,ItemEvent,KeyEvent,
MouseEvent,MouseWheelEvent,TextEvent,WindowEvent)
andvariouslistenerinterfaces(ActionListener,FocusListener,
ItemListener,KeyListener,MouseListener,
MouseMotionListener,MouseWheelListener,TextListener,
WindowFocusListener,WindowListener)
15lectures

MainReferences:

(1) Java2:TheCompleteReferenceTataMcGrawHill,Fifthedition
(2) ProgrammingwithJavaAprimer,byE.Balagurusamy3
rd
Edition

AdditionalReferences:
(1) ProgramminginJava,SchaumSeries.
(2) Java2ProgrammingBlackBook,DreamtechPress.

USCS203 SoftwareEngineering 2Credits(45Lectures)

UnitI IntroductiontoSoftwareEngineering
Whatissoftware?Typesofsoftware,SoftwareQualityfactors,
What is software engineering? Introduction to Soft Eng & its
objectives, The general systems approach to problem solving.
The three approaches to software systems development The
Structured approach, the Object Oriented Approach and the
InformationEngineeringApproach.
Software Process: SDLC Requirement Analysis, Software
design,coding,testing,maintenanceetc.
Software Development Life Cycle Models Waterfall Model,
Prototyping Model, RAD Model, Incremental Model, Spiral
Model, Component Based Model, Their features, strengths,
weaknessesanddifferencesbetweenthem,FourthGeneration
Techniques
Project Management Process, Role of metrics & models in
projectmanagement
Project Feasibility Study Operational, Technical, Economic,
Organizational and Cultural feasibility. Defining project costs
andprojectbenefits.Cost/BenefitAnalysisforaproject

15lectures
UnitII SystemAnalysis

Investigating System Requirements Software Requirement

Specification Document, Need of SRS, Characteristics &
Components of SRS, Stakeholders, Identifying requirements
using various techniques (such as Questionnaires, reviewing
reports/forms,interviews,workflowsetc),buildingprototypes,
StructuredWalkthroughs,
ModelingSystemRequirementsConceptualmodeling
Data Modeling Data entities, Attributes, Relationships,
Cardinality,ERD
Process Modeling Developing Data Flow Diagrams, Level of
abstraction, Context diagram, Top level DFD, DFD fragments,
PhysicalandLogicalDFD,DataDictionary,Events,EventTable
Logic Modeling Decision Tables, Decision Trees, Structured
English&Pseudocode
Object Oriented Modeling: Object Model, Elements of Object
Model, Basic Principles of OO Approach, Association,
Generalization,Specialization,Aggregation
UML: Basics of UML, Types of UML Diagrams, Use Case
Diagram, Class Diagram, Object Diagram, Sequence diagram &
Collaborationdiagram,StateTransition&Statechartdiagrams
15lectures

UnitIII SystemDesign&Coding
SystemDesignProblempartitioning,Abstraction,Topdown
&BottomupDesign,FunctionOriented&Objectoriented
Design,ProblemPartitioning,Abstraction&itstype(Data&
Function),Modularity,Coupling,Cohesion,DrawingStructure
Charts&Flowcharts,
UMLActivityDiagram,ComponentDiagram,Package&
DeploymentDiagram
DesigningDatabases:ConvertingERDtoDatabases,
IntroductiontoOODatabases,ObjectRelationalDatabases,
UserInterfaceDesignDesigningSystemInput,output,User
Interface,Characteristicsofgoodinterfaces
CodingTopdownVSBottomupstrategies,structured
programming&objectorientedprogramming,Information
hiding,programmingstyles,Internaldocumentation
Verification&Validation:WhatisV&V,TypesofV&Vactivities
suchasinspection,review,walkthrough,V&Vwithrespectto
requirements,systemanalysis,systemdesign&coding.
15lectures

References:
1. SoftwareEngineeringAPractitionersApproach6thEdition,RogerPressman,McGrawHill.
2. IntegratedApproachtoSoftwareEngineering(3rdEdition)PankajJalote(Narosa)
3. SystemAnalysis&DesigninaChangingWorld,Satzinger,Jackson,BurdThompsonLearning
4. InstantUML,PierreAlainMuller,Wrox.
AdditionalReferences:
1. UMLUsersGuideByGradyBooch,IvarJacobson,JamesRambaugh
2. OOModeling&DesignwithUML,IIndEdition,Blaha,Rambaugh,Pearson

USCSPG2 PRACTICAL 3Credits

UnitIP,
UnitIIP
and
UnitIIIP
(I)PracticalListforComputerGraphics
1. Study and use of graphics library for drawing primitive
images.
2. Write a program to a line using following algorithms:
(i)DigitalDifferentialAnalyzer(DDA),(ii)BresenhamsLine
drawingmethod
3. Write a program to draw circle using the following
algorithms (I) Bresenhams circle drawing method, (ii)
Midpointcircledrawingalgorithm
4. Write a program to demonstrate the following primitive 2D
transformationsonaunitsquareoratriangle:(i)scalingin
X or Y or Both directions, (ii) translation in X or Y or Both
directions, (iii) shear transformation, (iv) reflection about
anaxis,(v)rotationtransformation
5. Write a program to rotate a line about an arbitrary point
(x,y).[Useshiftoforigin]
6.Writeaprogramtodrawanorigincentered3Dcubeonthe
screen. (Use shift of origin and bring origin of coordinate at
thecenterofthescreen)
7. Implement line clipping algorithm using (i) MidPoint
Subdivision Clipping Algorithm, (ii) CohenSutherland
Clippingalgorithm,
8. WriteaprogramtogenerateaBeziercurvefortheNinput
controlpoints.(taken=4,5and6).
9. Generatecylinderassurfaceofrevolutionbyrotatingaline
aroundanaxis.(usedelayforbettervisualization)
10. Writeaprogram
(a)Toimplementbouncingballproblemusingtwoballs.(b)
Togenerateananimatingclock.
(c)Todrawanimatedsceneryusingprimitivestructureslike
points, lines, curves,circles, etc showing rising sunand
a wind mill. Other objects in the scene include trees,
house,roadsetc.

(II)PracticalListforJavaProgramming
1. WriteaJavaprogramtocreateaJavaclass:
(a)withoutinstancevariablesandmethods,
(b)withinstancevariablesandwithoutmethods,
(c)withoutinstancevariablesandwithmethods.
(d)withinstancevariablesandmethods.
2. Write a Java program that illustrates the concepts of
selectionstatement,looping,nestedloops,breakingoutof
45periods

loop.
3. Write a Java program that illustrates the concepts of one,
twodimensionarraysandstrings.
4. Write a Java program that illustrates the concepts of Java
classthatincludes
(a)constructorwithandwithoutparameters.
(b)Overloadingmethods.
(c)Overridingmethods
5. Write a Java program to demonstrate inheritance by
creatingsuitableclasses.
6. Create a Java package, interface and implement in Java
program.
7. Write a program that illustrates the error handling using
exceptionhandling.
8. Write a program that illustrates the concepts of stream
classes.
9. Write a Java applet to demonstrate graphics, Font and
Colorclasses.
10. Write a Java program to illustrate AWT package, Event
classesandlisteners.

(III)PracticalListforSoftwareEngineering
Following Case Studies are recommended: (To be solved in
groupofmaxof3to4students)
DevelopingthesystemforthefollowingwithSSADandOOAD
approach:
a. LibrarySystem,
b. ReservationSystem,
c. InventorySystem,
d. HospitalmanagementSystem
e. Anyothersystem
Note:Multiplesessionsmayberequiredforcompletinga
practical
1. Problem Definition Identifying & Understanding the
system,itsfunctions,desiredinputs,outputsetc.
2. Conducting Feasibility Study Deciding S/W, H/W
requirements, Typeof system (SingleUser/Multiuseretc),
Limitations of current system, Benefits of the proposed
systemetc.
3. Requirement Analysis, Interviews, Questionnaire, Creating
SRS
4. DrawingERD&convertingtotables
5. DrawingContextDiagram,DFDsforunderstandingprocess
flow

SchemeofExamination
The performance ofthe learners shall be evaluated into two parts.The learners performanceshall
beassessedbyInternalAssessmentwith40%marksinthefirstpartbyconductingtheSemesterEnd
Examinations with 60% marks in the second part. The allocation of marks for the Internal
AssessmentandSemesterEndExaminationsareasshownbelow:
[A]Internalassessment(i)Theory40%

[A]Internalassessment(ii)Practical40%

Eachpracticalexaminationcanbeconductedoutof50marks,20internaland30external.
Minimum 75 % practical from each paper are required to be completed and written in the
journal.
[B]ExternalTheoryexamination60%
(a)DurationTheseexaminationsshallbeof2Hoursdurationforeachpaper.
(b)TheoryQuestionPaperPattern(ForPaperI,IIandIII):
1) There shall be four questions each of 15 marks. On each unit there will be one
questionandthefourthonewillbebasedonentiresyllabus.
2) All questions shall be compulsory with internal choice within the questions. (Each question
willbeof20to23markswithoptions.)
3) Questionmaybesubdividedintosubquestionsa,b,candtheallocationofmarksdepend
ontheweightageofthetopic.
*******************************
6. DrawingUseCaseDiagram
7. DrawingClass,ObjectDiagrams,
8. DrawingSequence&CollaborationDiagrams,
9. DrawingStateTransition,Statechartdiagrams,
10. DrawingActivity,Component,PackageDiagrams