Net 14
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 moreNet 12
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 moreNet 13
CBSE NET JUNE 2014 PAPER III The reverse polish notation equivalent to the infix expression ((A + B) * C + D) / (E + F ...
Read moreNet 11
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 moreNet 10
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 moreNet 9
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 moreUSE CASE for MCQ application
USE CASE DIAGRAM FOR MCQ APPLICAITON:
Read moredfd LEVEL O FOR mcq
DFD LEVEL 0 FOR MCQ APPLICATION:
Read moreFlow Chart For MCQ
FLOWCHART FOR MCQ APPLICATION:
Read moreNet 9
CBSE NET JUNE 2012 PAPER III If two fuzzy sets A and B are given with membership functions μA(x) = {0.2, 0.4, 0.8, 0.5, 0.1} ...
Read more