Question 1 |

Suppose that L_1 is a regular language and L_2 is a context-free language. Which one of the following languages is NOT necessarily context-free?

L_1\cap L_2 | |

L_1\cdot L_2 | |

L_1 - L_2 | |

L_1\cup L_2 |

Question 1 Explanation:

Question 2 |

Let P be an array containing n integers. Let t be the lowest upper bound on the number of comparisons of the array elements, required to find the minimum and maximum values in an arbitrary array of n elements. Which one of the following choices is correct?

t \gt 2n-2
| |

t \gt 3\lceil \frac{n}{2}\rceil \text{ and } t\leq 2n-2 | |

t \gt n \text{ and } t\leq 3\lceil \frac{n}{2}\rceil | |

t \gt \lceil \log_2(n)\rceil \text{ and } t\leq n |

Question 2 Explanation:

Question 3 |

Consider the following three functions.

f_1=10^n\; f_2=n^{\log n}\;f_3=n^{\sqrt {n}}

Which one of the following options arranges the functions in the increasing order of asymptotic growth rate?

f_1=10^n\; f_2=n^{\log n}\;f_3=n^{\sqrt {n}}

Which one of the following options arranges the functions in the increasing order of asymptotic growth rate?

f_3, f_2, f_1 | |

f_2, f_1, f_3 | |

f_1, f_2, f_3 | |

f_2, f_3, f_1 |

Question 3 Explanation:

Question 4 |

Consider the following statements.

S1: The sequence of procedure calls corresponds to a preorder traversal of the activation tree.

S2: The sequence of procedure returns corresponds to a postorder traversal of the activation tree.

Which one of the following options is correct?

S1: The sequence of procedure calls corresponds to a preorder traversal of the activation tree.

S2: The sequence of procedure returns corresponds to a postorder traversal of the activation tree.

Which one of the following options is correct?

S1 is true and S2 is false | |

S1 is false and S2 is true | |

S1 is true and S2 is true | |

S1 is false and S2 is false |

Question 4 Explanation:

Question 5 |

Consider the following statements.

S1: Every SLR(1) grammar is unambiguous but there are certain unambiguous grammars that are not SLR(1).

S2: For any context-free grammar, there is a parser that takes at most O(n^3) time to parse a string of length n.

Which one of the following options is correct?

S1: Every SLR(1) grammar is unambiguous but there are certain unambiguous grammars that are not SLR(1).

S2: For any context-free grammar, there is a parser that takes at most O(n^3) time to parse a string of length n.

Which one of the following options is correct?

S1 is true and S2 is false | |

S1 is false and S2 is true | |

S1 is true and S2 is true | |

S1 is false and S2 is false |

Question 5 Explanation:

There are 5 questions to complete.

I’m unable to Attempt this one as Mock Test as whenever i solved que from 1 page & moge to nxt page it get again reset previous solved record so i couldn’t figerout proper marks of Full length Paper as Test

Btw Website is Truely Awesome for Practice Gate Questions with Trusted & Awesome Solutions👌👌