bikram
@bikram
Posts made by bikram

Automata  what to read
Automata
Syllabus:
Regular expressions and finite automata. Contextfree grammars and pushdown automata. Regular and contexfree languages, pumping lemma. Turing machines and undecidability.
1. What Books to read :
Book Name :
1 Peter Linz  An Introduction to Formal Languages and Automata : 3rd edition , chapter 1 to 12
2 Daniel I A Cohen  Introduction to Computer Theory , chapter 1 to 31
3 John C Martin  Introduction to Languages and The Theory of Computation : 4th Edition , chapter  1 to 9Video : NPTEL IITK  https://www.youtube.com/playlist?list=PLbMVogVj5nJSd25WnSU144ZyGmsqjuKr3
Sai Simonson  https://www.youtube.com/playlist?list=PL601FC994BDD963E4
2. What To read : Topics for that subject to read along with Chapter Subparts : ** marked parts are important for problems
**1 Regular expressions Linz Chapter  3  3.1, 3.2, 3.3 / Cohen  Chapter : 3 , 4 / Martin  3.1 to 3.5
**2 finite automata Linz Chapter  2 2.1, 2.2, 2.3,2.4 / Cohen  Chapter : 5, 6, 7, 8, 9 / Martin  2.1 to 2.6
**3 Contextfree grammars Linz Chapter  5 : 5.1 , 5.2, 5.3 , Chapter 6  6.1, 6.2 / Cohen  Chapter : 13 ,14,15,16 / Martin : 4.2
** 4 pushdown automata Linz Chapter  7 : 7.1, 7.2, 7.3 / Cohen  Chapter : 17 and Chapter : 18 / Martin : 5.1 to 5.5
**5 Regular Language Linz Chapter  4 : 4.1, 4.2, 4.3 / Cohen  Chapter : 10 , 11, 12 / Martin : 3.1, 4.3
6 contexfree languages Linz Chapter  8.2 / Cohen  Chapter : 19 , Chapter : 21 , 22, 23 / Martin 4.1, 4.2, 4.4, 4.5
7 pumping lemma Linz Chapter  8.1 / Cohen  Chapter : 20 / Martin  6.1 to 6.3
** 8 Turing machines Linz Chapter  9 : 9.1 , 9.2, 9.3 , Chapter 10 , chapter 11 / Cohen  Chapter : 24, 25, 26 , 27 / Martin 7.1 to 7.8 , 8.1 to 8.5
9 undecidability Linz Chapter  12 : 12.1 to 12.4 / Cohen  Chapter : 28, 29, 30, 31 / Martin 9.1 to 9.5
3. Types of problems from where questions came previous years : RE and FA
Finite Automata covers approximately 50% questions from TOC. So give it more time then others.
• Minimization of finite Automata , Closure Properties of finite automata .
• Finding minimum number of states, NFA to DFA conversion, Finding Regular Expressions, mealy moore machine .
• Regular Expression identification.
• Construction of finite Automata from regular Expression
• Generation of regular expression from finite Automata
• Equivalence of regular Expression
CFG and PDA
• In Context free grammer practice more on simplification of CFG, pushdown automata, closure properties etc.
Regular and Context Free Languages
• closure properties of regular language
• Decidability of regular Language
• Whether the given language is regular or not
• Do problems on finding category of any language or grammar.
• Concepts related to expressive power of different languages.
Turing Machine and Undecidability
• Basic problems related to NPCompleteness. Properties of Recursive and Recursive Enumerable Languages.
• Turing Machine making and expressive power of different type of turing machine. (also useful for interview ) .

Web Sites For IT Training Programming, Web Development, Networking
Web Sites For IT Training
Programming, Web Development, Networking
and More
 www.codecademy.com
 www.lynda.com
 www.udemy.com
 www.udacity.com
 www.coursera.org
 www.w3schools.com
 www.thenewboston.org
 www.programmr.com
 www.codeavengers.com
 www.codeschool.com
 www.learnstreet.com
 www.teamtreehouse.com
 www.sqlzoo.net
 www.codehs.com
 www.teamtreehouse.com
 www.html5rocks.com
 www.codepen.io
 www.sitepoint.com
 www.tutorialspoint.com
 www.javatpoint.com
 www.cplusplus.com
 www.learncpp.com
 www.tutorialspoint.com
 www.cprogramming.com
 www.stackoverflow.com
 www.learncodethehardway.org
 www.bloc.io
 www.howtocode.io
 www.edx.org
 www.instructables.com
 www.developer.apple.com
 www.developer.android.com
 www.developers.google.com
 www.developer.mozilla.org
 www.msdn.microsoft.com
 www.dev.opera.com
 www.www.developphp.com
 www.quackit.com
 www.htmlite.com
 www.siteduzero.com
 www.dreamincode.net
 www.phpbuddy.com
 www.php.net
 www.microsoftvirtualacademy.com
 www.professormesser.com .
Photoshop and Graphics
 www.adobe.com
 www.adobeknowhow.com
 www.pixel2life.com
 www.photoshopessentials.com
 www.photoshoptutorials.deviantart.com
 www.phlearn.com
 www.design.tutsplus.com
 www.practicalphotoshopmag.com
 www.tutorial9.net
 www.pshero.com
 www.psdlearning.com
 www.alison.com
Programing and Other IT Projects
 www.freeprojectscode.com
 www.sourcecodesworld.com
 www.freecode.com
 www.codeproject.com
 www.freestudentprojects.com
 www.programmersheaven.com
 www.code.google.com
 www.planetsourcecode.com
 www.dzone.com
 www.thefreecountry.com
 www.sourceforge.net
 www.creately.com/diagramexamples
 www.freewebsite.com
Photoshop and Graphics
 www.adobe.com 2. www.adobeknowhow.com 3. www.pixel2life.com 4. www.photoshopessentials.com 5. www.photoshoptutorials.deviantart.com 6. www.phlearn.com 7. www.design.tutsplus.com 8. www.practicalphotoshopmag.com 9. www.tutorial9.net 10. www.pshero.com 11. www.psdlearning.com 12. www.alison.com .
.
Programing and Other IT Projects
 www.freeprojectscode.com 2. www.sourcecodesworld.com 3. www.freecode.com 4. www.codeproject.com 5. www.freestudentprojects.com 6. www.programmersheaven.com 7. www.code.google.com 8. www.planetsourcecode.com 9. www.dzone.com 10. www.thefreecountry.com 11. www.sourceforge.net 12. www.creately.com/diagramexamples 13. www.freewebsitetemplates.com 14. www.templatemo.com 15. www.oswd.org 16. www.designrazzi.net/2014/freecss3html5 templates 17. www.html5up.net 18. www.freehtml5templates.com 19. www.themesbase.com/WordPressTemplates 20. www.templaty.com 21. www.arbloggertemplates.com 22. www.templates.ssdaa.com .

Digital Logic (What to read series)
#What_to_read_Digital
Digital LogicBook: Digital Design  Morris M Mano , 3rd edition
Video Lectures 
IITM S srinivasan [1 to 30 only cover gate syllabus ] https://www.youtube.com/playlist?list=PL803563859BF7ED8CNptel Mooc  IITM https://onlinecourses.nptel.ac.in/noc15_ec01/preview ,
https://www.youtube.com/playlist… What to read ? Syllabus to cover for that particular subject .
Boolean algebra. Combinational and sequential circuits. Minimization. Number representations and computer arithmetic (fixed and floating point).
 From where to read ? Chapter subparts to read from standard text book.
Boolean algebra : ~chapter 2 2.1 to 2.8
Laws of Boolean algebra, Theorems of Boolean algebra, Switching functions, Methods for specification of switching functions  Truth tables and Algebraic forms, Realization of functions using logic gates.
Combinational and sequential circuits
1 Design of Combinational Logic Circuits: ~ chapter 4  4.1 to 4.9
Gate level design of Small Scale Integration (SSI) circuits,
Modular combinational logic elements  Decoders, Encoders, Priority encoders, Multiplexers and Demultiplexers.Design of Integer Arithmetic Circuits using Combinational Logic: (Application ) ~ chapter 5  5.1 to 5.9
Integer adders  Ripple carry adder and Carry look ahead adder, Integer subtractors using adders,
Unsigned integer multipliers  Combinational array circuits,
Signed integer multipliers  Booth's coding, Bitpair recoding, Carry save addition and Wallace tree multiplier, Signed integer division circuits  Combinational array circuits, Complexity and propagation delay analysis of circuits.2 Sequential Circuit Elements: ~ chapter 6  6.1 to 6.8
Latches RS latch and JK latch, FlipflopsRS, JK, T and D flip flops, Masterslave flip flops, Edgetriggered flipflops.
Analysis and Design of Synchronous Sequential Circuits:
Models of sequential circuits  Moore machine and Mealy machine,
Flipflops  Characteristic table, Characteristic equation and Excitation table,
Analysis of sequential circuits Flipflop input expressions, Next state equations, Next state maps, State table and State transition diagram,
Modular sequential logic circuits Shift registers, Registers, Counters and Random access memories, Design of Arithmetic Circuits using Sequential Logic : ~chapter 7  7.1 to 7.9Serial adder for integers, Unsigned integer multiplier, Unsigned integer division circuits, Signed integer division, Floatingpint adder/subtractor  Design of control circuit, Floating  point multiplier. Introduction to digital computer :~chapter 9  9.1 to 9.8
 Design of Arithmetic circuits – Adders, Multipliers
 Design of Memory – ROM/RAM
Minimization: (Simplification of Boolean Expressions and Functions ) ~ chapter 3  3.1 to 3.11
Algebraic methods, Canonical forms of Boolean functions, Minimization of functions using Karnaugh maps, Minimization of functions using QuineMcClusky method.
Number representations and computer arithmetic (fixed and floating point) ~ chapter 1  1.1 to 1.9
Number systems and codes  ( Binary, octal and hexadecimal number systems; Methods of base conversions; Binary, octal and hexadecimal arithmetic )
Representation of unsigned and signed integers, Fixedpoint representation of real numbers, Floatingpoint representation of real numbers,
3 . Types of problems generally comes from that chapter.
1 . Practice KMap minimization. SOP, POS , Don't care representation
 Practice Multiplexer, Demultiplexer, Encoder, Decoder questions.
 Understand concept of flip flop. They are given and modulas of counter is asked.
 Practice questions related to Floating Point representation, integer representation, ieee format, range and precision.
 A Truth table is given , what function does it represent .
 4 input multiplexer 4 to 1 , determine the output F 2010,2014
 Jk flip flop state sequence 2014 , 2015
 Calculate the propagation delay in flip flops
 minimum no of gates required to implement the given boolean function 2009, 2004
 a sequence is given and you have to find out minimum number of jk flip flip require to implement the counter 2016 , 2015
 counter  2011, 2007, 2004, 2014
important flip flops  JK , D, T , RS type of flip flops

What to read series
Operating System
Syllabus:
Processes, threads, interprocess communication, concurrency and synchronization. Deadlock. CPU scheduling. Memory management and virtual memory. File systems.1. What Books to read :
Book Name :
1 Operating System Concepts By Galvin 7th Edition , Chapter  1 , 2, 3, 4, 5, 6, 7, 8 , 9, 10 , 11, 12
2 Operating Systems Internals and Design Principles By William Stalling , 5 Ed, Chapter 3 , 4, 5 , 6, 9, 7 , 8 , 12
3 Modern Operating System By Andrew S Tanenbaum 3 rd Edition , Chapter 2 , 3 , 4, 6 completely have to readVideo  P k Biswas ( Scheduling, Deadlock part is well explained) , Lecture No  1 to 29
IISc  T Mathew Jacob ( best for process, IPC, Concurrency, memory & VM, Files and storage ) Lecture Number  12 , 13, 14, 15, 16,17,18,19,20 , 34 , 35
https://www.youtube.com/playlist?list=PL2F82ECDF8BB71B0C2. Topics for that subject to read along with Chapter Subparts : ** marked parts are important for problems
Processes : Galvin Chapter  3 ( 3.1, 3.2, 3.3 ) / Stalling Chapter 3 ( 3.1, 3.2, 3.3, 3.4 )
Threads : Galvin Chapter  4 ( 4.1, 4.2, 4.4, 4.5 ) / Stalling Chapter 4 ( 4.1, 4.2 )
Interprocess communication : Galvin 3.4 , 3.5 , 3.6
** Concurrency and synchronization : Galvin Chapter  6 ( 6.1, 6.2, 6.3, 6.5, 6.6, 6.7, 6.8, 6.9) / Stalling Chapter 5 ( 5.1, 5.2, 5.3, 5.4, 5.5, 5.6 ) This chapter is better written than Galvin
** Deadlock : Galvin Chapter  7 ( 7.1, 7.2, 7.3, 7.4, 7.5, 7.6, 7.7 ) / Stalling Chapter 6 ( 6.1, 6.2, 6.3, 6.4, 6.6 )
** CPU scheduling: Galvin Chapter  5 ( 5.1, 5.2, 5.3, 5.4, 5.5, 5.7 ) / Stalling Chapter 9 ( 9.1, 9.2 )
** Memory Management : Galvin Chapter  8 ( 8.1, 8.2, 8.3, 8.4, 8.5, 8.6 ) / Stalling Chapter 7 ( 7.1, 7.2, 7.3, 7.4 )
** Virtual memory : Galvin Chapter  9 ( 9.1, 9.2, 9.4, 9.5, 9.6, 9.7, 9.8) / Stalling Chapter 8 ( 8.1, 8.2 ) well written in stalling
** File systems: Galvin Chapter  10 ( 10.1, 10.2, 10.3, 10.5 ) / Stalling Chapter 12 ( 12.1, 12.2, 12.4, 12.6 )
Chapter  11( 11.1, 11.2, 11.4, 11.5, 11.6 )
** Chapter 12.2, 12.3, 12.4 , 12.5, 12.73. Types of problems from where questions came previous years :
• Scheduling : Numerical Questions have more chances. Practice more in finding turn around time and waiting time of different scheduling policies.
• Deadlock : Bankers Algo, Given Sequence is safe or not. Chances of common data or linked questions.
• Concurrency and Synchronization : High Probability Of Questions in exam. Practice some question related to semaphores and classical problems of synchronization
(this will help you to solve other questions), Mutual Exclusion case using P and V , Critical section problem.
• Memory Management : Questions generally comes from page table size, number of pages, logical address, physical address, page size, inverted page table, virtual memory, TLB etc.• File systems: algorithms for disk scheduling

RE: How to prepare Verbal ability for GATE Exam
Verbal Ability:
Syllabus  English grammar, sentence completion, verbal analogies, word groups, instructions, critical reasoning and verbal deduction.
Types of Problems came in Previous Years :

Antonym, Synonym [ English grammar part ],

Given a sentence and i have to fill in with appropriate word [Sentence completion part ]

Same or different pairs of words [ Verbal Analogy part ] ,

Analogy of words , Ordering of words/ ordering of sentences , Odd one out from a group of words [ Word groups part ] ,

Summary or Logical meaning from a passage /sentence, Given a problem sequence you have to satisfy a condition [ instructions , critical reasoning part ]

A sentence is given in english and you have to select the logical meaning of this sentence in a single word [ Verbal deduction part ]
Now it is better to practice Problems on these Types from previous Year Gate papers starting from 2010 ( this year Apti is introduced) .
GRE Barron book ( lots of examples are there in this book for each of these types ) .Numerical Ability
Syllabus : Numerical computation, numerical estimation, numerical reasoning and data interpretation.
Types of problems needs to practice :
Problems on time and work, distance, Data Interpretation ( imp) , Number system, percentages, clocks, coding and decoding, Venn Diagram, cubes, blood relation, Directions, Number odd man out, Boats and pipes etc.Book:
 Quantitative Reasoning –By R.S. Agarwal


What to read series ( Compiler Design )
Syllabus:
Lexical analysis, parsing, syntaxdirected translation. Runtime environments. Intermediate code generation.Book Aho sethi Ullman
These are chapters from this book to read
chapter 1 complete
chapter 2 complete
chapter 3  3.1, 3.2, 3.3, 3.4 , 3.5
chapter 4  4.1, 4.2, 4.3, 4.4 to 4.9  4.4 first and follow  complete chapter to read
chapter 5  5.1, 5.2, 5.3 , 5.4, 5.5
chapter 6  6.1, 6.2, 6.6 , 6.7
chapter 7  7.2 ,7.3, 7.4Types of problems comes in exam:
1 . 3 address code : [ minimum number of temporary variables ] constructing 3 address code for an expression 6.2
2 Abstract Syntax tree  from syntax directed translation 5.3
3 Control flow graph no of nodes and edges from Intermediate code generation 6.6 [ CFG not in syllabus ]

Finding First and Follow 4.4

Parsing : there is always a question related to parsing. You need to practice all parsing technique because there is also chances for linked questions.
4.4 4.9 
lexical analysis

Finding internal node in syntaxdirected translation 5.4, 5.5

finding first and follow,

Number of token generated 3.3 ,3.4

a grammer is given , you have to find : 4.4  4.7
LL(1)LR(1)SLRLALRCLR. 
Precedence and Associativity of operators. 4.8, 4.9
12• Finding value from expression tree. 2.8 , 6.1
13• Ambiguous grammar 4.3
http://nptel.ac.in/courses/106104123
By Prof S k Agarwal
For Gate lec no 2, 4 to 27
Lecture 1  History and Overview of the subject compiler design
Lecture 2  Overview of Different Steps Lexical Analysis to Code Generation
Lecture 3  Discussion about different phases and Issues related to compiler design
Lecture 4  Lexical AnalysisLecture 5  LA: Generation and Recognition of tokens
Lecture 6  Lex and Syntax analysis
Lecture 7  SA  Parse Tree , AmbiguityLecture 8  Top Down parsing First & Follow
Lecture 9  Bottom Up parsing , shift reduce parsing , Handle pruningLecture 10  Intro to LR parsing, simple LR
Lecture 11  construction of Simple LR parse table from grammar
Lecture 12  Canonical LR parse (1), construction of LR(1) items , Canonical LR
Lecture 13  Constract LALR Parsing table , parser generator
Lecture 14 Syntax directed Translation , Attribute grammar
Lecture 15  L Attributed Definition
Lecture 16  Application of syntax directed translation
Lecture 17  syntax directed translation schemes
Lecture 18  Elimination of left recursion from SDT
Lecture 19  Type conversion in Intermediate code generationLecture 20  Three Address Code
Lecture 21  3 address code, types and declaration
Lecture 22  Declaration, storage layout
Lecture 23  Translation of expression , control flow
Lecture 24  control flow, short circuit code
Lecture 25  Run time Environment  Activation record
Lecture 26  calling sequence
Lecture 27  Heap management
Lecture 28  Code generation and Instruction Selection , Next use information
Lecture 29  DAG representation of basic blocks
Lecture 30  Peephole Optimization


What to read series ( Computer Networks )
Computer Networks
1. What Books to read :
Book Name :

Computer Networking: A TopDown Approach (1st Edition) by Kurose and Ross

Andrew S Tanenbaum  Computer networks , 4th edition

Behrouz A. Forouzan  Data Communications And Networking , 4th edition
2. Topics for that subject to read along with Chapter Subparts : ** marked parts are important for problems
Concept of layering  Kurose & Ross chapter 1.7 / Andrew S Tanenbaum chapter  1.4
LAN technologies (Ethernet)  Kurose & Ross chapter 5.2.3 , 5.5(5.5.3) / Andrew S Tanenbaum chapter  4.3
** Flow and error control techniques  Kurose & Ross chapter 3.4.2 3.5.6[ flow control], 5.1, 5.2 / Andrew S Tanenbaum chapter  3.1, 3.3.2, 3.4 [ Flow ] 3.2 [ error]
switching  Kurose & Ross chapter 1.4 / Andrew S Tanenbaum chapter  2.5.5
** IPv4/IPv6  Kurose & Ross chapter 4.4, 4.7 / Andrew S Tanenbaum chapter  5.6.1, 5.6.2, ( IPv4) 5.6.8 (IPv6)
routers  Kurose & Ross chapter 4.6 / Andrew S Tanenbaum chapter  5.1.3, 5.1.4
** routing algorithms (distance vector, link state)  Kurose & Ross chapter 4.2 / Andrew S Tanenbaum chapter  5.2.1, 5.2.2, 5.2.3, 5.2.4 (DV), 5.2.5(link state),
TCP/UDP and sockets  Kurose & Ross chapter 3.3, 3.5 (sockets  2.6,2.7) / Andrew S Tanenbaum chapter  6.1.3(sockets) , 6.4.1(udp), 6.5.1,6.5.2,6.5.3,6.5.4,6.5.5, 6.5.6, 6.5.8
** congestion control  Kurose & Ross chapter 3.6, 3.7 / Andrew S Tanenbaum chapter  5.4.2 [leaky & token]
Application layer protocols (DNS, SMTP, POP, FTP, HTTP)  Kurose & Ross chapter 2.1, 2.2, 2.3, 2.4 / Andrew S Tanenbaum chapter  7.1,7.2,7.3
Basics of WiFi  Kurose & Ross chapter 6.1,6.2,6.3 (5.7 in old version) / Andrew S Tanenbaum chapter  4.4
Network security: authentication  Kurose & Ross chapter 7.3 / Andrew S Tanenbaum chapter  8.7
** basics of public key and private key cryptography  Kurose & Ross chapter ( Asymetric key cryptography) 7.2 / Andrew S Tanenbaum chapter  8.3
digital signatures and certificates  Kurose & Ross chapter 7.5 / Andrew S Tanenbaum chapter  8.4.2 , 8.5.1
firewalls  Kurose & Ross chapter 8.5 / Andrew S Tanenbaum chapter  8.6.2
3. From where to read ? to read from standard text book :
Computer Networking: A TopDown Approach (1st Edition) by Kurose and Ross [ Chapter 1 to 5 ]
[ chapter 6 (basics of wifi)  6.1, 6.2 , 6.3 ] [ chapter 8  security in computer networks ]AN Tanenbaum  chapter 1,2,3,4,5,6,7,8
4 . Types of problems from where questions came previous years :• • • • Important Types :
• Addressing related questions :: Subnet address, supernet address, brodcast address, range of network, no of host, classless addressing, non continuous addresses, first host and last host finding etc.
• Properties Of Circuit Switching and packet switching, Routing Protocols and Numerical Problems on them.
• Flow Control and Error Control Policies.
Numerical Problems on Window Size [ sliding window protocols ] , No Of Sequence bits, frame size, bandwidth, round trip time, utilization, Hamming Distance, CRC.
selective repeat [2016] , stop n wait [2016] , go back n[2008]  flow control .• Congestion Control policies like slow start, congestion avoidence and Congestion Detection. Token bucket [2016]
• IP Header , TCP and UDP header format, theory related to Ethernet . csma/cd
• Basics Of Different Type of protocols like : FTP, HTTP, DHCP, ARP, RARP, SMTP, ICMP,POP .
• Basic Concepts of Cryptography and firewalls.


What to read series  C Programming
#C_Programming_What_To_Read
C Programming Language :
Syllabus : ( As per old syllabus)
Programming in C; Functions, Recursion, Parameter passing, Scope, Binding .
1 What Books To Read :
Book Name :
1 K N King : 2nd edition
Chapter  1 to 14 , chapter 17 and 18
chapter 8, 9 , 10, 11, 12 are very important for gate exam purpose .2 Dennis M Ritchie : 2nd edition
Chapter 1 to 6Video: NPTEL MOOC IITK CS 101 programming in C https://onlinecourses.nptel.ac.in/iitk_cs_101/preview
Youtube Link > https://www.youtube.com/playlist… Important Topics for that subject to read along with Chapter Subparts :
Function K N King Chapter  9 : 9.1, 9.2 / Dennis Ritchie : chapter 4  4.1, 4.2
Recursion K N King Chapter  9.6 / Dennis Ritchie : chapter 4 4.10
Parameter Passing K N King Chapter  9.3 , 9.4, 9.5 / Dennis Ritchie : chapter 1 1.8
Scope K N King Chapter  10: 10.1 to 10.4 / Dennis Ritchie : chapter 4 4.3 to 4.7
Binding K N King Chapter  10.5 / Dennis Ritchie : chapter 4  4.8 , 4.9
Pointer K N King Chapter  11: 11.1 to 11.5 , Chapter 17 : 17.1 to 17.8 / Dennis Ritchie : chapter 5  5.1 to 5.5
Array  1D array K N King chapter 8  8.1 , 2 D Array 8.2 , 8.3
Pointers and Arrays K N King Chapter  12: 12.1 to 12.5 / Dennis Ritchie : chapter 5  5.6 to 5.9
3 . Types of problems from where questions came in previous years :
C programming Questions are logical and mostly based on finding outputs which contain some pointers, static variables, arrays, strings, functions etc.
Important Topics are:
Pointer
Array 1D and 2D Array
Array row and column major order
memory location sums
1D, 2D array location sums
moving no of memory locations based on given program
pointers and arrays
switch statement
passbyvalue, passbypointer/ reference
global initialization
typecasting
short circuit rule
array to pointer conversion on function call
Register variable
String literals
Loop inveriantscope :  static and dynamic scoping,
Binding,
Function ,
Recursion,
parameter passing .A small NOTE for GATE Exam purpose > "C" is included in GATE syllabus as one language for checking programming compatibility not to see if a student is master in C. For the same
reason, GATE COMMITTEE don't ask questions related to C library functions or anything too specific to C. So, GATE C portions are always from a small subset of C.The best way to practice C programming question is take questions from previous year Gate papers and try to solve them and try to do programming on Compiler.
It will increase your skills and accuracy. 
What to read series  Discrete Math
Discrete Mathematics and Engineering Mathematics:
Syllabus
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.
1. What Books to read :
1 Kenneth H Rosen 7 th Ed.  Chapter 1,2 and 6 , 8, 9 , 10 ( 10.4, 10.5, 10.8)
2 Susanna S Epp  Discrete Mathematics with Applications : Chapter 2 , 3, 6, 7, 8 , 9
3 Erwin Kryszig  9th edition Chapter 7.1 to 7.7 , 8.1 to 8.3 , 20.2
4 Narsingh Deo  Chapter 25, 26, 45, 81, 82, 84, 86
5 Sheldon Ross  Chapter 1,2,3, 4 [exclude 4.8] ,5 [ exclude 5.6 ]
"Optional :
6 KolmanBusbyRoss  Group and Semigroup  9.1 to 9.5
7 Ralph P Grimaldi  Discrete & Combinatorial Math  Ring : 14.1 and 14.2 "
Video : IITM Discrete  https://www.youtube.com/playlist?list=PL0862D1A947252D20LU Decomposition  https://www.youtube.com/watch?v=gA7m5lttIcU , this is the first video which need to be watched then shortcut ,finally system of equations video have to watch.
LA and calculus  video  https://www.youtube.com/playlist?list=PLx5CT0AzDJCmqjbTWbWCwzanbZwWQ_b18
2. Topics for that subject to read along with Chapter Subparts :
Propositional and first order logic  Rosen Chapter 1  1.1 to 1.6
Propositional Logic  Page 1 to 12. page 16 and 17
Propositional Equivalences  Page 25 to 31
Predicates and Quantifiers  page 37 to 49
Nested Quantifiers  page 57 to 63
Rules of Inference  page 69 to 78Sets  Rosen Chapter 2 : 2.1 , 2.2
relations  Rosen Chapter 9 , 9.1 to 9.5
functions  Rosen Chapter 2.3
partial orders and lattices  Rosen Chapter 9.6
Groups : GROUP, Abelian Group, SEMIGROUP, MONOID, RING, INTEGRAL DOMAIN, FIELD from IITM Kamala Madam video lectures 35, 36, 37
Graphs : connectivity, matching, coloring is there in syllabus
From Rosen  connectivity, euler and hamilton paths , coloring is in chapter 10  10.4, 10.5, 10.8
From narsingh deo Chapter no 2  25, 26, Chapter no 4  45 [ connectivity] , Chapter no 8  81, 82, 84, 86 , so 4 color theorem , Independent set is imp from graph coloring.Counting, recurrence relations, generating functions  Rosen Chapter 6 and Chapter 8
Linear Algebra : Erwin Kryszig  9th edition Chapter 7.1 to 7.7 , 8.1 to 8.3 , video  https://www.youtube.com/playlist?list=PLx5CT0AzDJCmqjbTWbWCwzanbZwWQ_b18
Calculus : mean value theorem page 402 Kreyszig , and also from above video link
Probability : A first course in probability ~ Sheldon Ross,8th edition, chapter 1,2,3, 4 [exclude 4.8] ,5 [ exclude 5.6 ]
3. Types of problems from where questions came previous years :
 Simple problems on logic.

Sets Related Questions. Properties of relation, function. Partial and Total Ordering.

Hasse Diagrams, Group Theory.

Different types of graph and there properties : vertex and edge connectivity , separable graph , kconnected graph , connected component, matching , graph coloring ( 4 color theorem ) ,
Euler and Hamiltonian Graphs , konigsberg Bridge problem, Independent set of vertices , chromatic number are important . 
Tricky Problems on Permutations and Combinations. Pigeonhole principle.

LA : Eigen values and eigen vectors question. Simple questions related to matrix.

LA : Finding Values of variable with some properties of linear equations like infinite no of solutions or unique solution.

Calculus : Finding Maxima and Minima. Properties of limit, Continuity and differentiability. Finding values by Mean Value Theorem. Integration.

For probability questions You need to practice Bays theorem, Normal and poisson distribution, mean and variance of different distributions , standard deviaton .