ID1004 Objectoriented Programming 7.5 credits

Objektorienterad programmering

Please note

This course has been cancelled.

  • Educational level

    First cycle
  • Academic level (A-D)

  • Subject area

  • Grade scale

    A, B, C, D, E, FX, F

Last planned examination: spring 20.

At present this course is not scheduled to be offered.

Intended learning outcomes

After the course, you must be able to:
• in your computing environment, write your own programs, make programs ready to run and
run them
• have an approach of attacking errors that occur during the above process - troubleshooting and correction of both syntactic and logical errors
• able to describe and discuss the problem-solving approach to
you used or would use the to solve a given programming problems
• be able to search and select appropriate software components from a class library
• have a basic understanding of compilers and debuggers
You show that you have achieved these objectives through the oral report on the work process and outcome of your driving when working with and reporting on the various programming tasks.
• self-tackle and solve a given programming task
• verbally describe and apply a problem solving approach and justify their own choices
• use the relevant program structures (methods, classes, etc.) to facilitate the solution of programming problems
• make sure that the solution meets the specified requirements (testing)
• use the basic features of a debugger
• able to use existing software components
• be able to reason about a program's qualitative aspects (eg in terms of time complexity, modularity, etc.)
You show that you have reached those goals by solving, writing, documenting and
orally present assignments.
• describe basic computer science concepts and relationships between
these concepts (selection, iteration, data types, variables, etc.)
• describe and discuss basic object oriented concepts (objects, classes, encapsulation, etc.)
• a description of a minor problem to write an algorithm
which solves the problem
• illustrate and explain an algorithm into an algorithm notation (eg
• be able to reason about a program's qualitative aspects (eg in terms of time complexity, modularity, etc.)
You show that you have achieved these objectives on the exam.

Course main content

* Abstractions (methods and classes)* Data types, variables, type systems* Assignment, expressions* Sequence, selection, iteration* Method calls, parameter passing* The basics of object orientation -- classes, objects, messages, encapsulation* Library components (i.e. GUI components)* Basic event driven programming* Collections* Debugging* Design patterns* Simple program analysis


Completed upper secondary education including documented proficiency in Swedish corresponding to Swedish B and English corresponding to English A. For students who received/will receive their final school grades after 31 December 2009, there is an additional entry requirement for mathematics as follows: documented proficiency in mathematics corresponding to Mathematics A. And the specific requirements of mathematics, physics and chemistry corresponding to Mathematics D, Physics B and Chemistry A.


John Lewis & William Loftus: Java Software Solutions (Edition/upplaga: 6), Addison Wesley, 2009


  • INL1 - Assignments, 4.5, grade scale: P, F
  • TEN1 - Examination, 3.0, grade scale: A, B, C, D, E, FX, F

Requirements for final grade

Pass grade on written exam and problem assignments

Offered by

ICT/Software and Computer system


Fredrik Kilander <>

Add-on studies

ID 1005 Algorithms and Data Structures


Course syllabus valid from: Spring 2011.
Examination information valid from: Autumn 2007.