Close sidebar

GATE syllabus for Computer science

I need some help regarding the syllabus and exam pattern?

  • Deepshikha
  • 3971 Views
  • 18 Answers
  Answer
18 Answers

  • help

    0

  • strongSyllabus/strongbr /Topics to be studied thoroughly are :br /Engineering Mathematicsbr /Digital Logicbr /Computer Organization & Architecturebr /Programming & Data Structuresbr /Algorithmsbr /Theory of Computationbr /Compiler Designbr /Operating Systembr /Data basesbr /Computer Networksbr /emstrongTO PREPARE WELL, PRACTICE a rel='nofollow' href="https://www.prep.youth4work.com/Engineering/GATE-Computer-Science-(CS)-Test/About"GATE COMPUTER SCIENCE MOCK TESTS./a/strong/em

    0

  • Section1:br /Engineering Mathematics Discrete Mathematics: Propositional and first order logic. Sets, relations, functions, partial orders and lattices. Groups. Graphs: connectivity, matching, coloring. Combinatorics: counting, recurrence relations, generating functions. Linear Algebra:Matrices, determinants, system of linear equations, eigenvalues and eigenvectors, LU decomposition. Calculus: Limits, continuity and differentiability. Maxima and minima. Mean value theorem. Integration. Probability: Random variables. Uniform, normal, exponential, poisson and binomial distributions. Mean, median, mode and standard deviation. Conditional probability and Bayes theorem.br /br /Computer Science and Information Technologybr /br /Section 2: Digital Logic Boolean algebra. Combinational and sequential circuits. Minimization. Number representations and computer arithmetic (fixed and floating point).br /br /Section 3: Computer Organization and Architecture Machine instructions and addressing modes. ALU, data‐path and control unit. Instruction pipelining. Memory hierarchy: cache, main memory and secondary storage; I/O interface (interrupt and DMA mode).br /br /Section 4: Programming and Data Structures Programming in C. Recursion. Arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs.br /br /Section 5: Algorithms Searching, sorting, hashing. Asymptotic worst case time and space complexity. Algorithm design techniques: greedy, dynamic programming and divide‐and‐conquer. Graph search, minimum spanning trees, shortest paths.br /br /Section 6: Theory of Computation Regular expressions and finite automata. Context-free grammars and push-down automata. Regular and contex-free languages, pumping lemma. Turing machines and undecidability.br /br /Section 7: Compiler Design Lexical analysis, parsing, syntax-directed translation. Runtime environments. Intermediate code generation.br /br /Section 8: Operating System Processes, threads, inter‐process communication, concurrency and synchronization. Deadlock. CPU scheduling. Memory management and virtual memory. File systems.br /br /Section 9: Databases ER‐model. Relational model: relational algebra, tuple calculus, SQL. Integrity constraints, normal forms. File organization, indexing (e.g., B and B+ trees). Transactions and concurrency control.br /br /Section 10: Computer Networks Concept of layering. LAN technologies (Ethernet). Flow and error control techniques, switching. IPv4/IPv6, routers and routing algorithms (distance vector, link state). TCP/UDP and sockets, congestion control. Application layer protocols (DNS, SMTP, POP, FTP, HTTP). Basics of Wi-Fi. Network security: authentication, basics of public key and private key cryptography, digital signatures and certificates, firewalls.br /br / 

    0

  • Here is the direct link by which you can download and check the latest GATE syllabus for Computer Sciencebr /a rel='nofollow' href='https://engineering.careers360.com/articles/gate-syllabus'https://engineering.careers360.com/articles/gate-syllabus/a

    2

  • Click on this link and you can get the full syllabus of GATE 2019 for CS in pdf form (downloadable) - br /a rel='nofollow' href="https://images.careers360.mobi/sites/default/files/GATE%202018-CS-Computer-Science-and-Information-Technology.pdf"https://images.careers360.mobi/sites/default/files/GATE%202018-CS-Computer-Science-and-Information-Technology.pdf/abr /As for the exam pattern, here are some multiple choice questions which have negative markings and 4 choices are supplied with each questions. Some NAT questions will also be there which doesnot have any negative markings. You have to answer NAT questions using the provided virtual keyboard. In the exam you will also be provided with a virtual on-screen calculated for critical calculation purposes.At first there will be some aptitude questions (MCQs) and then technical based questions (MCQs and NATs).

    0

  • Engineering mathematicsbr /Digital Logicbr /Computer Organization and Architecturebr /Programming and Data Structuresbr /Algorithmsbr /Theory of Computationbr /Compiler Designbr /Operating Systembr /Databasesbr /Section JComputer Networks

    0

  • 1: Engineering Mathematicsbr /2: Digital Logicbr /3: Computer Organization and ArchitectureSectionbr /4: Programming and Data Structures Sectionbr /5: Algorithms Sectionbr /6: Theory of Computation Sectionbr /7: Compiler DesignSectionbr /8: Operating System Sectionbr /9: Databases Sectionbr /10: Computer Networks

    0

  • When I searched on google about the syllabus I came up with this, There are about 10 sections in the total computer science syllabus where engineering mathematics is again subdivided into 4 new topics, (If you studied all these topics you can achieve a good life in the field of Computer Science)br /br /Section1: Engineering Mathematicsbr /- Discrete Mathematicsbr /- Linear Algebrabr /- Probabilitybr /- Calculusbr /br /Section 2: Digital Logic br /br /Section 3: Computer Organization and Architecturebr /br /Section 4: Programming and Data Structures br /br /Section 5: Algorithms br /br /Section 6: Theory of Computation br /br /Section 7: Compiler Designbr /br /Section 8: Operating System br /br /Section 9: Databases br /br /Section 10: Computer Networks br /br /You can download the syllabus in PDF format from here a rel='nofollow' href="http://www.gate.iitg.ac.in/Syllabi/CS_Computer-Science-and-Information-Technology.pdf"http://www.gate.iitg.ac.in/Syllabi/CS_Computer-Science-and-Information-Technology.pdf/a

    0

  • Computer Science and Information Technologybr /br /Section1: Engineering Mathematicsbr /Discrete Mathematics: Propositional and first-order logic. Sets, relations, functions, partialbr /orders and lattices. Groups. Graphs: connectivity, matching, coloring. Combinatorics:br /counting, recurrence relations, generating functions.br /Linear Algebra: Matrices, determinants, the system of linear equations, eigenvalues andbr /eigenvectors, LU decomposition.br /Calculus: Limits, continuity, and differentiability. Maxima and minima. Mean valuebr /theorem. Integration.br /Probability: Random variables. Uniform, normal, exponential, Poisson and binomialbr /distributions. Mean, median, mode and standard deviation. Conditional probability andbr /Bayes theorem.br /br /Computer Science and Information Technologybr /br /Section 2: Digital Logicbr /Boolean algebra. Combinational and sequential circuits. Minimization. Numberbr /representations and computer arithmetic (fixed and floating point).br /br /Section 3: Computer Organization and Architecturebr /Machine instructions and addressing modes. ALU, data‐path and control unit. Instructionbr /pipelining. Memory hierarchy: cache, main memory, and secondary storage; I/Obr /interface (Interrupt and DMA mode).br /br /Section 4: Programming and Data Structuresbr /Programming in C. Recursion. Arrays, stacks, queues, linked lists, trees, binary searchbr /trees, binary heaps, graphs.br /br /Section 5: Algorithmsbr /Searching, sorting, hashing. Asymptotic worst-case time and space complexity.br /Algorithm design techniques: greedy, dynamic programming and divide‐and‐conquer.br /Graph search, minimum spanning trees, shortest paths.br /br /Section 6: Theory of Computationbr /Regular expressions and finite automata. Context-free grammars and push-downbr /automata. Regular and context-free languages, pumping lemma. Turing machines andbr /undecidability.br /br /Section 7: Compiler Designbr /Lexical analysis, parsing, syntax-directed translation. Runtime environments. Intermediatebr /code generation.br /br /Section 8: Operating Systembr /Processes, threads, inter‐process communication, concurrency, and synchronization.br /Deadlock. CPU scheduling. Memory management and virtual memory. File systems.br /br /Section 9: Databasesbr /ER‐model. Relational model: relational algebra, tuple calculus, SQL. Integrity constraints,br /normal forms. File organization, indexing (e.g., B and B+ trees). Transactions andbr /concurrency control.br /br /Section 10: Computer Networksbr /The concept of layering. LAN technologies (Ethernet). Flow and error control techniques,br /switching. IPv4/IPv6, routers and routing algorithms (distance vector, link state). TCP/UDPbr /and sockets, congestion control. Application layer protocols (DNS, SMTP, POP, FTP, HTTP).br /Basics of Wi-Fi. Network security: authentication, basics of the public key and private keybr /cryptography, digital signatures, and certificates, firewalls.

    0

  • Candidates can check the syllabus of GATE 2019 for Computer Science and Information Technology given below. By knowing the syllabus, the candidates will be able to know which chapters and topics have to be studied or not.br / br /Section 1 – Engineering Mathematicsbr /Discrete Mathematicsbr /Linear Algebrabr /Calculusbr /Probabilitybr /Section 2 – Digital Logicbr /Section 3 – Computer Organization and Architecturebr /Section 4 – Programming and Data Structuresbr /Section 5 – Algorithmsbr /Section 6 – Theory of Computationbr /Section 7 – Compiler Designbr /Section 8 – Operating Systembr /Section 9 – Databasesbr /Section 10 – Computer Networks

    0

  • Go on Follow link to get Syllbus for GATE br /br /a rel='nofollow' href="https://images.careers360.mobi/sites/default/files/GATE%202018-CS-Computer-Science-and-Information-Technology.pdf"https://images.careers360.mobi/sites/default/files/GATE%202018-CS-Computer-Science-and-Information-Technology.pdf/a

    0

  • For gate syllabus you can visit this link-br /a rel='nofollow' href="http://www.gate.iitg.ac.in/Syllabi/CS_Computer-Science-and-Information-Technology.pdf"http://www.gate.iitg.ac.in/Syllabi/CS_Computer-Science-and-Information-Technology.pdf/abr /The paper will be of 3 hours. There will be 65 questions of 100 marks. 2 types of questions - multiple choice ans numerical answer type. 3 sections - br /strong1. General Aptitudebr /2. Engg Mathematicsbr /3. Subject specific section./strongbr /br /em1 mark MCQs – 1/3 mark will be deducted for every wrong answer.br /2 mark MCQs – 2/3 mark will be deducted for every wrong response.br /Zero marks will be awarded for unattempted questionsbr /No negative marking will be done for Numerical Answer Type (NAT) questions/em.br / 

    0

  • GATE stands for Graduate Aptitude Test in Engineering is mainly taken on various comprehensive subjects that are taught in engineering  as well as in other science subjects.GATE is conducted by Indian Institute of science and seven of the IIT's namely - IIT Kharagpur , IIT Madras , IIT Guwahati , IIT Kanpur ,IIT Mumbai ,IIT Madras , and , IIT Roorkee.The candidate must hold a bachelors degree in B. Tech/B.E./ B. Pharma, Science, B.sc research from recognized University. The duration of the exam is 3 hours. The questions are multiple choice as well as objective type questions. There is total 65 number of questions. The GATE Computer Science is divided into 10 sections. The application form for GATE Computer Science will release from August 31st, 2018 & available till October 05, 2018.br /GATE Computer Science Entrance Exam 2019 Exam Patternbr /Type: Online testbr /Duration: The duration of the paper GATE Electrical Engineering 2019 exam will be of 180 minutes.br /No. of Questions: 65 Objective type questions.br /Syllabus Covered:  Syllabus of GATE Computer Science Engineering is divided into 10 sections. Engineering Mathematics, Digital Logic, Computer Organization & Architecture, Programming & Data Structures, Algorithms, Theory of Computation, Compiler Design, Operating System, Data bases, Computer Networks.br /Marking Scheme:  Different marking scheme for each section and 1/3rd mark will be deducted for every wrong answer.br /Understanding the competition in GATE Computer Science 2019 exambr /Understanding the competition is an important step before appearing for any competitive exam, so it is for GATE. The GATE (Graduate Aptitude Test in Engineering is one of the most awaited entrance test for engineering aspirants. The candidates need to outperform others to secure spot.  br /And yes it is an online exam.br /br /Hope this will help.

    0

  • I am completing my 75% portion and i need some grand mock exam free for cs.

    4

  • subiect m

    2

  • Pattern of Question Papers: Total 65 queries (ALL Objective Type) Total Marks: a hundred every question has solely one correct answer.br /GATE Computer science Examination will be on-line.br /br /GATE Computer science would contain questions of four differing kinds in engineering papers: :br /1. Multiple choice queries carrying one or two marks every. Common data queries, where 2 ordered queries use the same set of computer file. Linked answer queries, where the answer to the primary question of the combine is needed so as to answer its successor.br /2. Numerical answer questions, where the answer may be a variety, to be entered by the candidate using the mouse and a virtual input device that can be provided on the screen.br /Note: Sectional cut-off (Technical / Non-Technical like Engineering mathematics & General Aptitude) square measure not applied in GATE communication.br /br /In all the papers, there will be a complete of sixty five queries carrying a hundred marks, out of which ten queries carrying fifteen marks in General power (GA) square measure mandatory.br /br /br /NOTE: General Aptitude (GA-15 Marks) is common for the entire engineering branch (Computer Science-CS). Question of General Aptitude can stay same for branches control in same seating.br /br /br /Engineering Mathematics can carry fifteen the troubles of the full marks, the General Aptitude section can carry V-day of the full marks and also the remaining seventy take advantage of the full marks is technical in nature.br /br /br /Engineering Mathematics information for Electrical Engineering, Electronics & Communication Engineering & Instrumentation Engineering is same and same question would be asked in the examination of gate 2015.br /br /br /Engineering Mathematics information for Civil Engineering, Chemical Engineering & Mechanical Engineering is same and same question would be asked within the examination of gate 2015.br /br /br /Few topics of engineering mathematics square measure common for pc Science & IT Engineering, Electrical, Electronics & Communication, Civil, Instrumentation, Chemical and mechanical engineering.br /br /br /Marking scheme: Negative marking of 1/3rd for one marks question and Negative marking of 2/3rd for two marks question.br /br /br /Unattempted question: No Marksbr /br /br /Linked answer question pair: every question carries two marks, 2/3 mark will be subtracted for a wrong answer to the primary question solely. There is no negative marking for wrong answer to the second question of the

    -1

  • !--[if gte mso 9]xml w:WordDocument w:ViewNormal/w:View w:Zoom0/w:Zoom w:TrackMoves/ w:TrackFormatting/ w:PunctuationKerning/ w:ValidateAgainstSchemas/ w:SaveIfXMLInvalidfalse/w:SaveIfXMLInvalid w:IgnoreMixedContentfalse/w:IgnoreMixedContent w:AlwaysShowPlaceholderTextfalse/w:AlwaysShowPlaceholderText w:DoNotPromoteQF/ w:LidThemeOtherEN-US/w:LidThemeOther w:LidThemeAsianX-NONE/w:LidThemeAsian w:LidThemeComplexScriptX-NONE/w:LidThemeComplexScript w:Compatibility w:BreakWrappedTables/ w:SnapToGridInCell/ w:WrapTextWithPunct/ w:UseAsianBreakRules/ w:DontGrowAutofit/ w:SplitPgBreakAndParaMark/ w:DontVertAlignCellWithSp/ w:DontBreakConstrainedForcedTables/ w:DontVertAlignInTxbx/ w:Word11KerningPairs/ w:CachedColBalance/ /w:Compatibility w:BrowserLevelMicrosoftInternetExplorer4/w:BrowserLevel m:mathPr m:mathFont m:val="Cambria Math"/ m:brkBin m:val="before"/ m:brkBinSub m:val="--"/ m:smallFrac m:val="off"/ m:dispDef/ m:lMargin m:val="0"/ m:rMargin m:val="0"/ m:defJc m:val="centerGroup"/ m:wrapIndent m:val="1440"/ m:intLim m:val="subSup"/ m:naryLim m:val="undOvr"/ /m:mathPr/w:WordDocument /xml![endif]--br /the linked answer question combine.br /If the first question within the connected combine is incorrectly answered or is unattempted, then the answer to the second question within the pair won't be evaluated. There is no negative marking for numerical answer type queries.br /br /br /Common DATA: Multiple choice type: Equal marks to all connected queries.br /br /br /General Aptitude (GA) Section: Same Question can be expected for EE, Electronics & Communication Engineering & Instrumentation engineering in the examination of gate 2015.br /br /br /In all papers, GA questions square measure of multiple selection sorts, and carry a total of 15 marks. The GA section includes five queries carrying one mark every (sub-total five marks) and 5 queries carrying 2-marks every (sub-total ten marks)br /br /Question 1 to 25: One mark every ( Negative marking 1/3rd )br /br /Question 26 to 55: 2 mark every ( Negative marking 2/3rd )br /br /Question 56 to 65: General power ( total fifteen marks ) : ( Negative marking 1/3rd for One marks & 2/3rd for 2 mark )br /br /Question 56 to 60: One mark every Question sixty one to sixty five : 2 mark everybr /br /NOTE : Calculator is allowed whereas charts, graph sheet or Tables are NOT allowed within the examination hall.br /!--[if gte mso 9]xml w:LatentStyles DefLockedState="false" DefUnhideWhenUsed="true" DefSemiHidden="true" DefQFormat="false" DefPriority="99" LatentStyleCount="267" w:LsdException Locked="false" Priority="0" SemiHidden="false" UnhideWhenUsed="false" QFormat="true" Name="Normal"/ w:LsdException Locked="false" Priority="9" SemiHidden="false" UnhideWhenUsed="false" QFormat="true" Name="heading 1"/ w:LsdException Locked="false" Priority="9" QFormat="true" Name="heading 2"/ w:LsdException Locked="false" Priority="9" QFormat="true" Name="heading 3"/ w:LsdException Locked="false" Priority="9" QFormat="true" Name="heading 4"/ w:LsdException Locked="false" Priority="9" QFormat="true" Name="heading 5"/ w:LsdException Locked="false" Priority="9" QFormat="true" Name="heading 6"/ w:LsdException Locked="false" Priority="9" QFormat="true" Name="heading 7"/ w:LsdException Locked="false" Priority="9" QFormat="true" Name="heading 8"/ w:LsdException Locked="false" Priority="9" QFormat="true" Name="heading 9"/ w:LsdException Locked="false" Priority="39" Name="toc 1"/ w:LsdException Locked="false" Priority="39" Name="toc 2"/ w:LsdException Locked="false" Priority="39" Name="toc 3"/ w:LsdException Locked="false

    2
  Other Related Discussions
Ask a Question
Practice Mock Test
gate computer science (cs)
Youth4work © 2024