GATE

The postorder traversal of a binary tree is 8,9,6,7,4,5,2,3,1. The inorder traversal of the same tree

The postorder traversal of a binary tree is 8,9,6,7,4,5,2,3,1. The inorder traversal of the same tree

Q. The postorder traversal of a binary tree is 8,9,6,7,4,5,2,3,1. The inorder traversal of the same tree is 8,6,9,4,7,2,5,1,3. The height of a tree is the length of the longest path from the root to any leaf. The height of the binary tree above is                                   . Ans: 4 Sol: Given, post-order – 8, 9, 6, […]

The postorder traversal of a binary tree is 8,9,6,7,4,5,2,3,1. The inorder traversal of the same tree Read More »

Let G be a finite group on 84 elements. The size of a largest possible proper subgroup of G is    

Let G be a finite group on 84 elements. The size of a largest possible proper subgroup of G is    

Q. Let G be a finite group on 84 elements. The size of a largest possible proper subgroup of G is                 . Ans: 42 According to Lagrange’s theorem, states that for any finite group G, the order (number of elements) of every subgroup H of G divides the order of G. Therefore, possible subgroups of group on

Let G be a finite group on 84 elements. The size of a largest possible proper subgroup of G is     Read More »

Consider the following statements regarding the slow start phase of the TCP congestion control algorithm

Consider the following statements regarding the slow start phase of the TCP congestion control algorithm

Q. Consider the following statements regarding the slow start phase of the TCP congestion control algorithm. Note that cwnd stands for the TCP congestion window and MSS denotes the Maximum Segment Size. i. The cwnd increases by 2 MSS on every successful acknowledgment. ii. The cwnd approximately doubles on every successful acknowledgement. iii. The cwnd

Consider the following statements regarding the slow start phase of the TCP congestion control algorithm Read More »

In an Entity-Relationship (ER) model, suppose 𝑅 is a many-to-one relationship from entity set E1 to entity set E2

In an Entity-Relationship (ER) model, suppose 𝑅 is a many-to-one relationship from entity set E1 to entity set E2

Q. In an Entity-Relationship (ER) model, suppose 𝑅 is a many-to-one relationship from entity set E1 to entity set E2. Assume that E1 and E2 participate totally in 𝑅 and that the cardinality of E1 is greater than the cardinality of E2. Which one of the following is true about 𝑅? A. Every entity in

In an Entity-Relationship (ER) model, suppose 𝑅 is a many-to-one relationship from entity set E1 to entity set E2 Read More »

The following are some events that occur after a device controller issues an interrupt while process

The following are some events that occur after a device controller issues an interrupt while process

Q. The following are some events that occur after a device controller issues an interrupt while process L is under execution. P. The processor pushes the process status of L onto the control stack. Q. The processor finishes the execution of the current instruction. R. The processor executes the interrupt service routine. S. The processor

The following are some events that occur after a device controller issues an interrupt while process Read More »

Let N be an NFA with n states. Let k be the number of states of a minimal DFA which is equivalent to N

Let N be an NFA with n states. Let k be the number of states of a minimal DFA which is equivalent to N

Q. Let N be an NFA with n states. Let k be the number of states of a minimal DFA which is equivalent to N. Which one of the following is necessarily true? (A) 𝑘 ≥ 2𝑛                  (B) 𝑘 ≥ 𝑛                   (C) 𝑘 ≤ 𝑛2                  (D) 𝑘 ≤ 2𝑛 Ans: 𝑘 ≤ 2𝑛

Let N be an NFA with n states. Let k be the number of states of a minimal DFA which is equivalent to N Read More »

Scroll to Top