Hi Everyone,

While preparing for Gate , I found some really helpful tables which consolidate lot of information at one place.

two such links are 

https://gatecse.in/grammar-decidable-and-undecidable-problems/

https://gatecse.in/closure-property-of-language-families/

Although we can not by heart these table without understanding meaning of each entry,  but many time such table saves lots of  time spent on searching . and consolidate all  information at one place.

Does anyone have such more table , on any of subject of gate computer science ?

Please post link, it will be really helpful

posted in Useful Links Sep 4, 2018 edited Sep 6, 2018 by
3,779 views
23
Like
4
Love
1
Haha
0
Wow
0
Angry
0
Sad

20 Comments

20 Comments

Like
1
These tables are very handy and time-saving in actual GATE exam because every year 1 or 2 marks questions are being asked in GATE from these tables
edited Sep 8, 2018 by
Like
3

Please verify this

 

 

 

 

 

 

Like
1
If I get more tables, I will post it here.
Like
1

This is incomplete though

edited Sep 8, 2018 by
Like
31

CIRCUIT SWITCHING VS PACKET SWITCHING

If you find any mistake in this,please tell.

Like
21

Process Vs Thread

Like
52

If you find any mistake in this, please tell.

Like
4

If you find any mistake in this, please tell.

Like
2

If you find any mistake in this, please tell.

Like
2
@Balaji Thanks for such huge amount of information.

I am not qualified person to verify these table, But Lets hope GO user's will definitely help us to validate these table .
Like
thanks balaji
Like
Will post an edited table. It is difficult to read.
Like
1

http://bigocheatsheet.com/

Like

RISC vs CISC .

Most of differences are obvious ,but some are not 

Like
there was one post of all the decidable and undecidable language such as state entry and all in one post...im not able to find that ..can some one please put the link of that also
Like

https://gatecse.in/identify-the-class-of-a-given-language/ .This link can also be useful.

Like

https://www.cs.rice.edu/~nakhleh/COMP481/final_review_sp06_sol.pdf. All about undecidable and decideable  languages.