Gate Exam

In a binary tree with n nodes, every node has an odd number of descendants. Every node is considered to be its own descendant. What is the number of nodes in the tree that have exactly one child?
option
(A) 0
(B) 1
(C) (n-1)/2
(D) n-1

Read Solution (Total 0)

Gate Other Question

Consider the following table of arrival time and burst time for three processes P0, P1 and P2. Process Arrival time Burst Time
P0 0 ms 9 ms
P1 1 ms 4ms
P2 2 ms 9ms
The pre-emptive shortest job first scheduling algorithm is used. Scheduling is carried out only at arrival or completion of processes. What is the average waiting time for the three processes?
option
(A) 5.0 ms
(B) 4.33 ms
(C) 6.33 ms
(D) 7.33 ms Which data structure in a compiler is used for managing information about variables and their attributes?
(A) Abstract syntax tree
(B) Symbol table
(C) Semantic stack
(D) Parse table