Time Left - 12:00 mins
BARC CS 2018 MiniMock Quiz -3
Attempt now to get your rank among 502 students!
Question 1
Consider the following statements regarding binary tree.
1). A tree with n nodes has (n – 1) edges.
2). A labelled and rooted binary tree can be uniquely constructed given its post-order and pre-order traversal results.
3). The maximum number of nodes in a binary tree of height (depth) h is (2h+1 –1).
4). A complete binary tree with n internal nodes has (n +1) leaves.
Which of the statements given above are correct?
1). A tree with n nodes has (n – 1) edges.
2). A labelled and rooted binary tree can be uniquely constructed given its post-order and pre-order traversal results.
3). The maximum number of nodes in a binary tree of height (depth) h is (2h+1 –1).
4). A complete binary tree with n internal nodes has (n +1) leaves.
Which of the statements given above are correct?
Question 2
Which among the following is the correct header length of IPv6 datagram?
Question 3
Effective address is calculated by adding or subtracting displacement value to
Question 4
Given the following instance of a relation
Which of the following FDs is satisfied by the relation?
Which of the following FDs is satisfied by the relation?
Question 5
The number of elements in the power set of the set {{A,B},C} is
Question 6
Which of the following item is not a part of Process Control Block (PCB)?
Question 7
If the functions W, X, Y and Z are as follows
Then which are equivalent?
Question 8
If L and 
are recursively enumerable then L is
are recursively enumerable then L is Question 9
Which of the following class of statement usually produces no executable code when compiled?
Question 10
During detailed design which of the following activities take place?
- 502 attempts
- 2 upvotes
- 12 comments
Tags :
GATE & PSU CSGeneralApr 8GATE & PSU CS
