Syllabus for Computer Programming II

Programmeringsteknik II

A revised version of the syllabus is available.

Syllabus

  • 5 credits
  • Course code: 1TD722
  • Education cycle: First cycle
  • Main field(s) of study and in-depth level: Computer Science G1F, Technology 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:

    First cycle

    • 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

    Second cycle

    • 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: 2013-05-14
  • Revised by: The Faculty Board of Science and Technology
  • Applies from: Spring 2013
  • Entry requirements:

    Computer Programming I or equivalent.

  • Responsible department: Department of Information Technology

Learning outcomes

To pass, the student should be able to

  • use the programming language Java, both writing own code and explaining what task a given code performs;
  • explain the concepts inheritance and polymorphism in an object-oriented language, and use these concepts in the programming process;
  • implement recursive solutions to different problems;
  • describe the general principle for analysing the efficiency of an algorithm and perform such an analysis on algorithms;
  • describe, implement and use the fundamental data structures array, linked list, hash table, binary tree and abstract data types as stacks, queues and maps;
  • describe how error handling with exceptions is working and to be able to use it in programs.

Content

Programming in Java: inheritance, polymorphism, exceptions. Object oriented analysis and design. Data structures: stacks, queues, lists, trees, hash tables, maps and collections.

Basic algorithms for storing, searching and sorting. Programming techniques, tools for software development. Debugging and testing.

Instruction

Lectures, problem classes/computer lab and compulsory assignments.

Assessment

Written examination (2 credits) and approved assignments (3 credits).

Syllabus Revisions

Reading list

Reading list

Applies from: Spring 2013

Some titles may be available electronically through the University library.

  • Lewis, John; Loftus, William Java software solutions : foundations of program design

    6. ed.: Boston ;a London: Pearson/Addison-Wesley, [2008] cop. 2009

    Find in the library

  • Skansholm, Jan Java direkt med Swing

    5. uppl.: Lund: Studentlitteratur, 2005

    Find in the library

Print syllabus and reading list
Print