Difference between revisions of "BSc: Introduction To Programming"

From IU
Jump to navigation Jump to search
Tag: Manual revert
 
(2 intermediate revisions by 2 users not shown)
Line 1: Line 1:
  +
 
= Introduction to Programming =
  
= Introduction to Programming =
  +
* '''Course name''': Introduction to Programming
  +
* '''Code discipline''': CSE101
  +
* '''Subject area''': Programming Languages and Software Engineering
   
  +
== Short Description ==
−
* <span>'''Course name:'''</span> Introduction to Programming
  
  +
This course covers the following concepts: Basic concept - algorithm, program, data; Computer architecture basics; Structured programming; Object-oriented programming; Generic programming; Exception handling; Programming by contract (c); Functional programming; Concurrent programming.
−
* <span>'''Course number:'''</span> CSE101
  
−
* <span>'''Subject area:'''</span> Programming Languages and Software Engineering
  
   
  +
== Prerequisites ==
   
  +
=== Prerequisite subjects ===
−
== Course characteristics ==
  
   
−
=== Key concepts of the class ===
  
   
  +
=== Prerequisite topics ===
−
* Basic concept - algorithm, program, data
  
−
* Computer architecture basics
  
−
* Structured programming
  
−
* Object-oriented programming
  
−
* Generic programming
  
−
* Exception handling
  
−
* Programming by contract (c)
  
−
* Functional programming
  
−
* Concurrent programming
  
   
−
=== What is the purpose of this course? ===
  
   
  +
== Course Topics ==
  +
{| class="wikitable"
  +
|+ Course Sections and Topics
  +
|-
  +
! Section !! Topics within the section
  +
|-
  +
| Introduction to programming ||
  +
# Basic definitions – algorithm, program, computer, von Neumann architecture, CPU lifecycle.
  +
# Programming languages history and overview. Imperative (procedural) and functional approaches.
  +
# Translation – compilation vs. interpretation. JIT, AOT. Hybrid modes.
  +
# Introduction to typification. Static and dynamic typing. Type inference. Basic types – integer, real, character, boolean, bit. Arrays and strings. Records-structures.
  +
# Programming – basic concepts. Statements and expressions. 3 atomic statements - assignment, if-check, goto. Control structures – conditional, assignment, goto, case-switch-inspect, loops.
  +
# Variables and constants.
  +
# Routines – procedures and functions.
  +
|-
  +
| Introduction to object-oriented programming ||
  +
# Key principles of object-oriented programming
  +
# Overloading is not overriding
  +
# Concepts of class and object
  +
# How objects can be created?
  +
# Single and multiple inheritance
  +
|-
  +
| Introduction to generics, exception handling and programming by contract (C) ||
  +
# Introduction to generics
  +
# Introduction to exception handling
  +
# Introduction to programming by contract (C)
  +
|-
  +
| Introduction to programming environments ||
  +
# Concept of libraries as the basis for reuse.
  +
# Concept of interfaces/API. Separate compilation.
  +
# Approaches to software documentation.
  +
# Persistence. Files.
  +
# How to building a program. Recompilation problem. Name clashes, name spaces
  +
|-
  +
| Introduction to concurrent and functional programming ||
  +
# Concurrent programming.
  +
# Functional programming within imperative programming languages.
  +
|}
  +
== Intended Learning Outcomes (ILOs) ==
  +
  +
=== What is the main purpose of this course? ===
 
The Introduction to Programming course teaches the fundamental concepts and skills necessary to perform programming at a professional level. Students will learn how to master the fundamental control structures, data structures, reasoning patterns and programming language mechanisms characterizing modern programming, as well as the fundamental rules of producing high-quality software. They will acquire the necessary programming background for later courses introducing programming skills in specialized application areas. The course focuses on Object Oriented paradigm.
  
The Introduction to Programming course teaches the fundamental concepts and skills necessary to perform programming at a professional level. Students will learn how to master the fundamental control structures, data structures, reasoning patterns and programming language mechanisms characterizing modern programming, as well as the fundamental rules of producing high-quality software. They will acquire the necessary programming background for later courses introducing programming skills in specialized application areas. The course focuses on Object Oriented paradigm.
   
  +
=== ILOs defined at three levels ===
−
== Course Objectives Based on Bloom’s Taxonomy ==
  
−  
−
=== - What should a student remember at the end of the course? ===
  
   
  +
==== Level 1: What concepts should a student know/remember/explain? ====
  +
By the end of the course, the students should be able to ...
 
* Basic concepts of programming. What is algorithm, program.
  
* Basic concepts of programming. What is algorithm, program.
 
* Concept of typification. Dynamic and static types.
  
* Concept of typification. Dynamic and static types.
Line 35: Line 70:
 
* verification of the software based on programming by contract (C)
  
* verification of the software based on programming by contract (C)
   
−
=== - What should a student be able to understand at the end of the course? ===
 +
==== Level 2: What basic practical skills should a student be able to perform? ====
  +
By the end of the course, the students should be able to ...
−  
 
* How to create high quality software using mainstream concepts of programming.
  
* How to create high quality software using mainstream concepts of programming.
 
* What is object-oriented programming and its main advantages
  
* What is object-oriented programming and its main advantages
Line 42: Line 77:
 
* How to create concurrent programs and what are the main issues related to this kind of programming
  
* How to create concurrent programs and what are the main issues related to this kind of programming
   
−
=== - What should a student be able to apply at the end of the course? ===
 +
==== Level 3: What complex comprehensive skills should a student be able to apply in real-life scenarios? ====
  +
By the end of the course, the students should be able to ...
  +
* To be able to create quality programs in Java.
  +
== Grading ==
   
  +
=== Course grading range ===
−
* To be able to create quality programs in Java.
  
  +
{| class="wikitable"
  +
|+
  +
|-
  +
! Grade !! Range !! Description of performance
  +
|-
  +
| A. Excellent || 85-100 || -
  +
|-
  +
| B. Good || 75-84 || -
  +
|-
  +
| C. Satisfactory || 60-75 || -
  +
|-
  +
| D. Poor || 0-59 || -
  +
|}
   
−
=== Course evaluation ===
 +
=== Course activities and grading breakdown ===
  +
{| class="wikitable"
−  
−
{|
 +
|+
  +
|-
−
|+ Course grade breakdown
  
  +
! Activity Type !! Percentage of the overall course grade
−
!
  
−
!
  
−
!align="center"| '''Proposed points'''
  
 
|-
  
|-
−
| Labs/seminar classes
 +
| Labs/seminar classes || 40
−
| 40
  
−
|align="center"| 40
  
 
|-
  
|-
−
| Interim performance assessment
 +
| Interim performance assessment || 30
−
| 30
  
−
|align="center"| 30
  
 
|-
  
|-
−
| Exams
 +
| Exams || 30
−
| 30
  
−
|align="center"| 30
  
 
|}
  
|}
   
  +
=== Recommendations for students on how to succeed in the course ===
−
If necessary, please indicate freely your course’s features in terms of students’ performance assessment:
  
   
−
==== Labs/seminar classes: ====
  
   
  +
== Resources, literature and reference materials ==
−
* In-class participation 1 point for each individual contribution in a class but not more than 1 point a week (i.e. 14 points in total for 14 study weeks),
  
−
* overall course contribution (to accumulate extra-class activities valuable to the course progress, e.g. a short presentation, book review, very active in-class participation, etc.) up to 6 points.
  
   
−
==== Interim performance assessment: ====
 +
=== Open access resources ===
   
−
* in-class tests up to 10 points for each test (i.e. up to 40 points in total for 2 theory and 2 practice tests),
  
−
* computational practicum assignment up to 10 points for each task (i.e. up to 30 points for 3 tasks).
  
   
−
==== Exams: ====
 +
=== Closed access resources ===
   
−
* mid-term exam up to 30 points,
  
−
* final examination up to 30 points.
  
   
  +
=== Software and tools used within the course ===
−
==== Overall score: ====
  
  +
  +
= Teaching Methodology: Methods, techniques, & activities =
   
  +
== Activities and Teaching Methods ==
−
100 points (100%).
  
  +
{| class="wikitable"
−  
  +
|+ Activities within each section
−
=== Grades range ===
  
−  
−
{|
  
−
|+ Course grading range
  
−
!
  
−
!
  
−
!align="center"| '''Proposed range'''
  
 
|-
  
|-
  +
! Learning Activities !! Section 1 !! Section 2 !! Section 3 !! Section 4 !! Section 5
−
| A. Excellent
  
−
| 85-100
  
−
|align="center"| 85-100
  
 
|-
  
|-
  +
| Homework and group projects || 1 || 1 || 1 || 1 || 1
−
| B. Good
  
−
| 75-84
  
−
|align="center"| 75-84
  
 
|-
  
|-
  +
| Midterm evaluation || 1 || 1 || 1 || 0 || 0
−
| C. Satisfactory
  
−
| 60-75
  
−
|align="center"| 60-75
  
 
|-
  
|-
  +
| Testing (written or computer based) || 1 || 0 || 0 || 1 || 1
−
| D. Poor
  
−
| 0-59
 +
|-
  +
| Oral polls || 1 || 1 || 1 || 1 || 1
−
|align="center"| 0-59
  
−
|}
 +
|-
  +
| Discussions || 1 || 1 || 1 || 1 || 1
  +
|-
  +
| Development of individual parts of software product code || 0 || 1 || 0 || 0 || 0
  +
|-
  +
| Reports || 0 || 1 || 0 || 0 || 0
  +
|}
  +
== Formative Assessment and Course Activities ==
   
  +
=== Ongoing performance assessment ===
−
If necessary, please indicate freely your course’s grading features:
  
   
  +
==== Section 1 ====
−
* A: more than 85 of the overall score;
  
  +
{| class="wikitable"
−
* B: at least 85 of the overall score;
  
  +
|+
−
* C: at least 75 of the overall score;
  
  +
|-
−
* D: less than 60 of the overall score.
  
  +
! Activity Type !! Content !! Is Graded?
−  
  +
|-
−
=== Resources and reference material ===
  
  +
| Question || What is the difference between compiler and interpreter? || 1
−  
  +
|-
−
==== Textbook: ====
  
  +
| Question || What is the difference between type and variable? || 1
−  
  +
|-
−
*
 
  +
| Question || What is the background of structured programming? || 1
−
*
 
  +
|-
−  
  +
| Question || How to compile a program? || 0
−
== Course Sections ==
  
  +
|-
−  
  +
| Question || How to run a program? || 0
−
The main sections of the course and approximate hour distribution between them is as follows:
  
  +
|-
−  
  +
| Question || How to debug a program? || 0
−
{|
  
  +
|}
−
|+ Course Sections
  
−
|align="center"| '''Section'''
 +
==== Section 2 ====
  +
{| class="wikitable"
−
| '''Section Title'''
  
  +
|+
−
|align="center"| '''Lectures'''
  
  +
|-
−
|align="center"| '''Seminars'''
  
  +
! Activity Type !! Content !! Is Graded?
−
|align="center"| '''Self-study'''
  
−
|align="center"| '''Knowledge'''
  
 
|-
  
|-
  +
| Question || What is the meaning of polymorphism? || 1
−
|align="center"| '''Number'''
  
−
|
  
−
|align="center"| '''(hours)'''
  
−
|align="center"| '''(labs)'''
  
−
|align="center"|
  
−
|align="center"| '''evaluation'''
  
 
|-
  
|-
  +
| Question || How to check the dynamic type of an object? || 1
−
|align="center"| 1
  
−
| Introduction to programming
  
−
|align="center"| 12
  
−
|align="center"| 6
  
−
|align="center"| 12
  
−
|align="center"| 2
  
 
|-
  
|-
  +
| Question || What are the limitations of single inheritance? || 1
−
|align="center"| 2
  
−
| Introduction to object-oriented programming
  
−
|align="center"| 8
  
−
|align="center"| 4
  
−
|align="center"| 8
  
−
|align="center"| 1
  
 
|-
  
|-
  +
| Question || What are the issues related with multiple inheritance? || 1
−
|align="center"| 3
  
−
| Introduction to generics, exception handling and programming by contract (C)
  
−
|align="center"| 8
  
−
|align="center"| 4
  
−
|align="center"| 8
  
−
|align="center"| 1
  
 
|-
  
|-
  +
| Question || How to handle array of objects of some class type? || 0
−
|align="center"| 4
  
−
| Introduction to programming environments
  
−
|align="center"| 12
  
−
|align="center"| 6
  
−
|align="center"| 12
  
−
|align="center"| 2
  
 
|-
  
|-
  +
| Question || How to implement the class which logically has to have 2 constructors with the same signature but with different semantics? || 0
−
|align="center"| 5
  
  +
|}
−
| Introduction to concurrent and functional programming
  
  +
==== Section 3 ====
−
|align="center"| 8
  
  +
{| class="wikitable"
−
|align="center"| 4
  
  +
|+
−
|align="center"| 8
  
−
|align="center"| 1
  
 
|-
  
|-
  +
! Activity Type !! Content !! Is Graded?
−
|align="center"| Final examination
  
−
|
 +
|-
  +
| Question || What is constrained genericity? || 1
−
|align="center"|
  
  +
|-
−
|align="center"|
  
  +
| Question || What is exception? || 1
−
|align="center"|
  
  +
|-
−
|align="center"| 2
  
  +
| Question || What is assertion? || 1
−
|}
  
  +
|-
−  
  +
| Question || How constrained genericity may be used for sorting of objects? || 0
−
=== Section 1 ===
  
  +
|-
−  
  +
| Question || In which order catch blocks are being processed? || 0
−
==== Section title: ====
  
  +
|-
−  
  +
| Question || Where is the problem when precondition is violated? || 0
−
Introduction to programming
  
  +
|}
−  
−
=== Topics covered in this section: ===
 +
==== Section 4 ====
  +
{| class="wikitable"
−  
  +
|+
−
* Basic definitions – algorithm, program, computer, von Neumann architecture, CPU lifecycle.
  
  +
|-
−
* Programming languages history and overview. Imperative (procedural) and functional approaches.
  
  +
! Activity Type !! Content !! Is Graded?
−
* Translation – compilation vs. interpretation. JIT, AOT. Hybrid modes.
  
  +
|-
−
* Introduction to typification. Static and dynamic typing. Type inference. Basic types – integer, real, character, boolean, bit. Arrays and strings. Records-structures.
  
  +
| Question || How reuse helps to develop software? || 1
−
* Programming – basic concepts. Statements and expressions. 3 atomic statements - assignment, if-check, goto. Control structures – conditional, assignment, goto, case-switch-inspect, loops.
  
  +
|-
−
* Variables and constants.
  
  +
| Question || How concept of libraries and separate compilation co-relate? || 1
−
* Routines – procedures and functions.
  
  +
|-
−  
  +
| Question || What are the benefits of integrating documentation into the source code? || 1
−
=== What forms of evaluation were used to test students’ performance in this section? ===
  
  +
|-
−  
  +
| Question || Why is it essential to have persistent data structures? || 1
−
<div class="tabular">
  
  +
|-
−  
  +
| Question || What is to be done to design and develop a library? || 0
−
<span>|a|c|</span> &amp; '''Yes/No'''<br />
  
  +
|-
−
Development of individual parts of software product code &amp; 0<br />
  
  +
| Question || How to add documenting comments into the source code? || 0
−
Homework and group projects &amp; 1<br />
  
  +
|-
−
Midterm evaluation &amp; 1<br />
  
  +
| Question || What ways exists in Java to support persistence ? || 0
−
Testing (written or computer based) &amp; 1<br />
  
  +
|}
−
Reports &amp; 0<br />
  
  +
==== Section 5 ====
−
Essays &amp; 0<br />
  
  +
{| class="wikitable"
−
Oral polls &amp; 1<br />
  
  +
|+
−
Discussions &amp; 1<br />
  
  +
|-
−  
  +
! Activity Type !! Content !! Is Graded?
−  
  +
|-
−  
  +
| Question || Explain the key differences parallelism and concurrency || 1
−
</div>
  
  +
|-
−
=== Typical questions for ongoing performance evaluation within this section ===
  
  +
| Question || What are the key issues related to parallel execution? || 1
−  
  +
|-
−
# What is the difference between compiler and interpreter?
  
−
# What is the difference between type and variable?
 +
| Question || What are the models of parallel execution? || 1
  +
|-
−
# What is the background of structured programming?
  
  +
| Question || What is the difference between function and object? || 1
−  
  +
|-
−
=== Typical questions for seminar classes (labs) within this section ===
  
  +
| Question || Which Java construction support concurrency? || 0
−  
  +
|-
−
# How to compile a program?
  
  +
| Question || What is a thread? || 0
−
# How to run a program?
  
  +
|-
−
# How to debug a program?
  
  +
| Question || What is in-line lambda function? || 0
−  
  +
|}
−
=== Test questions for final assessment in this section ===
  
  +
=== Final assessment ===
−  
  +
'''Section 1'''
 
# What are the basic control structure of structured programming?
  
# What are the basic control structure of structured programming?
 
# What is the difference between statements and expressions?
  
# What is the difference between statements and expressions?
 
# What are the benefits of type inference?
  
# What are the benefits of type inference?
  +
'''Section 2'''
−  
−
=== Section 2 ===
  
−  
−
==== Section title: ====
  
−  
−
Introduction to object-oriented programming
  
−  
−
=== Topics covered in this section: ===
  
−  
−
* Key principles of object-oriented programming
  
−
* Overloading is not overriding
  
−
* Concepts of class and object
  
−
* How objects can be created?
  
−
* Single and multiple inheritance
  
−  
−
=== What forms of evaluation were used to test students’ performance in this section? ===
  
−  
−
<div class="tabular">
  
−  
−
<span>|a|c|</span> &amp; '''Yes/No'''<br />
  
−
Development of individual parts of software product code &amp; 1<br />
  
−
Homework and group projects &amp; 1<br />
  
−
Midterm evaluation &amp; 1<br />
  
−
Testing (written or computer based) &amp; 0<br />
  
−
Reports &amp; 1<br />
  
−
Essays &amp; 0<br />
  
−
Oral polls &amp; 1<br />
  
−
Discussions &amp; 1<br />
  
−  
−  
−  
−
</div>
  
−
=== Typical questions for ongoing performance evaluation within this section ===
  
−  
−
# What is the meaning of polymorphism?
  
−
# How to check the dynamic type of an object?
  
−
# What are the limitations of single inheritance?
  
−
# What are the issues related with multiple inheritance?
  
−  
−
=== Typical questions for seminar classes (labs) within this section ===
  
−  
−
# How to handle array of objects of some class type?
  
−
# How to implement the class which logically has to have 2 constructors with the same signature but with different semantics?
  
−  
−
=== Test questions for final assessment in this section ===
  
−  
 
# Name all principles of object-oriented programming?
  
# Name all principles of object-oriented programming?
 
# Explain what conformance means?
  
# Explain what conformance means?
 
# Explain why cycles are prohibited in the inheritance graph?
  
# Explain why cycles are prohibited in the inheritance graph?
  +
'''Section 3'''
−  
−
=== Section 3 ===
  
−  
−
==== Section title: ====
  
−  
−
Introduction to generics, exception handling and programming by contract (C)
  
−  
−
=== Topics covered in this section: ===
  
−  
−
* Introduction to generics
  
−
* Introduction to exception handling
  
−
* Introduction to programming by contract (C)
  
−  
−
=== What forms of evaluation were used to test students’ performance in this section? ===
  
−  
−
<div class="tabular">
  
−  
−
<span>|a|c|</span> &amp; '''Yes/No'''<br />
  
−
Development of individual parts of software product code &amp; 0<br />
  
−
Homework and group projects &amp; 1<br />
  
−
Midterm evaluation &amp; 1<br />
  
−
Testing (written or computer based) &amp; 0<br />
  
−
Reports &amp; 0<br />
  
−
Essays &amp; 0<br />
  
−
Oral polls &amp; 1<br />
  
−
Discussions &amp; 1<br />
  
−  
−  
−  
−
</div>
  
−
=== Typical questions for ongoing performance evaluation within this section ===
  
−  
−
# What is constrained genericity?
  
−
# What is exception?
  
−
# What is assertion?
  
−  
−
=== Typical questions for seminar classes (labs) within this section ===
  
−  
−
# How constrained genericity may be used for sorting of objects?
  
−
# In which order catch blocks are being processed?
  
−
# Where is the problem when precondition is violated?
  
−  
−
=== Test questions for final assessment in this section ===
  
−  
 
# Can array be treated as generic class?
  
# Can array be treated as generic class?
 
# What is the difference between throw and throws in Java?
  
# What is the difference between throw and throws in Java?
 
# What is purpose of the class invariant?
  
# What is purpose of the class invariant?
  +
'''Section 4'''
−  
−
=== Section 4 ===
  
−  
−
==== Section title: ====
  
−  
−
Introduction to programming environments
  
−  
−
=== Topics covered in this section: ===
  
−  
−
* Concept of libraries as the basis for reuse.
  
−
* Concept of interfaces/API. Separate compilation.
  
−
* Approaches to software documentation.
  
−
* Persistence. Files.
  
−
* How to building a program. Recompilation problem. Name clashes, name spaces
  
−  
−
=== What forms of evaluation were used to test students’ performance in this section? ===
  
−  
−
<div class="tabular">
  
−  
−
<span>|a|c|</span> &amp; '''Yes/No'''<br />
  
−
Development of individual parts of software product code &amp; 0<br />
  
−
Homework and group projects &amp; 1<br />
  
−
Midterm evaluation &amp; 0<br />
  
−
Testing (written or computer based) &amp; 1<br />
  
−
Reports &amp; 0<br />
  
−
Essays &amp; 0<br />
  
−
Oral polls &amp; 1<br />
  
−
Discussions &amp; 1<br />
  
−  
−  
−  
−
</div>
  
−
=== Typical questions for ongoing performance evaluation within this section ===
  
−  
−
# How reuse helps to develop software?
  
−
# How concept of libraries and separate compilation co-relate?
  
−
# What are the benefits of integrating documentation into the source code?
  
−
# Why is it essential to have persistent data structures?
  
−  
−
=== Typical questions for seminar classes (labs) within this section ===
  
−  
−
# What is to be done to design and develop a library?
  
−
# How to add documenting comments into the source code?
  
−
# What ways exists in Java to support persistence ?
  
−  
−
=== Test questions for final assessment in this section ===
  
−  
 
# How to deal with name clashes?
  
# How to deal with name clashes?
 
# What is the main task of the recompilation module?
  
# What is the main task of the recompilation module?
 
# What are the differences between different formats of persistence files?
  
# What are the differences between different formats of persistence files?
  +
'''Section 5'''
−  
−
=== Section 5 ===
  
−  
−
==== Section title: ====
  
−  
−
Introduction to concurrent and functional programming
  
−  
−
=== Topics covered in this section: ===
  
−  
−
* Concurrent programming.
  
−
* Functional programming within imperative programming languages.
  
−  
−
=== What forms of evaluation were used to test students’ performance in this section? ===
  
−  
−
<div class="tabular">
  
−  
−
<span>|a|c|</span> &amp; '''Yes/No'''<br />
  
−
Development of individual parts of software product code &amp; 0<br />
  
−
Homework and group projects &amp; 1<br />
  
−
Midterm evaluation &amp; 0<br />
  
−
Testing (written or computer based) &amp; 1<br />
  
−
Reports &amp; 0<br />
  
−
Essays &amp; 0<br />
  
−
Oral polls &amp; 1<br />
  
−
Discussions &amp; 1<br />
  
−  
−  
−  
−
</div>
  
−
=== Typical questions for ongoing performance evaluation within this section ===
  
−  
−
# Explain the key differences parallelism and concurrency
  
−
# What are the key issues related to parallel execution?
  
−
# What are the models of parallel execution?
  
−
# What is the difference between function and object?
  
−  
−
=== Typical questions for seminar classes (labs) within this section ===
  
−  
−
# Which Java construction support concurrency?
  
−
# What is a thread?
  
−
# What is in-line lambda function?
  
−  
−
=== Test questions for final assessment in this section ===
  
−  
 
# What is the meaning of SIMD and MIMD?
  
# What is the meaning of SIMD and MIMD?
 
# What are the implications of the Amdahl’s law?
  
# What are the implications of the Amdahl’s law?
Line 437: Line 268:
 
# How Java supports high-order functions?
  
# How Java supports high-order functions?
 
# How capturing variables works in Java?
  
# How capturing variables works in Java?
  +
  +
=== The retake exam ===
  +
'''Section 1'''
  +
  +
'''Section 2'''
  +
  +
'''Section 3'''
  +
  +
'''Section 4'''
  +
  +
'''Section 5'''

Latest revision as of 10:59, 11 November 2022

Introduction to Programming

  • Course name: Introduction to Programming
  • Code discipline: CSE101
  • Subject area: Programming Languages and Software Engineering

Short Description

This course covers the following concepts: Basic concept - algorithm, program, data; Computer architecture basics; Structured programming; Object-oriented programming; Generic programming; Exception handling; Programming by contract (c); Functional programming; Concurrent programming.

Prerequisites

Prerequisite subjects

Prerequisite topics

Course Topics

Course Sections and Topics
Section Topics within the section
Introduction to programming
  1. Basic definitions – algorithm, program, computer, von Neumann architecture, CPU lifecycle.
  2. Programming languages history and overview. Imperative (procedural) and functional approaches.
  3. Translation – compilation vs. interpretation. JIT, AOT. Hybrid modes.
  4. Introduction to typification. Static and dynamic typing. Type inference. Basic types – integer, real, character, boolean, bit. Arrays and strings. Records-structures.
  5. Programming – basic concepts. Statements and expressions. 3 atomic statements - assignment, if-check, goto. Control structures – conditional, assignment, goto, case-switch-inspect, loops.
  6. Variables and constants.
  7. Routines – procedures and functions.
Introduction to object-oriented programming
  1. Key principles of object-oriented programming
  2. Overloading is not overriding
  3. Concepts of class and object
  4. How objects can be created?
  5. Single and multiple inheritance
Introduction to generics, exception handling and programming by contract (C)
  1. Introduction to generics
  2. Introduction to exception handling
  3. Introduction to programming by contract (C)
Introduction to programming environments
  1. Concept of libraries as the basis for reuse.
  2. Concept of interfaces/API. Separate compilation.
  3. Approaches to software documentation.
  4. Persistence. Files.
  5. How to building a program. Recompilation problem. Name clashes, name spaces
Introduction to concurrent and functional programming
  1. Concurrent programming.
  2. Functional programming within imperative programming languages.

Intended Learning Outcomes (ILOs)

What is the main purpose of this course?

The Introduction to Programming course teaches the fundamental concepts and skills necessary to perform programming at a professional level. Students will learn how to master the fundamental control structures, data structures, reasoning patterns and programming language mechanisms characterizing modern programming, as well as the fundamental rules of producing high-quality software. They will acquire the necessary programming background for later courses introducing programming skills in specialized application areas. The course focuses on Object Oriented paradigm.

ILOs defined at three levels

Level 1: What concepts should a student know/remember/explain?

By the end of the course, the students should be able to ...

  • Basic concepts of programming. What is algorithm, program.
  • Concept of typification. Dynamic and static types.
  • Concepts of structured programming, object-oriented one.
  • Concepts of exception handling and generic programming.
  • Concurrent programming and functional programming in imperative programming languages.
  • verification of the software based on programming by contract (C)

Level 2: What basic practical skills should a student be able to perform?

By the end of the course, the students should be able to ...

  • How to create high quality software using mainstream concepts of programming.
  • What is object-oriented programming and its main advantages
  • How to increase the level of abstraction with help of genericity.
  • How to create concurrent programs and what are the main issues related to this kind of programming

Level 3: What complex comprehensive skills should a student be able to apply in real-life scenarios?

By the end of the course, the students should be able to ...

  • To be able to create quality programs in Java.

Grading

Course grading range

Grade Range Description of performance
A. Excellent 85-100 -
B. Good 75-84 -
C. Satisfactory 60-75 -
D. Poor 0-59 -

Course activities and grading breakdown

Activity Type Percentage of the overall course grade
Labs/seminar classes 40
Interim performance assessment 30
Exams 30

Recommendations for students on how to succeed in the course

Resources, literature and reference materials

Open access resources

Closed access resources

Software and tools used within the course

Teaching Methodology: Methods, techniques, & activities

Activities and Teaching Methods

Activities within each section
Learning Activities Section 1 Section 2 Section 3 Section 4 Section 5
Homework and group projects 1 1 1 1 1
Midterm evaluation 1 1 1 0 0
Testing (written or computer based) 1 0 0 1 1
Oral polls 1 1 1 1 1
Discussions 1 1 1 1 1
Development of individual parts of software product code 0 1 0 0 0
Reports 0 1 0 0 0

Formative Assessment and Course Activities

Ongoing performance assessment

Section 1

Activity Type Content Is Graded?
Question What is the difference between compiler and interpreter? 1
Question What is the difference between type and variable? 1
Question What is the background of structured programming? 1
Question How to compile a program? 0
Question How to run a program? 0
Question How to debug a program? 0

Section 2

Activity Type Content Is Graded?
Question What is the meaning of polymorphism? 1
Question How to check the dynamic type of an object? 1
Question What are the limitations of single inheritance? 1
Question What are the issues related with multiple inheritance? 1
Question How to handle array of objects of some class type? 0
Question How to implement the class which logically has to have 2 constructors with the same signature but with different semantics? 0

Section 3

Activity Type Content Is Graded?
Question What is constrained genericity? 1
Question What is exception? 1
Question What is assertion? 1
Question How constrained genericity may be used for sorting of objects? 0
Question In which order catch blocks are being processed? 0
Question Where is the problem when precondition is violated? 0

Section 4

Activity Type Content Is Graded?
Question How reuse helps to develop software? 1
Question How concept of libraries and separate compilation co-relate? 1
Question What are the benefits of integrating documentation into the source code? 1
Question Why is it essential to have persistent data structures? 1
Question What is to be done to design and develop a library? 0
Question How to add documenting comments into the source code? 0
Question What ways exists in Java to support persistence ? 0

Section 5

Activity Type Content Is Graded?
Question Explain the key differences parallelism and concurrency 1
Question What are the key issues related to parallel execution? 1
Question What are the models of parallel execution? 1
Question What is the difference between function and object? 1
Question Which Java construction support concurrency? 0
Question What is a thread? 0
Question What is in-line lambda function? 0

Final assessment

Section 1

  1. What are the basic control structure of structured programming?
  2. What is the difference between statements and expressions?
  3. What are the benefits of type inference?

Section 2

  1. Name all principles of object-oriented programming?
  2. Explain what conformance means?
  3. Explain why cycles are prohibited in the inheritance graph?

Section 3

  1. Can array be treated as generic class?
  2. What is the difference between throw and throws in Java?
  3. What is purpose of the class invariant?

Section 4

  1. How to deal with name clashes?
  2. What is the main task of the recompilation module?
  3. What are the differences between different formats of persistence files?

Section 5

  1. What is the meaning of SIMD and MIMD?
  2. What are the implications of the Amdahl’s law?
  3. What model of concurrency Java relies on?
  4. Which function can be considered as pure?
  5. How to declare a function to accept a functional object as its argument?
  6. How Java supports high-order functions?
  7. How capturing variables works in Java?

The retake exam

Section 1

Section 2

Section 3

Section 4

Section 5

Retrieved from "https://eduwiki.innopolis.university/index.php?title=BSc:_Introduction_To_Programming&oldid=7764"