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
These questions include questions from ACE Engineering Academy Volume 1 : Booklet Volume 2: Workbook Bites and Bytes : Expected Question Booklet
Recent questions tagged ace-booklet
0
votes
2
answers
1
Ace Gate practice booklet Volume 1
Class B network on the internet has a subnet mask of 255.255.119.0 what is maximum possible hosts per subnet. Assuming Classfull Addressing Scheme
Shivam_j
asked
in
Computer Networks
Oct 16
by
Shivam_j
154
views
ace-booklet
computer-networks
subnetting
easy
0
votes
1
answer
2
Ace Book for Discreet Mathematics , Combinatorics.
Number of ways to assign 5 different people in 3 different rooms, so that each room contains at least one person?
Satyansh
asked
in
Mathematical Logic
Sep 22
by
Satyansh
181
views
combinatory
ace-booklet
1
vote
1
answer
3
Ace BITS&BYTES, #Trees #B-Tree
What is the smallest and largest number of entries for 2_3 BTree (B2_3 Tree) of height 8 (i.e 8 levels) ? 255 & 6560 127 & 2186 6561 & 255 255 & 2186
casberg
asked
in
DS
Nov 23, 2021
by
casberg
207
views
data-structures
b-tree
tree
ace-booklet
1
vote
0
answers
4
Descrete Mathematic ACE Text Book Practice Question #16
A women's health clinic has four doctors and each patient is assigned to one of them. If a patient givs birth btween 8 am and 4 pm, then her chance of being attended by her assigned doctor is 3/4, otherwise it is 1/4. What is the probability that ... is attended by the assigned doctor when she gives birth? (A) 25/144 (B) 5/12 (C) 7/12 (D) 1/12
JAYKISHAN
asked
in
Mathematical Logic
May 30, 2019
by
JAYKISHAN
654
views
probability
ace-booklet
4
votes
3
answers
5
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$
`JEET
asked
in
Graph Theory
May 26, 2019
by
`JEET
843
views
graph-theory
ace-booklet
2
votes
3
answers
6
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.
`JEET
asked
in
Graph Theory
May 26, 2019
by
`JEET
1.5k
views
graph-theory
ace-booklet
3
votes
1
answer
7
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.
`JEET
asked
in
Graph Theory
May 26, 2019
by
`JEET
435
views
graph-theory
discrete-mathematics
ace-booklet
1
vote
2
answers
8
#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.
`JEET
asked
in
Graph Theory
May 26, 2019
by
`JEET
1.9k
views
discrete-mathematics
graph-theory
ace-booklet
0
votes
1
answer
9
Ace dlp
for(i=n, j=0; i>0; i/=2, j+=i) Let val(j) denote the value stored in the variable j after termination of the for loop. Whjch is correct? a. val(j)=theta(logn) b. Val(j)= theta(√n) c. Val(j) = theta(n) d. Val(j) = theta(nlogn)
gate_dreams
asked
in
Algorithms
Jan 27, 2019
by
gate_dreams
158
views
ace-booklet
algorithms
time-complexity
1
vote
1
answer
10
Ace booklet questions no 07
If A∆B = (A intersection B) whole complement than the universal set is??
Anjali2002
asked
in
Set Theory & Algebra
Sep 18, 2018
by
Anjali2002
188
views
ace-booklet
set-theory&algebra
engineering-mathematics
set-theory
0
votes
1
answer
11
ace booklet
whats ans of this qn and please explain
Vegeta
asked
in
Mathematical Logic
Sep 13, 2018
by
Vegeta
421
views
ace-booklet
engineering-mathematics
discrete-mathematics
propositional-logic
0
votes
1
answer
12
ACE Algorithms volume 2 Divede and Conquer Q 11
Given two sorted double linked list L1 and L2 of n elements each, which of the following are true? (A) L1 and L2 can be merged into single sorted list in Θ(n) time. (B) L1 and L2 can be merged into single sorted list in Θ(1) time. ( ... merged into single sorted list in Θ(nlogn) time. (D) L1 and L2 can be merged into single sorted list in Θ(n2) time.
JAYKISHAN
asked
in
Algorithms
Jul 5, 2018
by
JAYKISHAN
515
views
algorithms
ace-booklet
divide-and-conquer
0
votes
1
answer
13
LEFT RECURSION
To avoid left recursion can we do like this. I think this is incorrect way to do
learner_geek
asked
in
Compiler Design
Aug 5, 2017
by
learner_geek
961
views
compiler-design
grammar
parsing
left-recursion
ace-booklet
1
vote
1
answer
14
First and Follow
Example 3.3
learner_geek
asked
in
Compiler Design
Aug 5, 2017
by
learner_geek
1.8k
views
compiler-design
parsing
first-and-follow
ll-parser
descriptive
ace-booklet
0
votes
2
answers
15
Ace Page# 128, Q#48
I think the median can be found in O(n), because in O(n) we can merge the arrays into a single sorted array and in O(1) we can find the middle element of the array. Am I correct ??
Payal Rastogi
asked
in
Algorithms
Oct 20, 2016
by
Payal Rastogi
380
views
time-complexity
algorithms
ace-booklet
1
vote
3
answers
16
CPU Scheduling
Which are invalid process state transition? a. Timer Start: ready->running b. Timer Out: running->blocked c. I/O: running->ready d. Resume : suspend->running
harshit agarwal
asked
in
Operating System
Oct 13, 2016
by
harshit agarwal
1.3k
views
process-scheduling
operating-system
ace-booklet
1
vote
0
answers
17
Ace Practice booklet
T(n)=sqrt(2T(n/2))+logn
Ankush Tiwari
asked
in
Algorithms
Jul 27, 2016
by
Ankush Tiwari
498
views
ace-booklet
time-complexity
recurrence-relation
2
votes
1
answer
18
ACE-BOOKLET-VOL1-CHAPTER1 Question #15 page #54
Let $\Sigma$ be an alphabet define $L_{\Sigma}$ to be the collection of all infinite languages over $\Sigma$. Then choose the correct from the following: $L_{\Sigma}$ is closed under complementation $L_{\Sigma}$ is closed under concatenation $L_{\Sigma}$ is closed under Kleen closure None of the above answer given as B what is that infinite language?
pC
asked
in
Theory of Computation
Jul 22, 2016
by
pC
366
views
ace-booklet
theory-of-computation
1
vote
1
answer
19
ACE-BOOKLET-VOL1-CHAPTER1 ( Question #19 page #54)
Question 19 solution given as A Need explanation
pC
asked
in
Theory of Computation
Jul 22, 2016
by
pC
222
views
ace-booklet
theory-of-computation
6
votes
2
answers
20
ACE-BOOKLET-VOL1-CHAPTER1 (questions #9 page #53)
Question 9 solution is given as
pC
asked
in
Theory of Computation
Jul 22, 2016
by
pC
359
views
ace-booklet
theory-of-computation
regular-expression
2
votes
3
answers
21
ACE-BOOKLET-VOL1-CHAPTER1 ( questions #8 pages #53)
Consider the regular grammar generating the set of all strings ending in 00 S $\rightarrow$ 1S $\mid$ 0P P $\rightarrow$ 0C $\mid$ 0 $\mid$ 1S The production missing is C $\rightarrow$ 1S B $\rightarrow$ C1 D $\rightarrow$ C1 A $\rightarrow$ $\varepsilon$ Solution is given option A
pC
asked
in
Theory of Computation
Jul 22, 2016
by
pC
974
views
ace-booklet
theory-of-computation
regular-expression
3
votes
3
answers
22
ACE-BOOKLET-VOL1-CHAPTER1 (questions #14 page #54)
The regular expression denoting all the strings such that every even position occupied by ‘a’ [a+ba]* (a+b+c) b(a)a* + a(a)* ba(b)* aa(b)* aa(b)* aa(a)* Both a and c
pC
asked
in
Theory of Computation
Jul 22, 2016
by
pC
694
views
ace-booklet
theory-of-computation
regular-expression
1
vote
1
answer
23
ACE-BOOKLET-VOL1-CHAPTER1 (questions #5, page #53)
Questions 5
pC
asked
in
Theory of Computation
Jul 21, 2016
by
pC
315
views
ace-booklet
theory-of-computation
2
votes
1
answer
24
ACE-BOOKLET-VOL2-Level1-Chanpter5 ( Page #49 Question#9 )
Find Host Address from the following Given IP: 200.34.22.156 Mask : 255.255.255.240 Answer is given as IP and complemented MASK gives host ID 200.34.22.12 My Approach I have never seen anything like complementing MASK address to obtain ... 200.34.22.12 Host does not belong this range So HOST Address has to be 200.34.22.156 Given IP itself.
pC
asked
in
Computer Networks
Jul 16, 2016
by
pC
2.0k
views
subnetting
computer-networks
ace-booklet
0
votes
2
answers
25
Find the Space complexity of following Code [Ace Gate Practice Booklet Vol-1 Page 127]
Find the time and Space complexity of code below : void fun(n) { if (n==1) then call A(); else { fun(n/2); fun(n/2); call B(n); } } Please note that B(n) takes O(n) time and A(n) takes O(1) time respectively. ... above code would be : $T(n) = 2T(n/2)+O(n)$ which is $O(nlog(n))$ But What will be space complexity ?
APOORV PANSE
asked
in
Algorithms
Jun 2, 2016
by
APOORV PANSE
1.6k
views
space-complexity
algorithms
ace-booklet
1
vote
2
answers
26
Analysis of code fragment to find time complexity [ACE Gate Practice Booklet Volume 1 Page 127 Question 32]
APOORV PANSE
asked
in
Algorithms
Jun 1, 2016
by
APOORV PANSE
2.1k
views
asymptotic-notations
time-complexity
algorithms
ace-booklet
3
votes
2
answers
27
ACE-BOOKLET-VOL2-Level2-Q3 in swp ,sender utilization
If the packet size is 1KB and propagation time is 15ms, the channel capacity is $10^9$ b/s then find the transmission time and utilization of sender in stop and wait protocol.
kvkumar
asked
in
Computer Networks
Apr 13, 2016
by
kvkumar
1.5k
views
stop-and-wait
ace-booklet
numerical-answers
2
votes
2
answers
28
ACE-BOOKLET-VOL2-Level2-Chanpter5 ( Question #2 Page #52 )
The intermediate router between source and destination do not need the following information in IP header a.Protocol b.Identification number c.Source IP d.Version ans given = ALL FIELDS ARE REQUIRED. But according to me Identification number ... is used for reassembling of packets. and Reassembling is not done at router. plz clarify.......
tiger
asked
in
Computer Networks
Dec 8, 2015
by
tiger
1.6k
views
computer-networks
ace-booklet
To see more, click for the
full list of questions
or
popular tags
.
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
POWER GRID CORPORATION OF INDIA LIMITED
INSTITUTE OF BANKING PERSONNEL SELECTION
GATE Overflow books for TIFR, ISRO, UGCNET and NIELIT
RECRUITMENT IN OIL AND GAS CORPORATION LIMITED
Aptitude Overflow Book
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(9.1k)
Digital Logic
(3.2k)
Programming and DS
(5.8k)
Algorithms
(4.5k)
Theory of Computation
(6.6k)
Compiler Design
(2.3k)
Operating System
(4.9k)
Databases
(4.5k)
CO and Architecture
(3.7k)
Computer Networks
(4.5k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(647)
Exam Queries
(841)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(855)
Recent questions tagged ace-booklet
Recent Blog Comments
@abir_banerjee Thanks Abir. I'm third year...
@nolan_keats Currently I am in third year...
@abir_banerjee thank you Abir.Supposing you...
@nolan_keats just a suggestion as I also...
@abir_banerjee Hope I can do this in span of one...