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
Filter
User akshay_123
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by akshay_123
2
answers
1
Subnets
Given an IP address 156.233.42.56 with a subnet mask of 7 bits. How many hosts and Subnets are Possible ? 126 hosts and 510 subnet 128 host and 512 subnet 510 hosts and 126 subnet 512 hosts and 128 Subnet
answered
in
Computer Networks
Jan 30
2.5k
views
subnetting
computer-networks
network-addressing
1
answer
2
UGC NET CSE | December 2005 | Part 2 | Question: 23
Consider the graph, which of the following is a valid topological sorting? $\text{ABCD}$ $\text{BACD}$ $\text{BADC}$ $\text{ABDC}$
commented
in
Algorithms
Dec 10, 2023
2.2k
views
ugcnetcse-dec2005-paper2
algorithms
topological-sort
8
answers
3
GATE CSE 1996 | Question: 2.13, ISRO2016-28
The average number of key comparisons required for a successful search for sequential search on $n$ items is $\frac{n}{2}$ $\frac{n-1}{2}$ $\frac{n+1}{2}$ None of the above
commented
in
Algorithms
Dec 7, 2023
31.5k
views
gate1996
algorithms
easy
isro2016
searching
7
answers
4
GATE CSE 1994 | Question: 1.7, ISRO2017-14
The recurrence relation that arises in relation with the complexity of binary search is: $T(n) = 2T\left(\frac{n}{2}\right)+k, \text{ k is a constant }$ $T(n) = T\left(\frac{n}{2}\right)+k, \text{ k is a constant }$ $T(n) = T\left(\frac{n}{2}\right)+\log n$ $T(n) = T\left(\frac{n}{2}\right)+n$
answered
in
Algorithms
Dec 6, 2023
18.0k
views
gate1994
algorithms
recurrence-relation
easy
isro2017
11
answers
5
GATE IT 2007 | Question: 28
Consider a hash function that distributes keys uniformly. The hash table size is $20$. After hashing of how many keys will the probability that any new key hashed collides with an existing one exceed $0.5$. $5$ $6$ $7$ $10$
commented
in
DS
Nov 27, 2023
29.2k
views
gateit-2007
data-structures
hashing
probability
normal
5
answers
6
GATE CSE 2009 | Question: 37,ISRO-DEC2017-55
What is the maximum height of any AVL-tree with $7$ nodes? Assume that the height of a tree with a single node is $0$. $2$ $3$ $4$ $5$
answered
in
DS
Nov 16, 2023
43.3k
views
gatecse-2009
data-structures
binary-search-tree
normal
isrodec2017
avl-tree
7
answers
7
GATE IT 2005 | Question: 12
The numbers $1, 2, .\dots n$ are inserted in a binary search tree in some order. In the resulting tree, the right subtree of the root contains $p$ nodes. The first number to be inserted in the tree must be $p$ $p + 1$ $n - p$ $n - p + 1$
answered
in
DS
Nov 14, 2023
13.4k
views
gateit-2005
data-structures
normal
binary-search-tree
3
answers
8
Hash table
A Hash table has space for 100 records. Then the probability of collision before the table is 10% full is? A 0.45 B 0.5 C 0.3 D 0.34 (approximately)
answered
in
Algorithms
Nov 10, 2023
15.5k
views
hashing
probability
8
answers
9
ISRO2015-69
If n has 3, then the statement a[++n]=n++; assigns 3 to a[5] assigns 4 to a[5] assigns 4 to a[4] what is assigned is compiler dependent
answered
in
Programming in C
Oct 31, 2023
8.5k
views
isro2015
programming-in-c
non-gate
undefined-behaviour
2
answers
10
Hash table
A hash table can store a max of 10 records, currently, there are records in locations 1,3,4,7,8,9,10. The probability of a new record going into location 2,with a hash function resolving collisions by linear probing is..
answered
in
Algorithms
Oct 29, 2023
9.0k
views
hashing
linear-probing
numerical-answers
1
answer
11
Turing Computatbe Function
Which of the following functions are Turing Machine computable? $1) \ n \times (n-1) \times (n-2) ......1$ $2)\{log_2n\}$ $3)\Large2^{2^n}$
answered
in
Theory of Computation
Oct 24, 2023
630
views
theory-of-computation
3
answers
12
GATE CSE 1987 | Question: 1-xii
A context-free grammar is ambiguous if: The grammar contains useless non-terminals. It produces more than one parse tree for some sentence. Some production has two non terminals side by side on the right-hand side. None of the above.
answered
in
Theory of Computation
Oct 21, 2023
12.5k
views
gate1987
theory-of-computation
context-free-language
ambiguous-grammar
5
answers
13
GATE CSE 2008 | Question: 30
Let $\text{fsa}$ and $\text{pda}$ be two predicates such that $\text{fsa}(x)$ means $x$ is a finite state automaton and $\text{pda}(y)$ means that $y$ is a pushdown automaton. Let $\text{equivalent}$ ...
commented
in
Mathematical Logic
Oct 20, 2023
14.1k
views
gatecse-2008
easy
mathematical-logic
first-order-logic
9
answers
14
GATE CSE 1991 | Question: 03,xii
If $F_1$, $F_2$ and $F_3$ are propositional formulae such that $F_1 \land F_2 \rightarrow F_3$ and $F_1 \land F_2 \rightarrow \sim F_3$ are both tautologies, then which of the following is true: Both $F_1$ and $F_2$ are tautologies The conjunction $F_1 \land F_2$ is not satisfiable Neither is tautologous Neither is satisfiable None of the above
commented
in
Mathematical Logic
Oct 16, 2023
8.8k
views
gate1991
mathematical-logic
normal
propositional-logic
multiple-selects
10
answers
15
GATE CSE 2014 Set 1 | Question: 51
Consider an undirected graph $G$ where self-loops are not allowed. The vertex set of $G$ is $\{(i,j) \mid1 \leq i \leq 12, 1 \leq j \leq 12\}$. There is an edge between $(a,b)$ and $(c,d)$ if $|a-c| \leq 1$ and $|b-d| \leq 1$. The number of edges in this graph is______.
answered
in
Graph Theory
Oct 14, 2023
26.7k
views
gatecse-2014-set1
graph-theory
numerical-answers
normal
graph-connectivity
9
answers
16
GATE IT 2006 | Question: 25
Consider the undirected graph $G$ defined as follows. The vertices of $G$ are bit strings of length $n$. We have an edge between vertex $u$ and vertex $v$ if and only if $u$ and $v$ differ in exactly one bit position (in other words, $v$ can be obtained from $u$ by ... $\left(\frac{1}{n}\right)$ $\left(\frac{2}{n}\right)$ $\left(\frac{3}{n}\right)$
answered
in
Graph Theory
Oct 14, 2023
13.2k
views
gateit-2006
graph-theory
graph-coloring
normal
12
answers
17
GATE CSE 1994 | Question: 1.6, ISRO2008-29
The number of distinct simple graphs with up to three nodes is $15$ $10$ $7$ $9$
commented
in
Graph Theory
Oct 13, 2023
34.7k
views
gate1994
graph-theory
graph-connectivity
combinatory
normal
isro2008
counting
9
answers
18
GATE CSE 2017 Set 2 | Question: 47
If the ordinary generating function of a sequence $\left \{a_n\right \}_{n=0}^\infty$ is $\large \frac{1+z}{(1-z)^3}$, then $a_3-a_0$ is equal to ___________ .
commented
in
Combinatory
Oct 13, 2023
17.6k
views
gatecse-2017-set2
combinatory
generating-functions
numerical-answers
normal
17
answers
19
GATE CSE 2016 Set 1 | Question: 26
The coefficient of $x^{12}$ in $\left(x^{3}+x^{4}+x^{5}+x^{6}+\dots \right)^{3}$ is ___________.
commented
in
Combinatory
Oct 13, 2023
25.9k
views
gatecse-2016-set1
combinatory
generating-functions
normal
numerical-answers
8
answers
20
GATE CSE 2020 | Question: 42
The number of permutations of the characters in LILAC so that no character appears in its original position, if the two Lās are indistinguishable, is ______.
commented
in
Combinatory
Oct 13, 2023
16.4k
views
gatecse-2020
numerical-answers
combinatory
2-marks
5
answers
21
GATE CSE 2003 | Question: 8, ISRO2009-53
Let $\text{G}$ be an arbitrary graph with $n$ nodes and $k$ components. If a vertex is removed from $\text{G}$, the number of components in the resultant graph must necessarily lie down between $k$ and $n$ $k-1$ and $k+1$ $k-1$ and $n-1$ $k+1$ and $n-k$
commented
in
Graph Theory
Oct 9, 2023
15.3k
views
gatecse-2003
graph-theory
graph-connectivity
normal
isro2009
4
answers
22
GATE CSE 1993 | Question: 8.1
Consider a simple connected graph $G$ with $n$ vertices and $n$ edges $(n > 2)$. Then, which of the following statements are true? $G$ has no cycles The graph obtained by removing any edge from $G$ is not connected $G$ has at least one cycle The graph obtained by removing any two edges from $G$ is not connected None of the above
answered
in
Graph Theory
Oct 9, 2023
9.8k
views
gate1993
graph-theory
graph-connectivity
easy
multiple-selects
4
answers
23
GATE CSE 1991 | Question: 01,xv
The maximum number of possible edges in an undirected graph with $n$ vertices and $k$ components is ______.
answered
in
Graph Theory
Oct 9, 2023
11.5k
views
gate1991
graph-theory
graph-connectivity
normal
fill-in-the-blanks
11
answers
24
GATE CSE 2009 | Question: 2
What is the chromatic number of an $n$ vertex simple connected graph which does not contain any odd length cycle? Assume $n > 2$. $2$ $3$ $n-1$ $n$
answered
in
Graph Theory
Oct 8, 2023
13.1k
views
gatecse-2009
graph-theory
graph-coloring
normal
4
answers
25
GATE CSE 2014 Set 1 | Question: 52
An ordered $n-$tuple $(d_1, d_2,\ldots,d_n)$ with $d_1 \geq d_2 \geq \ldots \geq d_n$ is called graphic if there exists a simple undirected graph with $n$ vertices having degrees $d_1,d_2,\ldots,d_n$ respectively. Which one of the following $6$-tuples is NOT graphic? $(1,1,1,1,1,1)$ $(2,2,2,2,2,2)$ $(3,3,3,1,0,0)$ $(3,2,1,1,1,0)$
answered
in
Graph Theory
Oct 8, 2023
7.4k
views
gatecse-2014-set1
graph-theory
normal
degree-of-graph
4
answers
26
GATE CSE 2006 | Question: 71
The $2^n$ vertices of a graph $G$ corresponds to all subsets of a set of size $n$, for $n \geq 6$. Two vertices of $G$ are adjacent if and only if the corresponding sets intersect in exactly two elements. The number of vertices of degree zero in $G$ is: $1$ $n$ $n + 1$ $2^n$
commented
in
Graph Theory
Oct 7, 2023
17.1k
views
gatecse-2006
graph-theory
normal
degree-of-graph
9
answers
27
GATE CSE 2012 | Question: 38
Let $G$ be a complete undirected graph on $6$ vertices. If vertices of $G$ are labeled, then the number of distinct cycles of length $4$ in $G$ is equal to $15$ $30$ $90$ $360$
answered
in
Graph Theory
Oct 7, 2023
34.8k
views
gatecse-2012
graph-theory
normal
marks-to-all
counting
6
answers
28
GATE CSE 2000 | Question: 1.1
The minimum number of cards to be dealt from an arbitrarily shuffled deck of $52$ cards to guarantee that three cards are from same suit is $3$ $8$ $9$ $12$
commented
in
Combinatory
Oct 5, 2023
10.0k
views
gatecse-2000
easy
pigeonhole-principle
combinatory
11
answers
29
GATE CSE 2018 | Question: 1
Which one of the following is a closed form expression for the generating function of the sequence $\{a_n\}$, where $a_n = 2n +3 \text{ for all } n=0, 1, 2, \dots$? $\frac{3}{(1-x)^2}$ $\frac{3x}{(1-x)^2}$ $\frac{2-x}{(1-x)^2}$ $\frac{3-x}{(1-x)^2}$
commented
in
Combinatory
Oct 5, 2023
22.6k
views
gatecse-2018
generating-functions
normal
combinatory
1-mark
6
answers
30
GATE CSE 2021 Set 2 | Question: 50
Let $S$ be a set of consisting of $10$ elements. The number of tuples of the form $(A,B)$ such that $A$ and $B$ are subsets of $S$, and $A \subseteq B$ is ___________
answered
in
Combinatory
Oct 4, 2023
11.8k
views
gatecse-2021-set2
combinatory
counting
numerical-answers
2-marks
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 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:...