1 / 6

CEN 111 Introduction to Algorithms and Programming

INTERNATIONAL BURCH UNIVERSITY. DEPARTMENT of INFORMATION TECHNOLOGIES. CEN 111 Introduction to Algorithms and Programming. Dr . G ünay Karlı gkarli@ibu.edu.ba. 201 2 -201 3 Fall. Class Schedule: Lectures: Thursday 9 :00-11: 45 Labs: Wednesday 9:00-10:45 Office Hour:

swett
Télécharger la présentation

CEN 111 Introduction to Algorithms and Programming

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. INTERNATIONAL BURCH UNIVERSITY DEPARTMENT of INFORMATION TECHNOLOGIES CEN 111 Introduction to Algorithms and Programming Dr. Günay Karlıgkarli@ibu.edu.ba 2012-2013 Fall

  2. Class Schedule: Lectures: Thursday 9:00-11:45 Labs: Wednesday 9:00-10:45 • Office Hour: Schedule is on my door

  3. Course Objectives • basic understanding of algorithms and programming concepts • Flowcharts • Develop a basic understanding of programming concepts • Learning C language • Using selection structures, and repetition structures • variables, if-then-else, loop structures: for/while/do-while, break/continue/switch statements, flowcharting solutions, arrays

  4. Textbooks and Resources • Deitel, D., C How to Program, Prentice Hall, 2005 • Kleinberg J., Tardos E., Algorithm Design, Addison Wesley, 2005 • Karlı G., C’de Problem Çözme Mantığı, 2010

  5. BriefContents • Introduction to course and C programming language • Variables and arithmetic in C • Relational Operators • Control structures (if, switch) • Flowcharts, Pseudo code and Algorithms • Repetition structures (for, while) • Functions • Arrays and Pointers • File processing

  6. Grading • Lab and participation 20% • Home Study&Project 20% • Midterm Exam 30% • Final Exam 40%

More Related