260 likes | 426 Views
CSI 1306 E Computing Concepts for Business . Instructor: Ivan Stojmenovic Winter 2009 Course website is linked from: www.site.uottawa.ca/~ivan INTRODUCTION. Official description.
E N D
CSI 1306 EComputing Concepts for Business Instructor: Ivan Stojmenovic Winter 2009 Course website is linked from: www.site.uottawa.ca/~ivan INTRODUCTION
Official description • This course provides an introduction to computer-based problem solving from the perspective of the business world. • Design of algorithms and algorithm description. • Introduction to 4th generation languages and methodologies. • Structured program development and program testing. • Modular programming. • Searching, sorting and file processing. • Application generators of business oriented software products such as spreadsheets and database packages.
Course Objectives • A basic understanding of • computer hardware and software • business application generators for word processing, presentations, spreadsheets and database management • object linking and embedding, security, communications and the Internet • An in-depth understanding of • problem solving and algorithm development • computer program development and testing using a 4th generation programming language to increase the functionality of spreadsheets • A solid foundation for the use of computers in further studies
Lecture Topics • 01 Introduction January 8 • 02 Hardware & Software January 8 • 03 Communications & the Internet January 15 • 04 Word & PowerPoint January 15 • 05 Excel – part 1 January 22 • 06 Excel – part 2 & OLE January 22
Lecture Topics • 07 Algorithms – part 1 January 29 • 08 Visual Basic – part 1 January 29 • 09 Algorithms – part 2 February 5 • 10 Visual Basic – part 2 February 5 • Midterm: February 12 • Study break (no classes): February 19 • 11 Algorithms – part 3 February 26 • 12 Visual Basic – part 3 February 26
Lecture Topics • 13 Algorithms – part 4: March 5 • 14 Visual Basic – part 4: March 5 • 15 Algorithms – part 5: March 12 • 16 Visual Basic – part 5: March 12 • 17 Visual Basic – part 6: March 19 • 18 Visual Basic – part 7: March 19
Lecture Topics • 19 Database – part 1: March 26 • 20 Database – part 2: March 26 • 21 Database – part 3: April 2 • 22 Database – part 4: April 2 • 23 Security: April 9 • 24 Review: April 9 • 25, 25… Program examples: self-study
Tutorials and Labs • During tutorials= DGD, teaching assistants will • assist you in solving homework questions • answer your questions about assignment requirements and class material • and, occasionally, teach material to supplement the lecture topics. • Lab access time is a period of time when the computers in the lab are reserved for use by a specific group of students under the supervision of a teaching assistant. • The lab is in room DMS 2150 from 17:30 to 19:00 weekdays • At the commencement of the course, you will find out how to register for one of the tutorial and lab groups. • Each group is limited to 30 students • Each group has a 1.5 hour tutorial and a 1.5 hour lab each week
Assignments • There will be 5 assignments during the term. Each will be posted on the course web site at the appropriate time. • The posting and due dates for assignments are in the course syllabus • The solutions must run on the computers provided in the lab.
Assignments • Assignment solutions are to be submitted for marking. Therefore, you must prepare your own solution set. • You must not work on an assignment with another individual or individuals. • However, if you have difficulty with part of an assignment, you may discuss potential solutions with your teaching assistant or another student.
Assignments • Assignments must be submitted on time • Assignments will be submitted electronically to the URL posted on the Website http://courses.management.uottawa.ca/etphp/ Login name – First Letter First Name + Last Name Password – Student Number • Resubmissions allowed • UNTIL DUE DATE/TIME • Late submissions allowed • 25% deduction for any late assignment
Homework • Homework will be posted on one of the course web sites prior to each tutorial • Homework consists of questions related to the lecture material from the previous week • Homework is not to be submitted for marking • You can review solutions to the homework questions with your teaching assistant during tutorials
Textbook (recommended but not required) • Simple Program Design, A Step-by-Step Approach, third edition, Lesley Anne Robertson, Course Technology, Thomson Learning.
Important Dates • Midterm examination • February 12, class time and place • (additional classrooms may be added) • Start of labs • Week of January 12 • Start of tutorials • Week of January 12
Web Addresses • Course Web Sites • The primary course web site is at • www.site.uottawa.ca/~ivan • (could be moved later to, with link and info at above site: http://doc-depot.management.uottawa.ca/.) • The course syllabus and announcements will be posted at this site. • You will also be able to download files of the lecture slides, homework and assignments from
Lab Computers • Your username and password to log on to one of the computers in the lab are derived as follows: • Username: first initial of your surname + 7 digit student number • Password: date of birth in the format YYMMDD • Remember to change your password after your initial log on • Technical Environment • Windows XP, Office XP
Printing • 4 Relmon printers (VNR081): campus-wide • About 10 cents/page • Buy Copy-Card at the Library • Replenish Copy-Card in VNR081 • Same login name as for lab computers • Print (ie. print and delete) • Print and keep • Delete
Antivirus Software • The University owns a campus-wide license for Norton Antivirus software • You can download it for use on your home computer at www.ccs.uottawa.ca/downloade.html
Marking Algorithm A = mark on assignments (out of 100) M = mark on midterm exam (out of 100) F = mark on final exam (out of 100) • EM = 0.75F +0.25M • To pass the course, EM must be equal to, or greater than, 50
Marking Algorithm • To calculate the final letter grade (FLG) for the course: • LG(EM) = letter grade corresponding to the numeric mark EM • next_up_LG(EM) = letter grade immediately above LG(EM) • next_down_LG(EM) = letter grade immediately below LG(EM) • If EM >= 50, then • FLG = next_up_LG(EM) if A >= 75 • FLG = LG(EM) if (50 <= A <75) • FLG = next_down_LG(EM) if A < 50, unless causes a failure, in which case FLG =LG(EM)
Additional Material • Lecture notes have Additional Material sections • Information that MAY NOT be covered in class • Students ARE responsible for learning this material • Homework is found at the end of lecture material • Answers will be provided in tutorial sessions
Homework • Where is the Assignment Schedule Posted? • What is Homework URL? • What is your TA’s Name? • Log into the School of Management Network • Get PowerPoint Slides • Change Password • Log into the Homework Server • Change Password