#1
| |||
| |||
![]()
I need the study material for the GATE (Computer Science and Information Technology), can you provide me the same???
|
#2
| |||
| |||
![]()
As you are looking for the syllabus of Competitive Exams like GATE (Computer Science and Information Technology), here I am sharing the same: Mathematical Logic: Propositional Logic; First Order Logic. Probability: Conditional Probability; Mean, Median, Mode and Standard Deviation; Random Variables; Distributions; uniform, normal, exponential, Poisson, Binomial. Set Theory & Algebra: Sets; Relations; Functions; Groups; Partial Orders; Lattice; Boolean Algebra. Combinatory: Permutations; Combinations; Counting; Summation; generating functions; recurrence relations; asymptotics. Graph Theory: Connectivity; spanning trees; Cut vertices & edges; covering; matching; independent sets; Colouring; Planarity; Isomorphism. GATE (Computer Science and Information Technology) syllabus Syllabus for Computer Science and Information Technology (CS) ENGINEERING MATHEMATICS Mathematical Logic: Propositional Logic; First Order Logic. Probability: Conditional Probability; Mean, Median, Mode and Standard Deviation; Random Variables; Distributions; uniform, normal, exponential, Poisson, Binomial. Set Theory & Algebra: Sets; Relations; Functions; Groups; Partial Orders; Lattice; Boolean Algebra. Combinatory: Permutations; Combinations; Counting; Summation; generating functions; recurrence relations; asymptotics. Graph Theory: Connectivity; spanning trees; Cut vertices & edges; covering; matching; independent sets; Colouring; Planarity; Isomorphism. Linear Algebra: Algebra of matrices, determinants, systems of linear equations, Eigen values and Eigen vectors. Numerical Methods: LU decomposition for systems of linear equations; numerical solutions of non-linear algebraic equations by Secant, Bisection and Newton-Raphson Methods; Numerical integration by trapezoidal and Simpson’s rules. Calculus: Limit, Continuity & differentiability, Mean value Theorems, Theorems of integral calculus, evaluation of definite & improper integrals, Partial derivatives, Total derivatives, maxima & minima. COMPUTER SCIENCE AND INFORMATION TECHNOLOGY Digital Logic: Logic functions, Minimization, Design and synthesis of combinational and sequential circuits; Number representation and computer arithmetic (fixed and floating point). Computer Organization and Architecture: Machine instructions and addressing modes, ALU and data-path, CPU control design, Memory interface, I/O interface (Interrupt and DMA mode), Instruction pipelining, Cache and main memory, Secondary storage. Programming and Data Structures: Programming in C; Functions, Recursion, Parameter passing, Scope, Binding; Abstract data types, Arrays, Stacks, Queues, Linked Lists, Trees, Binary search trees, Binary heaps. Algorithms: Analysis, Asymptotic notation, Notions of space and time complexity, Worst and average case analysis; Design: Greedy approach, Dynamic programming, Divide-and-conquer; Tree and graph traversals, Connected components, Spanning trees, Shortest paths; Hashing, Sorting, Searching. Asymptotic analysis (best, worst, average cases) of time and space, upper and lower bounds, Basic concepts of complexity classes – P, NP, NP-hard, NP-complete. Theory of Computation: Regular languages and finite automata, Context free languages and Push-down automata, Recursively enumerable sets and Turing machines, Undecidability. Compiler Design: Lexical analysis, Parsing, Syntax directed translation, Runtime environments, Intermediate and target code generation, Basics of code optimization. Operating System: Processes, Threads, Inter-process communication, Concurrency, Synchronization, Deadlock, CPU scheduling, Memory management and virtual memory, File systems, I/O systems, Protection and security. Databases: ER-model, Relational model (relational algebra, tuple calculus), Database design (integrity constraints, normal forms), Query languages (SQL), File structures (sequential files, indexing, B and B+ trees), Transactions and concurrency control. Information Systems and Software Engineering: information gathering, requirement and feasibility analysis, data flow diagrams, process specifications, input/output design, process life cycle, planning and managing the project, design, coding, testing, implementation, maintenance. Computer Networks: ISO/OSI stack, LAN technologies (Ethernet, Token ring), Flow and error control techniques, Routing algorithms, Congestion control, TCP/UDP and sockets, IP(v4), Application layer protocols (icmp, dns, smtp, pop, ftp, http); Basic concepts of hubs, switches, gateways, and routers. Network security – basic concepts of public key and private key cryptography, digital signature, firewalls. Web technologies: HTML, XML, basic concepts of client-server computing.
__________________ Answered By StudyChaCha Member |
#4
| |||
| |||
![]()
Combined Defence Services Exam is a Civil Services exam conducted by the Union Public Service Commission Here I am providing you the syllabus of the CDS exam CDS Syllabus Details: Union Public Service Commission (UPSC) is going to conducts Combined Defence Services (CDS) Examination for recruitment of various vacancies under Indian Military Academy, Indian Naval Academy, Air Force Academy and Officers Training Academy. The CDS syllabus details is given below. PAPER – 1: ENGLISH: The question paper will be designed to test the candidates’ understanding of English and workmanlike use of words. PAPER – 2: GENERAL KNOWLEDGE: General Knowledge including knowledge of current events and of such matters of everyday observation and experience in their scientific aspects as may be expected of an educated person who has not made a special study of any scientific subject. The Paper will also include questions on History of India and Geography of a nature which Candidate should be able to answer without special study. PAPER – 3: ELEMENTARY MATHEMATICS: Arithmetic:Number System-Natural numbers, Integers, Rational and Real numbers. Fundamental Operations addition, subtraction, multiplication, division, Square roots, Decimal, fractions. Unitary method, time and distance, time and work, percentages, applications to simple and compound interest, profit and loss, ratio and proportion, variation. Elementary Number Theory- Division algorithm. Prime and composite numbers. Tests of divisibility by 2, 3,4,5,9 and 11. Multiples and factors. Factorisation Theorem. H.C.F. and L.C.M. Euclidean algorithm, Logarithms to base 10, laws of logarithms, use of logarithmic tables. ALGEBRA Basic Operations, simple factors, Remainder Theorem, H.C.F., L.C.M. Theory of polynomials, Solutions of quadratic equations, relation between its roots and coefficients (Only real roots to be considered). Simultaneous linear equations in two unknowns-analytical and graphical solutions. Simultaneous linear in equations in two variables and their solutions. Practical problems leading to two simultaneous linear equations or in equations in two Variables or quadratic equations in one variable & their solutions. Set language and set notation, rational expressions and conditional identities, Laws of indices. TRIGONOMETRY Sine x, cosine x, Tangent x when 0 Use of trigonometric tables. Simple cases of heights and distances. GEOMETRY Lines and angles, Plane and plane figures, Theorems on (i) Properties of angles at a Point(ii) Parallel lines, (iii) Sides and angles of a triangle, (iv) Congruency of triangles, (v) Similar triangles, (vi) Concurrence of medians and altitudes, (vii) Properties of angles, sides and diagonals of a parallelogram, rectangle and square (viii) Circles and its properties including tangents and normal, (ix) Loci. MENSURATION Areas of squares, rectangles, parallelograms, triangle and circle. Areas of figures which Can be split up into these figures (Field Book), Surface area and volume of cuboids, lateral surface and volume of right circular cones and cylinders, surface area and Volume of spheres. STATISTICS Collection and tabulation of statistical data, Graphical representation, frequency Polygons, histograms, bar charts, pie charts etc. Measures of central tendency.
__________________ Answered By StudyChaCha Member |