GATE Exam  Aptitude Questions  GATE Syllabus  GATE Result  Mock Test  GATE Preparation
Best Answer to Any Question
Toggle navigation
GATE FORUM
Email or Username
Password
Remember
Login
Register

I forgot my password
Ask a Question
Submit Question
transmitted using the CRC polynomial
0
votes
The message 11001001 is to be transmitted using the CRC polynomial x^3 + 1 to protect it from errors. The message that should be transmitted is:
asked
in
Flow and error control techniques, switching
by
gate
answer
flag
Your answer
Your name to display (optional):
Email me at this address if my answer is selected or commented on:
Email me if my answer is selected or commented on
Privacy: Your email address will only be used for sending these notifications.
Antispam verification:
To avoid this verification in future, please
log in
or
register
.
Add answer
Cancel
1 Answer
0
votes
11001001011
answered
by
gate
comment
flag
ask related question
Your comment on this answer:
Your name to display (optional):
Email me at this address if a comment is added after mine:
Email me if a comment is added after mine
Privacy: Your email address will only be used for sending these notifications.
Antispam verification:
To avoid this verification in future, please
log in
or
register
.
Add comment
Cancel
Related questions
0
votes
1
answer
generator polynomial used for CRC checking detect odd number of bits in error
Let G(x) be the generator polynomial used for CRC checking. What is the condition that should be satisfied by G(x) to detect odd number of bits in error? A G(x) contains more than two terms B G(x) does not divide 1+x^k, for any k not exceeding the frame length C 1+x is a factor of G(x) D G(x) has an odd number of terms.
asked
in
Flow and error control techniques, switching
by
gate
0
votes
1
answer
maximum window size for data transmission using the selective reject protocol
The maximum window size for data transmission using the selective reject protocol with nbit frame sequence numbers is:
asked
in
Flow and error control techniques, switching
by
gate
0
votes
0
answers
f (x) be a polynomial and g(x) = f (x) be its derivative. If the degree
Let f (x) be a polynomial and g(x) = f (x) be its derivative. If the degree of (f(x) + f(−x)) is 10, then the degree of (g(x) − g(−x)) is _______________
asked
in
Linear Algebra
by
gate
0
votes
1
answer
sliding window ARQ scheme, the transmitter's window size is N and the receiver's window size is M. The minimum number of distinct sequence numbers required to ensure correct operation of the ARQ scheme
In a sliding window ARQ scheme, the transmitter's window size is N and the receiver's window size is M. The minimum number of distinct sequence numbers required to ensure correct operation of the ARQ scheme is A min (M, N) B max (M, N) C M + N D MN
asked
in
Flow and error control techniques, switching
by
gate
0
votes
0
answers
satellite communication link minimum number of bits required for the sequence number field to achieve 100% utilization
Consider a 128×10 3 bits/second satellite communication link with one way propagation delay of 150 milliseconds. Selective retransmission (repeat) protocol is used on this link to send data with a frame size of 1 kilobyte. Neglect the transmission time of acknowledgement. The minimum number of bits required for the sequence number field to achieve 100% utilization is ___________
asked
in
Flow and error control techniques, switching
by
gate
0
votes
0
answers
sliding window protocol minimum time the sender will have to wait before starting transmission of the next frame
Consider the data of previous question. Suppose that the sliding window protocol is used with the sender window size of 2^i where is the number of bits identified in the previous question and acknowledgments are always piggybacked. After sending 2^i frames, what is the minimum time the sender will have to wait before starting transmission of the next frame? (Identify the closest choice ignoring the frame processing time.)
asked
in
Flow and error control techniques, switching
by
gate
0
votes
0
answers
What are the advantages of using pointers?
Pointers are special variables which store address of some other variables. Syntax: datatype *ptr; Here * indicates that ptr is a pointer variable which represents value stored at a particular address. Example: int *p; 'p' is a pointer variable pointing to address location where an integer type is stored. Advantages: 1. Pointers allow us to pass values to functions using call by reference. This is useful when large sized arrays are passed as arguments to functions. A function can return more ... . For instance, if an array's memory is fixed, it cannot be resized. But in case of an array whose memory is created out of malloc can be resized. 4. Pointers point to physical memory and allow quicker access to data.
asked
in
Programming
by
anonymous
cprogramming
pointers
pointer
0
votes
1
answer
cube is built using 64 cubic blocks of side one unit. After it is built, one cubic block is removed from every corner of the cube. The resulting surface area of the body (in square units) after the removal
A cube is built using 64 cubic blocks of side one unit. After it is built, one cubic block is removed from every corner of the cube. The resulting surface area of the body (in square units) after the removal is __________.
asked
in
aptitude questions
by
gate
gate
aptitude
test
questions
answers
0
votes
1
answer
join (relation algebra) between relations r(R)and s(S) using the nested loop method
Consider a join (relation algebra) between relations r(R)and s(S) using the nested loop method. There are 3 buffers each of size equal to disk block size, out of which one buffer is reserved for intermediate results. Assuming size(r(R)) < size(s(S)), the join will have fewer number of disk block accesses if A relation r(R) is in the outer loop. B relation s(S) is in the outer loop. C join selection factor between r(R) and s(S) is more than 0.5. D join selection factor between r(R) and s(S) is less than 0.5.
asked
in
Relational model: relational algebra, tuple calculus, SQL
by
gate
0
votes
1
answer
tightest upper bound on the running time on Depth First Search DFS using adjacency matrix
Let G be a graph with n vertices and m edges. What is the tightest upper bound on the running time on Depth First Search of G? Assume that the graph is represented using adjacency matrix.
asked
in
graphs
by
gate
The best answer to any question
All categories
Computer Science & Information Technology
453
Computer Science
10
Information Technology
0
Digital Logic
10
Computer Architecture
28
Programming
38
Data Structures
67
Algorithms
66
Theory of Computation
45
Compiler Design
28
Operating System
44
Databases
46
Computer Networks
65
Computer Networks
4
Concept of layering & LAN technologies (Ethernet)
7
Flow and error control techniques, switching
11
IPv4/IPv6
6
routers and routing algorithms (distance vector, link state)
5
TCP/UDP and sockets
10
congestion control
2
Application layer protocols (DNS, SMTP, POP, FTP, HTTP)
9
Basics of WiFi
1
Network security: key cryptography, digital signatures, firewalls
5
networking
3
Mathematics
81
Aptitude Questions
114
GATE
94
Online Aptitude Test
6
Gate Exam
22
Gate Syllabus
6
Gate Preparation
36
Gate Coaching
14
Online Registration
21
Electronics and Communication (EC)
0
Electrical Engineering (EE)
3
Civil Engineering (CE)
0
Mechanical Engineering (ME)
1
Aerospace Engineering (AE)
0
Agricultural Engineering (AG)
0
Architecture and Planning (AR)
0
Biotechnology (BT)
0
Chemical Engineering (CH)
0
Chemistry (CY)
0
Ecology and Evolution (EY)
0
Geology and Geophysics (GG)
0
Instrumentation Engineering (IN)
0
Mining Engineering (MN)
0
Metallurgical Engineering (MT)
0
Petroleum Engineering (PE)
0
Physics (PH)
0
Production and Industrial Engineering (PI)
0
Textile Engineering and Fibre Science (TF)
0
Engineering Sciences
0
Life Sciences
0
Mathematics (MA)
0
Related questions
generator polynomial used for CRC checking detect odd number of bits in error
maximum window size for data transmission using the selective reject protocol
f (x) be a polynomial and g(x) = f (x) be its derivative. If the degree
sliding window ARQ scheme, the transmitter's window size is N and the receiver's window size is M. The minimum number of distinct sequence numbers required to ensure correct operation of the ARQ scheme
satellite communication link minimum number of bits required for the sequence number field to achieve 100% utilization
sliding window protocol minimum time the sender will have to wait before starting transmission of the next frame
What are the advantages of using pointers?
cube is built using 64 cubic blocks of side one unit. After it is built, one cubic block is removed from every corner of the cube. The resulting surface area of the body (in square units) after the removal
join (relation algebra) between relations r(R)and s(S) using the nested loop method
tightest upper bound on the running time on Depth First Search DFS using adjacency matrix