Planning to take coaching on Unacademy
http://bit.ly/gate_unacademy
or
https://unacademy.com/
here is a code for 10% off PLUS1BPK1
Telegram Notification Group link:-
https://t.me/joinchat/X5egW_cvdt9kMGY1
Telegram discussion Group link:-
https://t.me/joinchat/VCyGUmVq8RNkMzhl
Downloads resources from here
https://education4fun.com/gate-cse/
Numerical
GATE CSE 2014 Set 1
Consider an undirected graph G where self-loops are not allowed. The vertex set of G is {(i, j): 1 LESS THAN OR EQUAL TO i LESS THAN OR EQUAL TO 12, 1 LESS THAN OR EQUAL TO j LESS THAN OR EQUAL TO 12}. There is an edge between (a, b) and (c, d) if |a − c| LESS THAN OR EQUAL TO 1 and |b − d| LESS THAN OR EQUAL TO 1.The number of edges in this graph is __________.
