COMP SCI 2202BNA - Foundations of Computer Science B

Ngee Ann Academy - Trimester 2 - 2015

Introduces the fundamental concepts of object oriented programming. Topics include: Fundamental constructs - data types, arrays, strings and string processing, files, variables, expressions, conditionals, iteration, simple I/O. Object oriented fundamentals - methods, classes, interfaces, inheritance Algorithms and problem solving - problem solving process and strategies, simple searching and Sorting algorithms (linear and binary search, selection and insertion sort) Software development tools and techniques - testing: black box, requirements, unit Machine level representation - bits, bytes, words, number bases, representation of data, memory management.

Open All

Course Details

Course Code	COMP SCI 2202BNA
Course	Foundations of Computer Science B
Coordinating Unit	Computer Science
Term	Trimester 2
Level	Undergraduate
Location/s	Ngee Ann Academy
Units	3
Contact	up to 12 hours per week
Available for Study Abroad and Exchange	N
Incompatible	COMP SCI 1007, 1101, 1102, 1103, 1201, 1202, 1203, 1008, 1009, 2202
Restrictions	available to approved Bachelor of Computer Science students only
Assessment	written exam, assignments

Course Staff

Course Coordinator: Dr Alfred Fred Brown

Lecturer: Mr Kwang Hua Lim

Course Timetable

The full timetable of all activities for this course can be accessed from .

The full timetable of all activities for this course can be accessed from

Course Learning Outcomes

The key learning objectives for this course are:

Design, implement and test algorithms using fundamental programming constructs and data structures.
Translate between machine level representations and demonstrate how data is represented in computers.
Identify, evaluate and use information sources to support the practice of programming, including APIs, tutorials and documentation.
Determine and compare the runtime complexity of common searching and sorting techniques and their implementations – both iterative and recursive.
Identify and apply searching and sorting techniques (linear and binary search, selection, insertion, merge, quick, bucket sorts).
Identify and apply basic data structures: linked list, stack, queue, qraph, tree (ordered, binary, balanced).
Design, implement and test solutions to problems selecting appropriate data structures and basic algorithmic techiques (brute force, divide and conquer, transform and conquer, greedy).

University Graduate Attributes

This course will provide students with an opportunity to develop the Graduate Attribute(s) specified below:

University Graduate Attribute	Course Learning Outcome(s)
Knowledge and understanding of the content and techniques of a chosen discipline at advanced levels that are internationally recognised.	1,2,3,4,5,6,7
The ability to locate, analyse, evaluate and synthesise information from a wide variety of sources in a planned and timely manner.	3
An ability to apply effective, creative and innovative solutions, both independently and cooperatively, to current and future problems.	1,6,7
Skills of a high order in interpersonal understanding, teamwork and communication.	1,3
A proficiency in the appropriate use of contemporary technologies.	1,2,3,4,5,6,7
A commitment to continuous learning and the capacity to maintain intellectual curiosity throughout life.	3
An awareness of ethical, social and cultural issues within a global context and their importance in the exercise of professional skills and responsibilities.	3

Learning Resources

Required Resources

There is no required text. The course will make use of various freely available resources.

Recommended Resources

If you prefer to have a textbook for reference, we recommend:

"Problem Solving with C++", 9e Global Edition, Walter Savitch, ISBN-13:9781292018249, Addison-Wesley, 2015.

Online Learning

The School of Computer Science uses a variety of e-learning tools to support traditional face-to-face lectures, tutorials and workshops. These tools provide access to various features including announcements, course materials, discussion boards and assessments for each course of study. Online learning resources can be accessed by selecting your course from .
Learning & Teaching Activities
Learning & Teaching Modes

This course is offered in blended learning mode with the face-to-face component offered as intensives.

Workload

The information below is provided as a guide to assist students in engaging appropriately with the course requirements.

As a guide, a 3 unit course comprises a total of 144 hours work (this includes face-to-face contact, any online components, and self directed study).

Learning Activities Summary
1. Class hierarchies, inheritance, multiple inheritance, polymorphism, namespaces.
2. Recursion, evaluating algorithms memory and runtime, algorithmic approaches to searching (linear and binary), sorting.
3. Programming data structures: stacks, queues, linked lists.
4. Trees, algorithmic strategies, review.
Specific Course Requirements

Students are expected to complete work and practice programming outside of intensive times. The lab at NAAEC has all the required resources for the course.

The University's policy on Assessment for Coursework Programs is based on the following four principles:

Assessment must encourage and reinforce learning.
Assessment must enable robust and fair judgements about student performance.
Assessment practices must be fair and equitable to students and give them the opportunity to demonstrate what they have learned.
Assessment must maintain academic standards.

Assessment Summary

Assessments
Assessment Task	Task Type	To Be Scheduled During	Weighting	Learning Outcome
Practicals*	Formative	Face to face teaching.	20%	1,3,5,6,7
Theory Quizzes	Summative	Between Intensives.	10%	2,3,4,5,6
Practical Exams	Summative	Face to face teaching.	10%	1,3,5,6,7
Final Theory Exam	Summative	Examination Day.	30%	2,3,4,5,6
Final Practical Exam	Summative	Examination Day.	30%	1,3,5,6,7
Total			100%

* During practicals, you are encouraged to collaborate with your classmates. This extends to discussing ideas, alternatives, possible solutions and questions about material discussed in class. It does not permit copying of code from classmates. All code you submit must be your own.

Theory quizzes and practical exams are individual and you must not consult classmates in developing your solutions.

Assessment Related Requirements

Students must achieve a minimum of 40% of the available marks in the Final Theory Quiz and a minimum of 40% of the available marks in the Final Practical Exam. If a student has a final mark for the course greater than 44 F but, fails to achieve both of these requirements, the final mark for the course will be reduced to 44 F.

Assessment Detail

Assessment: Practicals*

Weighting: 20%
Due Dates: please note schedule on course website. Some practicals will be undertaken during class time but some may be completed outside class times.
Submission Details: Submit using the .
Task: Design, test and implement solutions to programming problems.
Scope: These assess your understanding of the course material covered during prior classes.
Criteria by which your assignment will be marked: design, functionality, testing and program style.
Learning objectives: 1,3,5,6,7

Assessment: Theory Quizzes^

Weighting: 10%
Due Dates: please note schedule on course website. Theory quizzes will be held outside class time.
Submission Details: Online Quiz.
Task: Design, test and implement solutions to the practical problems.
Scope: These cover all topics up to the time of the quiz.
Criteria by which your assignment will be marked: Correctness of answers.
Learning objectives: 2,3,4,5,6

Assessment: Practical Exams^

Weighting: 10%
Due Dates: please note schedule on course website. Practical exams will be held during class time.
Submission Details: Submit using the .
Task: Design, test and implement solutions to programming problems.
Scope: These cover all topics up to the time of the practical exam.
Criteria by which your assignment will be marked: design, functionality, testing and program style.
Learning objectives: 1,3,5,6,7

Assessment: Final Theory Exam^

Weighting: 30%
Due Dates: The final theory exam will be scheduled during the exmination day.
Submission Details: Written Exam
Task: The theory exam assesses students depth of knowledge of programming constructs in general, tradeoffs of memory and cpu use in algorithms and data representation.
Scope: 60 minute written exam. Covers material from all of the course.
Criteria by which your assignment will be marked: Correctness of answers.
Learning objectives: 2,3,4,5,6

Assessment: Final Practical Exam^

Weighting: 30%
Due Dates: The final practical exam will be scheduled during the examination day.
Submission Details: Submit using the .
Task: Design, test and implement solutions to programming problems.
Scope: 120 minute practical exam. Covers material from all of the course.
Criteria by which your assignment will be marked: design, functionality, testing and program style.
Learning objectives: 1,3,5,6,7

Practicals are both summative (assessing your understanding) and formative (used to give you feedback and help you prepare for practical exams). The theory quizzes and practical exams are all summative.

* During practicals, you are encouraged to collaborate with your classmates. This extends to discussing ideas, alternatives, possible solutions and questions about material discussed in class. It does not permit copying of code from classmates. All code you submit must be your own.

^Theory quizzes and practical exams are individual and you must not consult classmates in developing your solutions.

Submission

Programming Assignment Submission
All programming practicals must be submitted using the . Programming assignments must not be emailed to the lecturer. If you are unable to submit a programming assignment, ask for help.

Note: programming assignments may be processed using external online plagiarism detection tools.

Backup Copy of Programming Assignments
All programming assignments must be stored in your SVN repository. Failure to use the repository and any subsequent loss of work will not be grounds for an extension.

Late Penalties
Failure to submit a programming assignment on time or by the agreed extension deadline will result in penalties. For each day or part-day that a programming assignment is late, the maximum mark that can be awarded is reduced by 25%. The following table shows effect of the capping for different levels of marks:

Late Penalties - Programming Practicals
On time Mark	One Day Late	Two Days Late	Three Days Late
100	75	50	25
75	75	50	25
50	50	50	25
25	25	25	25
0	0	0	0

Extensions
Any request for an extension of time for the submission of a programming assignment should be made well before the due date to the Course Coordinator. Normally, extensions will only be granted for a maximum of two weeks from the original assignment submission date. Extensions will only be granted in cases of genuine extenuating circumstances and evidence, such as a medical certificate, must be provided.

Theory Quizzes and Practical Exams
If you are unable to take a theory quiz or attend a practical exam, you must contact the course coordinator as soon as practicable. If appropriate evidence can be provided, such as a medical certificate, alternative arrangements may be considered.

Course Grading

Grades for your performance in this course will be awarded in accordance with the following scheme:

M10 (Coursework Mark Scheme)
Grade	Mark	Description
FNS		Fail No Submission
F	1-49	Fail
P	50-64	Pass
C	65-74	Credit
D	75-84	Distinction
HD	85-100	High Distinction
CN		Continuing
NFE		No Formal Examination
RP		Result Pending

Further details of the grades/results can be obtained from Examinations.

Grade Descriptors are available which provide a general guide to the standard of work that is expected at each grade level. More information at Assessment for Coursework Programs.

Final results for this course will be made available through .

Student Feedback

The University places a high priority on approaches to learning and teaching that enhance the student experience. Feedback is sought from students in a variety of ways including on-going engagement with staff, the use of online discussion boards and the use of Student Experience of Learning and Teaching (SELT) surveys as well as GOS surveys and Program reviews.

SELTs are an important source of information to inform individual teaching practice, decisions about teaching duties, and course and program curriculum design. They enable the University to assess how effectively its learning environments and teaching practices facilitate student engagement and learning outcomes. Under the current SELT Policy (http://www.adelaide.edu.au/policies/101/) course SELTs are mandated and must be conducted at the conclusion of each term/semester/trimester for every course offering. Feedback on issues raised through course SELT surveys is made available to enrolled students through various resources (e.g. MyUni). In addition aggregated course SELT data is available.
Student Support
Policies & Guidelines
This section contains links to relevant assessment-related policies and guidelines - all university policies.
Fraud Awareness

Students are reminded that in order to maintain the academic integrity of all programs and courses, the university has a zero-tolerance approach to students offering money or significant value goods or services to any staff member who is involved in their teaching or assessment. Students offering lecturers or tutors or professional staff anything more than a small token of appreciation is totally unacceptable, in any circumstances. Staff members are obliged to report all such incidents to their supervisor/manager, who will refer them for action under the university's student鈥檚 disciplinary procedures.

The 成人大片 is committed to regular reviews of the courses and programs it offers to students. The 成人大片 therefore reserves the right to discontinue or vary programs and courses without notice. Please read the important information contained in the disclaimer.

Authorised by:	Deputy Vice-Chancellor and Vice-President (Academic)
Maintained by:	Course Outlines Administrator

成人大片