Amortized efficiency of list update and paging rules
Communications of the ACM
Routing, merging, and sorting on parallel models of computation
Journal of Computer and System Sciences
Constructing a perfect matching is in random NC
Combinatorica
Journal of the ACM (JACM)
Journal of Algorithms
A subexponential randomized simplex algorithm (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Randomized algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
Using randomization in the teaching of data structures and algorithms
SIGCSE '99 The proceedings of the thirtieth SIGCSE technical symposium on Computer science education
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Expected time bounds for selection
Communications of the ACM
Median Selection Requires $(2+\epsilon)n$ Comparisons
SIAM Journal on Discrete Mathematics
The use of ill-defined problems for developing problem-solving and empirical skills in CS1
Journal of Computing Sciences in Colleges
Universal schemes for parallel communication
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Core empirical concepts and skills for computer science
Proceedings of the 35th SIGCSE technical symposium on Computer science education
Teaching empirical skills and concepts in computer science using random walks
Proceedings of the 36th SIGCSE technical symposium on Computer science education
How (and why) to introduce Monte Carlo randomized algorithms into a basic algorithms course?
Journal of Computing Sciences in Colleges
Teaching the power of randomization using a simple game
Proceedings of the 37th SIGCSE technical symposium on Computer science education
Introduction to Algorithms, Third Edition
Introduction to Algorithms, Third Edition
Hi-index | 0.00 |
Probability theory is branch of mathematics that plays one of the central roles, not only in computer science, but also in science at large. We present a way to integrate non-intuitive probability experiments into introductory programming courses. We consider a set of the probability problems in which the intuitive approach leads to the wrong solution. These problems are based on interesting scenarios, attractive to students, and could be successfully "translated" into programming assignments. We present and discuss numerical simulations and verification of the correct solution through the computational approach. The proposed enrichment provides opportunity to engage students in experimental problem solving. Surprising computational results enhance students' curiosity and interest. This component promotes active involvement in the course. In addition, these problems provide an opportunity to make a connection between mathematics and computer science topics. Such non-intuitive answers may be remembered by students and may promote better understanding in the basic probability course they take later