b.tech computer science engineering - syllabus of b

7/24/2019 B.tech Computer Science Engineering - Syllabus of B

1/18

w.e.f.2010-2011academicyear

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY: KAKINADAKAKINADA-533003, Andhra Pradesh (India)

COMPUTERSCIENCEANDENGINEERING

IYEAR ISEMISTER

S.No.

Subject

T

P

Credits

1 EnglishI 3 - 2

2

Mathematics- I 3 - 2

3 Engineering PhysicsI 3 - 2

4 Engineering ChemistryI 3 - 2

5

CProgramming 3 - 2

6 MathematicalMethods 3 - 2

7 Engineering Physics&EngineeringChemistryLaboratory-I - 3 2

8 EngineeringWorkshop (Carpentry,Fitting,Housewiring,) - 3 2

9

CProgrammingLab

-

3

2

10 EnglishProficiencyLab - 3 2

Total

20

IYEAR IISEMISTER

S.No. Subject T P Credits

1

EnglishII

3

-

2

2 MathematicsII 3 - 2

3

EngineeringPhysicsII

3

-

2

4

EngineeringChemistry-II 3 - 2

5

EngineeringDrawing

3

-

2

6

Environmental Studies

3

-

2

7

Engineering Physics&EngineeringChemistryLaboratory-II

-

3

2

8

English-CommunicationSkillsLab - 3 2

9

ITWorkshop

-

3

2

Total 18

www.jntu3u.in


2/18




IIYEAR ISEMISTER


1

ManagerialEconomicsandFinancialAnalysis

4

-

4

2

Probability&Statistics

4

-

4

3MathematicalFoundationsofComputer ScienceandEngineering

4

-

4

4 DigitalLogicDesign 4 - 4

5 ElectronicDevicesAndCircuits 4 - 4

6

DataStructures

4

-

4

7

ElectronicDevicesandCircuitsLab

-

3

2

8

DataStructuresLab - 3 2

9 ProfessionalCommunicationalskills - 2

10

ProfessionalEthicsandMorals-I

2

-

-

Total 29

IIYEAR IISEMISTER


1 SoftwareEngineering 4 - 4

2PrinciplesofProgrammingLanguages

4

-

4

3ObjectOrientedProgramming

throughJava

4

-

4

4

ComputerOrganization 4 - 4

5

DataBaseManagementSystems

4

-

4

6

FormalLanguagesandAutomataTheory

4 - 4

7

ObjectOrientedProgrammingLab - 3 2

8

DataBaseManagementSystemsLab

-

3

2

9

ProfessionalCommunicational skills

-

2

1

10 ProfessionalEthicsandMorals-I 2 - -

Total

29

www.jntu3u.in


3/18

www.jntu3u.in


4/18




IIIYEAR ISEMISTER


1

CompilerDesign

4

-

4

2

ComputerNetworks

4

-

4

3

MicroProcessorsandMulticoreSystems

4

-

4

4

OperatingSystems 4 - 4

5

ComputerGraphics

4

-

4

6

AdvancedDataStructures 4 - 4

7

OperatingSystem&CompilerDesignLab

-

3

2

8

AdvancedDataStructures Lab

-

3

2

9

IPRandPatents-1

2

-

-

Total 28

IIIYEAR IISEMISTER


1 AdvancedComputerNetworks 4 - 4

2 ComputerArchitecture 4 - 4

3 DesignandAnalysisofAlgorithms 4 - 4

4 UNIXProgramming 4 - 4

5

ManagementScience 4 - 4

6

AdvancedJavaandWebTechnologies 4 - 4

7 ComputerNetworksandUnix Lab - 3 2

8 AdvancedJavaandWebTechnologiesLab - 3 2

9

IPRandPatents-2 2 - -

Total

28

www.jntu3u.in


5/18




IVYEAR ISEMISTER


1

CryptographyandNetworkSecurity

4

-

4

2

UML&DesignPatterns

4

-

4

3

DataWareHousingandDataMining

4

-

4

4

MobileComputing 4 - 4

5

OpenElectivei.MATLABii.WebServicesiii.OpenSourceSoftware

iv.CyberLaws

4 - 4

6

ElectiveI:i.ComputerForensicsii.CloudComputingiii.SoftwareProjectManagementiv.MachineLearningv.DistributedDatabases

4

-

4

7

UML&DesignPatternsLab

-

3

2

8

MobileApplicationDevelopmentLab

-

3

2

Total

28

IVYEAR IISEMISTER


1

ElectiveII

i)HumanComputerInteractionii)AdvancedOperatingSystemsiii)MobileAdhoc&SensorNetworksiv)PatternRecognitionv)DigitalImageProcessing

4 - 4

2

ElectiveIIIi)EmbeddedandRealTimeSystemsii)SimulationModelingiii)Information RetrievalSystemsiv)ArtificialIntelligencev)Multimedia&ApplicationDevelopment

4

-

4

www.jntu3u.in


6/18

3

ElectiveIV

i)SoftwareTestingMethodologies ii)NeuralNetworks&SoftComputingiii)SocialNetworksandtheSemanticWebiv)ParallelComputingv)E-Commerce

4

-

4

4

DistributedSystems

4

-

4

5

Project

12

Total

28

www.jntu3u.in


7/18

JAWAHARLALNEHRUTECHNOLOGICALUNIVERSITYKAKINADA

IIIYearB.Tech.ComputerScienceandEngineeringISem.

COMPILERDESIGN

Unit I : Overview of language processing preprocessors compiler assemblerinterpreterslinkers&loaders-structureofacompilerphasesofacompiler.

UnitII:LexicalAnalysisRoleofLexicalAnalysisLexicalAnalysisVs.ParsingToken,patterns and Lexemes Lexical Errors Regular Expressions Regular definitions for thelanguageconstructsStrings,Sequences,CommentsTransitiondiagram for recognitionoftokens,Reservedwordsandidentifiers,Examples.

Unit III : Syntax Analysis Role of a parser classification of parsing techniques Topdownparsing Firstand Follow-LL(1) Grammars,Non-Recursive predictiveparsing Errorrecoveryinpredictiveparsing.

UnitIV:Introduction tosimpleLRWhyLRParsersModelofanLRParsersOperatorPrecedence-ShiftReduceParsingDifferencebetween LRandLLParsers,Constructionof

SLRTables.

UnitV:MorepowerfulLRparses,constructionofCLR (1),LALRParsing tables,DanglingELSEAmbiguity,ErrorrecoveryinLRParsing.

UnitVI:Semanticanalysis,SDT,evaluationofsemanticrules,symboltables,useofsymboltables.RuntimeEnvironment:storageorganization, stackallocation,accesstonon-localdata,heapmanagement,parameterpassingmechanisms.

UnitVII: Intermediatecode , threeaddresscode,quadraples, triples,abstractsyntax trees,basic blocks, CFG. Machine independent code optimization - Common sub expressionelimination,constantfolding,copypropagation, deadcodeelimination,strengthreduction,loopoptimization,procedureinlining.

UnitVIII:Machinedependentcodeoptimization:Peepholeoptimization, registerallocation,instructionscheduling,interproceduraloptimization,garbagecollectionviareferencecounting.

Textbooks:1. Compilers,PrinciplesTechniquesandTools-AlfredVAho,MonicalSLam,RaviSethi,Jeffrey

D.Ullman,2nd ed, Pearson,2007.

2. Principlesofcompilerdesign,V.Raghavan,2nd

ed,TMH,2011.3. Principlesofcompilerdesign,2

nd ed,NandiniPrasad,Elsevier

Referencebooks:

1. http://www.nptel.iitm.ac.in/downloads/106108052/2. Compilerconstruction,PrinciplesandPractice,KennethCLouden,CENGAGE3. Implementations ofCompiler,AnewapproachtoCompilersincludingthealgebraicmethods,

Yunlinsu,SPRINGER

www.jntu3u.in


8/18



COMPUTERNETWORKS

Unit-I:Introduction:DataCommunication,components,datarepresentation, data flow;Networks:distributedprocessing,networkcriteria,physicalstructures,networkmodels,categoriesofnetwork,interconnectionofnetworks;TheInternet:briefhistory,internettoday,Protocols&standardlayers:protocols,standards,standardorganization,internetstandards,LayeredTasks:sender,receiver,carrier,hierarchy.

TheOSImodels: layeredarchitecture,peer to peerprocess,encapsulation, Layers inOSImodel: physical layer, data link layer, Network layer, transport layer, session layer ,presentation layer , application layer ,TCP/IPprotocolsuite: physical and data link layers,network layer, transport layer, application layer, Addressing: physical address, logical

address,portaddress,specificaddress.

Unit-II: Physical layer and overview of PL Switching: Multiplexing: frequency divisionmultiplexing, wave length division multiplexing, synchronous time division multiplexing,statistical time division multiplexing, introduction to switching: Circuit Switched Networks,

DatagramNetworks,VirtualCircuitNetworks.

Unit-III:Framing:fixedsizeframing,variablesizeframing,,Flowcontrol,Errorcontrol,Errordetections Error correction: block coding, linear block codes, cyclic codes: cyclicredundancycheck,hardware implementation,polynomials,cycliccodeanalysis,advantages ,Checksum: idea,onescomplement internetchecksum,servicesprovided toNetworkLayer,elementaryDatalinkLayerprotocols-UnrestrictedSimplexprotocol,SimplexStop-and-WaitProtocol,SimplexprotocolforNoisyChannel.

Unit-IV: Sliding Window Protocol: One bit, Go back N, Selective Repeat-Stop and waitprotocol ,data link layerHDLC:configurationand transfermodes, frames,control field,pointtopointprotocol(PPP):framing,transitionphase,multiplexing, multilinkPPP.

Unit -V: Random Access : ALOHA, career sense multiple access (CSMA), career sense

multipleaccesswithcollisiondetection,careersensemultipleaccesswithcollisionavoidance,ControlledAccess:Reservation,Polling,TokenPassing,Channelization:frequencydivisionmultiple access(FDMA),time division multiple access(TDMA), code division multipleaccess(CDMA).

Unit-VI: IEEE Standards: data link layer, physical layer, Manchester encoding, StandardEthernet: MA C Sub Layer, physical layer, FastEthernet: MAC Sub Layer, physical layer,IEE-802.11:Architecture,MACsublayer,addressingmechanism,framestructure.

Unit-VII:Bluetooth :Architecture,bluetooth layers,Protocolstack,Framestructure,cellurTelephony-frequency reuse Transmitting, receiving, roaming, Satellite Networks

GEO,LEO,MEOsatellite.

www.jntu3u.in


9/18

Unit-VIII:DataLinkLayerSwitching-Bridges,LocalinternetworkingSpanningtreebridges,remotebridges,switchvirtualLANs.

TextBooks:1)Datacommunicationsandnetworking4

thedtion BehrouzAFourzan,TMH

2)Computernetworks 4th editon AndrewSTanenbaum,Pearson

3)Computernetworks, MayankDave, CENGAGE

ReferenceBooks:

1) http://nptel.iitm.ac.in/courses/Webcourse-

contents/IIT%20Kharagpur/Computer%20networks/New_index1.html

2) Computernetworks,AsystemApproach,5th

ed,LarryLPetersonandBruceSDavie,Elsevier

www.jntu3u.in


10/18



MICROPROCESSORSANDMULTICORESYSTEMS

UNIT I: overview of microcomputer structure and operation., execution of a three instructionprogram,microprocessorevolutionand types,the8086microprocessorfamily,8086 internalarchitecture , introduction to programming the 8086,8086 family assembly languageprogramming :Program development steps , constructing the machine codes for 8086

instructions, writing programs for use with an assembler, assembly language programdevelopmenttools.

UNITII:Implementing standardprogramstructuresin8086assemblylanguageSimple sequence programs,jumps, flags and conditional jumps, if-then, if-then-else andmultiple if-then-else programs, while-do programs, repeat-until programs, instruction timinganddelayloops.

UNITIII:Strings,proceduresandmacrosThe 8086 string instructions, writing and using procedures, writing and using assembler

macros.

UNITIV:8086instructiondescriptionsandassemblerdirectives

Instruction descriptions, assembler directives , DB, DD, DQ, DT, DW, end-program, endp,ends,equ ,even-alignonevenmemoryaddress,extrn ,global,public/extrn,group, include,label, length- not implemented IBM MASM, name off set, ORG,proc, ptr, segment, short,type.

UNITV:8086: 8086interruptsandinterruptapplications8086 interruptsand interrupt responses,hardware interruptapplications,Software Interrupts,priorityofinterrupts,softwareinterruptapplications,programming.

UNITVI: 8086 ASSEMBLY LANGUAGE PROGRAMMES - Bit & Logic operations, strings,procedures, Macros, Number Format, Conversions, ASCII operations, signed NumbersArithmetic,ProgrammingusingHighlevellanguageconstructs.

UNIT VII: CPU: architecture of Intel 80286 CPU, Intel 80386, and 32-bit CPU- 80486-

Microprocessor(Noinstructionset).

UNITVIII: Introduction to Pentium Processor architecture, dual Core and Core DuoBasiccharacteristics,ArchitectureandcomparisonwithotherCPUs.

TextBooks:1. Microprocessors andInterfacing,DouglasVHall,Revised2

nd ed,TMH

2. TheX86Microprocessors,architecture,ProgrammingandInterfacing(8086toPentium),LylaBDas,PEA

3. The8086Microprocessor:Programming&InterfacingthePC,Ayala:Cengage

www.jntu3u.in


11/18

ReferenceBooks:1. http://nptel.iitm.ac.in/courses/Webcourse-contents/IIT-

KANPUR/microcontrollers/micro/ui/Course_home4_29.htm

2. http://nptel.iitm.ac.in/courses/Webcourse-contents/IISc-BANG/Microprocessors%20and%20Microcontrollers/pdf/Teacher_Slides/mod1/M1L3.pdf

3.MicrocomputerSystems:The8086.8088Family,Architecture,ProgrammingandDesign,Yu-ChengLiu,GlennAGibson,2

nded,

4.The8086Microprocessor:Programming&InterfacingthePC,KennethJAyala,CENGAGE5.Microprocessors, The8086/8088,80186/80286,80386/80486andthePentiumFamily,Nilesh

BBahadure,PHI6.Microprocessors andMicrocontrollers, SenthilKumar,Saravanan, Jeevanathan,OXFORD

www.jntu9.in

www.jntu3u.in


12/18



OPERATINGSYSTEMS

UNIT I : Computer System and Operating System Overview: Overview of computer

operating systems, operating systems functions,protection and security,distributed systems,specialpurposesystems,operatingsystemsstructuresandsystemscalls,operatingsystemsgeneration.

UNIT II : ProcessManagement Process concept- process scheduling, operations, Interprocess communication. Multi Thread programming models. Process scheduling criteria andalgorithms,andtheirevaluation.

UNIT III :Concurrency : Process synchronization, the critical- section problem, Petersons

Solution, synchronization Hardware, semaphores, classic problems of synchronization, monitors,Synchronizationexamples

UNITIV:MemoryManagement:Swapping,contiguousmemoryallocation,paging,structureofthepagetable,segmentation

UNITV:VirtualMemoryManagement:virtual memory, demand paging, page-Replacement, algorithms, Allocation of Frames,Thrashing

UNIT VI : Principles of deadlock system model, deadlock characterization, deadlock

prevention,detectionandavoidance,recoveryformdeadlock,

UNITVII :Filesystem Interface- theconceptofa file,AccessMethods,Directorystructure,Filesystemmounting,filesharing,protection.File System implementation- File system structure, file system implementation, directory

implementation, allocationmethods,free-spacemanagement

UNITVIII :Mass-storagestructureoverviewof Mass-storagestructure,Diskstructure,diskattachment,diskscheduling,swap-spacemanagement

TEXTBOOKS:

1. Operating System Concepts- Abraham Silberchatz, Peter B. Galvin, Greg Gagne 7thEdition,JohnWiley.2.OperatingSystemsInternalandDesignPrinciplesStallings,SixthEdition2005,Pearsoneducation

REFERENCES:1.http://nptel.iitm.ac.in/courses/Webcourse-contents/IISc- BANG/Operating%20Systems/New_index1.html

2.Operatingsystems-AConceptbasedApproach-D.M.Dhamdhere, 2nd

Edition,TMH

www.jntu3u.in


13/18

3.OperatingSystemADesignApproach-Crowley, TMH.4.ModernOperatingSystems,AndrewSTanenbaum3rd edition PHI.



COMPUTERGRAPHICS

UNIT I : Introduction:ApplicationofComputerGraphics, rasterscansystems, randomscansystems,rasterscandisplayprocessors. Output primitives : Points and lines, line drawing algorithms( Bresenhams and DDA Line

derivationsandalgorithms),mid-pointcircleandellipsealgorithms.

UNIT II : Filled area primitives: Scan line polygon fill algorithm, boundary-fill and flood-fillalgorithms.Insideandoutsidetests.

UNIT III : 2-D geometrical transforms: Translation, scaling, rotation, reflection and sheartransformations, matrixrepresentations andhomogeneouscoordinates,composite transforms,transformations betweencoordinatesystems.(p.nos204-227oftextbook-1).

UNITIV:2-Dviewing :Theviewingpipeline,viewingcoordinatereference frame,window toview-portcoordinate transformation,viewing functions,Cohen-Sutherland andCyrus-beck lineclippingalgorithms,SutherlandHodgemanpolygonclippingalgorithm.

UNIT V : 3-D object representation : Polygon surfaces, quadric surfaces, splinerepresentation, Hermite curve, Bezier curve and B-Spline curves, Bezier and B-Splinesurfaces.

UNITVI:3-DGeometrictransformations:Translation,rotation,scaling,reflectionandsheartransformations, compositetransformations. 3DViewingpipeline,clipping,projections(ParallelandPerspective).

UNITVII : Visible surface detectionmethods: Classification, back-face detection, depth-

buffer,scan-line,depthsorting,BSPtreemethods,areasub-divisionandoctreemethods.

UNIT VIII : Computer animation : Design of animation sequence, general computer

animation functions, raster animation, computer animation languages, key frame systems,

motionspecifications.

TEXTBOOKS:1.ComputerGraphicsCversion,DonaldHearn,M.PaulineBaker,Pearson

2.ComputerGraphicswithVirtualRealitySystems,RajeshKMaurya,Wiley3. IntroductiontoComputerGraphics,UsingJava2Dand3D,FrankKlawonn,Springer4.ComputerGraphics,StevenHarrington,TMH5.ComputerGraphics,AmarendraNSinha,ArunUdai,TMHREFERENCEBOOKS:

1.ComputerGraphicsPrinciples&practice,2/e,Foley,VanDam,Feiner,Hughes,Pearson2.ComputerGraphics,Peter,Shirley,CENGAGE3.PrinciplesofInteractiveComputerGraphics,Neuman,Sproul,TMH.

www.jntu3u.in


14/18

4.TheComputerGraphicsmanual,Vol2,David,Soloman,Springer

5.ProceduralelementsforComputerGraphics,DavidFRogers,2/e,TMH



ADVANCEDDATASTRUCTURES(Note:C++andJavaimplementationisnotincludedinthesyllabus)

Unit I : Dictionaries : Sets, Dictionaries, Hash Tables, Open Hashing, Closed Hashing(RehashingMethods), HashingFunctions(DivisionMethod,MultiplicationMethod, UniversalHashing), Analysis of Closed Hashing Result (Unsuccessful Search, Insertion, SuccessfulSearch,Deletion),HashTableRestructuring,SkipLists,AnalysisofSkipLists.(Reference1)

Unit II : Balanced Trees : AVL Trees: Maximum Height of an AVL Tree, Insertions andDeletions.2-3Trees:Insertion,Deletion.

UnitIII: PriorityQueues:

BinaryHeaps:ImplementationofInsertandDeletemin,CreatingHeap.BinomialQueues : BinomialQueue Operations, Binomai l Amortized Analysis, LazyBinomialQueues

Unit IV :Graphs :Operations onGraphs:Vertex insertion,vertexdeletion, findvertex,edgeaddition,edge deletion,GraphTraversals-Depth FirstSearchand Breadth FirstSearch(Nonrecursive).GraphstorageRepresentation-Adjacencymatrix,adjacencylists.

UnitV : Graph algorithms : Minimum-Cost Spanning Trees- Prim's Algorithm, Kruskal'sAlgorithm Shortest Path Algorithms: Dijkstra's Algorithm, All Pairs Shortest Paths Problem:Floyd'sAlgorithm,Warshall'sAlgorithm,

Unit VI : Sorting Methods : Order Statistics: Lower Bound on Complexity for SortingMethods: Lower Bound on Worst Case Complexity, Lower Bound on Average CaseComplexity,HeapSort,QuickSort,RadixSorting,MergeSort.

UnitVII : Patternmatching and Tries : Pattern matching algorithms- the BoyerMoorealgorithm,theKnuth-Morris-Pratt algorithm

Tries:Definitionsandconceptsofdigitalsearchtree,Binarytrie,Patricia,Multi-waytrie

UnitVIII : FileStructures: Fundamental File Processing Operations-opening files, closingfiles,ReadingandWritingfilecontents,Specialcharactersinfiles.

Fundamental File Structure Concepts- Fieldand record organization, Managing fixed-length,fixed-fieldbuffers.(Reference5)

TextBooks:

www.jntu3u.in


15/18

1. DataStructures,APseudocodeApproach,RichardFGilberg,BehrouzA

Forouzan,Cengage.2. FundamentalsofDATASTRUCTURES inC:2nd ed, ,Horowitz ,Sahani,

Anderson-freed,UniversitiesPress3. DatastructuresandAlgorithmAnalysisinC,2

ndedition,MarkAllenWeiss,Pearson

Reference Books:

1. Web:http://lcm.csa.iisc.ernet.in/dsa/dsa.html

2. http://utubersity.com/?page_id=878

3. http://freevideolectures.com/Course/2519/C-Programming-and-Data-Structures

4. http://freevideolectures.com/Course/2279/Data-Structures-And-Algorithms

5. File Structures :An Object oriented approach with C++, 3rd

ed, Michel J Folk, Greg

Riccardi,BillZoellick6. CandDataStructures:ASnapShotorientedTreatisewithLiveexamples

fromScienceandEngineering,NBVenkateswarlu&EVPrasad,SChand,2010.

www.jntu3u.in


16/18



OPERATINGSYSTEM&COMPILERDESIGNLABPARTA:1. DesignaLexicalanalyzerforthegivenlanguage.Thelexicalanalyzershouldignore

redundantspaces,tabsandnewlines.Itshouldalsoignorecomments.Althoughthesyntaxspecificationstatesthatidentifierscanbearbitrarilylong,youmayrestrictthelengthtosomereasonablevalue.

2. ImplementthelexicalanalyzerusingJLex,flexorlexorotherlexicalanalyzergeneratingtools.

3. DesignPredictiveparserforthegivenlanguage4. DesignLALRbottomupparserforthegivenlanguage.5. ConverttheBNFrulesintoYaccformandwritecodetogenerateabstractsyntaxtree.

PART-B:1. SimulatethefollowingCPUschedulingalgorithms

a)RoundRobinb)SJFc)FCFSd)Priority2. Simulateallfileallocationstrategies

a)Sequentialb)Indexedc)Linked

3. SimulateMVTandMFT4. SimulateallFileOrganizationTechniques

a)Singleleveldirectoryb)Twolevelc)Hierarchicald)DAG5. SimulateBankersAlgorithmforDeadLockAvoidance

6. SimulateBankersAlgorithmforDeadLockPrevention7. Simulateallpagereplacementalgorithms

a)FIFOb)LRUc)LFUEtc.Q8. SimulatePagingTechniqueofmemorymanagement.

www.jntu3u.in


17/18



ADVANCEDDATASTRUCTURESLab

1. ToimplementfunctionsofDictionaryusingHashing(divisionmethod,Multiplicationmethod,Universalhashing)

2. Toperformvariousoperationsi.e,insertionsanddeletionsonAVLtrees3. Toperformvariousoperationsi.e.,insertionsanddeletionson2-3trees.4. Toimplementoperationsonbinaryheap.5. Toimplementoperationsongraphs

i)vertexinsertion

ii)Vertexdeletioniii)findingvertexiv)Edgeadditionanddeletion

6.. ToimplementDepth FirstSearchforagraph nonrecursively.7. ToimplementBreadthFirstSearchforagraph nonrecursively.8. ToimplementPrimsalgorithmtogenerateamin-costspanningtree.9. ToimplementKrushkalsalgorithmtogenerateamin-costspanningtree.10. ToimplementDijkstrasalgorithmtofindshortestpathinthegraph.11. ToimplementpatternmatchingusingBoyer-Moorealgorithm.12. ToimplementKnuth-Morris-Pratt algorithmforpatternmatching.

www.jntu3u.in


18/18



INTELLUCTUALPROPERTYRIGHTSANDPATENTS-1

www.jntu3u.in

b.tech computer science engineering - syllabus of b

Documents