EASTERN MEDITERRANEAN UNIVERSITY

COURSE OUTLINE

COURSE CODE / COMP183 / COURSE LEVEL / First Year
COURSE TITLE / Computer Science Fundamentals I
COURSE TYPE / Area Core
LECTURER(S)
Asistants: / Mehmet Ali TUT: Room: AS351, Tel:1237, mail:
CREDIT VALUE / (3,2)3 / ECTS VALUE / 4
PREREQUISITES / None
COREQUISITES / None
DURATION OF COURSE / 1 semester
WEB LINK / http://brahms.emu.edu.tr/tut
CATALOGUE DESCRIPTION
Organization of a digital computer. Number systems. Algorithmic approach to problem solving. Flowcharting.
Concepts of structured programming. Programming in at least one of the programming languages. Data types,
constants and variable declarations. Expressions. Input/output statements. Control structures, loops, arrays.
AIMS & OBJECTIVES
The main aim of this course is to provide students with an introductory overview into the Computer Science and
programming. The basic concepts in programming using C++ as programming language will be used to make the
students understand structured or functional programming. At the end of this course the students should be able
to write simple procedural programs using build in data types and arrays of these data types.
GENERAL LEARNING OUTCOMES (COMPETENCES)
On successful completion of this course, all students will have developed knowledge and understanding of:
- The basics of the structure of a computer program
- Control and Repetition Structures
- The definition and usage of Functions, also recursive functions
- Declaration and Initialization of Arrays and usage with functions
- Pass by Value and Pass by Reference
On successful completion of this course, all students will have developed their skills in:
- Writing programs using all control structures provided by the programming language C++, namely
selection (if, if/else, switch) and repetition (while, do/while, for) control structures.
- Writing programs using recursive and non-recursive functions
- Writing programs using arrays, also with functions
- Applying pass by reference and pass by value correctly
On successful completion of this course, all students will have developed their appreciation of and respect for values and attitudes regarding the issues of:
-  Willingness to work independently to solve problems
-  Willingness to reach extra information about the topics (library and/or internet)
-  Plagiarism and cheating
GRADING CRITERIA
A
(Excellent)
~85% and above / Excellent understanding of the concepts and the principles as demonstrated by correct and accurate knowledge and application of theory/laws in solving problems. Response to problems is clear, legible, concise and accurate. Excellent performance.
(Good)
~70% and above
70-74:B, 75-79:B+, 80-84:A- / Better than average understanding of the concepts and the principles as demonstrated by correct and accurate knowledge and application of theory/laws in solving problems, but doesn't have the depth and outstanding quality of an "A". Response to problems is fairly clear, legible, but occasionally contains some inaccuracies. Performance exceeds the minimum requirements
(Average)
~60 % and above
60-62:C, 63-65:C+, 66-69:B- / An average understanding of the concepts and the principles as demonstrated by reasonably correct knowledge and application of theory/laws in solving problems, but doesn't have any depth. Response to problems is reasonably clear, legible, but contains inaccuracies. It reveals a sufficient understanding of the material, but lacks depth in understanding and approach/application. Content and form don't go beyond basic expectations and/or display some substantial errors. Acceptable but non-exceptional performance that doesn't go beyond the minimum requirements.
(Barely sufficient)
~50% and above
50-52:D, 53-55:D+, 56-59:C- / Minimal knowledge and barely sufficient understanding of the concepts and the principles as demonstrated by approximately correct application of theory/laws in solving problems. Response to problems is not very clear and is barely legible, and contains many inaccuracies. It reveals a minimum (confused) understanding of the material, and lacks depth in understanding and approach/application. Content and form do not adequately meet the basic expectations, and/or display significant errors. Performance demonstrates severe problems in one or more areas.
(Fail)
Below 50%
0-34:F, 35-49:D- / Work does not meet the most minimal standards. It reveals no understanding of the material, lack of basic academic skills and knowledge, or completely incomprehensible writing. Performance is not acceptable
NG
nil grade / Conditions that might lead to NG grade.
Totally absent in classes and exams
RELATIONSHIP WITH OTHER COURSES
LEARNING / TEACHING METHOD
A combination of teaching and project-based learning is chosen as teaching method for this course.
ASSIGNMENTS
Assignments will be given weekly as lab homework to give the student the chance to review and apply the concepts
discussed in the class.
METHOD OF ASSESSMENT
35% Midterm Exam
45% Final Exam
20% Labs
ATTENDANCE
Attendance is required. Students are responsible not only for the material presented and discussed, but also for any announcements made in class. Poor attendance may result NG grade
TEXTBOOK/S
C++ Programming by D. S. Malik, 6th ed., Course Technology, Cengage Learning
INDICATIVE BASIC READING LIST
EXTENDED READING LIST
Absolute C++, Walter Savitch, 2nd Ed., Addison Wesley (2006),
C++ How to program, Deitel and Deitel, 5th edition, Prentice Hall
Starting Out With C++ by Gaddis, Prentice Hall
SEMESTER OFFERRED
2015-2016 Fall Semester
CONTENT & SCHEDULE
Lectures will be held on Wednesday at 12.30-14.20 in ASG14 and on Friday at 08.30-09.20 in ASG03, the Laboratoy works will be on Monday at 14.30-16.20 in ASLAB2.
The lecture topics within the semester are as in the following schedule:
WEEK / DATE / TOPICS
1 / Oct. 05-11 / Introduction: Organization of a computer system, hardware and software
components, types of programming languages, structured programming
2 / Oct. 12-18 / First steps in writing programs: basic arithmetic, basic structures of a program, the “hello world” program. Basic Formatting of input and output
3 / Oct. 19-25 / Selection Structures if, if/else. Nested if structures and switch statement
4 / Oct. 26- Nov. 01 / Repetition Structures: while, for, do/while
5 / Nov. 02-08 / Nested repetition structures.
6 / Nov. 09-15 / Functions: Library functions
7 / Nov. 16-19 / Functions: User defined functions
8 / Nov. 20- Dec.01 / Midterm Examinations Period
9 / Dec. 02-06 / Functions: User defined functions (cont.)
10 / Dec. 07-13 / Recursive Functions: Definition and usage
11 / Dec. 14-20 / Arrays: Declaration, initialization, usage
12 / Dec. 21-27 / Arrays: usage with functions. Difference of Pass by reference and Pass by value
13 / Dec. 28- Jan 03 / Pointers: Declaration and initialization.
14 / Jan. 04-08 / Equivalence between pointers and Arrays. Pointers and Functions
15-17 / Jan. 12-27 / Final Examinations
PLAGIARISM
Individual accountability for all individual work, written or oral. Copying from others or providing answers or information, written or oral, to others is cheating. Providing proper acknowledgment of original author. Copying from another student’s paper or from another text without written acknowledgement is plagiarism. According to University’s bylaws cheating and plagiarism are serious offences resulting in a failure from exam or project and disciplinary action (which includes an official warning may appear in student’s transcript or/and suspension from University for up to one semester).
ANY OTHER USEFUL INFORMATION (SUCH AS STUDIO RULES, MAKE-UP EXAMS, STUDENTS’ RESPONSIBILITIES, EQUIPMENT OR MATERIAL NEEDED, SITE TRIPS, ETC.)
Attendance is compulsory. Students with poor attendance and not attended the exams will receive NG grade.
A make-up exam will be given for the missed midterm examination.
You will not be allowed to attend no ID card (an official ID card with photograph is acceptable).