Articles by Team EasyExamNotes

Team EasyExamNotes

Net 15

by

CBSE NET JUNE 2014 PAPER III Assume that a program will experience 200 failures in infinite time. It has now experienced 100 failures. The initial … Read more

Net 14

by

CBSE NET DECEMBER 2011 PAPER II The number of nodes in a complete binary tree of height h (with roots at level 0) is equal … Read more

Net 12

by

CBSE NET DECEMBER 2007 PAPER II The height of a binary tree with ‘n’ nodes in the worst case is  (A)  0(log n)(B)  O(n)(C)  Ω(n … Read more

Net 13

by

CBSE NET JUNE 2014 PAPER III The reverse polish notation equivalent to the infix expression ((A + B) * C + D) / (E + F … Read more

Net 11

by

CBSE NET JANUARY 2017 PAPER III Distance vector routing algorithm is a dynamic routing algorithm. The routing tables in distance vector routing algorithm are updated … Read more

Net 10

by

CBSE NET JANUARY 2017 PAPER III A packet whose destination is outside the local TCP/IP network segment is sent to ………….. (1) File server(2) DNS … Read more

Net 9

by

CBSE NET JAN 2017 PAPER III In link state routing algorithm after construction of link state packets, new routes are computed using: (1) DES algorithm(2) … Read more