Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by jugnu1337
3
votes
1
Made Easy Test Series
You are given an array of elements where each array element represents the MAXIMUM number of jumps that can be made in the forward direction from that element. Now, consider the following array: {1, 3, 5, 8, 9, 2, 6, 7, 6). What is the minimum number of jumps required to reach the end of the array?
You are given an array of elements where each array element represents the MAXIMUM number of jumps that can be made in the forward direction from that element. Now, consi...
878
views
answered
Aug 9, 2023
Algorithms
made-easy-test-series
made-easy-booklet
algorithms
data-structures
array
algorithm-design
+
–
0
votes
2
IB JIO Grade-2 Tech 2023 part-2: 17
Q.17 What is the output of the following part of python program? \[ \begin{array}{l} \mathrm{s}=\text { "india" } \\ \mathrm{l}=0 \end{array} \] for $\mathrm{x}$ in $\mathrm{s}$ : \[ \begin{array}{l} \text { if(x!="i"): } \ ... $\mathbf{6 3 0 6 8 0 1 0 8 2 4 0 6}$ Option 4 ID : 6306801082408 Status : Answered Chosen Option : 4
Q.17 What is the output of the following part of python program?\[\begin{array}{l}\mathrm{s}=\text { "india" } \\\mathrm{l}=0\end{array}\]for $\mathrm{x}$ in $\mathrm{s}$...
144
views
answered
Aug 1, 2023
Others
ibjio2023-part2
non-gate
python
+
–
0
votes
3
IB JIO Grade-2 Tech 2023 part-2: 27
Q.27 In a digital communication system, let the encoding scheme be "Add 1 at the end of the bit stream if number of 1 bits is odd, else add 0 at the end of bit stream". If 1011 is the bit stream, which of the ... : 6306801082303 Option 2 ID : 6306801082301 Option 3 ID : 6306801082302 Option 4 ID : 6306801082304 Status : Not Answered Chosen Option : --
Q.27 In a digital communication system, let the encoding scheme be "Add 1 at the end of the bit stream if number of 1 bits is odd, else add 0 at the end of bit stream". I...
146
views
answered
Aug 1, 2023
Others
ibjio2023-part2
+
–
0
votes
4
Galvin Edition 9 Exercise 8 Question 12 (Page No. 391)
Most systems allow a program to allocate more memory to its address space during execution. Allocation of data in the heap segments of programs is an example of such allocated memory. What is required to support dynamic memory allocation in the following schemes ? $a$. Contiguous memory allocation $b$. Pure segmentation $c$. Pure paging
Most systems allow a program to allocate more memory to its address space during execution. Allocation of data in the heap segments of programs is an example of such allo...
3.3k
views
answered
Jun 21, 2023
Operating System
galvin
operating-system
memory-management
+
–
1
votes
5
Computer Networks
Given answer 7th = 30 8th = c How??
Given answer 7th = 308th = c How??
389
views
answered
Oct 13, 2022
Computer Networks
computer-networks
test-series
subnetting
+
–
2
votes
6
NPTEL Assignment Question
Suppose we want to synchronize two concurrent processes P and Q
Suppose we want to synchronize two concurrent processes P and Q
549
views
answered
Jul 14, 2022
Operating System
nptel-quiz
operating-system
process-synchronization
binary-semaphore
+
–
1
votes
7
Applied Mathematics Calculus and Limit Question
Evaluate the question of the following limits. $\lim_{x\rightarrow \infty} \frac{2x^{3}+3x-5}{5x^{3}+1}$
Evaluate the question of the following limits. $\lim_{x\rightarrow \infty} \frac{2x^{3}+3x-5}{5x^{3}+1}$
472
views
answered
Jul 8, 2022
Calculus
calculus
limits
+
–
2
votes
8
Process synchronzation
A particular computation of counting semaphore is 7 Then 20p operation and x. V operation were completed on this semaphore If the final value of X will be 5 then what will be the value of x? Options a) 13 b) 18 C) 22 d) 2
A particular computation of counting semaphore is 7 Then 20p operation and x. V operation were completed on this semaphore If the final value of X will be 5 then what wi...
720
views
answered
Jul 8, 2022
Operating System
operating-system
process-synchronization
semaphore
+
–
1
votes
9
Are all Irrecoverable/Non-Recoverable schedules cascading?
Suppose, T1: W(X), T2: R(X), T1: W(X), T2: Commit, T1: Abort Here we can see T2 is getting committed before T1 aborts, so it is clearly an Irrecoverable schedule but is it cascading?
Suppose,T1: W(X), T2: R(X), T1: W(X), T2: Commit, T1: AbortHere we can see T2 is getting committed before T1 aborts, so it is clearly an Irrecoverable schedule but is it ...
745
views
answered
Dec 29, 2021
Databases
databases
transaction-and-concurrency
data
+
–
0
votes
10
self doubt
every strict recoverable schedule is conflict serializable..if not then why?
every strict recoverable schedule is conflict serializable..if not then why?
621
views
answered
Dec 29, 2021
Databases
transaction-and-concurrency
databases
+
–
2
votes
11
Which layer protocol RIP and OSPF are ? And why ?
596
views
answered
Dec 12, 2021
0
votes
12
CMI-2021-Data Science
239
views
answered
Dec 11, 2021
Probability
probability
+
–
1
votes
13
CMI-2021-Data Science
292
views
answered
Dec 11, 2021
Probability
probability
+
–
0
votes
14
CMI-2021-Data Science
262
views
answered
Dec 9, 2021
Linear Algebra
linear-algebra
+
–
1
votes
15
NPTEL Assignment Question
357
views
answered
Dec 8, 2021
Theory of Computation
nptel-quiz
+
–
1
votes
16
Gate@Zeal test series
Here each resource have a single instance, we can check whether a given system is safe or not is by checking whether there exists a cycle or not, To detect cycle in the graph, the most efficient algorithm is the DFS, So, Time complexity should be O(m+n), ... approximately equals to the number of vertices. But the answer given is O(m*n^2). Can anyone explain how O(m*n^2)?
Here each resource have a single instance, we can check whether a given system is safe or not is by checking whether there exists a cycle or not, To detect cycle in the g...
1.0k
views
answered
Dec 5, 2021
Operating System
operating-system
test-series
+
–
2
votes
17
Applied Mock Test
Find the next term in the series 10, 18, 28, 40, 54?
Find the next term in the series10, 18, 28, 40, 54?
477
views
answered
Dec 5, 2021
Quantitative Aptitude
test-series
general-aptitude
number-series
+
–
0
votes
18
Single accumulator organisation
The size of the instruction in a single accumulator is 16 bits. In order to evaluate the expression Y = A-B+C / E+F , how much memory space is required to store the program? a) 18 bytes b)24 bytes c)22 bytes d)20 bytes
The size of the instruction in a single accumulator is 16 bits. In order to evaluate the expression Y = A-B+C / E+F , how much memory space is required to store the progr...
1.4k
views
answered
Dec 5, 2021
1
votes
19
Single accumulator organisation
The size of the instruction in a single accumulator is 16 bits. In order to evaluate the expression Y = A-B+C / E+F , how much memory space is required to store the program? a) 18 bytes b)24 bytes c)22 bytes d)20 bytes
The size of the instruction in a single accumulator is 16 bits. In order to evaluate the expression Y = A-B+C / E+F , how much memory space is required to store the progr...
1.4k
views
answered
Dec 5, 2021
1
votes
20
Gate Applied course Test series
What is answer for this question and also please explain the approach
What is answer for this question and also please explain the approach
1.2k
views
answered
Nov 24, 2021
Operating System
virtual-memory
operating-system
memory
memory-management
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register