1
GATE CSE 1987
Subjective
+2
-0
Find a solution to the following recurrence equation
T(n) = T(n - 1)+ n
T(1) = 1
2
GATE CSE 1987
MCQ (Single Correct Answer)
+2
-0.6
In a circular linked list organization,insertion of a record involves modification of :
A
One Pointer
B
One Pointer
C
Multiple pointers
D
No pointer
3
GATE CSE 1987
True or False
+1
-0
If the no of leaves in a tree is not a power of 2,then the tree is not a binary tree.
A
TRUE
B
FALSE
4
GATE CSE 1987
True or False
+1
-0
It is possible to construct a binary tree uniquely whose pre-order and post-order traversals are given.
A
TRUE
B
FALSE
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12