Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged gateit-2008
38
votes
3
answers
61
GATE IT 2008 | Question: 25
In how many ways can $b$ blue balls and $r$ red balls be distributed in $n$ distinct boxes? $\frac{(n+b-1)!\,(n+r-1)!}{(n-1)!\,b!\,(n-1)!\,r!}$ $\frac{(n+(b+r)-1)!}{(n-1)!\,(n-1)!\,(b+r)!}$ $\frac{n!}{b!\,r!}$ $\frac{(n + (b + r) - 1)!} {n!\,(b + r - 1)}$
Ishrat Jahan
asked
in
Combinatory
Oct 27, 2014
by
Ishrat Jahan
8.4k
views
gateit-2008
combinatory
normal
14
votes
3
answers
62
GATE IT 2008 | Question: 24
The exponent of $11$ in the prime factorization of $300!$ is $27$ $28$ $29$ $30$
Ishrat Jahan
asked
in
Set Theory & Algebra
Oct 27, 2014
by
Ishrat Jahan
8.0k
views
gateit-2008
set-theory&algebra
normal
number-theory
34
votes
5
answers
63
GATE IT 2008 | Question: 23
What is the probability that in a randomly chosen group of $r$ people at least three people have the same birthday? $1-\dfrac{365-364 \dots (365-r+1)}{365^{r}}$ ... $\dfrac{365 \cdot 364 \dots (365-r+1)}{365^{r}}$
Ishrat Jahan
asked
in
Probability
Oct 27, 2014
by
Ishrat Jahan
8.6k
views
gateit-2008
probability
normal
43
votes
2
answers
64
GATE IT 2008 | Question: 22
Which of the following is the negation of $[∀ x, α → (∃y, β → (∀ u, ∃v, y))]$ $[∃ x, α → (∀y, β → (∃u, ∀ v, y))]$ $[∃ x, α → (∀y, β → (∃u, ∀ v, ¬y))]$ $[∀ x, ¬α → (∃y, ¬β → (∀u, ∃ v, ¬y))]$ $[∃ x, α \wedge (∀y, β \wedge (∃u, ∀ v, ¬y))]$
Ishrat Jahan
asked
in
Mathematical Logic
Oct 27, 2014
by
Ishrat Jahan
7.7k
views
gateit-2008
mathematical-logic
normal
first-order-logic
68
votes
9
answers
65
GATE IT 2008 | Question: 21
Which of the following first order formulae is logically valid? Here $\alpha(x)$ is a first order formula with $x$ as a free variable, and $\beta$ ... $[(\forall x, \alpha(x)) \rightarrow \beta] \rightarrow [\forall x, \alpha(x) \rightarrow \beta]$
Ishrat Jahan
asked
in
Mathematical Logic
Oct 27, 2014
by
Ishrat Jahan
15.1k
views
gateit-2008
first-order-logic
normal
30
votes
4
answers
66
GATE IT 2008 | Question: 20
Provide the best matching between the entries in the two columns given in the table below: ... $\text{I-a, II-c, III-d, IV-b}$ $\text{I-b, II-c, III-d, IV-a}$
Ishrat Jahan
asked
in
Computer Networks
Oct 27, 2014
by
Ishrat Jahan
6.5k
views
gateit-2008
computer-networks
normal
application-layer-protocols
4
votes
3
answers
67
GATE IT 2008 | Question: 19, ISRO2016-76
Which of the following is TRUE only of XML but NOT HTML? It is derived from SGML It describes content and layout It allows user defined tags It is restricted only to be used with web browsers
Ishrat Jahan
asked
in
Web Technologies
Oct 27, 2014
by
Ishrat Jahan
4.0k
views
gateit-2008
web-technologies
html
normal
isro2016
29
votes
7
answers
68
GATE IT 2008 | Question: 18
How many bytes of data can be sent in $15$ seconds over a serial link with baud rate of $9600$ in asynchronous mode with odd parity and two stop bits in the frame? $10,000$ bytes $12,000$ bytes $15,000$ bytes $27,000$ bytes
Ishrat Jahan
asked
in
Computer Networks
Oct 27, 2014
by
Ishrat Jahan
16.0k
views
gateit-2008
computer-networks
communication
serial-communication
normal
out-of-gate-syllabus
2
votes
3
answers
69
GATE IT 2008 | Question: 17
Find if the following statements in the context of software testing are TRUE or FALSE. (S1): Statement coverage cannot guarantee execution of loops in a program under test. (S2): Use of independent path testing criterion guarantees execution of each loop in a program under test more than once. True, True True, False False, True False, False
Ishrat Jahan
asked
in
IS&Software Engineering
Oct 27, 2014
by
Ishrat Jahan
3.6k
views
gateit-2008
is&software-engineering
software-testing
normal
35
votes
5
answers
70
GATE IT 2008 | Question: 16
A paging scheme uses a Translation Look-aside Buffer (TLB). A TLB-access takes $10$ ns and the main memory access takes $50$ ns. What is the effective access time(in ns) if the TLB hit ratio is $\text{90%}$ and there is no page-fault? $54$ $60$ $65$ $75$
Ishrat Jahan
asked
in
Operating System
Oct 27, 2014
by
Ishrat Jahan
13.8k
views
gateit-2008
operating-system
virtual-memory
normal
30
votes
3
answers
71
GATE IT 2008 | Question: 15
A processor that has the carry, overflow and sign flag bits as part of its program status word (PSW) performs addition of the following two $2's$ complement numbers $01001101$ and $11101001$. After the execution of this addition operation, the status of the carry, overflow and sign flags, respectively will be: $1, 1, 0$ $1, 0, 0$ $0, 1, 0$ $1, 0, 1$
Ishrat Jahan
asked
in
Digital Logic
Oct 27, 2014
by
Ishrat Jahan
14.2k
views
gateit-2008
digital-logic
number-representation
normal
0
votes
0
answers
72
GATE IT 2008 | Question: 14
Consider the execution of the following commands in a shell on a Linux operating system. bash\$ cat alpha Mathematics bash\$ In alpha beta bash\$ rm alpha bash\$ cat >> beta << SAME ... The output of the last command will be: Mathematics Information Technology SAME Mathematics Information Technology Information Technology Information Technology SAME
Ishrat Jahan
asked
in
Operating System
Oct 27, 2014
by
Ishrat Jahan
1.3k
views
gateit-2008
operating-system
linux
out-of-syllabus-now
normal
12
votes
2
answers
73
GATE IT 2008 | Question: 13
Match the programming paradigms and languages given in the following table. Paradigms Languages (I) Imperative (a) Prolog (II) Object Oriented (b) Lisp (III) Functional (c) C, Fortran 77, Pascal (IV) Logic (d) C++, Smalltalk, Java I-c, II-d, III-b, IV-a I-a, II-d, III-c, IV-b I-d, II-c, III-b, IV-a I-c, II-d, III-a, IV-b
Ishrat Jahan
asked
in
Programming in C
Oct 27, 2014
by
Ishrat Jahan
5.6k
views
gateit-2008
programming
programming-paradigms
easy
out-of-syllabus-now
32
votes
2
answers
74
GATE IT 2008 | Question: 12
Which of the following is TRUE? The cost of searching an AVL tree is $\Theta (\log n)$ but that of a binary search tree is $O(n)$ The cost of searching an AVL tree is $\Theta (\log n)$ but that of a complete binary tree is $\Theta (n \log n)$ The cost ... is $\Theta(n)$ The cost of searching an AVL tree is $\Theta (n \log n)$ but that of a binary search tree is $O(n)$
Ishrat Jahan
asked
in
DS
Oct 27, 2014
by
Ishrat Jahan
11.8k
views
gateit-2008
data-structures
binary-search-tree
easy
avl-tree
10
votes
3
answers
75
GATE IT 2008 | Question: 11
For problems X and Y, Y is NP-complete and X reduces to Y in polynomial time. Which of the following is TRUE? If X can be solved in polynomial time, then so can Y X is NP-complete X is NP-hard X is in NP, but not necessarily NP-complete
Ishrat Jahan
asked
in
Algorithms
Oct 27, 2014
by
Ishrat Jahan
7.1k
views
gateit-2008
algorithms
p-np-npc-nph
normal
out-of-syllabus-now
56
votes
3
answers
76
GATE IT 2008 | Question: 10
Arrange the following functions in increasing asymptotic order: $n^{1/3}$ $e^n$ $n^{7/4}$ $n \log^9n$ $1.0000001^n$ a, d, c, e, b d, a, c, e, b a, c, d, e, b a, c, d, b, e
Ishrat Jahan
asked
in
Algorithms
Oct 27, 2014
by
Ishrat Jahan
18.1k
views
gateit-2008
algorithms
asymptotic-notation
normal
30
votes
2
answers
77
GATE IT 2008 | Question: 9
What Boolean function does the circuit below realize? $xz + \bar{x}\bar{z}$ $x\bar{z} + \bar{x}{z}$ $\bar{x}\bar{y} + {y}{z}$ $xy + \bar{y}\bar{z}$
Ishrat Jahan
asked
in
Digital Logic
Oct 27, 2014
by
Ishrat Jahan
9.2k
views
gateit-2008
digital-logic
circuit-output
decoder
normal
20
votes
2
answers
78
GATE IT 2008 | Question: 8
Consider the following Boolean function of four variables $f(A, B, C, D) = Σ(2, 3, 6, 7, 8, 9, 10, 11, 12, 13)$ The function is independent of one variable independent of two variables independent of three variable dependent on all the variables
Ishrat Jahan
asked
in
Digital Logic
Oct 27, 2014
by
Ishrat Jahan
6.3k
views
gateit-2008
digital-logic
normal
min-sum-of-products-form
29
votes
1
answer
79
GATE IT 2008 | Question: 7
The following bit pattern represents a floating point number in IEEE $754$ single precision format $1 \ 10000011 \ 101000000000000000000000$ The value of the number in decimal form is $-10$ $-13$ $-26$ None of the above
Ishrat Jahan
asked
in
Digital Logic
Oct 27, 2014
by
Ishrat Jahan
8.6k
views
gateit-2008
digital-logic
number-representation
floating-point-representation
ieee-representation
normal
30
votes
5
answers
80
GATE IT 2008 | Question: 6
Let $N$ be an NFA with $n$ states and let $M$ be the minimized DFA with m states recognizing the same language. Which of the following in NECESSARILY true? $m \leq 2^n$ $n \leq m$ $M$ has one accept state $m = 2^n$
Ishrat Jahan
asked
in
Theory of Computation
Oct 27, 2014
by
Ishrat Jahan
10.7k
views
gateit-2008
theory-of-computation
finite-automata
normal
minimal-state-automata
23
votes
3
answers
81
GATE IT 2008 | Question: 5
Which of the following regular expressions describes the language over$\{0, 1\}$ consisting of strings that contain exactly two $1$'s? $(0 + 1)^ * \ 11(0 + 1) ^*$ $0 ^* \ 110 ^*$ $0 ^* 10 ^* 10 ^*$ $(0 + 1) ^* 1(0 + 1) ^* 1 (0 + 1) ^*$
Ishrat Jahan
asked
in
Theory of Computation
Oct 27, 2014
by
Ishrat Jahan
8.5k
views
gateit-2008
theory-of-computation
regular-expression
easy
58
votes
7
answers
82
GATE IT 2008 | Question: 4
What is the size of the smallest $\textsf{MIS}$ (Maximal Independent Set) of a chain of nine nodes? $5$ $4$ $3$ $2$
Ishrat Jahan
asked
in
Graph Theory
Oct 27, 2014
by
Ishrat Jahan
49.7k
views
gateit-2008
normal
graph-connectivity
34
votes
4
answers
83
GATE IT 2008 | Question: 3
What is the chromatic number of the following graph? $2$ $3$ $4$ $5$
Ishrat Jahan
asked
in
Graph Theory
Oct 27, 2014
by
Ishrat Jahan
8.2k
views
gateit-2008
graph-theory
graph-coloring
normal
21
votes
2
answers
84
GATE IT 2008 | Question: 2
A sample space has two events $A$ and $B$ such that probabilities $P(A\cap B) = \dfrac{1}{2}, P(A') = \dfrac{1}{3}, P(B') =\dfrac{1}{3}$. What is $P(A\cup B)$ ? $\left(\dfrac{11}{12}\right)$ $\left(\dfrac{10}{12}\right)$ $\left(\dfrac{9}{12}\right)$ $\left(\dfrac{8}{12}\right)$
Ishrat Jahan
asked
in
Probability
Oct 27, 2014
by
Ishrat Jahan
4.3k
views
gateit-2008
probability
easy
27
votes
2
answers
85
GATE IT 2008 | Question: 1
A set of Boolean connectives is functionally complete if all Boolean functions can be synthesized using those. Which of the following sets of connectives is NOT functionally complete? EX-NOR implication, negation OR, negation NAND
Arjun
asked
in
Digital Logic
Oct 27, 2014
by
Arjun
8.3k
views
gateit-2008
digital-logic
easy
functional-completeness
Page:
« prev
1
2
3
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent questions tagged gateit-2008
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...