<--- Back to Details
First PageDocument Content
Computer programming / Software engineering / Computing / Theoretical computer science / Programming idioms / Algorithms / Computability theory / Mathematical logic / Recursion / Programming paradigm / Subroutine / Iteration
Date: 2004-09-27 01:19:29
Computer programming
Software engineering
Computing
Theoretical computer science
Programming idioms
Algorithms
Computability theory
Mathematical logic
Recursion
Programming paradigm
Subroutine
Iteration

Curriculum and Course Syllabi for a High-School Program in Computer Science1 Judith Gal-Ezer2 David Harel3

Add to Reading List

Source URL: www.openu.ac.il

Download Document from Source Website

File Size: 505,10 KB

Share Document on Facebook

Similar Documents

A	
  Family	
  of	
  Provably	
  Correct	
  Algorithms	
   for	
  Exact	
  Triangle	
  Coun;ng	
  	
   	
   Ma=hew	
  Lee,	
  Tze	
  Meng	
  Low	
   Correctness	
  2017	
   	
  

A  Family  of  Provably  Correct  Algorithms   for  Exact  Triangle  Coun;ng       Ma=hew  Lee,  Tze  Meng  Low   Correctness  2017    

DocID: 1xVUG - View Document

Theoretical Computer Science–40  www.elsevier.com/locate/tcs Presorting algorithms: An average-case point of view

Theoretical Computer Science–40 www.elsevier.com/locate/tcs Presorting algorithms: An average-case point of view

DocID: 1xVR3 - View Document

Formal Correctness of Comparison Algorithms between Binary64 and Decimal64 Floating-point Numbers Arthur Blot ENS Lyon, France  NSV, July 22-23, 2017

Formal Correctness of Comparison Algorithms between Binary64 and Decimal64 Floating-point Numbers Arthur Blot ENS Lyon, France NSV, July 22-23, 2017

DocID: 1xVvl - View Document

Theory and Techniques for Synthesizing a Family of Graph Algorithms Srinivas Nedunuri William R. Cook

Theory and Techniques for Synthesizing a Family of Graph Algorithms Srinivas Nedunuri William R. Cook

DocID: 1xVkB - View Document

Stochastic Hillclimbing as a Baseline Method for Evaluating Genetic Algorithms Ari Juels Department of Computer Science

Stochastic Hillclimbing as a Baseline Method for Evaluating Genetic Algorithms Ari Juels Department of Computer Science

DocID: 1xVfc - View Document