Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged ace-test-series
0
votes
1
answer
1
Ace test series
dheerajgudipati
155
views
dheerajgudipati
asked
Jan 12
Computer Networks
computer-networks
ace-test-series
fragmentation
+
–
3
votes
1
answer
2
Can someone please explain how to solve this type of questions?
himanshu55
368
views
himanshu55
asked
Dec 9, 2023
Databases
test-series
gate-preparation
databases
ace-test-series
+
–
1
votes
2
answers
3
Ace Test series
Which of the following Language has Prefix property? A) L=01* B) L=0*1* c) L= {0" 1" | n>, 1} D) L= {WW | We(0+1)*}
Which of the following Language has Prefix property?A) L=01*B) L=0*1*c) L= {0" 1" | n>, 1}D) L= {WW | We(0+1)*}
amrish0524
283
views
amrish0524
asked
Nov 14, 2023
Theory of Computation
theory-of-computation
ace-test-series
+
–
0
votes
2
answers
4
ACE TOC Test
Which of the following regular expression represent the set of all the strings not containing $100$ as a substring ? $0^*(1^*0)^*$ $0^*1010^*$ $0^*1^*01^*$ $0^*(10+1)^*$
Which of the following regular expression represent the set of all the strings not containing $100$ as a substring ?$0^*(1^*0)^*$$0^*1010^*$$0^*1^*01^*$$0^*(10+1)^*$
Pratik.patil
401
views
Pratik.patil
asked
Oct 30, 2023
Theory of Computation
theory-of-computation
ace-test-series
regular-expression
+
–
0
votes
0
answers
5
Ace Academy Bits and Bytes
Assertion(a) : A relation R(ABC) is having 3 rows and results in 3 rows. Reason(r) : Natural Join join two tables based on all common columns with equality conditions. A . both 'a' and 'r' are true and 'r' is the correct ... 'a'. C. both 'a' and 'r' are false. D. 'a' is true but 'r' is false .
Assertion(a) : A relation R(ABC) is having 3 rows andresults in 3 rows.Reason(r) : Natural Join join two tables based on all common columns with equality conditions.A . b...
jaydip74
231
views
jaydip74
asked
Oct 29, 2023
Databases
bits
databases
ace-test-series
+
–
0
votes
1
answer
6
Ace Test Series | DBMS | B+ Trees
Consider the following description: To construct the B+ tree use the following values. Consider the database block size as 512 bytes, block pointer as 6 bytes, record pointer as 7 bytes and search key value as 9 bytes. What will be the number of data entries possible in level 2 of the B+ tree, if fill factor of the node is 0.8? 17,954 16,954 18,954 19,954
Consider the following description:To construct the B+ tree use the following values. Consider the database block size as 512 bytes, block pointer as 6 bytes, record poin...
none30
388
views
none30
asked
Sep 6, 2023
Databases
ace-test-series
databases
b-tree
+
–
1
votes
2
answers
7
Ace Test Series | COA | Addressing
A system support zero address, one address & two address instructions. Let 16-bit instruction is stored in 128-word memory. Identify the correct among the following. (A) 16K zero address, 128-one address, 2-two address instructions (B) 256 K ... -zero address instructions (C) 28 K zero address, 2-two address, 32-one address instructions (D) None of the above
A system support zero address, one address & two address instructions. Let 16-bit instruction is stored in 128-word memory. Identify the correct among the following.(A) 1...
none30
394
views
none30
asked
Sep 5, 2023
CO and Architecture
co-and-architecture
ace-test-series
instruction-format
+
–
0
votes
1
answer
8
Ace Test Series | Operating System | Paging
A machine supports a 48 bit virtual address and 32 bit physical address. Pages are 8KB. If the page table entry contains besides other information, one V/I bit, 1R, 1M and 2 bits for page protection. What is the page table size in bytes? 86 MB 128 MB 96 MB 512 MB
A machine supports a 48 bit virtual address and 32 bit physical address. Pages are 8KB. If the page table entry contains besides other information, one V/I bit, 1R, 1M an...
none30
301
views
none30
asked
Sep 4, 2023
Operating System
operating-system
ace-test-series
paging
+
–
0
votes
1
answer
9
Ace Test Series | Star Topology
Consider the star topology network where terminals are attached by a dedicated pair (one input and one output) of lines to a hub. The distance from each terminal to the hub is 'd' meters. Assume the packet size is 1250 ... allowed to transmit an unlimited number of packets/token. 2500 packets/token 25000 packets/token 250000 packets/token 25 packets/token
Consider the star topology network where terminals are attached by a dedicated pair (one input and one output) of lines to a hub. The distance from each terminal to the h...
none30
265
views
none30
asked
Jul 11, 2023
Computer Networks
computer-networks
ace-test-series
+
–
0
votes
1
answer
10
Ace Test Series | Latency
Consider the star topology 100 Mbps network where 125 terminals are attached by a dedicated pair (one input and one output) of lines to a hub. The distance from each terminal to the hub is 100 meters. Assume eight bit latency per station and velocity of propagation is 2.5 X ${{10^8}}$ m/sec. ... ${{10^{-6}}}$ s 1.10 X ${{10^{-6}}}$ s None of the above
Consider the star topology 100 Mbps network where 125 terminals are attached by a dedicated pair (one input and one output) of lines to a hub. The distance from each term...
none30
256
views
none30
asked
Jul 11, 2023
Computer Networks
computer-networks
ace-test-series
+
–
0
votes
2
answers
11
Ace Test Series | Operating System | Demand paging
On a system using demand paging, it takes 200 ns to satisfy a memory request if the page is in memory. If the page is not in memory, the request takes 7 ms if a free frame is available or the page to be replaces is not ... of the time the page to be replaced has been modified? 600.19 micro seconds 590.19 micro seconds 790.19 micro seconds none
On a system using demand paging, it takes 200 ns to satisfy a memory request if the page is in memory. If the page is not in memory, the request takes 7 ms if a free fram...
none30
434
views
none30
asked
Jul 1, 2023
Operating System
operating-system
demand-paging
ace-test-series
page-fault
+
–
0
votes
1
answer
12
Ace Test Series | Operating System | Demand Paging
On a system using demand - paged memory, it takes 120 ns to satisfy a memory request if the page is in memory. If the page is not in memory, the request takes 5 ms. What would the page fault rate need to be to achieve an effective access time of 1 us? 25% 30% 18% 20%
On a system using demand - paged memory, it takes 120 ns to satisfy a memory request if the page is in memory. If the page is not in memory, the request takes 5 ms. What ...
none30
558
views
none30
asked
Jul 1, 2023
Operating System
operating-system
demand-paging
ace-test-series
+
–
0
votes
1
answer
13
Ace Test Series | Operating System | Scheduling
Given a system using Round Robin scheduling, assuming it can perform a context- switch in zero time. Each process is allowed to run only one instruction before the next instruction is allocated to the CPU. The ready queue always contains n-processes. If ... -processing environment, how long will it take to execute on this system? n+t n*t n/t (n^2)t
Given a system using Round Robin scheduling, assuming it can perform a context- switch in zero time. Each process is allowed to run only one instruction before the next i...
none30
368
views
none30
asked
Jul 1, 2023
Operating System
operating-system
ace-test-series
round-robin-scheduling
+
–
1
votes
1
answer
14
Ace Test Series | DBMS
In multiple Granularity locking protocol at a particular node transaction T1 is holding SIX LOCK. When transaction T2 is also requesting a lock, at that node which other lock is allowed. I S I X S SIX X
In multiple Granularity locking protocol at a particular node transaction T1 is holding SIX LOCK. When transaction T2 is also requesting a lock, at that node which other ...
none30
355
views
none30
asked
Jun 16, 2023
Databases
ace-test-series
databases
+
–
0
votes
1
answer
15
Ace Test Series | DBMS
A schedule S is having 3 transactions and each transaction is having two different data items and a blind 'Write A' statement is in all the three transactions.With the above information can you say whether the schedule is ... how many equivalent serial schedules are there serializable and it is equivalent to only two serial schedule detailed schedule is needed
A schedule S is having 3 transactions and each transaction is having two different data items and a blind 'Write A’ statement is in all the three transactions.With the ...
none30
343
views
none30
asked
Jun 16, 2023
Databases
ace-test-series
databases
serializability
+
–
0
votes
1
answer
16
Ace Test Series | Computer Organistaion
A pipelined processor with a separate instruction & data cache has 5- stages, the cycle time 30 nano sec. It can start a new instruction on every cycle when there were no hazards. It is used with copy- back data cache with a block size of one - ... store which only result hazards. What is the throughout of CPU. a) 31 MIPS b) 24 MIPS c) 48 MIPS d) 10 MIPS
A pipelined processor with a separate instruction & data cache has 5- stages, the cycle time 30 nano sec. It can start a new instruction on every cycle when there were no...
none30
327
views
none30
asked
Jun 12, 2023
CO and Architecture
ace-test-series
co-and-architecture
pipelining
throughput
+
–
0
votes
0
answers
17
Ace test series
What is the smallest and largest number of entries for 2-3 BTree (B2-3 Tree) of height 8 (i.e., 8 levels) ? 255 and 6560 127 and 2186 6561 and 255 255 and 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 and 6560127 and 2186 6561 and 255255 and 2186
none30
439
views
none30
asked
Jun 11, 2023
DS
ace-test-series
data-structures
binary-tree
+
–
0
votes
1
answer
18
Ace Test Series
Consider six files: F1, F2, F3, F4, F5, F6 with corresponding sizes 100, 200, 70, 40, 250 and 50 respectively. the files are to be stored on a sequential device in such a way that as to optimize access time. In what order should the files be stored ?? A) ... approximate average access time of a record from one of the six files on the sequential device?? A) 131 B) 198 C) 286 D) 433
Consider six files: F1, F2, F3, F4, F5, F6 with corresponding sizes 100, 200, 70, 40, 250 and 50 respectively. the files are to be stored on a sequential device in such a...
none30
385
views
none30
asked
Apr 12, 2023
Operating System
ace-test-series
operating-system
file-organization
+
–
1
votes
1
answer
19
Context Free Language
The complement of the languages: i) {ww | w in (0+1)*} ii) {$a^n b^nc^n$ | n>1} are a) Context Free b) Not Context Free c)are DCFL’s d)None
The complement of the languages:i) {ww | w in (0+1)*}ii) {$a^n b^nc^n$ | n>1} area) Context Free b) Not Context Free c)are DCFL’s d)None
practicalmetal
372
views
practicalmetal
asked
Mar 20, 2023
Theory of Computation
context-free-language
theory-of-computation
ace-test-series
+
–
0
votes
0
answers
20
register allocation
nbhatt
459
views
nbhatt
asked
Jan 12, 2023
Compiler Design
compiler-design
register-allocation
ace-test-series
+
–
1
votes
2
answers
21
#ACE acedmy test series
In a host size for PDU of network layer is 17076 bytes, MTU size for that network is 200 bytes and IPv4 header size is 20 bytes .find number of IP fragments
In a host size for PDU of network layer is 17076 bytes, MTU size for that network is 200 bytes and IPv4 header size is 20 bytes .find number of IP fragments
amit166
485
views
amit166
asked
Jan 5, 2023
Computer Networks
computer-networks
network-layer
ip-addressing
ace-test-series
+
–
1
votes
1
answer
22
CN | ACE Test Series
Which of the following is/are TRUE? In virtual circuit switching, the scope of VCI(Virtual Circuit Identifier) is not the entire network. In datagram switching, packets are traveled in different paths. In Internet, we use virtual circuit switching technique. In circuit switching, the message is not break down into small pieces. MSQ
Which of the following is/are TRUE?In virtual circuit switching, the scope of VCI(Virtual Circuit Identifier) is not the entire network.In datagram switching, packets are...
anupamsworld
645
views
anupamsworld
asked
Dec 20, 2022
Computer Networks
computer-networks
test-series
ace-test-series
+
–
2
votes
1
answer
23
ace academy ToC
I don’t get the explanation, How do you categorize grammer on the basis of production?
I don’t get the explanation, How do you categorize grammer on the basis of production?
h4kr
573
views
h4kr
asked
Dec 4, 2022
Theory of Computation
theory-of-computation
context-sensitive
grammar
ace-test-series
+
–
0
votes
0
answers
24
Ace academy test series
Time Complexity in C will be O(n) right? and big omega (n) is also big omega (n^2), then why is c incorrect?
Time Complexity in C will be O(n) right? and big omega (n) is also big omega (n^2), then why is c incorrect?
Neelu Lalchandani
337
views
Neelu Lalchandani
asked
Nov 2, 2022
Algorithms
ace-test-series
algorithms
time-complexity
+
–
0
votes
0
answers
25
ACE Test Series Q#9 || Computer Network
ICMP error reporting messages are used for error handling and debugging network problem TRUE FALSE
ICMP error reporting messages are used for error handling and debugging network problemTRUEFALSE
Souvik33
330
views
Souvik33
asked
Oct 31, 2022
Computer Networks
computer-networks
icmp
ace-test-series
+
–
0
votes
0
answers
26
ACE Academy Test Series q #11 || Travelling Salesman
Souvik33
495
views
Souvik33
asked
Oct 30, 2022
Algorithms
dynamic-programming
graph-algorithms
ace-test-series
+
–
1
votes
0
answers
27
Ace Academy Test Series Qn#7
A hash function h maps 16-bit inputs to 8 bit hash values. What is the largest k such that in any set of 1000 inputs, there are atleast k inputs that h maps to the same hash value? 3 4 10 64
A hash function h maps 16-bit inputs to 8 bit hash values. What is the largest k such that in any set of 1000 inputs, there are atleast k inputs that h maps to the same h...
Souvik33
405
views
Souvik33
asked
Oct 30, 2022
DS
ace-test-series
data-structures
hashing
pigeonhole-principle
discrete-mathematics
+
–
0
votes
0
answers
28
Ace Academy Test Series
A hash function h maps 16-bit inputs to 8 bit hash values. What is the largest k such that in any set of 1000 inputs, there are atleast k inputs that h maps to the same hash value? 3 4 10 64
A hash function h maps 16-bit inputs to 8 bit hash values. What is the largest k such that in any set of 1000 inputs, there are atleast k inputs that h maps to the same h...
Souvik33
336
views
Souvik33
asked
Oct 30, 2022
DS
ace-test-series
data-structures
hashing
pigeonhole-principle
discrete-mathematics
+
–
0
votes
2
answers
29
ACE 2023 Test series: TOC: Basic properties
abhinowKatore
688
views
abhinowKatore
asked
Oct 18, 2022
Theory of Computation
theory-of-computation
regular-expression
closure-property
ace-test-series
+
–
1
votes
2
answers
30
Ace test series 2023
The return value of ace(4) is int ace(int a) { int x=1; static int k=1; if(a==1) return x; for(;k<a;++k) x=x+ace(k)*ace(a-k); return x; } A.15 B.4 C.10 D.Error
The return value of ace(4) is int ace(int a) { int x=1; static int k=1; if(a==1) return x; for(;k<a;++k) x=x+ace(k)*ace(a-k); return x; }A.15B.4C.10D.Error
Sazia Tabassum
601
views
Sazia Tabassum
asked
Oct 14, 2022
Programming in C
ace-test-series
programming-in-c
array
+
–
Page:
1
2
3
4
5
6
...
16
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register