Credit points: 4.0Computer architecture. Algorithmic approach to problem solving.Basic concepts in the C language. Top-down design.Structured programming. Bottom-up design. Debugging.Partial and complete correctness proof of programs. Measuresof algorithm efficiency: time and space complexity.Polynomial and exponential time. Probabilistic analysis of algorithms.Randomized algorithms. Intractable problems. Stack. Queue.Representations of arithmetic expressions, and implementation oftheir evaluation by stack.Recursion and its implementation. Branch and Bound Search. Efficientsorting.
דלג לתוכןדלג לתפריט החלף לסטייל מקצועהחלף לסטייל מערכת Skip to contentSkip to menu Switch to course styleSwitch to system style Skip to contentSkip to menu Switch to course styleSwitch to system style Skip to contentSkip to menu Switch to course styleSwitch to system style
הטכניון - מכון טכנולוגי לישראל Technion - Israel Institute of Technology Технион - израильский технологический институт ألتخنيون - معهد تكنولوجي لإسرائيل
02340111 - מבוא למדעי המחשב 02340111 - Introduction to Computer Science 02340111 - Introduction to Computer Science 02340111 - Introduction to Computer Science
חורף 2003-2004Winter 2003-2004Зима 2003-2004شتاء 2003-2004
הטכניון - מכון טכנולוגי לישראל Technion - Israel Institute of Technology Технион - израильский технологический институт ألتخنيون - معهد تكنولوجي لإسرائيل