Professional Documents
Culture Documents
4.42 S.Y. BSc. Comp Science
4.42 S.Y. BSc. Comp Science
10/02/2012
ItemNo.4.42
UniversityofMumbai
UNIVERSITY OF MUMBAI
S.Y.B.Sc.ComputerScienceSyllabus
Credit,GradeandSemesterSystem
Syllabus for
S.Y.B.Sc.
Program: S.Y.B.Sc.
Course: Computer
Science
Tobeintroducedfromthe
20122013.
S.Y.B.Sc.ComputerScienceSyllabus
RestructuredforCreditBasedSemesterandGradingSystem
TobeimplementedfromtheAcademicyear20122013
SemesterI
COURSE
CODE
USCS101
USCS102
USCS103
USCSPG1
LECTURES
/WEEK
DiscreteMathematics
3
C++Programming
3
DataBaseManagementSystemsI 3
PracticalI
9
COURSE/PAPER
CREDITS
2
2
2
3
PracticalI:3lectureperiodspercourseperweekperbatch.Allthreelectureperiodsofthepractical
shallbeconductedinsuccessiontogetheronasingleday.
SEMESTERI
CourseCode
USCS101
UnitI
Title
THEORY
DISCRETEMATHEMATICS
UNITI:Relations:
Credits
2Credits(45lectures)
15lectures
UnitII
GraphsandTrees:
15lectures
UnitIII
15lectures
CountingPrinciples,LanguagesandFiniteStateMachine:
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
UnitI
C++Programming
ConceptofOOPandintroductiontoC++
UnitII
(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.
Manipulators,
Operator
Overloading,
Inheritance, 15lectures
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.
2Credits(45lectures)
15lectures
UnitIII
Library
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
UnitI
DatabaseManagementSystemsI
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,andBCNFnormalforms
2Credits(45lectures)
15Lectures
basedonprimarykeys,losslessjoindecomposition.
UnitII
QueryLanguages
15Lectures
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
Units
ItoIIIP
PRACTICAL
(I)PracticalListforDiscreteMathematics
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
Examplesofpartialorderingsets,Hassediagram.
ExamplesonLattices.
Formulateandsolverecurrencerelation.
Develop Warshalls and Shortest Path algorithm and
implementusingC.
ImplementoperationsongraphinC.
DevelopBreadthandDepthFirstsearchalgorithmsand
implementusingC.
Createalinklist,insertingitemsintoalinklist,deleting
anitemfromalinklist
Implement in C for searching and inserting in binary
searchtreesanddeletinginabinarysearchtree.
Examplesbasedondifferentcountingprinciples.
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:
3Credits
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
LECTURES
COURSE/PAPER
CREDITS
CODE
/WEEK
USCS201 ComputerGraphics
3
2
USCS202 JavaProgramming
3
2
USCS203 DataBaseManagementSystemsI 3
2
USCSPG2 PracticalII
9
3
PracticalII:3lectureperiodspercourseperweekperbatch.Allthreelectureperiodsofthepractical
shallbeconductedinsuccessiontogetheronasingleday.
USCS201
UNITI
ComputerGraphics
IntroductiontoComputerGraphics
2Credits(45lectures)
15lectures
ElementsofgraphicsDisplays.
(b) ScanConversionoflines:DigitalDifferentialAnalyzer(DDA)
algorithm,BresenhamsLinedrawingalgorithm
(c) ScanConversionofacircle:BresenhamsmethodofCircle
drawing, Midpoint Circle Algorithm, Midpoint Ellipse
Algorithm.
(d) IntroductiontoComputerGraphicslibrariesinC.
UnitII
DesignandVisualization
15lectures
(a) ViewingandClipping
IntroductiontoViewingandClipping,WindowtoViewport
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
IntroductiontoModelingofobjectprimitives,SpaceCurve
representation Cubic Splines, Bezier curves, Properties of
Beziercurves,BSplinecurves,comparisonofBeziercurves
andBSplinecurves
SurfaceGenerationandObjectDesign:Wireframemodel,
Surface of Revolution, Sweep surface design, Quadric
Curvedsurfaces.
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
AnimationandVirtualreality:IntroductiontoComputer
AnimationandMultimediasystems: Components of
Animation system, Keyframing, Kinematics and Inverse
Kinematics,IntroductiontoMorphing
15lectures
IntroductiontoVirtualRealityandSpecialEffects
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
UnitI
JavaProgramming
IntroductiontoJavaProgramming
2Credits(45Lectures)
15lectures
Inheritance,InterfaceandPackages
15lectures
extending
interfaces,
JavaAppletsandGraphicsProgramming
15lectures
Applets:Differenceofappletandapplication,creatingapplets,
appletlifecycle,passingparameterstoapplets.
MainReferences:
(1) Java2:TheCompleteReferenceTataMcGrawHill,Fifthedition
(2) ProgrammingwithJavaAprimer,byE.Balagurusamy3rdEdition
AdditionalReferences:
(1) ProgramminginJava,SchaumSeries.
(2) Java2ProgrammingBlackBook,DreamtechPress.
USCS203
UnitI
SoftwareEngineering
2Credits(45Lectures)
IntroductiontoSoftwareEngineering
15lectures
Whatissoftware?Typesofsoftware,SoftwareQualityfactors,
What is software engineering? Introduction to Soft Eng & its
objectives, The general systems approach to problem solving.
ThethreeapproachestosoftwaresystemsdevelopmentThe
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
UnitII
SystemAnalysis
15lectures
UnitIII
SystemDesign&Coding
15lectures
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.
References:
1.
2.
3.
4.
SoftwareEngineeringAPractitionersApproach6thEdition,RogerPressman,McGrawHill.
IntegratedApproachtoSoftwareEngineering(3rdEdition)PankajJalote(Narosa)
SystemAnalysis&DesigninaChangingWorld,Satzinger,Jackson,BurdThompsonLearning
InstantUML,PierreAlainMuller,Wrox.
AdditionalReferences:
1. UMLUsersGuideByGradyBooch,IvarJacobson,JamesRambaugh
2. OOModeling&DesignwithUML,IIndEdition,Blaha,Rambaugh,Pearson
USCSPG2
UnitIP,
UnitIIP
and
UnitIIIP
PRACTICAL
(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.Writeaprogramtodemonstratethefollowingprimitive2D
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.(Useshiftoforiginandbringoriginofcoordinateat
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,etcshowingrisingsunand
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
3Credits
45periods
loop.
3. Writea Java program thatillustratesthe concepts ofone,
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,Typeofsystem(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
6.
7.
8.
9.
10.
DrawingUseCaseDiagram
DrawingClass,ObjectDiagrams,
DrawingSequence&CollaborationDiagrams,
DrawingStateTransition,Statechartdiagrams,
DrawingActivity,Component,PackageDiagrams
SchemeofExamination
Theperformanceofthelearnersshallbeevaluatedintotwoparts.Thelearnersperformanceshall
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) Allquestionsshallbecompulsorywithinternalchoicewithinthequestions.(Eachquestion
willbeof20to23markswithoptions.)
3) Questionmaybesubdividedintosubquestionsa,b,candtheallocationofmarksdepend
ontheweightageofthetopic.
*******************************