Textbook / Material. Nabiyev V., , Seçkin Y., Algoritmalar: Teoriden Uygulamalara, Ankara. Method of Assessment. Mid-term exam: % End-of-term exam. 3. Algorithms, Sanjoy Dasgupta, Christos H. Papadimitriou, and Umesh. Vazirani. , McGraw-Hill, 4. Algoritmalar(Teoriden Uygulamalara), Vasif Vagifoğlu. om/, om/ | mhjgeia.
|Published (Last):||13 April 2006|
|PDF File Size:||11.16 Mb|
|ePub File Size:||20.21 Mb|
|Price:||Free* [*Free Regsitration Required]|
Define variables, types and purposes of usages. Interpret the purpose of the loop command, determine the user of location.
Teoriden uygulamalara algoritmalar
Tell the relationship between flow chart and pseudo code. Use arrays and matrixes while solving problems.
Identify necessary subprograms for an algorithm. Demonstrate relationship between subprogram and main program. Introduction to the course and informing students about practices and evaluation.
Emphasizing the importance of the course in the curriculum and its interaction with other courses. Space and time complexity of algorithms, complexity analysis.
Algoritmalar teoriden uygulamalara pdf download
To be successful in this course, a continuous study is recommended. Before joining the class, student must study given materials in LMS and note at least two topics to discuss. In case a late homework, there will be a 20 points penalty for each late day.
For a better engagement, after the class, students should review the lesson at the end of the class, workbook exercises must be completed. The course aims to make an introduction to computer programming. This course presents basic knowledge about structural programming, algorithm concept, how to create yugulamalara, design and analysis of algorithms. Explain general programming concepts. Define usages and priorities of operators. Identify usage of branch statements.
Recognize General Algorithmic concepts. Explain basic Algorithm steps.
Submission » DergiPark
Recognize flow chart symbols. Explain the purpose of pseudo code usage. Develop solutions for basic algoritmic problems. Restate problem solutions using flow charts.
Restate problem solutions using pseudo code. Test Algoritmic solutions with data. Use structural programming tools. Recognize array, matrix, and index concepts. Evaluate complexity of an algorithm. Define space and time complexity. Analyse complexity of an algorithm. Compare complexity of two algorithms. Algoritmalag and programming language.
Have lecture materials including current information based on their competence in the discipline; applied tools and materials; research methods and techniques used in field works; and advanced level slgoritmalar theoretical and practical knowledge supported with ot. Have knowledge on interdisciplinary issues in their main discipline.
Have the competence to understand, interpet and solve related problems of a system, algoritmalad, equipment or product and apply modern methods. Determine the problems, define, formulize and solve competence in their discipline; have the competence to choose and apply proper analysis and modelling methods.
Use, solve and apply learned theoretical and practical knowledge in academic, research and community service areas. Have the competence to plan, experiment, information store, analyse the results, archive, text analyse and interprete to the discipline.
Teoriden uygulamalara algoritmalar (Book, ) 
Have the competence to choose, use, improve the modern equipments required for field applications. Have the ability to work individually or in a team effectively. Have the capabilities of accessing information, following developments in science and technology, and critically analyzing these developments along with the awareness of lifetime learning. Use the required computer software and information technologies with an advanced level European Computer Driving Licence.
Be aware of influence at the universal and social level environmental problems, economy, continuity etc. Be conscious about professional ethics and responsibility.