Professional Documents
Culture Documents
S.Y. BSc. Comp Science
S.Y. BSc. Comp Science
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
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
UnitII
15lectures
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.
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.
MainReferences:
(1) Java2:TheCompleteReferenceTataMcGrawHill,Fifthedition
(2) ProgrammingwithJavaAprimer,byE.Balagurusamy3
rd
Edition
AdditionalReferences:
(1) ProgramminginJava,SchaumSeries.
(2) Java2ProgrammingBlackBook,DreamtechPress.
15lectures
UnitII SystemAnalysis
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
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