Scribd
Upload
69 views1 page

Gate CS

This syllabus outlines the topics covered in a computer science and information technology course including: 1) Digital logic, computer organization and architecture, programming and data structures, algorithms, and theory of computation. 2) Operating systems, databases, information systems, and software engineering. 3) Computer networks, network security, and web technologies.

Uploaded by

Jagdish Kumar
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
69 views1 page

Gate CS

This syllabus outlines the topics covered in a computer science and information technology course including: 1) Digital logic, computer organization and architecture, programming and data structures, algorithms, and theory of computation. 2) Operating systems, databases, information systems, and software engineering. 3) Computer networks, network security, and web technologies.

Uploaded by

Jagdish Kumar
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

SYLLABUSFORCOMPUTERSCIENCEANDINFORMATIONTECHNOLOGY(CS) ComputerScienceandInformationTechnology DigitalLogic:Logicfunctions,Minimization,Designandsynthesisofcombinationaland sequentialcircuits;Numberrepresentationandcomputerarithmetic(fixedandfloating point). ComputerOrganizationandArchitecture:Machineinstructionsandaddressingmodes, ALUanddatapath,CPUcontroldesign,Memoryinterface,I/Ointerface(Interruptand DMAmode),Instructionpipelining,Cacheandmainmemory,Secondarystorage. ProgrammingandDataStructures:ProgramminginC;Functions,Recursion,Parameter passing,Scope,Binding;Abstractdatatypes,Arrays,Stacks,Queues,LinkedLists, Trees,Binarysearchtrees,Binaryheaps. Algorithms:Analysis,Asymptoticnotation,Notionsofspaceandtimecomplexity,Worst andaveragecaseanalysis;Design:Greedyapproach,Dynamicprogramming,Divide andconquer;Treeandgraphtraversals,Connectedcomponents,Spanningtrees, Shortestpaths;Hashing,Sorting,Searching.

Asymptoticanalysis(best,worst,average cases)oftimeandspace,upperandlowerbounds,Basicconceptsofcomplexityclasses P ,NPhard,NPcomplete. ,NP TheoryofComputation:Regularlanguagesandfiniteautomata,Contextfreelanguages andPushdownautomata,RecursivelyenumerablesetsandTuringmachines, Undecidability. CompilerDesign:Lexicalanalysis,Parsing,Syntaxdirectedtranslation,Runtime environments,Intermediateandtargetcodegeneration,Basicsofcodeoptimization. OperatingSystem:Processes,Threads,Interprocesscommunication,Concurrency, Synchronization,Deadlock,CPUscheduling,Memorymanagementandvirtualmemory, Filesystems,I/Osystems,Protectionandsecurity. Databases:ERmodel,Relationalmodel(relationalalgebra,tuplecalculus),Database design(integrityconstraints,normalforms),Querylanguages(SQL),Filestructures (sequentialfiles,indexing,BandB+trees),Transactionsandconcurrencycontrol. InformationSystemsandSoftwareEngineering:informationgathering,requirement andfeasibilityanalysis,dataflowdiagrams,processspecifications,input/outputdesign, processlifecycle,planningandmanagingtheproject,design,coding,testing, implementation,maintenance. ComputerNetworks:ISO/OSIstack,LANtechnologies(Ethernet,Tokenring),Flowand errorcontroltechniques,Routingalgorithms,Congestioncontrol,TCP/UDPand sockets,IP(v4),Applicationlayerprotocols(icmp,dns,smtp,pop,ftp,http);Basic conceptsofhubs,switches,gateways,androuters.Networksecuritybasicconceptsof publickeyandprivatekeycryptography,digitalsignature,firewalls. Webtechnologies:HTML,XML,basicconceptsofclientservercomputing.

You might also like