Teaching bit-level algorithm analysis to the undergraduates in computer science

Authors:
Ranjan Chaudhuri
Affiliations:
Eastern Michigan University, Ypsilanti, Michigan
Venue:
ACM SIGCSE Bulletin
Year:
2004

Citing 3
Cited 1

A course in number theory and cryptography

A course in number theory and cryptography
Data Structures and Algorithms

Data Structures and Algorithms
Do the arithmetic operations really execute in constant time?

ACM SIGCSE Bulletin

What makes big-O analysis difficult: understanding how students understand runtime analysis

Journal of Computing Sciences in Colleges

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper presents a number of elementary examples which could be used to teach the concept of bit-level algorithm analysis to the undergraduate students in Computer Science. Each of these example algorithms take one or more integer(s) as input in order to output the result. Without a bit-level analysis, the run-time complexities of these algorithms can not be estimated correctly. These simple examples will greatly facilitate learning this new concept.