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
Questions by rsansiya111
0
votes
0
answers
1
Help
I need computer networks tanenbaum 4th edition solutions Kindly help anyone
I need computer networks tanenbaum 4th edition solutionsKindly help anyone
146
views
asked
Nov 11, 2022
Computer Networks
computer-networks
+
–
0
votes
1
answer
2
PhD Entrance Test
Consider all 6-digit numbers of the form abccba where b is odd. Determine the number of all such 6-digit numbers that are divisible by 7.
Consider all 6-digit numbers of the form abccba where b is odd. Determine the number of all such 6-digit numbers that are divisible by 7.
359
views
asked
Nov 9, 2022
Unknown Category
written-test
admissions
+
–
1
votes
2
answers
3
Telegram Quiz
(1101)x = (241)16 x = ?
(1101)x = (241)16x = ?
651
views
asked
Nov 8, 2022
Digital Logic
test-series
digital-logic
number-system
+
–
0
votes
2
answers
4
GATE CS Applied Course Test Series
In the GO back N ARQ sender is sending the 15 packets to the destination with a window size of 5.Assume every sixth packet while transmission is lost. How many transmissions will there be?
In the GO back N ARQ sender is sending the 15 packets to the destination with a window size of 5.Assume every sixth packet while transmission is lost. How many transmiss...
1.3k
views
asked
Nov 2, 2022
Computer Networks
computer-networks
applied-gate-test-series
go-back-n
+
–
0
votes
1
answer
5
Algorithm Quiz
392
views
asked
Oct 13, 2022
Algorithms
algorithms
+
–
0
votes
0
answers
6
CBRT Computer Engineering Paper
136
views
asked
Oct 11, 2022
Others
non-gate
+
–
1
votes
0
answers
7
COMBINED CBRT FOR THE POST OF DEPUTY CENTRAL INTELLIGENCE OFFICER
What is the length of an ICMP data field for an Ethernet frame that is carrying an IP datagram with a 20 byte header, an ICMP message with a header length of 8 bytes and the Ethernet data field is 480 bytes long? (a) 452 bytes (b) 480 bytes (c) 256 bytes (d) 280 bytes
What is the length of an ICMP data field for an Ethernet frame that is carrying an IP datagram with a 20 byte header, an ICMP message with a header length of 8 bytes and ...
275
views
asked
Oct 8, 2022
Computer Networks
computer-networks
icmp
ethernet
+
–
3
votes
1
answer
8
Computer Network Question
A network using CSMA/CD has a bandwidth of 10 Mbps. If the maximum propagation time including the delays in the devices and ignoring the time needed to send a jamming signal is 25.6 𝜇s, the minimum size of the frame is: (a) 256 bits (b) 1024 bits (c) 128 bits (d) 512 bits
A network using CSMA/CD has a bandwidth of 10 Mbps. If the maximum propagation time including the delays in the devices and ignoring the time needed to send a jamming sig...
1.4k
views
asked
Oct 8, 2022
Computer Networks
computer-networks
csma-cd
+
–
0
votes
1
answer
9
Programming Quiz
Which one of the following features is supported by 𝐶 ++ but not by JAVA ? (a) Encapsulation (b) Multiple inheritance (c) Concurrency (d) Garbage collection
Which one of the following features is supported by 𝐶 ++ but not by JAVA ?(a) Encapsulation(b) Multiple inheritance(c) Concurrency(d) Garbage collection
1.0k
views
asked
Oct 7, 2022
Object Oriented Programming
object-oriented-programming
+
–
0
votes
1
answer
10
Oops Quiz
Which one of the following fundamental features of the OOPs is not supported by 𝐶++? (a) Persistence (b) Delegation (c) Genericity (d) Data abstraction
Which one of the following fundamental features of the OOPs is not supported by 𝐶++?(a) Persistence(b) Delegation(c) Genericity(d) Data abstraction
782
views
asked
Oct 7, 2022
Object Oriented Programming
object-oriented-programming
non-gate
+
–
0
votes
1
answer
11
Computer Network Quiz
A Hamming code can correct all combinations of 𝑘 or fewer errors if and only if the minimum distance between any two code words is at least: (a) 𝑘 + 1 (b) 𝑘 − 1 (c) 2𝑘 + 1 (d) 2𝑘 − 1
A Hamming code can correct all combinations of 𝑘 or fewer errors if and only if the minimum distance between any two code words is at least:(a) 𝑘 + 1(b) 𝑘 − 1(...
423
views
asked
Oct 7, 2022
Computer Networks
computer-networks
+
–
1
votes
1
answer
12
Programming Question
An object whose contents cannot be changed once the object is created is called: (a) Immutable object (b) Mutable object (c) Smart object (d) Rich object
An object whose contents cannot be changed once the object is created is called:(a) Immutable object(b) Mutable object(c) Smart object(d) Rich object
380
views
asked
Oct 7, 2022
Programming in C
java
object-oriented-programming
+
–
0
votes
1
answer
13
Digital Logic Question
473
views
asked
Oct 7, 2022
Digital Logic
digital-logic
flip-flop
sequential-circuit
+
–
1
votes
1
answer
14
Digital Logic Question
Consider the following statements regarding the logic circuits: 1. In combinational logic circuits, the outputs at any instant of time are entirely dependent upon the inputs present at that time. 2. The behavior of synchronous sequential circuit depends upon the order in which its input signals change and ... ? (a) 1, 2 and 3 (b) 1 and 2 only (c) 2 and 3 only (d) 1 and 3 only
Consider the following statements regarding the logic circuits:1. In combinational logic circuits, the outputs at any instant of time are entirely dependent upon the inpu...
623
views
asked
Oct 7, 2022
Digital Logic
digital-logic
combinational-circuit
sequential-circuit
+
–
0
votes
2
answers
15
igate Test Series
Rahul knows the implementation of merge sort. One day, his teacher asked him to find numbers of inversion in an array. An inversion can be defined in an array as if i < j, a[i] > a[j] then it is an inversion. Now, given there are p inversions in an ... multiply all elements by -1, what is the time complexity to find inversions in an updated array? O(n) O(nlogn) O(n^2) None
Rahul knows the implementation of merge sort. One day, his teacher asked him to find numbers of inversion in an array. An inversion can be defined in an array as if i < j...
501
views
asked
Sep 23, 2022
Algorithms
algorithms
array-inversion
i-gate-test-series
+
–
1
votes
1
answer
16
PhD Qualifier Examination, Paper I
Give a context-free grammar for the set of all strings over the alphabet {a, b} with exactly twice as many a’s as b’s. Explain the working of the grammar by characterizing the strings generated by each non-terminal.
Give a context-free grammar for the set of all strings over the alphabet {a, b} with exactly twice as many a’s as b’s. Explain the working of the grammar by character...
275
views
asked
Sep 17, 2022
Theory of Computation
theory-of-computation
context-free-grammar
+
–
1
votes
2
answers
17
PhD Admissions Written Test (Basic)
Let x1, x2, ...x8 be 8 propositional variables. Let · represent AND connective ⊕ represent the Exclusive-or connective. The number of satisfying assignments of the formula x1 ⊕ x2 ⊕ ...x8 is _________________ The number of satisfying assignments of the formula (x1·x2) ⊕ (x3·x4)... ⊕ (x7·x8) is __________________
Let x1, x2, ...x8 be 8 propositional variables. Let · represent AND connective ⊕ represent the Exclusive-or connective.The number of satisfying assignments of the form...
493
views
asked
Sep 11, 2022
Mathematical Logic
written-test
iit
discrete-mathematics
+
–
2
votes
1
answer
18
PhD Admissions Written Test (Basic)
Let A be an array containing n integers. It is required to find 3 indices i, j, k such that i < j < k and either A[i] ≤ A[j] ≤ A[k] or A[i] ≥ A[j] ≥ A[k], if such indices exist. The asymptotic time complexity of the fastest algorithm for this problem, assuming the array is already available, is Θ(_____________).
Let A be an array containing n integers. It is required to find 3 indices i, j, k such that i < j < k and either A[i] ≤ A[j] ≤ A[k] or A[i] ≥ A[j] ≥ A[k], if such...
403
views
asked
Sep 11, 2022
Others
data-structures
algorithms
+
–
0
votes
0
answers
19
PhD Admissions Written Test (Basic)
Let A be a sorted array of distinct integers of length n. Design an algorithm to find an index i such that A[i] = i if such an index exists. If there are more than one such indices, you may output any one ... −1. The asymptotic time complexity of the fastest algorithm for this problem, assuming the array is already available, is Θ ______________________________
Let A be a sorted array of distinct integers of length n. Design an algorithm to find an index i such that A[i] = i if such an index exists. If there are more than one su...
472
views
asked
Sep 10, 2022
Others
sorting
array
time-complexity
asymptotic-notation
+
–
0
votes
0
answers
20
PhD Admissions Written Test (Basic)
Consider all permutations of the 16 numbers from 1 to 16 which satisfy the property that every number is placed such that it is either bigger than ALL numbers preceding it or it is smaller than ALL numbers preceding it. The number of such permutations is ________________________
Consider all permutations of the 16 numbers from 1 to 16 which satisfy the property that every number is placed such that it is either bigger than ALL numbers preceding i...
326
views
asked
Sep 10, 2022
Others
written-test
admissions
combinatory
+
–
Page:
1
2
3
4
5
6
...
13
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register