The Eladr Protocol is a decentralized, security and efficiency enhanced Web3 noSQL database powered by IPFS as the data storage layer https://ipfs.io/, and the Cardano block chain as the rewards token platform, https://cardano.org/. It provides a JSON based, IPFS layer 2 solution for data indexing and retrieval in an 'append only' file system built with open source Node.js API libraries.

The ELADR token was designed to incentivize and reward community members as a proof of contribution. Token holders are also granted access to EduLadder.com premium features as well as associated ELADR token enabled apps.

WHITE PAPER Buy Now Try BETAReal Problems! Real Experts!

Join Our Telegram Channel !

In eduladder you can Ask,Answer,Listen,Earn and Download Questions and Question papers.

Watch related videos of your favorite subject.

Connect with students from different parts of the world.

Apply or Post Jobs, Courses ,Internships and Volunteering opportunity. For FREE

See Our team

Wondering how we keep quality?

Got unsolved questions? Ask Questions

Checkout our YouTube channel for video tutorials and learn more about Eduladder.

Searching for :NCERTDate:2023-03-21 06:42:24Done by:Anonymous user(Visitor)

Searching for :JavaScriptDate:2023-03-21 06:42:11Done by:Anonymous user(Visitor)

View All

### Similar Questions

**Q.51) A computer network uses polynomial over GF(2) for error checking with 8 bits as information bits and uses x3 + x + 1 as the generator polynomial to generate the check bits. In this network, the message 01011011 is transmitted as -gate computer science 2017**

1 Answer

**When two 8-bit numbers A7 ... A0 and B7 ... B0 in 2s complement representation (with A0 and B0 as the least significant bits) are added using ripple-carry adder. the sum bits obtained are S7 ... S0 and the carry bits are C7 ... C0. An overflow is said to have occured if : -gate computer science 2017**

1 Answer

**When two 8-bit numbers A7 ... A0 and B7 ... B0 in 2s complement representation (with A0 and B0 as the least significant bits) are added using ripple-carry adder. the sum bits obtained are S7 ... S0 and the carry bits are C7 ... C0. An overflow is said to have occured if : -gate computer science 2017**

1 Answer

**A certain processor uses a fully associative cache of size 16 kB. The cache block size is 16 bytes. Assume that the main memory is byte addressable and uses a 32-bit address. How many bits are required for the Tag and the Index fields respectively in the addresses generated by the processor?**

0 Answer

**A nibble is: 1) 8 bits 2) 16 bits 3) 32 bits 4) 64 bits**

1 Answer

**Consider Z = X – Y, where X, Y and Z are all in sign-magnitude form. X and Y are each represented in n bits. To avoid overflow, the representation of Z would require a minimum of:**

0 Answer

**Consider a source computer(S) transmitting a file of size 10^6 bits to a destination computer(D) -gate-cse-2012**

1 Answer

**A computer has a 256 KByte, 4-way set associative, write back data cache with block size of 32 Bytes. -gate-cse-2012**

1 Answer

**Q.56) A cache memory unit with capacity of N words and block size of B words is to be designed. If it is designed as direct mapped cache, the length of the TAG field is 10 bits. If the cache unit is now designed as a 16-way set-associative cache, the length of the TAG field is ______ bits. -gate computer science 2017**

1 Answer

**A computer has a 256 KByte, 4-way set associative, write back data cache with block size of 32 Bytes. -gate-cse-2012**

1 Answer

**The n-bit fixed-point representation of an unsigned real number X uses f bits for the fraction part. Let i = n - f. The range of decimal values for X in this representation is :- -gate computer science 2017**

1 Answer

**A voice signal m(t) is in the frequency range 5 kHz to 15 kHz. The signal is amplitude- modulated to generate an AM signal f(t) = A(1 + m(t)) cos 2πfc t, where fc = 600 kHz. The AM signal f(t) is to be digitized and archived. This is done by first sampling f(t) at 1.2 times the Nyquist frequency, and then quantizing each sample using a 256-level quantizer. Finally, each quantized sample is binary coded using K bits, where K is the minimum number of bits required for the encoding. The rate, in Megabits per second (rounded off to 2 decimal places), of the resulting stream of coded bits is _______ Mbps.**

0 Answer

**The amount of ROM needed to implement a 4 bit multiplier is -gate-computer science-2012**

1 Answer

**Frequency of an analog periodic signal in the range of 5kHz –10kHz is to be measured with a resolution of 100Hz by measuring its period with a counter. Assuming negligible signal and transition delays the minimum clock frequency and minimum**

1 Answer

**The decimal value 0.5 in IEEE single precision floating point representation has -gate-cse-2012**

1 Answer

**The decimal value 0.5 in IEEE single precision floating point representation has -gate-computer science-2012**

1 Answer

**The amount of ROM needed to implement a 4 bit multiplier is -gate-cse-2012**

1 Answer

**Assume that in a certain computer, the virtual addresses are 64 bits long and the physical addresses are 48 bits long. The memory is word addressible. The page size is 8 kB and the word size is 4 bytes. The Translation Look-aside Buffer (TLB) in the address translation path has 128 valid entries. At most how many distinct virtual addresses can be translated without any TLB miss?**

0 Answer

**A RAM chip has a capacity of 1024 words of 8 bits each (1K x 8 ) . The number of 2 x 4 decoders with enable line needed to construct a 16K x 16 RAM from 1K x 8 RAM is -gate-computer science-2013**

1 Answer

**C onsider a long-lived TCP session with an end-to-end bandwidth of 1 Gbps (= 109 bits-persecond). The session starts with a sequence number of 1234. The minimum time (in seconds, rounded to the closest integer) before this sequence number can be used again is _______.**

1 Answer

### Notes

**Networks Laboratory Manual -10CSL77**

**GATE-Computer-Science-Engineering-2017**

**Packet Sniffers**

**SPEED PROTOCOL**

**COMPUTER NETWORKS I10CS55 unit 8**

**SYSTEM SOFTWARE [10CS52] Unit-1**

**bio molecular computing**

**GATE Computer Science Engineering / Information Technology Question Paper 2012 download**

**GATE Computer Science Engineering / Information Technology Question Paper with Answer key 2011 download**

**Setting up a LAN using Linux**

## Q.51) A computer network uses polynomial over GF(2) for error checking with 8 bits as information bits and uses x3 + x + 1 as the generator polynomial to generate the check bits. In this network, the message 01011011 is transmitted as -gate computer science 2017

Asked On2018-05-28 09:49:29 by:satyashiromani

Taged users:

FututronShivam-Yadavsatyashiromani13priyathegdxvaishnavi-Deshpandemilanyoyoyogmailcomsukhil-vadakkanUmangShikhilThreeRedajithvmManisha12milan-ransinghleoAaditimadachodtichaona-garaidengaronaldbinojinsnjjosesumeshVinitTholakeleprabhat2346batsam22mmodi1995iamknownvishwadeepsoumya

Likes:

Oshal-Borkar

Dislikes:

Be first to dislike this question

Talk about this Like Dislike

Download question setAnswersC) 01011011101We add (n-1) 0's to the LSB of dividend(message) and divided by given GF g20172_51 The remainder will be CRC, it will be added to the LSB of the original message, that should be transmitted to the receiver. That is: 01011011101.Deepak RajLikes:

Be first to like this answer

Dislikes:

Be first to dislike this answer

Talk about this Like Dislike

Lets together make the web is a better placeWe made eduladder by keeping the ideology of building a supermarket of all the educational material available under one roof. We are doing it with the help of individual contributors like you, interns and employees. So the resources you are looking for can be easily available and accessible also with the freedom of remix reuse and reshare our content under the terms of creative commons license with attribution required close.

You can also contribute to our vision of "Helping student to pass any exams"with these.Answer a question:You can answer the questions not yet answered in eduladder.How to answer a questionCareer:Work or do your internship with us.Work with usCreate a video:You can teach anything and everything each video should be less than five minutes should cover the idea less than five min.How to upload a video on eduladder