# Recent questions tagged written-test 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
I am getting a score of 69.33(according to GO answer key and an expected rank around 200), what are the chances for me getting admissions in old IITs(top 5) ? How can I know about the procedure of admissions in IITs, whether it will be direct or interview/written test based? I want to work hard if there will be interview/test.
1 vote
8
Greetings! I appeared for GATE Computer Science in 2018 but could not manage to get into any decent IIT for Monsoon admissions. I had applied to IIT-Hyderabad's winter admissions for M.Tech. (RA) and got shortlisted yesterday. The interview is to be held on 26th ... test so what about that? How is the difficulty of such written tests? Any other advice will be greatly appreciated. Thanks a lot!
9
I Think answer should be $C$. Let , India is a stronger team than australia is $X$ and India will loose the series is $Y$ so ,$X\rightarrow Y$ can be wriiten as $Y^{'}\rightarrow X^{'}$ or $Y+X^{'}$ So answer is coming out to be $C$. Am i right?
10
Hey Guys, Did anyone get any offer (for interview/Direct Admission) from IIT Kharaghpur. Coz on their website there are no changes. So if anyone knows anything about it or has got an offer please tell. Thank you.
11
Hi , I want to know whether a second class engineer(below 60%) can get into iits,nits,iiits even after a good score in gate exam
1 vote
12
There are 1000 instructions in a program.They are like lw, r, lw, r, lw, ..... lw instructions are load/store type and r instructions are non load/store type.Each lw instruction is dependent only on rightmost r instruction on it's left and each r instruction depends only on ... ,WB) pipeline.Operand forwarding is used here.What will be the effective cpi? A) 1.204 B) 1.504 C) 2.204 D) 2.504
13
An experiment is performed $n$ times, in each of which an event $X$ may occur with a probability $p$. Determine$E[ \overline{X}]$ and $Var( \overline{X})$, where $\overline{X}$is the complement of the event $X$
14
Any Hints on how to solve this?
1 vote
15
Number of distinct simple graphs possible, given 8 vertices and not considering self loops?
16
(Overfed pets) The Jones family have n pet cats. The caretaker who is charged to feed these cats is very careless. Everytime he goes into the pet zone, he takes food along and feeds a random cat - he does not care whether the cat seems to be hungry or if it seems to ... . On an expectation, how many more trips would he have to make before he feeds one of the unfed (n− k) cats for the first time?
17
(Batman and Robin) The city of Gotham keeps propping up newer challenges for our dynamic duo. The criminals in the city are so organized that they have come up with a schedule to commit the crimes. a. The Mad Hatter commits maddeningly despicable crimes from 10AM - ... her alone. What is the probability of that? 4) In the above scenario, what is the probability that two criminals get defeated?
18
How should I prepare for programming test for MTEch at IIT Kanpur which will be held on 14th may? What sort of question I can expect and What should I actually practice?
19
Hey Guys, How to prepare for the IITK programming test. what is the level of questions?? Any sample questions from previous years?? Please guys any help wud be appreciated. Thank you.
20
Given an undirected graph with vertices as your friends and edges between people who do not talk to each other. Your task is to invite as many guests to your party such that there are no two friends at the party who have problem talking to each other. This problem is an instance of: A. Maximum vertex cover. B. Maximum cut. C. Maximum eigenvalue of adjacency matrix. D. None of the above.
21
C Program to find addition factors of a number in lexicographic order for n < 15. For example if n = 4 then output will be : 1 1 1 1 1 1 2 2 2 1 3
22
Consider a grammar $G$ with productions $P$. Let $INIT(G)$ be the grammar with production $P'$ such that $P' = P \cup ( A\rightarrow B \mid \text{such that } A->BC \text{ belongs to } P ) \cup ( A\rightarrow \epsilon \mid \text{such that} A\rightarrow b \text{ belongs to} P )$ prove that: a) Prefix(G) is subset of INIT(G) b) INIT(G) is subset of Prefix(G)
23
Graph Matching was explained. Let $S$ and $R$ be the matching graph, then a new graph $G=(S-R) \cup (R-S)$, will be union of vertex disjoint path and cycle. Also prove that the cycle obtained will be of even length.
24
if degree of vertices < 3, then prove that the graph will be union of vertex disjoint path and cycle
1 vote
25
1. Prove/Disprove: a) If a graph has k-independent components, it it n-k+1 colorable b) converse of (a) c) If a graph is not n-1 colorable, it's a clique
26
how to get admission in iit hyderabad ra ?? Is there any separate test or takes admission through GATE only?
1 vote
27
If you are hosting an email service on your server with some domain name with many local nodes, what service is absolutely essential? 1.DNS 2.SMTP 3.DHCP 4.IRC Multiple options can be right?