Gate 2019 Syllabus and Exam
Pattern for Computer Science and Information Technology Pdf Download. Gate 2019 exam will conduct in fab 2019. This article
contain with all type information GATE 2019 exams like detail exam pattern and syllabus,
marking scheme gate 2019, negative marking and total number of question will
ask in gate 2019 exam. Here we provide you Gate 2019 Exam Syllabus End
Pattern CS & IT Computer Science and Information Technology Free Pdf
file.
We
all know that gate 2019 will ask two type of question one type of question are
multiple objective type and other is numerical objective type, During the
online exam, the candidate must select the right answer for the questions for
MCQs, while for the numerical type of questions, the candidate has to enter the
numerical answer by using the mouse on a virtual keyboard.
Gate 2019 Exam Pattern for Computer Science and Information
Technology
GATE
2019 Computer Science and Information Technology Engineering paper ask two type of questions first
will objective in nature and each question will have choice of four
answers. And second will Numerical Answer Questions, that type of
questions will be no choices available for these types of questions. The answer
for these questions is a real number to be entered by using mouse and virtual
keypad displayed on the monitor. No negative marking for these questions.
In
this paper each question (Both objective and Numerical Answer
Questions) carries 1 or 2 marks questions in all the sections.
Duration & Timing Exam: 3 hours (180 minutes) hours duration.
Questions Type
|
No
Of Questions
|
Maximum
Marks
|
General Aptitude+
Technical + Engineering Mathematics
|
65
|
100
|
Total
|
65
|
100
|
GATE 2019 Marks of Each Topic:
The
gate 2019 total number of question will 65, have 100 marks. In this exams 10
questions will be from General Aptitude carrying 15 marks. Papers with the
codes AE, AG, BT, CE, CH, CS, EC, EE, IN, ME, MN, MT, PE, PI, TF and XE, will
include a compulsory Engineering Mathematics section carrying around 15% of the
total marks, and General Aptitude section carrying 15% of total marks. The
remaining 70% is reserved for the subject of the paper.
Negative
Marking: in gate 2019 the
negative marking scheme For 1-mark MCQs, 1/3 mark will be deducted for every
incorrect attempt. In case of 2-mark MCQs, the candidate will be penalised 2/3
mark for wrong attempt For questions that aren’t attempted, zero marks will be
awarded. There is no negative marking for numerical answer type (NAT)
questions.
Section1: 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.
Computer
Science and Information Technology
Section 2: Digital Logic
Boolean
algebra. Combinational and sequential circuits. Minimization. Number representations
and computer arithmetic (fixed and floating point).
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).
Section 4: Programming and Data
Structures
Programming
in C. Recursion. Arrays, stacks, queues, linked lists, trees, binary search
trees, binary heaps, graphs.
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.
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.
Section 7: Compiler Design
Lexical
analysis, parsing, syntax-directed translation. Runtime environments.
Intermediate code generation.
Section 8: Operating System
Processes,
threads, inter‐process communication, concurrency and
synchronization. Deadlock. CPU scheduling. Memory management and virtual
memory. File systems.
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.
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
Syllabus
for General Aptitude (GA) (Common for All Branch Papers)
Verbal Ability: English grammar, sentence completion,
verbal analogies, word groups, instructions, critical reasoning and
verbal deduction.
Numerical
Ability: Numerical computation,
numerical estimation, numerical reasoning and data interpretation.
Gate 2019 Syllabus and Exam Pattern
for Computer Science and Information Technology Pdf
I hope these all Gate 2019 Syllabus and
Exam Pattern for Computer Science and Information Technology Pdf Download will help you crack all engineering
exams 2018-19. If you face any problem to download any file comment below. Like This Post Please Share With Your All Friends.
Advertise
With Us: - Advertise With Erexams.Com We have more than 10 lakh Page
Views Monthly all over world.
Get Latest Engineering Exams Update Study Material and Much More
Join Our
Comment Below, Ask Anything About This Article...:)