ד"ר דוד גינת

מנהלת ביה"ס לחינוך סגל אקדמי בכיר
ד"ר דוד גינת
טלפון פנימי: 03-6408151
טלפון חיצוני: 02-5633233
פקס: 03-6405068
משרד: שרת

קורות חיים

Education

B.A., Computer Science, Technion - Israel Institute of Technology, Israel.
Ph.D., Computer Science, University of Maryland at College Park, USA.

 

Research Topics

Development of mathematical and algorithmic thinking.
Novice tendencies, misleading intuition, and learning from mistakes.
Creative encapsulation of colorful challenges in teaching.


 

Fields of Instruction

Computer science and mathematics education.
Didactics of algorithmics; Mathimatical thinking through mathematical games;
Scientific contents as didactic tools; Learning from mistakes.
Computer science Olympiad challenges.

Patent

Ginat, D., Allon, D., & Leonard, A.G., "A database-driven interactive shell for controlling output rendering devices", USA Patent number AT9-89-039X, IBM confidential, IBM Corporation, 1991.


 

Awards

1991 - IBM Patent award.

1994 - IBM Research division award, for contribution to the DSMIT project.

2001 - Tel-Aviv University, Science Education Department, Best lecturer award.

2003 - Tel-Aviv University, Rector’s best lecturer award.

 

 

תחומי מחקר והוראה

 
תחומי מחקר: היבטים של ניתוח בעיה מתמטית, שימוש בנושאים תכניים כאמצעים דידקטיים במתמטיקה ומדעי המחשב, הוכחת נכונות אל אלגוריתם, שימוש במשחקים.
 
תחומי הוראה: הוראת מדעי המחשב, הוראת מתמטיקה.

פרסומים נבחרים

Books:

Ginat, D., “Fundamentals of Computer Science, vol 1 (of 2)” Textbook & Teacher’s guide, in Hebrew, Weizmann Institute of Science Pub, 1998.

Ginat, D., Haberman, B., Cohen, D., Katz, D., Miller, O., Menashe, E., “Design Patterns for Fundamentals of Computer Science” Textbook, in Hebrew, Tel-Aviv University Pub, 2001.

 

Papers:

Ginat, D., Sleator, D.D., & Tarjan, R.E., A tight amortized bound for path reversal, Information Processing Letters, 31, (1), 1989 (pp. 3-5).

Ginat, D., Early algorithm efficiency with design patterns, Computer Science Education, 11, (2), 2001 (pp. 89-109).

Ginat, D., Loop invariants, exploration of regularities, and mathematical games, International Journal of Mathematical Education in Science and Technology, 32, (5), 2001 (pp. 635-651).

Ginat, D., Strating top-down, refining bottom-up, sharpening by zoom-in, SIGCSE Bulletin, 33, (4), 2001 (pp. 28-31).

Ginat, D., Gaining algorithmic insight via simplifying constraints, Journal of Computer Science Education, 2002 (pp. 41-47).

Ginat, D., Effective binary perspectives in algorithmic problem solving, Journal of Educational Resources in Computing, 2, (2), 2002 (pp. 1-12).

Ginat, D., Digit-distance mastermind, The Mathematical Gazette, November 2002 (pp. 437-442).

Ginat, D., Seeking or skipping regularities? Novice tendencies and the role of invariants, Informatics in Education, 2, (2), 2003 (pp. 211-222).

Ginat, D., Algorithmic patterns and the case of the sliding delta, to appear in the SIGCSE Bulletin.

Ginat, D. & Garcia, D., Ordering patterns and list inversions, to appear in the Journal of Computer Science Education.

Ginat, D., Decomposition diversity in computer science – beyond the top-down icon, to appear in the Journal of Computers in Mathematics and Science Teaching.

Ginat, D., Mathematical operators and ways of reasoning, to appear in The Mathematical Gazette.

Ginat, D., On novice loop boundaries and range conceptions, to appear in Computer Science Education.


Ginat, D., Shankar, A.U., & Agrawala, A.K., An efficient solution to the drinking philosophers, Lecture Notes in Computer Science - Distributed Algorithms, 3rd International Workshop - WDAG, Nice, France, Spring-Verlag Pub, 1989 (pp. 83-93).

Ginat, D., Loop invariants and mathematical games, Proc of the 26th ACM Computer Science Education Symposium - SIGCSE, ACM Press, 1995 (pp. 263-267).

Ginat, D., Efficiency of algorithms for programming beginners, Proc of the 27th ACM Computer Science Education Symposium - SIGCSE, ACM Press, 1996 (pp. 256-260).

Shifrony, E. & Ginat, D., Simulation game for teaching communication protocols, Proc of the 28th ACM Computer Science Education Symposium - SIGCSE, ACM Press, 1997 (pp. 184-188).

Ginat, D. & Shifrony, E., Teaching recursion in procedural environment - how much should we emphasize the computing model?, Proc of the 30th ACM Computer Science Education Symposium - SIGCSE, ACM Press, 1999 (pp. 127-131).

Haberman, B. & Ginat, D., Distance learning model with local workshop sessions, applied to in-service teacher training, Proc of the 4th Conference on Innovation and Technology in Computer Science Education - ITiCSE, ACM Press, 1999 (pp. 64-67).

Ginat, D., Colorful examples for elaborating exploration of regularities in high-school CS1, Proc of the 5th Conference on Innovation and Technology in Computer Science Education - ITiCSE , ACM Press, 2000 (pp. 81-84).

Ginat, D., Misleading intuition in algorithmic problem solving, Proc of the 32nd ACM Computer Science Education Symposium - SIGCSE, ACM Press, 2001 (pp. 21-25).

Ginat, D., Metacognitive awareness utilized for learning control elements in algorithmic problem solving, Proc of the 6th Conference on Innovation and Technology in Computer Science Education - ITiCSE, ACM Press, 2001 (pp. 81-84).

Ginat, D., On varying perspectives of problem decomposition, Proc of the 33rd ACM Computer Science Education Symposium - SIGCSE, ACM Press, 2002 (pp. 331-335).

Ginat, D. & Wolfson, M., On limited views of the mean as a point of balance, Proc of the 26th Conference of the International Group for Psychology of Mathematics Education - PME, 2002 (vol. 2, pp. 430-437).

Ginat, D., The greedy trap and learning from mistakes, Proc of the 34th ACM Computer Science Education Symposium - SIGCSE, ACM Press, 2003 (pp. 11-15).

Ginat, D., The novice programmers’ syndrome of design-by-keyword, Proc of the 8th Conference on Innovation and Technology in Computer Science Education - ITiCSE, ACM Press, 2003 (pp. 154-157).


 

Scientific Column

Ginat, D., Placement calculations, Colorful Challenges Column, SIGCSE Bulletin, 32, (4), 2000 (pp. 20-21).

Ginat, D., Color conversion, Colorful Challenges Column, SIGCSE Bulletin, 33, (2), 2001 (pp. 20-21).

Ginat, D., Chain of permutations, Colorful Challenges Column, SIGCSE Bulletin, 33, (4), 2001 (pp. 20-21).

Ginat, D., Divisor games, Colorful Challenges Column, SIGCSE Bulletin, 34, (4), 2002 (pp. 28-29).

Ginat, D., Sorting and disorders, Colorful Challenges Column, SIGCSE Bulletin, 35, (2), 2003 (pp. 28-29).

Ginat, D., Board reconstruction, Colorful Challenges Column, SIGCSE Bulletin, to appear in December 2003.

אוניברסיטת תל-אביב, ת.ד. 39040, תל-אביב 6997801
UI/UX Basch_Interactive