Gate Syllabus - Computer science Engineering

Section 1


 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. 21 of 72

 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. 




Comments

Post a Comment

Popular posts from this blog

Show that number of pendant vertices in a binary tree is (n+1)/2 ,where n is the number of vertices in the tree.

Image
The number of vertices of odd degree in an undirected graph is even,(N-1) is even.  Therefore, n is odd. Let p be the number of pendant vertices. 2+p+3(n- p-1) = 2(n-1) or, 3n-2n-3+4 = 2p or, 2p = n+1 or, P = (n+1)/2 Hence, the number of pendant vertices is (n+1)/2. Also, see : 1.)  Graph Theory and Tree 2.)  The Reflection about line yx is.......... 3.)  Prove that a simple graph with n vertices and k components can have at most 1/2(n-k)(n-k-1) edges. 4.)  Show for what condition rotation and scaling are commutative. 5.) Vector in R space 6.) Prove that every tree has at most one perfect matching. 7.)  Prove that every tree with 2 or more vertices is 2-chromatic. 8.)  Show that every Bi-partite graph is 2 chromatic. 9.) Prove that the number of circular permutations of n different objects is (n-1)! . 10.)  State the "Pigeon Hole Principle" and the " Generalised pigeon Hole principle".
Read more

Prove that every tree with 2 or more vertices is 2-chromatic.

Image
Since a tree is connected and has no cycle if one starts coloring any one vertex with a specific color and keeps on coloring every alternate vertex with another color, the entire graph can be colored with only two colors and since there is one and only one path between any two vertices in a tree, no two vertices will have the same color. Hence every Tree with 2 or more vertices is 2-Chromatic.    [Proved]                                                                 FIG (I)                                                                  FIG (II)
Read more

Top 5 websites to learn coding Online

Image
Now, A Days Technology became our Daily Life partner. Sometimes we people are wondering how this page, website, Blog ,Game works .Then,Our Mind  starts searching for Real phenomenon .How this site works ,why this website is different from others,How the widget is different from others ,How e-commerce website works. So, The answer of all of the above is "CODING". Being a programmer ,i think without Coding Digital Word is Nothing. So, you need to learn Coding if you are interested in Digital world. Myths about coding is that It is Hard to Understand & Hard to Write.There is nothing like this.Just you have to do some basic Homework daily and continuation in learning.Learn Coding like a Interesting Puzzle and solve like a "SUDUKO" Game. Let's Start: Kids Section: For kids Go for  Tynker   (Android/IOS) and  Hopscotch   (IPAD) .These sites are the best tutor of kids ,they teach coding in the form of Games & Puzzles.
Read more