Download presentation
Presentation is loading. Please wait.
Published byRandall Spencer Modified over 9 years ago
1
1 Assoc. Prof. Stoyan Bonev, PhD Computer Science dept American University in Bulgaria e-mail:sbonev@aubg.bg
2
American University in Bulgaria Computer Science dept t Academic Year: 2014/15 t Semester: Fall t Major: Computer Science t Course Id: COS120 t Course Title: SW Development Using C++ t Course Status: Required or Placement Test 2
3
COS120 SW Development Using C++ AUBG, COS dept, Fall 2014 Lecture 00 A Concise Course Presentation (Extract from Syllabus)
4
4 Lecture Contents: t Semester Course Schedule t The Lecturer t Course History/Chronicle t References t Course Contents
5
5 Semester Course Schedule t Two COS120 sections: t Lectures/Exercises Hours: –COS120a Wed 10:45 – 12:00, Fri 09:00 – 10:15 –COS120b – Prof. S.Boytcheva t Lectures/Exercises Venue: –COS Lab MB 120
6
6 The Lecturer t Lecturer: Assoc. Prof. Stoyan Bonev, PhD COS dept, AUBG t Office: 243 t Tel.(ext.): 419 t e-mail: sbonev@aubg.bgsbonev@aubg.bg t Office Hours: see list on office door
7
7 Course History/Chronicle t Lectures held by –Prof. Galletly, Prof. Christozov, Prof. Karagiozov –OCC staff –Stoyan Bonev (since 2002/03 AY) –Prof. Boytcheva t Course id and name: –COS120 Introduction to COS I (before 2006/07 AY) –COS120 Software Development Using C++ (since 2006/07 AY)
8
8 The Recommended Textbook
9
9
10
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley The Recommended Textbook Problem Solving, Abstraction, and Design using C++ 5e by Frank L. Friedman and Elliot B. Koffman
11
11 Recommended Textbooks t Friedman F.L., Koffman E.B., Problem Solving, Abstraction and Design Using C++, Pearson, Addison- Wesley, 6e, 2012. t Y. Daniel Liang, Introduction to Programming with C++, Pearson IE, 3e, 2014. t Horstmann Cay, C++ for Everyone, Wiley, 2e, 2012. t Kernighan B.W., Ritchie D.M., The C Programming Language, Prentice-Hall, 1988. t Any book on C++ available in the AUBG library.
12
12 Course Contents t Computers, Problem Solving and Programming –SDM, algorithms, flowcharts, structure charts t Computer Languages t Program structure –Data, Expression, Statement, Function, Program t Data structures –Simple data types, array, structure, union, pointer, file t Intro to OOP
13
13 Course Contents in Details t COS120 Course syllabus, handouts and.ppt files for the course lectures are available on drive H. –Root: H:\shared –SubFolder: COS120a
14
14 For student convenience t The source texts of all programs discussed through the textbook are publicly available for download from ftp server at address: ftp://ftp.aw.com/cseng/authors/friedman/cpp5e
15
15 Course Grading t Component:Final exam1 x 30%
16
16 Course Grading t Component:Final exam1 x 30% t Component:Midterm exam1 x 18%
17
17 Course Grading t Component:Final exam1 x 30% t Component:Midterm exam1 x 18% t Component:Home Works 6 x 3%
18
18 Course Grading t Component:Final exam1 x 30% t Component:Midterm exam1 x 18% t Component:Home works6 x 3% t Component:Quizzes6 x 5%
19
19 Course Grading t Component:Final exam1 x 30% t Component:Midterm exam1 x 18% t Component:Home works6 x 3% t Component:Quizzes6 x 5% t Component: Class attendance 1 x 2%
20
20 Course Grading t Component:Final exam1 x 30% t Component:Midterm exam1 x 18% t Component:Home works6 x 3% t Component:Quizzes6 x 5% t Component: Class attendance 1 x 2% t Component: Class activity 1 x 2%
21
21 Final Exam Details t Exam offered in two versions: t Conventional Version –28 short answer questions - 28 x 3% –1 practical task-1 x 16% t Practical Version –2 short answer questions -2 x 5% –3 practical tasks -3 x 30%
22
22 Course Grading t Grading:Final exam: 30% Midterm exam:18% Home works: 18% Quizzes: 30% Attendance: 2% Activity: 2% Students will get a score in the range 0-100 for each of the components. The total score (computed with the above coefficients) will be used to form the final grade: t A–, A (excellent) scores 90-10090- - - - - - 9596-100 t B–, B, B+ (good) scores 80-9080-8283-8586-90 t C–, C, C+ (average) scores 70-8070-7273-7576-80 t D, D+ (poor) scores 60-7060- - - - - - 6566-70 t Scores below 60 mean failure.
23
23 Attendance t Students are expected to attend all classes (lectures and exercises). t An attendance register will be taken at each class. t Students who miss three classes will be dropped from the course. t Mobile phones ringing in class disturb the whole class. Please switch off your mobile phone before each class.
24
24 Attendance t There will be no make-up exam/quizzes for any reason. If you arrive late to an exam/quiz, you may still take the exam/quiz in the remaining time as long as nobody has finished the exam/quiz yet. t Browsing Internet in class is not allowed except by special request on topic discussed in the lecture.
25
25 Academic Honesty t Students are expected to demonstrate academic behavior in full capacity of the term.
26
26 Declaration of Ethics t The Power Point presentations for this course (including slides style, samples and partly contents) were created using.ppt files, publicly available for download from www sites associated with authors of recommended textbooks
27
27 Declaration of Ethics 2 (effective prior to 2014) (from Pearson Higher Education Resource Center) This work is protected by United States copyright laws and is provided solely for the use of instructors in teaching their courses and assessing student learning. Dissemination or sale of any part of this work (including on the WWW) will destroy the integrity of the work and is not permitted. The work and materials from this site should never be made available to students except by instructors using the accompanying text in their classes. All recipients of this work are expected to abide by these restrictions and to honor the intended pedagogical purposes and the needs of other instructors who rely on these materials. AcceptCancel
28
Declaration of Ethics 2 (effective 2014) (from Pearson Higher Education Resource Center) 28
29
29 Thank You For Your Attention!
Similar presentations
© 2024 SlidePlayer.com. Inc.
All rights reserved.