Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
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
1
answer
1
ace book
its output is 6??how?? // Online C++ compiler to run C++ program online #include <iostream> using namespace std; int main() { // Write int a=-3; a=-a-a+!a; cout<<a; return 0; }
its output is 6??how?? // Online C++ compiler to run C++ program online#include <iostream>using namespace std;int main() { // Write int a=-3; a=-a-a+!a; cout<...
Lifesuraj
230
views
Lifesuraj
asked
Oct 6, 2023
Programming in C
ace-booklet
+
–
0
votes
0
answers
2
Ace workbook dbms
gaddalakonda_ganesh
300
views
gaddalakonda_ganesh
asked
Feb 28, 2023
Databases
databases
rdbms
ace-booklet
+
–
1
votes
1
answer
3
CN | ACE Practice Book | Q47
Host A (on TCP/ IPv4 network A) sends an IP datagram to host B (also on TCP/IPV4 network B). Assume that, no error occurred during the transmission of D. When D reaches B, which of the following IP header field(s) may be different from that of the original datagram D? TTL Checksum Fragment offset HLEN (Header length)
Host A (on TCP/ IPv4 network A) sends an IP datagram to host B (also on TCP/IPV4 network B). Assume that, no error occurred during the transmission of D. When D reaches B...
anupamsworld
500
views
anupamsworld
asked
Dec 8, 2022
Computer Networks
computer-networks
tcp
ace-booklet
+
–
0
votes
2
answers
4
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
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
672
views
Shivam_j
asked
Oct 16, 2022
Computer Networks
ace-booklet
computer-networks
subnetting
easy
+
–
0
votes
1
answer
5
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?
Number of ways to assign 5 different people in 3 different rooms, so that each room contains at least one person?
Satyansh
530
views
Satyansh
asked
Sep 22, 2022
Mathematical Logic
combinatory
ace-booklet
+
–
1
votes
1
answer
6
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
What is the smallest and largest number of entries for 2_3 BTree (B2_3 Tree) of height 8 (i.e 8 levels) ? 255 & 6560127 & 21866561 & 255255 & 2186
casberg
498
views
casberg
asked
Nov 23, 2021
DS
data-structures
b-tree
tree
ace-booklet
+
–
1
votes
0
answers
7
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 ... is attended by the assigned doctor when she gives birth? (A) 25/144 (B) 5/12 (C) 7/12 (D) 1/12
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 h...
JAYKISHAN
873
views
JAYKISHAN
asked
May 30, 2019
Mathematical Logic
probability
ace-booklet
+
–
4
votes
3
answers
8
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$
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 su...
`JEET
1.1k
views
`JEET
asked
May 26, 2019
Graph Theory
graph-theory
ace-booklet
+
–
2
votes
3
answers
9
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.
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 bipartit...
`JEET
1.9k
views
`JEET
asked
May 26, 2019
Graph Theory
graph-theory
ace-booklet
+
–
3
votes
1
answer
10
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.
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...
`JEET
633
views
`JEET
asked
May 26, 2019
Graph Theory
graph-theory
discrete-mathematics
ace-booklet
+
–
1
votes
2
answers
11
#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.
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 ver...
`JEET
2.6k
views
`JEET
asked
May 26, 2019
Graph Theory
discrete-mathematics
graph-theory
ace-booklet
+
–
0
votes
1
answer
12
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)
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)= the...
gate_dreams
353
views
gate_dreams
asked
Jan 27, 2019
Algorithms
ace-booklet
algorithms
time-complexity
+
–
1
votes
1
answer
13
Ace booklet questions no 07
If A∆B = (A intersection B) whole complement than the universal set is??
If A∆B = (A intersection B) whole complement than the universal set is??
Anjali2002
326
views
Anjali2002
asked
Sep 18, 2018
Set Theory & Algebra
ace-booklet
set-theory&algebra
engineering-mathematics
set-theory
+
–
0
votes
1
answer
14
ace booklet
whats ans of this qn and please explain
whats ans of this qn and please explain
Vegeta
934
views
Vegeta
asked
Sep 13, 2018
Mathematical Logic
ace-booklet
engineering-mathematics
discrete-mathematics
propositional-logic
+
–
0
votes
1
answer
15
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.
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...
JAYKISHAN
790
views
JAYKISHAN
asked
Jul 5, 2018
Algorithms
algorithms
ace-booklet
divide-and-conquer
+
–
0
votes
1
answer
16
LEFT RECURSION
To avoid left recursion can we do like this. I think this is incorrect way to do
To avoid left recursion can we do like this. I think this is incorrect way to do
learner_geek
1.3k
views
learner_geek
asked
Aug 5, 2017
Compiler Design
compiler-design
grammar
parsing
left-recursion
ace-booklet
+
–
1
votes
1
answer
17
First and Follow
Example 3.3
Example 3.3
learner_geek
2.5k
views
learner_geek
asked
Aug 5, 2017
Compiler Design
compiler-design
parsing
first-and-follow
ll-parser
descriptive
ace-booklet
+
–
0
votes
2
answers
18
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 ??
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...
Payal Rastogi
646
views
Payal Rastogi
asked
Oct 19, 2016
Algorithms
time-complexity
algorithms
ace-booklet
+
–
1
votes
3
answers
19
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
Which are invalid process state transition?a. Timer Start: ready->runningb. Timer Out: running->blockedc. I/O: running->readyd. Resume : suspend->running
harshit agarwal
1.7k
views
harshit agarwal
asked
Oct 13, 2016
Operating System
process-scheduling
operating-system
ace-booklet
+
–
1
votes
0
answers
20
Ace Practice booklet
T(n)=sqrt(2T(n/2))+logn
T(n)=sqrt(2T(n/2))+logn
Ankush Tiwari
648
views
Ankush Tiwari
asked
Jul 27, 2016
Algorithms
ace-booklet
time-complexity
recurrence-relation
+
–
2
votes
1
answer
21
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?
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 c...
pC
505
views
pC
asked
Jul 22, 2016
Theory of Computation
ace-booklet
theory-of-computation
+
–
1
votes
1
answer
22
ACE-BOOKLET-VOL1-CHAPTER1 ( Question #19 page #54)
Question 19 solution given as A Need explanation
Question 19solution given as ANeed explanation
pC
326
views
pC
asked
Jul 22, 2016
Theory of Computation
ace-booklet
theory-of-computation
+
–
6
votes
2
answers
23
ACE-BOOKLET-VOL1-CHAPTER1 (questions #9 page #53)
Question 9 solution is given as
Question 9solution is given as
pC
523
views
pC
asked
Jul 22, 2016
Theory of Computation
ace-booklet
theory-of-computation
regular-expression
+
–
2
votes
3
answers
24
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
Consider the regular grammar generating the set of all strings ending in 00S $\rightarrow$ 1S $\mid$ 0PP $\rightarrow$ 0C $\mid$ 0 $\mid$ 1SThe production missing is C $\...
pC
1.3k
views
pC
asked
Jul 22, 2016
Theory of Computation
ace-booklet
theory-of-computation
regular-expression
+
–
3
votes
3
answers
25
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
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
1.0k
views
pC
asked
Jul 22, 2016
Theory of Computation
ace-booklet
theory-of-computation
regular-expression
+
–
1
votes
1
answer
26
ACE-BOOKLET-VOL1-CHAPTER1 (questions #5, page #53)
Questions 5
Questions 5
pC
501
views
pC
asked
Jul 21, 2016
Theory of Computation
ace-booklet
theory-of-computation
+
–
2
votes
1
answer
27
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.
Find Host Address from the followingGiven IP: 200.34.22.156 Mask : 255.255.255.240Answer is given asIP and complemented MASK gives host ID 200.34.22.12My ApproachI have ...
pC
2.5k
views
pC
asked
Jul 16, 2016
Computer Networks
subnetting
computer-networks
ace-booklet
+
–
0
votes
2
answers
28
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 ?
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 ...
APOORV PANSE
2.0k
views
APOORV PANSE
asked
Jun 2, 2016
Algorithms
space-complexity
algorithms
ace-booklet
+
–
1
votes
2
answers
29
Analysis of code fragment to find time complexity [ACE Gate Practice Booklet Volume 1 Page 127 Question 32]
Consider the following c fragment : void DAA(n) { int i,j,k,x=0; for (i=1 ; i <=n ; i++) for (j=1 ; j <= i * i ; j++) { if ( j mod i == 0 ) for ( k = 1 ; k <= j ; k++) x=...
APOORV PANSE
3.0k
views
APOORV PANSE
asked
Jun 1, 2016
Algorithms
asymptotic-notation
time-complexity
algorithms
ace-booklet
+
–
3
votes
2
answers
30
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.
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 prot...
kvkumar
3.1k
views
kvkumar
asked
Apr 13, 2016
Computer Networks
stop-and-wait
ace-booklet
numerical-answers
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register