Syllabus for Computer Programming II
A revised version of the syllabus is available.
- 5 credits
- Course code: 1TD722
- Education cycle: First cycle
Main field(s) of study and in-depth level:
Computer Science G1F,
Explanation of codes
The code indicates the education cycle and in-depth level of the course in relation to other courses within the same main field of study according to the requirements for general degrees:
- G1N: has only upper-secondary level entry requirements
- G1F: has less than 60 credits in first-cycle course/s as entry requirements
- G1E: contains specially designed degree project for Higher Education Diploma
- G2F: has at least 60 credits in first-cycle course/s as entry requirements
- G2E: has at least 60 credits in first-cycle course/s as entry requirements, contains degree project for Bachelor of Arts/Bachelor of Science
- GXX: in-depth level of the course cannot be classified
- A1N: has only first-cycle course/s as entry requirements
- A1F: has second-cycle course/s as entry requirements
- A1E: contains degree project for Master of Arts/Master of Science (60 credits)
- A2E: contains degree project for Master of Arts/Master of Science (120 credits)
- AXX: in-depth level of the course cannot be classified
- Grading system: Fail (U), Pass (3), Pass with credit (4), Pass with distinction (5)
- Established: 2007-03-15
- Established by: The Faculty Board of Science and Technology
- Revised: 2010-05-02
- Revised by: The Faculty Board of Science and Technology
- Applies from: Autumn 2010
Computer programming I or the equivalent.
- Responsible department: Department of Information Technology
To pass, the student should be able to
- explain the concepts inheritance and polymorphism in an object-oriented language, and use these concepts in the programming process,
- use the programming language Java, both writing own code and explaining what task a given code performs;
- implement recursive solutions to different problems;
- describe the general principle for analysing the efficiency of an algorithm and perform such an analysis on simple algorithms,
- describe, implement and use the data structures array, linked list, hash table and binary tree,
- describe how error handling with exceptions is working and to use this in self-written programs
Programming in Java: inheritance, polymorphism, exceptions. Object oriented analysis and design. Data structures: stacks, queues, lists, trees and hash tables.
Basic algorithms for storing, searching and sorting. Programming techniques, tools for software development.
Lectures, problem classes/computer lab and compulsory assignments.
Written examination at the end of the course and approved assignments.
- Latest syllabus (applies from Autumn 2022)
- Previous syllabus (applies from Autumn 2020)
- Previous syllabus (applies from Autumn 2019)
- Previous syllabus (applies from Autumn 2017)
- Previous syllabus (applies from Spring 2013)
- Previous syllabus (applies from Autumn 2010)
- Previous syllabus (applies from Autumn 2009)
- Previous syllabus (applies from Autumn 2007)
Applies from: Autumn 2010
Some titles may be available electronically through the University library.
Java software solutions : foundations of program design
6. ed.: Boston ;a London: Pearson/Addison-Wesley,  cop. 2009