COMP SCI 2202B - Foundations of Computer Science B
North Terrace Campus - Semester 1 - 2014
General Course Information
Course Code COMP SCI 2202B Course Foundations of Computer Science B Coordinating Unit School of Computer Science Term Semester 1 Level Undergraduate Location/s North Terrace Campus Units 3 Contact up to 12 hours per week Prerequisites COMP SCI 2202A Incompatible COMP SCI 1007, 1101, 1102, 1103, 1201, 1202, 1203, 1008, 1009, 2202 Restrictions available to approved Bachelor of Computer Science students only Course Description 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.
Course Coordinator: Dr Alfred Fred Brown
The full timetable of all activities for this course can be accessed from Course Planner.
Course Learning OutcomesThe 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
Required ResourcesThere is no required text. The course will make use of various online resources.
Recommended ResourcesIf you prefer to have a textbook for reference, we recommend Walter Savitch, "Problem Solving with C++ 8th ed", Addison-Wesley, 2012, ISBN-10:0132162733, ISBN-13:9780132162739
Online LearningThe 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 http://cs.adelaide.edu.au/degrees-courses.
Learning & Teaching Activities
Learning & Teaching ModesThis course is taught primarily face to face with active lab work interspersed with short examples and discussions. Students are expected to work on labs and review between face to face sessions.
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
- Class hierarchies, inheritance, multiple inheritance, polymorphism, namespaces.
- Recursion, evaluating algorithms memory and runtime, algorithmic approaches to searching (linear and binary), sorting.
- Programming data structures: stacks, queues, linked lists.
- Trees, algorithmic strategies, review.
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.
No information currently available.
No information currently available.
No information currently available.
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 Access Adelaide.
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.
- Academic Support with Maths
- Academic Support with writing and speaking skills
- Student Life Counselling Support - Personal counselling for issues affecting study
- International Student Support
- AUU Student Care - Advocacy, confidential counselling, welfare support and advice
- Students with a Disability - Alternative academic arrangements
- Reasonable Adjustments to Teaching & Assessment for Students with a Disability Policy
Policies & Guidelines
This section contains links to relevant assessment-related policies and guidelines - all university policies.
- Academic Credit Arrangement Policy
- Academic Honesty Policy
- Academic Progress by Coursework Students Policy
- Assessment for Coursework Programs
- Copyright Compliance Policy
- Coursework Academic Programs Policy
- Elder Conservatorium of Music Noise Management Plan
- Intellectual Property Policy
- IT Acceptable Use and Security Policy
- Modified Arrangements for Coursework Assessment
- Student Experience of Learning and Teaching Policy
- Student Grievance Resolution Process
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’s disciplinary procedures.
The University of Adelaide is committed to regular reviews of the courses and programs it offers to students. The University of Adelaide therefore reserves the right to discontinue or vary programs and courses without notice. Please read the important information contained in the disclaimer.