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

Ranjan Chaudhuri | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

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

Author(s) -

Ranjan Chaudhuri

Publication year - 2004

Publication title -

sigcse bulletin

Language(s) - English

Resource type - Journals

eISSN - 2331-3927

pISSN - 0097-8418

DOI - 10.1145/1024338.1024373

Subject(s) - bit (key) , computer science , simple (philosophy) , integer (computer science) , algorithm , arithmetic , order (exchange) , mathematics education , theoretical computer science , mathematics , programming language , philosophy , computer security , epistemology , finance , economics

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research