CSI 1306 Computing Concepts for Business - PowerPoint PPT Presentation

1 / 27
About This Presentation
Title:

CSI 1306 Computing Concepts for Business

Description:

Introduction to computer-based problem solving from the perspective of the business world. ... Juan Manuel Silva jsilv010_at_uottawa. Wed 16:00 - 17:30 CBY B202. DGD 2 ... – PowerPoint PPT presentation

Number of Views:137
Avg rating:3.0/5.0
Slides: 28
Provided by: Universi57
Category:

less

Transcript and Presenter's Notes

Title: CSI 1306 Computing Concepts for Business


1
CSI 1306 Computing Concepts for Business
  • Fall 2009
  • http//csi1306.telfer.uottawa.ca/
  • http//docdepot.management.uottawa.ca
  • INTRODUCTION

2
Official description
  • Introduction to computer-based problem solving
    from the perspective of the business world.
  • Design of algorithms for solving business
    problems.
  • Basics of computer programming in a modern
    programming language.
  • Solving business problems using applications
    packages including spreadsheets and databases
  • Basics of web design. Collaborative tools.
  • Using open source software.

3
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

4
Lecture Topics
  • 01 Introduction
  • 02 Hardware Software
  • 03 Communications the Internet
  • 04 Word PowerPoint
  • 05 Excel part 1
  • 06 Excel part 2 OLE

5
Lecture Topics
  • 07 Algorithms part 1
  • 08 Visual Basic part 1
  • 09 Algorithms part 2
  • 10 Visual Basic part 2
  • 11 Algorithms part 3
  • 12 Visual Basic part 3

6
Lecture Topics
  • 13 Algorithms part 4
  • 14 Visual Basic part 4
  • 15 Algorithms part 5
  • 16 Visual Basic part 5
  • 17 Visual Basic part 6
  • 18 Visual Basic part 7

7
Lecture Topics
  • 19 Database part 1
  • 20 Database part 2
  • 21 Database part 3
  • 22 Database part 4
  • 23 Security
  • 24 Review
  • 25, 25 Program examples self-study

8
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.
  • DMS2150 Monday to Fridays from 1600 to 1900
  • DMS2150 Weekends from 1130-1600.
  • At the commencement of the course, you will find
    out how to register for one of the tutorial and
    lab groups.
  • Each group has a 1.5 hour tutorial and a 1.5 hour
    lab each week
  • LAB schedule TBD per sections

9
CSI 1306 A
10
CSI 1306 B
11
CSI 1306 C
12
CSI 1306 D
13
CSI 1306 E
14
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 on
    the course website
  • The solutions must run on the computers provided
    in the lab.
  • TA for DGD x, Lab x and marking x is not normally
    the same person (x1, 2, 3, 4)

15
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.

16
Lab schedule
  • Start of labs
  • Week of September 14
  • CSI1306E Mon, Tue, Wed, Thu 1600-1730pm
  • Start of tutorials
  • Week of September 14

17
Course Web Sites
  • The course web site for submitting assignments is
    at
  • http//csi1306.telfer.uottawa.ca/.
  • You will also be able to download files of the
    lecture slides, homework and assignments from
  • http//docdepot.management.uottawa.ca
  • Resubmissions allowed
  • UNTIL DUE DATE/TIME
  • Late submissions allowed
  • 25 deduction for any late assignment
  • Maximum delay six days.

18
Homework
  • Homework will be posted on one of the course web
    sites prior to each tutorial, or at the end of
    corresponding lecture
  • 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

19
Textbook (recommended but not required)
  • Simple Program Design, A Step-by-Step Approach,
    third edition, Lesley Anne Robertson, Course
    Technology, Thomson Learning.
  •  

20
Important Dates
  • Midterm examination
  • October 17, 2009 9am Exam duration 1.5 hours
  • MNT 202 (244) CSI1306 B 103 Fadi
  • MNT 203 (244) CSI1306 E 110 Ivan
  • ART 026 (200) Jamel CSI1706 A 119
  • ART 257 (142) Jamel CSI1706 B 115
  • DMS 1160 (200) Trevor CSI1306 D 92
  • MRT 212 (117) ) Wonsook CSI1306 A 92
  • MRT 218 (183) Wonsook CSI1306 C 108
  • MRT 205 (118) Wonsook CSI1306 A 92
  • CBY B205 (118 seats) extras

21
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

22
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

23
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
  •  

24
 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 gt 50, then
  • FLG next_up_LG(EM) if A gt 75
  • FLG LG(EM) if (50 lt A lt75)
  • FLG next_down_LG(EM) if A lt 50, unless causes
    a failure,
  • in which case FLG LG(EM)

25
Calculation of Final Mark
26
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

27
Homework
  • Where is the Assignment Schedule Posted?
  • What is Homework URL?
  • What is your TAs Name?
  • Log into the School of Management Network
  • Get PowerPoint Slides
  • Change Password
  • Log into the Homework Server
  • Change Password
Write a Comment
User Comments (0)
About PowerShow.com