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 `JEET
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by `JEET
1
vote
1
answer
1
#ACE ACADEMY BOOKLET QUESTION
The solution of $\sqrt{a_n} – 2\sqrt{a_{n-1}} + \sqrt{a_{n-2}} = 0$ where $a_0 = 1$ and $a_1 = 2$ is ${\Big[\frac{2^{n+1} + (-1)^n}{3}\Big]}^2$ $(n+1)^2$ $(n-1)^3$ $(n-1)^2$
asked
in
Combinatory
Jun 4, 2019
515
views
discrete-mathematics
combinatory
recurrence-relation
4
votes
3
answers
2
ACE ACADEMY BOOKLET QUESTION
Let $G$ $=$ $(V, E)$ be a simple non-empty connected undirected graph, in which every vertex has degree 4. For any partition $V$ into two non-empty and non-overlapping subsets $S$ and $T$. Which of the following is true? There are at least two edges that ... $S$ and one end point in $T$ There are exactly one edge that have one end point in $S$ and one end point in $T$
asked
in
Graph Theory
May 26, 2019
1.1k
views
graph-theory
ace-booklet
2
votes
3
answers
3
Ace academy booklet #graph theory
Which of the following is $\textbf{not}$ TRUE? (a) In a complete graph $K_n$ ($n$ $\geq$ $3$), Euler circuit exists $\Leftrightarrow$ $n$ is odd. (b) In a complete bipartite graph $K_{m,n}$ (m $\geq$ 2 and n $\geq$2), Euler circuit exists ... Euler circuit exits for all $n$ (d) In a wheel graph $W_n$ ($n \geq 4$), Euler circuit exits $\Leftrightarrow$ $n$ is even.
asked
in
Graph Theory
May 26, 2019
1.9k
views
graph-theory
ace-booklet
3
votes
1
answer
4
ACE ACADEMY BOOKLET
Which of the following is $\textbf{not}$ TRUE? (a) In a complete graph $K_n$ ($n$ $\geq$ $3$), Hamiltonian cycle exists for all n. (b) In a complete bipartite graph $K_{m,n}$ (m $\geq$ 2 and n $\geq$2), Hamiltonian cycle exists $\Leftrightarrow$ ... Hamiltonian cycle exits for all $n$ (d) In a wheel graph $W_n$ ($n \geq 4$), Hamiltonian cycle exits $\Leftrightarrow$ $n$ is even.
asked
in
Graph Theory
May 26, 2019
646
views
graph-theory
discrete-mathematics
ace-booklet
1
vote
2
answers
5
#ACE_ACADEMY_DISCRETE_MATHS_BOOKLET.
Which of the following is not true? (a) Number of edge-disjoint Hamiltonian cycles in $K_7$ is $3$ (b) If $G$ is a simple graph with $6$ vertices and the degree of each vertex is at least $3$, then the Hamiltonian cycle exists in ... simple graph with $5$ vertices and $7$ edges, then the Hamiltonian cycle exists in $G$ Please help me understand all the options.
asked
in
Graph Theory
May 26, 2019
2.6k
views
discrete-mathematics
graph-theory
ace-booklet
0
votes
1
answer
6
#general
From where to study interconversion of flip flops. I couldn’t find the topic in MORRIS MANO
asked
in
GATE
Feb 22, 2019
378
views
gate-preparation
0
votes
0
answers
7
MADE EASY
Consider the following relations on Z∗Z. I. (a1,a2)(a1,a2) R (b1,b2)(b1,b2) iff (a1<b1(a1<b1 or (a1=b1a1=b1 ^ a2<b2a2<b2)) II (a1,a2)R(b1,b2)(a1,a2)R(b1,b2) iff (a1<b1(a1<b1 or (a1=b1a1=b1 ^ a2≤b2))a2≤b2)) Which of the above are POSETS? I I & II I, II & III
asked
in
Set Theory & Algebra
Jan 23, 2019
195
views
set-theory&algebra
0
votes
1
answer
8
How to do this question.
Disk request come into disk driver for cylinders 5, 17, 60, 125, 28, 170, 8, 32. Total moves using SCAN algorithm when disk head is currently positioned at 35 and moving toward higher cylinder number________.(Disk system has 200 cylinders (0 - 199)
asked
in
Operating System
Jan 21, 2019
1.1k
views
operating-system
disk-scheduling
0
votes
0
answers
9
How to solve such question.
$\frac{d}{dx}\int_{1}^{x^4} sect\space dt$
asked
in
Calculus
Jan 20, 2019
435
views
calculus
integration
0
votes
1
answer
10
How this output is obtained.
Output is 7. But can someone justify, how? #include <stdio.h> int f(int a, int b) { printf("%d", a + b); return 0; } int main() { f((2, 3), 4); return 0; }
asked
in
Programming in C
Jan 20, 2019
353
views
programming
programming-in-c
0
votes
1
answer
11
Sliding Window protocol.
There are two stations A and B connected by a $512 * 10^3$ bps network using a sliding window protocol. The speed of the signal is $10^8$ meter/sec and the distance between two stations is $45,000$ km. If the packet size is $256$ B, then what will be the optimal window size(in packets)?
asked
in
Computer Networks
Jan 19, 2019
764
views
computer-networks
sliding-window
0
votes
1
answer
12
Is there any good content available online for OPTIMAL BINARY SEARCH TREE? Preferably Videos.
Suggestions on good content for Optimal Binary Search Tree.
asked
in
DS
Jan 19, 2019
473
views
data-structures
binary-search-tree
reference-book
2
votes
1
answer
13
#Ace_Test_series.
Consider the problem of construction of a minimum cost binary search tree for a given set of ‘$n$’ identifiers with their respective probabilities. The time complexity of the most efficient algorithm of the same is $O(n^2)$ $O(n^3)$ $O(n\log n)$ $O(n^3\log n)$
asked
in
DS
Jan 19, 2019
480
views
data-structures
binary-search-tree
time-complexity
ace-test-series
0
votes
0
answers
14
#ACE_Test_Series
Consider the following instance of OBST (Optimal Binary search Tree) problem. N = 4; <$a_1$, $a_2$, $a_3$, $a_4$> = <do, if, int, while> P(1...4) = <3,3,1,1>; Q(0...4) = <2,3,1,1,1> The cost of OBST is________.
asked
in
Algorithms
Jan 19, 2019
1.0k
views
ace-test-series
algorithms
binary-search-tree
0
votes
1
answer
15
How to solve this.
Three people have 32,32,72, and $98, respectively. If they pool their money then re-distribute it among themselves, what is the maximum possible value for the median amount of money?
asked
in
Verbal Aptitude
Jan 18, 2019
551
views
0
votes
1
answer
16
How to do this question. #Made_Easy #operating_system
asked
in
Operating System
Jan 16, 2019
361
views
0
votes
0
answers
17
How to attempt such function questions. Always faces problem.
Let f(x, y) = (2x-y, x-2y), $\forall$(x, y) belongs $RxR$. Which of the following is true? f is one-to-one but not onto f is on-to but not one-to-one f is a bijection f is neither 1 – 1 nor onto
asked
in
Set Theory & Algebra
Jan 16, 2019
427
views
0
votes
1
answer
18
How to solve this question.
x = 5 + 2$\sqrt{6}$. Find $\frac{x-1}{\sqrt{x}}$
asked
in
Quantitative Aptitude
Jan 16, 2019
421
views
quantitative-aptitude
1
vote
0
answers
19
How to solve this question
If seven colors are used to paint 50 bicycles then which of the following statements need not be true? at least eight bicycles are of the same color at least seven bicycles are of the same color at least nine bicycles are of the same color at most eight bicycles are of the same color
asked
in
Combinatory
Jan 16, 2019
4.6k
views
pigeonhole-principle
1
vote
1
answer
20
How to solve this question.
A schedule S contains three transactions $T_1$, $T_2$, $T_3$ and the oeprations sequence is given below: $T_1$: $Read$ $A$; $T_2$: $Write$ $A$; $T_3$: $Read$ $A$; $T_1$: $Write$ $A$; $T_3$: $Write$ $A$ and all ... above schedule is serializable or not? If yes it is equivalent to which serial schedule. Find the proper combination of the given alternatives from I to VII
asked
in
Databases
Jan 16, 2019
1.4k
views
databases
serializability
Page:
1
2
3
4
next »
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:...