456-0538/01 – Programming in C# (PC#)

Gurantor departmentDepartment of Computer ScienceCredits6
Subject guarantorIng. Marek Běhálek, Ph.D.Subject version guarantorIng. Marek Běhálek, Ph.D.
Study levelundergraduate or graduateRequirementOptional
Year2Semesterwinter
Study languageCzech
Year of introduction2003/2004Year of cancellation2008/2009
Intended for the facultiesFEIIntended for study typesBachelor
Instruction secured by
LoginNameTuitorTeacher giving lectures
BEH01 Ing. Marek Běhálek, Ph.D.
FED006 Ing. Dušan Fedorčák, Ph.D.
GAJ03 doc. Ing. Petr Gajdoš, Ph.D.
Extent of instruction for forms of study
Form of studyWay of compl.Extent
Full-time Graded credit 2+2
Combined Graded credit 2+4

Subject aims expressed by acquired skills and competences

Main course goal is to teach students write programs in programming language C# with usage of full potential of .NET platform. After course graduation students will be able separately implement applications in this language. Also they will be able to use modern tool appropriate for programming language C#.

Teaching methods

Summary

Main goal of this course is to teach students how to write programs in programming language C#. Students after graduating should not only know how to use programming language C# but they should also understand .NET platform and they should be able to use full potential of .NET platform. Then they can use these expediencies for practical applications development.

Compulsory literature:

Behalek M.: Lecture material for course Programming in C#, available at www.cs.vsb.cz/behalek/vyuka/pcsharp

Recommended literature:

Tom Archer: Inside C#. ISBN 0-7356-1288-9 Drayton, P., Albahari, B., Neward, T.: C# in a Nutshell. O'Reilly & Associates Inc., 2002, ISBN 0-596-00181-9 http://msdn.microsoft.com/net http://www.gotdotnet.com http://www.go-mono.com http://www.dotgnu.org http://www.ecma.ch

Way of continuous check of knowledge in the course of semester

Conditions for inclusion: 45 points they can get directly in lectures for solving four practical laboratory exercises. At least 21 points is required. Exams condition is written test where students must get at least 25 points from 55 points.

E-learning

Další požadavky na studenta

Prerequisities

Subject has no prerequisities.

Co-requisities

Subject has no co-requisities.

Subject syllabus:

Lectures: Introduction: Goals and contents of the course, requirements, organization, resources. Programming languages classification. Usage and applications of compilers. Source and target languages. History of programming languages and compilers: theoretical aspects, first programming languages and compilers, high-order programming languages, structured programming, modular languages, object-oriented languages, scripting languages. Functional and logic programming languages: Declarative style of programming, advantages and disadvantages of this approach, basics of Lambda Calculus, implementation of practical examples in Haskell. Scripting languages: description of differences between traditional languages and scripting languages, description of some representatives of scripting languages, practical examples, overview of PHP. Imperative programming languages: basic principles, imperative programming languages. Examples of different programming paradigms. Object-oriented programming: basic principles, less known object-oriented programming languages. Structure and functions of a compiler: Source code models, transformations. Compiler organization - phases, passes. One-pass and optimising compilers. Utility programs. Testing and maintenance of a compiler. Lexical analysis: Function of a scanner, symbol representation. Regular languages, finite automaton, regular expression. Scanner implementation. Parsing: Goals and methods of the syntactic analysis. Top-down and Bottom-up analysis. LL(1) grammars, FIRST and FOLLOW set computation. Parsing table. Parser implementation: Pushdown automaton for LL(1) languages. Recursive descent analysis. Syntax directed translation: Translation grammar, attribute translation grammar. Implementation of attribute translation during top-down parsing. Compiler Compiler JavaCC. Symbol table: Basic notions - binding, range, visibility, life time. Functions of symbol table. Programming language model. Organization of symbol table. Block structured symbol table. Implementation. Internal representation of program: Formats of internal representation - graph, stack code, three-address code. Implementation of three-address code. Translation of expressions. Array items addressing. Translation of Boolean expressions. Generation of stack code as attribute translation. Run-time program structure: Run-time system. Subroutines - activation, static and dynamic structure, activation record. Memory organization, memory allocation for activation records, access pointers. Parameter passing. Projects: There will be two projects in this course. Firs will be an implementation of some task in less known programming language. Second will be a simple compiler. Computer labs: Examples of different programming paradigms. Examples of declarative style of programming. Practical implementation of some simple tasks in Haskell. Implementation of some tasks in Haskell. Scripting languages: Implementation of simple task in PHP. Imperative and object oriented languages. Examples of programs written in some less known languages. Work on firs project. Implementation in simple filters and lexical analyzers. Practical realization of grammars for a basic constructions common in programming languages. Implementation of algorithms for a computation of sets FIRST a FOLLOW. Demonstration of LL(1) a LR(1) based syntactic analyzers. Implementation of a syntactic analyzer using recursive descent. Implementation of a simple compiler using compiler compiler JavaCC. Work on second project.

Conditions for subject completion

Full-time form (validity from: 1960/1961 Summer semester, validity until: 2007/2008 Summer semester)
Task nameType of taskMax. number of points
(act. for subtasks)
Min. number of points
Graded exercises evaluation Graded credit 100 (100) 0
        Written exam Written test 55  0
        Other task type Other task type 45  0
Mandatory attendence parzicipation:

Show history

Occurrence in study plans

Academic yearProgrammeField of studySpec.FormStudy language Tut. centreYearWSType of duty
2009/2010 (B2646) Information Technology (2612R059) Mobile Technology P Czech Ostrava 2 Choice-compulsory study plan
2009/2010 (B2646) Information Technology (2612R059) Mobile Technology K Czech Ostrava 2 Choice-compulsory study plan
2008/2009 (B2646) Information Technology (2612R059) Mobile Technology P Czech Ostrava 2 Choice-compulsory study plan
2008/2009 (B2646) Information Technology (2612R059) Mobile Technology K Czech Ostrava 2 Choice-compulsory study plan
2008/2009 (B2647) Information and Communication Technology (1103R031) Computational Mathematics P Czech Ostrava 2 Optional study plan
2008/2009 (B2647) Information and Communication Technology (2601R013) Telecommunication Technology P Czech Ostrava 2 Optional study plan
2008/2009 (B2647) Information and Communication Technology (2612R025) Computer Science and Technology P Czech Ostrava 2 Optional study plan
2008/2009 (B2647) Information and Communication Technology (2612R059) Mobile Technology P Czech Ostrava 2 Optional study plan
2008/2009 (B2647) Information and Communication Technology (1103R031) Computational Mathematics K Czech Ostrava 2 Optional study plan
2008/2009 (B2647) Information and Communication Technology (2601R013) Telecommunication Technology K Czech Ostrava 2 Optional study plan
2008/2009 (B2647) Information and Communication Technology (2612R025) Computer Science and Technology K Czech Ostrava 2 Optional study plan
2008/2009 (B2647) Information and Communication Technology (2612R059) Mobile Technology K Czech Ostrava 2 Optional study plan
2007/2008 (B2646) Information Technology (2612R059) Mobile Technology P Czech Ostrava 2 Choice-compulsory study plan
2007/2008 (B2646) Information Technology (2612R059) Mobile Technology K Czech Ostrava 2 Choice-compulsory study plan
2007/2008 (B2647) Information and Communication Technology (1103R031) Computational Mathematics P Czech Ostrava 2 Optional study plan
2007/2008 (B2647) Information and Communication Technology (2601R013) Telecommunication Technology P Czech Ostrava 2 Optional study plan
2007/2008 (B2647) Information and Communication Technology (2612R025) Computer Science and Technology P Czech Ostrava 2 Optional study plan
2007/2008 (B2647) Information and Communication Technology (2612R059) Mobile Technology P Czech Ostrava 2 Optional study plan
2007/2008 (B2647) Information and Communication Technology (1103R031) Computational Mathematics K Czech Ostrava 2 Optional study plan
2007/2008 (B2647) Information and Communication Technology (2601R013) Telecommunication Technology K Czech Ostrava 2 Optional study plan
2007/2008 (B2647) Information and Communication Technology (2612R025) Computer Science and Technology K Czech Ostrava 2 Optional study plan
2007/2008 (B2647) Information and Communication Technology (2612R059) Mobile Technology K Czech Ostrava 2 Optional study plan
2006/2007 (B2646) Information Technology (2612R059) Mobile Technology P Czech Ostrava 2 Choice-compulsory study plan
2006/2007 (B2646) Information Technology (2612R059) Mobile Technology K Czech Ostrava 2 Choice-compulsory study plan
2006/2007 (B2647) Information and Communication Technology (1103R031) Computational Mathematics P Czech Ostrava 2 Optional study plan
2006/2007 (B2647) Information and Communication Technology (2601R013) Telecommunication Technology P Czech Ostrava 2 Optional study plan
2006/2007 (B2647) Information and Communication Technology (2612R025) Computer Science and Technology P Czech Ostrava 2 Optional study plan
2006/2007 (B2647) Information and Communication Technology (2612R059) Mobile Technology P Czech Ostrava 2 Optional study plan
2006/2007 (B2647) Information and Communication Technology (1103R031) Computational Mathematics K Czech Ostrava 2 Optional study plan
2006/2007 (B2647) Information and Communication Technology (2601R013) Telecommunication Technology K Czech Ostrava 2 Optional study plan
2006/2007 (B2647) Information and Communication Technology (2612R025) Computer Science and Technology K Czech Ostrava 2 Optional study plan
2006/2007 (B2647) Information and Communication Technology (2612R059) Mobile Technology K Czech Ostrava 2 Optional study plan
2005/2006 (B2646) Information Technology (2612R059) Mobile Technology P Czech Ostrava 2 Optional study plan
2005/2006 (B2646) Information Technology (2612R059) Mobile Technology K Czech Ostrava 2 Choice-compulsory study plan
2004/2005 (B2646) Information Technology (2612R059) Mobile Technology P Czech Ostrava 2 Choice-compulsory study plan
2004/2005 (B2646) Information Technology (2612R059) Mobile Technology K Czech Ostrava 2 Choice-compulsory study plan

Occurrence in special blocks

Block nameAcademic yearForm of studyStudy language YearWSType of blockBlock owner