Please use this identifier to cite or link to this item: http://ir.juit.ac.in:8080/jspui/jspui/handle/123456789/6866
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSrivastava, Abhijit-
dc.contributor.authorSingh, Yashwant [Guided by]-
dc.date.accessioned2022-09-27T04:48:41Z-
dc.date.available2022-09-27T04:48:41Z-
dc.date.issued2017-
dc.identifier.urihttp://ir.juit.ac.in:8080/jspui/jspui/handle/123456789/6866-
dc.description.abstractAs we all know computer based "von Neumann Architecture" are designed to achieve 100% efficiency, i.e. Generation of any random data states that the computation went wrong. That is why for the generation of random numbers, programmers and mathematicians have been designing complex algorithms with a large period for the generation of pseudo-random numbers. The word ‘pseudo’ means the pseudo-random numbers are not purely random in a way you might expect, at least not if it is compared to dice rolls or lottery tickets. Essentially, pseudo-random numbers generators are algorithms that use some kind of mathematical formula or just a pre-calculated tables to generate sequences of numbers that appear to be randomly generated. An example of a pseudo-random numbers generator can be the linear congruential methodology.en_US
dc.language.isoenen_US
dc.publisherJaypee University of Information Technology, Solan, H.P.en_US
dc.subjectNumber generatoren_US
dc.subjectCascade cdonstructionen_US
dc.titlePure Random Number Generatoren_US
dc.typeProject Reporten_US
Appears in Collections:B.Tech. Project Reports

Files in This Item:
File Description SizeFormat 
Pure Random Number Generator.pdf1.62 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.