# Recent questions tagged 2019 1
Let L1 and L2 be 2 languages which are not regular. Which of these is true? The union of L1 and L2 is not regular. The intersection of L1 and L2 is not regular. Both I and II are true I is true, II is false I is false, II is true Both I and II are false
2
Let SP be the problem of finding the shortest path between 2 nodes, and LP be the problem of finding the longest path between 2 nodes, in an unweighted, undirected graph. Which of the following is true? SP is NP-hard, LP is not LP is NP-hard, SP is not Both are NP-hard Neither SP nor LP is NP-hard
3
A scheduler - such as an OS scheduler - can suffer from the priority inversion problem, in which a lower priority process indirectly pre-empts a higher priority process, and this can happen due to the usage of shared resources and mutual exclusion. Which of the solutions below can ... that it has the highest priority by the time it exits the CS. S1 alone S2 alone Neither S1 nor S2 Either S1 or S2
4
Which of the following statements about SQL queries is true? The GROUP BY clause has nothing to do with Aggregate functions. The GROUP BY clause can only be used when Aggregate functions are used. Aggregate functions can only be used when the GROUP BY clause has been used. The GROUP BY clause can be used even when Aggregate functions are not used.
1 vote
5
for(; i != 0; --i) { printf("\nIITM"); --i; } If i is initialized to 100, then IITM will be printed 50 times If i is initialized to 101, then IITM will be printed 51 times Both I and II are true I is true, II is false I is false, II is true Both I and II are false
6
Which of the following infinite sets have the same cardinality? $\mathbb{N}$ : Set of Natural numbers $\mathbb{E}$ : Set of Even numbers $\mathbb{Q}$ : Set of Rational numbers $\mathbb{R}$ : Set of Real numbers $\mathbb{N}$ and $\mathbb{E}$ $\mathbb{Q}$ and $\mathbb{R}$ $\mathbb{R}$ and $\mathbb{N}$ None of the above
7
Let ${(0,1)}^n$ set of all binary string of length n. Hamming sphere of radius around a string C in ${(0,1)}^n$ is the set of all strings d$\epsilon$ ${(0,1)}^n$ that differ from C in at most r of n position, S(C,r) for n=2k+1 For C,C’ $\epsilon$ ${(0,1)}^n$ S(C,k) and S(C’,k) are disjoint couldn't remember rest of the options.
1 vote
8
Solve the recurrence relation given as: T(n)=2T(n-2)+n; where T(2)=2 and T(1)=0 What is the time complexity?
1 vote
Give an efficient algorithm for maximum size rectangle binary sub-matrix with all 1s . [Complexity should be O($n^c$)] (Memory based – Original question had a lot of added details)
Given a sequence $a_1$, $a_2$ , $a_3$ ... $a_n$ of any different positive integers, exhibit an arrangement of integers between 1 and $n^2$ which has no increasing or decreasing subsequence of length n+1.