DESCRIPTION OF THE COURSE -...

1

DESCRIPTION OF THE COURSE

Name of the course:

Algorithm Design and Analysis

Code: BCSCe03

Semester: 3

Type of teaching:

Lectures and laboratory work

Lessons per week:

L – 2 hours; LW – 2 hour

Number of credits: 5

LECTURER:

Prof. Ognian Nakov Nakov Ph.D. (FCSC), – tel.: 965 3513, email: [email protected]

Technical University of Sofia

COURSE STATUS IN THE CURRICULUM: Compulsory for students speciality “Computer

Science and Engineering” – bachelor degree (Faculty of Computer Systems and Control of TU-

Sofia).

AIMS AND OBJECTIVES OF THE COURSE: Development of basic knowledge for algorithm

synthesis and analysis. Main group of algorithms are estimated: numbers manipulation, sorting,

searching, hashing, tree structures evaluations, recursions, lists, graphs etc.

DESCRIPTION OF THE COURSE: Theory of algorithms, problem and algorithm analysis and

looking for optimal decision are the topics of the course. The discussion is centred in: sort

algorithms, searching, recursion, lists, graphs, hashing. Practical work is involved for individual

development of algorithm and program synthesis of a problem.

PREREQUISITES: Basic knowledge in programming languages (Pascal and C++).

TEACHING METHODS: Lectures in multimedia variant; developed web site with all lecture and practical matherials of the course; practical work in laboratory. Published tutorial for every lecture and laboratory theme.

METHOD OF ASSESSMENT: Written examination with developed individual program.

INSTRUCTION LANGUAGE: English. BIBLIOGRAPHY: 1.Clifford A. Shaffer, Data Structures and Algorithm Analysis, 2013. 2.Sandeep Sen, Lecture Notes

for Algorithm Analysis and Design, 2013. 3.Sara Baase, Computer Algorithms: Introduction to

Design and Analysis, 2009. 4.Samir Khuler, Design and Analysis of Algorithms, 2012.

5.A.A.Puntambekar, Design and Analysis of Algorithms, 2010. 6.Dasgupta, S., C.H. Papadimitriou,

and U.V. Vazirani. Algorithms, 2006. 7.Thomas Runkler, Data Analytics, 2012. 8.Sedgewick R.,

Wayne K., Algorithms, Addison-Wesley Professional 2011

mailto:[email protected]

2


Name of the course

Computer Aided Design:

CAD systems

Code: BCSCе05 Semester: 1

Type of teaching:


Lessons per week:

L – 1 hour; LW – 2 hours


LECTURER:

Assoc. Prof. Ph.D. M. Vicheva (MF) – tel.: 965 2782, email: [email protected]


COURSE STATUS IN THE CURRICULUM: Compulsory for the students specialty Computer

Science and Engineering, BEng programme of the Faculty of Computer Systems and Control in the

Technical University of Sofia.

AIMS AND OBJECTIVES OF THE COURSE: To develop basic knowledge of computer aided

design and documentation of technical objects in the field of computer science

DESCRIPTION OF THE COURSE: The main topics concern: Design process – essence and

structure of design process; CAD systems, structure. Geometrical models – classification,

characteristics. Design of parts, documentation, mechanical junctions, basic technologies, shapes;

Creating part drawings in CAD; CAD systems for 3D modeling of technical objects. Basic

functions for 3D modeling of parts and assembly units; Electrical diagrams, classification,

application and requirements for their preparation; Basic functions of CAD for creating electrical

diagrams; Design and documentation of printed circuit unit in CAD.

PREREQUISITES: Basic knowledge on using computers is necessary.

TEACHING METHODS: Lectures delivered by using traditional educative and technical means,

laboratories using computers.

METHOD OF ASSESSMENT: A two hours assessment at the end of semester (total 70%), course work (30%).

INSTRUCTION LANGUAGE: English

BIBLIOGRAPHY: 1. Pahl G., W. Beitz. Engineering Design. A Systematic Approach, Springer-

Verlag Berlin, 2007, 2. G. Bertoline, E. Wiebe, Technical Graphics Communication, McGraw-Hill,

2009, 3. E. Finkelstein, AutoCAD 2013 and AutoCAD LT 2013 Bible, Wiley Publishing, 2012, 4.

M. Lombard, SolidWorks 2013 Bible, Wiley Publishing Inc., 2012, 5. CADSTAR Express Do-It-

Yourself Book With Projects For Educational Purpose, www.zuken.com

http://www.zuken.com/

3


Name of the course: Code: BCSCe06 Semester: I

Computing І

Type of teaching: Lessons per week: Number of credits:

Lectures and Laboratory Classes L – 2 hours, Labs – 2 hours 6

LECTURER: Assoc. Prof. Ph.D. Milena Lazarova (FCSC), tel.: 965 3285, email: [email protected]


COURSE STATUS IN THE CURRICULUM: Compulsory for the students of specialty “Computer Science and Engineering” of the Faculty of

Computer Systems and Control of TU- Sofia required for obtaining Bachelor’s Degree.

AIMS AND OBJECTIVES OF THE COURSE:

The aim of the course is to give the students basic terms of the computer’s structure and

functioning, to teach the students means of information representation, to give them knowledge

about the techniques of algorithm’s development and few basic algorithm’s classes as well as skills

for development of programs using Visual Basic programming language.

DESCRIPTION OF THE COURSE:

The course is providing basic knowledge in development of algorithms, their programming using

particular programming language and running and testing of the programmes under certain

operation system. The structure and the main operational principles of the computer systems are

given. The means and accuracy of information presentation are also considered. Some of the key

classes of algorithms and data structures are studied. Skills for using basic office applications are

gained as working with word processing application, creation of presentations, creation of diagrams

and flow-charts, using macros. The main techniques of the structural approach of programming and

their application using Visual Basic programming language are introduced.

PREREQUISITIES:

Mathematics

TEACHING METHODS:

Lectures using video-presentation with beamer, laboratory works under an assistant guidance for

practicing on particular problems.

METHODS OF ASSESSMENT:

Two tests at the middle and the end of the semester. The results of each test determine 40% of the

final value; 20% of the final grade is determined by the task performance during laboratory classes.


BIBLIOGRAPHY:

Course web site (http://cs.tu-sofia.bg/enmoodle/ course/ view.php?id=7); Gotchev G., M. Lazarova,

Computing I, Technical University of Sofia, 2008; J. Gammack, V. Hobbs, D. Pigott, The Book of

Informatics, Cengage Learning, 2011; Bryant R., Computer Systems: A Programmer's Perspective,

Addison-Wesley, 2010; Harel D., Y. Feldman, Algorithmics: The Spirit of Computing, Springer,

2012; Cormen T., C. Leiserson, R. Rivest , C. Stein, Introduction to Algorithms, MIT Press, 2009;

Sedgewick R., K. Wayne, Algorithms, Addison-Wesley, 2011; Null L., J. Lobur, Essentials of

Computer Organization and Architecture, Jones&Bartlett Learning, 2010; Hennessy J., D.

Patterson, Computer Architecture: A Quantitative Approach, Morgan Kaufmann, 2011; Sipser M.,

Introduction to the Theory of Computation, Cengage Learning, 2012.

http://cs.tu-sofia.bg/enmoodle/%20course/%20view.php?id=7

4


Name of the course

Higher Mathematics I

Code: BCSCe02 Semester: 1

Type of teaching:

Lectures and Seminar

exercises

Lessons per week:

L –3 hours

SE – 2 hours


LECTURER: Assoc. Prof. Dr. Snejanka D. Donevska, Faculty of Applied Mathematics and

Informatics, Technical University of Sofia;

Tel: 02965-2356, e-mail: [email protected]

COURSE STATUS IN THE CURRICULUM: Compulsory course in English for the students in

the Bachelor Degree Programme on Computer Science and Engineering of the Faculty of

Computer Systems and Control, Department of Computer Science

AIMS AND OBJECTIVES OF THE COURSE: To develop students’ competence and

confidence to handle mathematical methods relevant to engineering. The emphasis is on the

development of the student’s ability to use mathematics with understanding, to solve engineering

problems effectively and to help understanding Further Mathematics Courses and other Engineering

Subjects.

DESCRIPTION OF THE COURSE: To achieve the desired objectives the course covers

appropriate topics of Mathematics for undergraduate courses in all engineering disciplines:

Complex Numbers, Polynomials, Matrices and their Applications, Function of one Variable –

Limits, Continuity, Derivatives and Applications, Indefinite Integrals – Rules and Basic Integrating

Technics, Applications of Integral Calculus, Infinite Series with nonnegative terms, Alternating

Series, Absolute and Conditional Convergence.

PREREQUISITES: High School Mathematics, Mathematics Part I, Physics

TEACHING METHODS: Lectures and seminars: traditional mode; application of software

packages; digital projector

METHOD OF ASSESSMENT: One 2-hour midterm assessment and one 2-hour assessment at the

end of semester (total 30%); written examination at the end of semester (70%).


BIBLIOGRAPHY:

1. Donevska S., B. Donevsky, Calculus and Analytic Geometry, Math I, Part 1, TU, 2013.



4. Howard Anton, I. Bivens, St. Davis, Calculus, 10th Edition, 2012.

5. Tan S. T., Applied Calculus, 6th Edition, 2009.

6. Stewart J., Single Variable Calculus, Early Transcendental, 7th Edition, 2012.

7. O'Neil P. V., Advanced Engineering Mathematics, 7th Edition, 2012.

8. Hass J., M. D. Weir, G. B. Thomas, Jr., University Calculus, 2011.

5


Name of the course

Sports

Code: BCSCe08,

BCSCe17

Semester: – І, ІІ.

Type of teaching:

Seminars and workshops

Lessons per week:

SEM.: І, ІІ – 4 hours

Number of credits

0, 0.

TEACHERS: Senior Lecturer Ivan Petrov Venkov; Senior Lecturer Valeri Georgiev Peltekov,

Senior Lecturer Rumyana Nikolova Vetova, Senior Lecturer Ivan Stoyanov Ivanov; Senior Lecturer

Alexander Alexandrov Alexandrov; Senior Lecturer Asya Krasteva Tsarova - Vassileva; Senior

Lecturer Krassimira Stoyanova Ivanova; Senior Lecturer Todor Stefanov Ivanov, Senior Lecturer

Georgi Dimitrov Palazov, Senior Lecturer Rumyana Georgieva Tasheva, Senior Lecturer Mariana

Vladimirova Tomova, Senior Lecturer Plamen Antonov Antonov, Senior Lecturer Velizar Vaskov

Lozanov, Senior Lecturer Ivan Georgiev Ivanov; Senior Lecturer Georgi Petrov Vassilev, Senior

Lecturer Kapka Konstantinova Vassileva, Senior Lecturer Petya Yordanova Arbova; Senior

Lecturer Milena Milkova Lazarova; Senior Lecturer Valentine Valentinov Velev, Senior Lecturer

Dimitar Ivanov Dimov; Lecturer Maya Borisova Chipeva; Lecturer Yanita Dimitrova Raikova

Technical University - Sofia, DFVS, Section of Individual Sports and Games Sports and

Section of Water and mountain sports"

COURSE STATUS IN THE CURRICULUM: Compulsory discipline for the full-time students of

all specialties of TU- Sofia required for obtaining a Bachelor’s Degree.

AIMS AND OBJECTIVES OF THE COURSE: The purpose of teaching physical education is

through the methods and means of physical education to increase physical activity of students.

Additional sporting skills of the respective sport aim to create lasting habits for individual classes in

physical education. Talented athletes to protect their honor and prestige to TU-Sofia in sports

competitions.

DESCRIPTION OF THE COURSE: Students are trained with a flexible modular system, tailored

to their abilities and desire, the choice of sport. Programs allow to improve the skills of secondary

and primary education in selected sports. Students receive a thorough knowledge of the sport.

Sports Complex TU possible to conduct many types of sports. Along with sports practiced outside

the sports complex, students learn and improve in 17 different sports.

TEACHING METHODS: In structuring the curriculum using practical communicative approach

consistent with the functional and physical abilities of students. The modular principle enables

learning sporting skills in this sport.

METHOD OF ASSESSMENT: Carry out tests of physical ability. Tests for motor skills and

habits in different sports.

INSTRUCTION LANGUAGE: Bulgarian

BIBLIOGRAPHY: Methodological manuals and regulations in selected sports.

6


Name of the course:

Foreign Language (English for

Computing)

Code: BCSCe07 Semester: 1-3

Type of teaching:

Laboratory work

Lessons per week:

LW – 2 hours


LECTURER:

Senior Lecturer Yordanka Angelova (DFLAL), – tel.: 965 3162, email: [email protected]


COURSE STATUS IN THE CURRICULUM: Compulsory for students on the “Computer

Science and Engineering” study programme leading to a Bachelor‘s degree (Faculty of Computer

Systems and Control of TU-Sofia).

AIMS AND OBJECTIVES OF THE COURSE: Introduction and acquisition of language related

to basic topics in the field of computer science. Development of skills enabling students to use

scientific literature in that specific area and to participate successfully in the process of training.

DESCRIPTION OF THE COURSE: Introduction of the topics of: The Computer, Computer

Science, Modern Machine Architecture, Types of computers and their main parts. Reading for

general comprehension. Introduction and practice of basic terms and vocabulary related to the

topics. Introduction and practice of basic grammatical items and structures.

PREREQUISITES: Basic knowledge in general English (level A2 under the Common European Framework).

TEACHING METHODS: Practical work in laboratory classes. A textbook published for that specific course is used.

METHOD OF ASSESSMENT: Continuous assessment.

INSTRUCTION LANGUAGE: English. BIBLIOGRAPHY:

Dinos Demetriades - Workshop: Information Technology (Lower-Intermediate), OUP,

2003.

E.H.Glendinning, John McEwan - Oxford English for Information Technology

(Intermediate - Upper-Intermediate), OUP, 2002.

Lindsay White - Engineering Workshop, OUP, 2003.

Santiago Remecha Esteras – Infotech, CUP, 2004.

N. Brieger, A. Pohl - Technical English Vocabulary & Grammar, Summertown, 2002.

K. Boeckener, P.Ch.Brown - Oxford English for Computing, OUP, 2000.

Y.Angelova – English for Computer Science, Publishing House -Technical University –

Sofia, 2010

I. Stoyneshka, D. Mihailova - English for Computing, Alma Mater International, Gabrovo,

2001

R. Murphy - Essential Grammar in Use: Supplementary Exercises, CUP, 2002.

H. Naylor, R. Murphy - English Grammar in Use: Supplementary Exercises, CUP, 2002.

J. Thomson, A. V. Martinet - Practical English Grammar Exercises 2 & 2, OUP, 2000.


7


Name of the course

Computing II


Type of teaching:


Course work

Lessons per week:

L – 2 hours; LW – 1 hours


LECTURER:

Assoc. Prof. Ph.D. D. Gotseva (FKSU) – tel.: 965 23383, email: [email protected]


COURSE STATUS IN THE CURRICULUM: Compulsory for the students’ specialty “Computer

Science and Engineering” of the Faculty of Computer Systems and Control of Technical University

of Sofia – bachelor degree.

AIMS AND OBJECTIVES OF THE COURSE: The aim of the discipline is to introduce the

students with fundamentals of computing into MS Excel, to acquire competitions for macro and

algorithm creation of the products tasks, and to have possibilities to create sample Visual Basic for

Application (VBA).

DESCRIPTION OF THE COURSE: The main topics concern: Excel basics; Creating, Recording

and Playing macros; Introduction into VBA programming; VBA Integrated Development

Environment (IDE); Execution of Excel Applications; VBA Programming Language; Common

properties with Microsoft Visual Basic; Data types, Variables, and Constants; Arrays; Scope and

Lifetime of the Variables; Functions and Subroutines; Built-in functions and statements; Passing

Arguments to Procedures and Functions; Control Statemens; Run-time error maintance; Using Name

Property; Excel Object Model; Creating Application into Excel; Excel Events; Menus and Toolbars;

Built-in Dialogs and User-defined Dialogs; VBA Access to the Excel Object Model; Basic Objects,

Methods, Properties, and Events; Application, Workbook, Worksheet, Range, Pivot table, Chart

Objects Summary; Creating Sample Applications with Excel Object; Data Lists and Tables; Sorting

and Filtering Data; etc.

PREREQUISITES: Computing I

TEACHING METHODS: Lectures, using slides, case studies, laboratory and course work, work in

teams, and course work description preparation and defence.

METHOD OF ASSESSMENT: One 1.5-hour assessment at end of semester (60%), laboratories

(20%), course work - one off assignment (20%)


BIBLIOGRAPHY: 1. http://dgotseva.com – course materials. 2. John Walkenbach, Excel 2007

Power Programming with VBA, John Wiley & Sons, 2011. 3. Excel 2010: VBA Programming,

Axzo Press, 2011. 4. Excel 2010: Advanced, Axzo Press, 2011. 5. Julitta orol, icrosoft E cel

rogramming by E ample: ith B , , and S , ercury earning and nformation,

. . Bill elen, Tracy Syrstad, VBA and Macros: Microsoft Excel 2010, Pearson Que, 2010. 7.

http://www.excel-vba.com/. 8. http://excelvbatutor.com/vba_tutorial.html. 9.

http://www.functionx.com/vbaexcel/,


http://dgotseva.com/

http://www.excel-vba.com/

http://excelvbatutor.com/vba_tutorial.html

http://www.functionx.com/vbaexcel/

8


Name of the course

DIGITAL AND

MICROPROCESSOR

DEVICES

Code:

BCSCе13

Semester:

II

Type of teaching:


Lessons per week:

L–30 hours; LW–15 hours

Number of credits:

4

LECTURER: Assoc. Prof. Asen Todorov, Ph.D. (Faculty of Computer Systems and Control),

tel.: 9 5 4, е-mail: [email protected] , Technical University of Sofia, Bulgaria

COURSE STATUS IN THE CURRICULUM: Compulsory course for the students of specialty

Computer Science and Engineering in the bachelor program of the Faculty of Computer Systems

and Control.

AIMS AND OBJECTIVES OF THE COURSE: This course is for students to learn and be able

to apply the approaches, methods and technical tools for design, analysis and application of digital

and microcomputer systems in accordance with their needs and interests to acquire new knowledge

and skills in this subject area. At the end of the course students will know the elements of digital

and microprocessors and defines the basic concepts, variables, parameters and relationships in the

theory of digital electronics and microcomputer technology and will be able to use them in the

design of microcomputer systems management processes, facilities and systems.

DESCRIPTION OF THE COURSE: The course examines: types of digital information

conversion codes, basic arithmetic, basic logic functions, minimization methods, decoders,

multiplexers, triggers, types, registers, counters, semiconductor memory, the structure of single chip

microcomputers (microcontrollers) - organization of memory programming model, the types of

interfaces - parallel and serial.

PREREQUISITES: The successful completion of this course is based on the knowledge and

practical skills, obtained in some previous courses as: Theoretical electrotechnics and Electronics.

TEACHING METHODS: Lectures, using slides, case studies, laboratory and course work, work

in teams and course work description preparation. Students have at their disposal these lecture notes

well in advance, so they are able to prepare themselves for further fruitful discussions. Various

supported materials are also available at: http://cs-tusofia.eu/ incl. labs preparation instructions,

keywords, references, etc

METHOD OF ASSESSMENT: Achieving the goal of teaching the course is monitored by

continuous assessment, compiled from two components: student participation in laboratory

exercises (with a weight of 0.2) and exam at the end of the semester (with a weight of 0.8 ). Exam during the exam session with duration of two academic hours (90 min), students give written

answers to set of 7 questions. Each correct answer gives ,5 or point (n). ark “e cellent” ( ) is

awarded when n ≥ 5,5; “very well” (5) - when n ≥ 4,5; “well” (4) – in case of n ≥ 3,5, “satisfactory”

(3) - when n=3. The final mark is arranged as a result from the written e am’s results (8 %) and

this of the laboratory exercises (20%).


BIBLIOGRAPHY: 1. Lecture notes.

2. Sajjan G. Shiva, Computer Design and Architecture, Third edition, 2000

3. Clemens A., The Principles Computer Hardware, Oxford University Press, 1994.

4. Sharma K., Advanced Semiconductor Memories, Willey Inter-Science, 2003.

5. Hans Peter Messmer, Pentium Klassische Konzepte, Addision-Wesley, 2004.

6. A. Saha, N. Manna, Digital principles and logic design, 2007

7. Tim Wilmshurst, Designing Embedded Systems with PIC Microcontrollers, 2007

http://cs-tusofia.eu/

9


Name of the course

Discrete Structures


Type of teaching:

Lectures and labс

Lessons per week:

L – 2 hours; Lаbs – 2 hours


LECTURER:

Full Prof. Dr. Valeri Mladenov (FA), tel./fax. +359 2 965 2386, e-mail: [email protected]


COURSE STATUS IN THE CURRICULUM: Elective for the students’ specialty Computer

Systems and Technologies, BEng program of the Department of Computer Science.

AIMS AND OBJECTIVES OF THE COURSE: To introduce students to the basic concepts of

some essential areas which are important for the computer science and to acquire some skills for

application of some methods and effective algorithms for solving different computer science and

and combinatorial problems. At the end of the course the students will acquire the basic discrete

structures that are used for mathematical modeling in the different areas of the applied mathematics

and computer science: formal logic and logic functions, sets, operations on sets and relations on

finite sets and presentation as structured data, graphs, trees and relations between graphs, binary

relations and Boolean matrixes, algorithms and complexity of the algorithms; combinatorics; finite

automata.

DESCRIPTION OF THE COURSE: The main topics concern: formal logic and logical

operations and functions; predicate and predicate functions; set theory; mathematical reasoning,

relations and their representation as data structures, functions, Boolean algebra and Boolean

functions, graphs and trees, combinatorics, mathematical induction and testing the program

correctness by use of the mathematical induction, recursion and recursive functions and algorithms,

finite automata.

PREREQUISITES: Mathematics I and II and Programming I and II.

TEACHING METHODS: Lectures present on a black board and by digital projector. Labs take

part solving problems analytically and by computer simulations.

METHOD OF ASSESSMENT: Final rate based on the points from 2 tests (2*10 pt.) during the

semester + the exam (40 pt.). Final result is: sum of points by test 1, test 2 and exam weighted by

coefficient 0,1.


BIBLIOGRAPHY: 1. Kenneth H. Rosen, Discrete Mathematics and its Applications, McGraw-Hill, 7th Edition 2012,

ISBN 0–07–338309–0, 1071 pp.; 2. Filipova-Petrakieva, S., V. Mladenov, Problems with solutions

on discrete structures, Publishing house “Avangard Prima”, Sofia, First edition 2012, ISBN: 978-

954-323-947-4, 84 pр. 3. R. A. Brualdi, Introductory Combinatorics, 5th ed., Prentice-Hall,

Englewood Cliffs, NJ, 2009. 4. G. Chartrand, L. Lesniak, and P. Zhang, Graphs and Digraphs, 5th

ed., Chapman and Hall/CRC, Boca Raton, 2010. 5. T. H. Cormen, C. E. Leierson, R. L. Rivest, and

C. Stein, Introduction to Algorithms, 3rd ed., MIT Press, Cambridge, MA, 2009. 6. D. A.

Gunderson, Handbook of Mathematical Induction, Chapman and Hall/CRC, Boca Raton, Florida,

2010. 7. H. F. Mattson, Jr., Discrete Mathematics with Applications, Wiley, NewYork, 1993.


10


Name of the course:

Theory of Electrical Engineering

Code: FBE20 Semester: 3

Type of teaching:

Lectures, tutorials and laboratory work

Lessons per week:

L-3 hours, Tut-1 hour,

LW-1 hour

Number of

credits:6

LECTURER: Full Prof. PhD. Valeri Mladenov (FA), phone: 9652386, еmail: [email protected]

Assoc. Prof. Ph.D. Simona Petrakieva (FA), phone:9652388, еmail: [email protected]


COURSE STATUS IN THE CURRICULUM: The course is compulsory for full-time and part-

time students for receiving the B.Sc. degree in Electronics, Telecommunications and Computer

Systems and Technology in FETT, FTK, FKSU at the Technical University of Sofia.

AIMS OF THE COURSE: To teach students the basic methods of analysis of linear circuits with

lumped parameters and to give basic concepts of the theory of nonlinear circuits and the theory of

electromagnetic field.

DESCRIPTION OF THE COURSE: The course includes basic concepts and laws for electric

circuits, sinusoidal steady-state analysis of linear circuits, transformations of electric circuits,

magnetically coupled circuits, methods for analysis of linear circuits, properties and theorems for

electric circuits, resonance, three-phase circuits, two-port networks, the classical method of

studying transients in linear circuits, basics notions of the theory of nonlinear circuits and the theory

of electromagnetic field.

PREREQUISITES: Mathematics I, II and III and General Physics I and II.

TEACHING METHODS:

Lectures, group seminars, laboratory practice with laboratory sets and appropriate measuring

instruments. Written laboratory practice reports are required from students that are checked by the

teacher. A course project with PSpice is included also. Each student has to prepare a course project

assignment using a PC in the PSpice environment.

METHOD OF ASSESSMENT: А written e amination at the and of the third semester. Test paper including two problems during

the tutorials. Defending the course project assignment and laboratory practice reports. The final

result is obtained by aggregation of the marks from the written examination, test paper, laboratory

practice reports and course project assignment.


BIBLIOGRAPHY: 1. Brandisky K., J.Georgiev, V.Mladenov and R.Stancheva, Textbook on

Theoretical Electrical Engineering, part I. KING, Sofia.2004, ISBN 954-9518-28-0 (in Bulgarian);

2. Brandisky K.,J.Georgiev, V.Mladenov and R.Stancheva, Textbook on Theoretical Electrical

Engineering, part II, KING, Sofia, 2005, ISBN 954-9518-29-9 (in Bulgarian); 3. Brandisky K. and

others, Seminar’s Handbook of Theoretical Electrical Engineering, part , NG, Sofia. 4, SBN

954-9518-26-4 (in Bulgarian); 4. Brandisky K.and others, Seminar’s Handbook of Theoretical

Electrical Engineering, part II, KING, Sofia.2004, ISBN 954-9518-27-2 (in Bulgarian); 5.

Brandisky K. and others, Laboratory Handbook of Theoretical Electrical Engineering, KING, Sofia

2007, 2010, ISBN 954-9518-24-8 (in Bulgarian); 6. Brandisky K., V. Mladenov, K. Stanchev,

Handbook for solving problems in Theoretical Electrical Engineering using PSpice (OrCAD 16.3),

KING, Sofia 2012, ISBN 978-954-9518-72-6.

11


Name of the course

Semiconductor Elements


Type of teaching:


Lessons per week:



LECTURER:

Prof. Ph.D. Tania Vasileva (FETT) – tel.: 965 2490, email: tkv@ tu-sofia.bg



Telecommunication engineering in the bachelor program of the Faculty of Telecommunication.

AIMS AND OBJECTIVES OF THE COURSE: The course aims to familiarise students with the

basic building elements of electronic circuits. At the end of the course the students are expected to

have basic knowledge and to be able to apply the basic semiconductors elements, to know their

characteristics, mode of operation, important parameters, and to choose appropriate device for given

application using datasheets.

DESCRIPTION OF THE COURSE: The main topics concern: Introduction to Semiconductors,

PN Junction Diodes, Zener Diodes, Bipolar Junction Transistors, Metal Oxide Semiconductor Field

Effect Transistors, Optoelectronic Devices, Introduction to Integrated Circuit, Displays

PREREQUISITES: Physics, Mathematics

TEACHING METHODS: Lectures, using video-presentation with beamer, interactive multimedia

learning materials, laboratory work with practical measurements, finished with protocols and

defence.

METHOD OF ASSESSMENT: Exam during the exam session. Final mark is calculated based on the written exam (70%), laboratory work (30%), lecture attendance (10%).


BIBLIOGRAPHY:

1. Interactive multimedia e-trainers: http://lark.tu-sofia.bg/sd/e-learning.html

1. Electrical Engineering; 2. Semiconductors; 3. PNJunction Diodes; 4. Zener Diodes; 5. Bipolar Junction

Transistors; 6. Bipolar Transistor Amplifiers; 7. MOS Transistors; 8. Integrated Circuits; 9. Displays

2. Lecture slides http://lark.tu-sofia.bg/sd/lectures

3. Electronics Fundamentals: Circuits, Devices and Applications (8th Edition) (Floyd Electronics

Fundamentals Series) by Thomas L. Floyd, David M. Buchla (Hardcover – June 23, 2009) Prentice

Hall, ISBN-10: 0135072956

http://www.amazon.com/Electronics-Fundamentals-Circuits-Devices-Applications/dp/0135072956


http://lark.tu-sofia.bg/sd/e-learning.html

http://www.amazon.com/Electronics-Fundamentals-Circuits-Devices-Applications/dp/013219709X/ref=sr_1_1?ie=UTF8&s=books&qid=1238676481&sr=1-1

http://www.amazon.com/Electronics-Fundamentals-Circuits-Devices-Applications/dp/013219709X/ref=sr_1_1?ie=UTF8&s=books&qid=1238676481&sr=1-1

http://www.amazon.com/Electronics-Fundamentals-Circuits-Devices-Applications/dp/0135072956

12


Name of the course

Higher Mathematics II


Type of teaching:

Lectures and Seminar

exercises

Lessons per week:

L –3 hours

SE – 2 hours


LECTURER: Assoc.Prof. Dr. Elena Varbanova, Faculty of Applied Mathematics and Informatics,

Technical University of Sofia; Tel: 965-3373, e-mail: [email protected]

COURSE STATUS IN THE CURRICULUM: Compulsory course in English for the students in

the Bachelor Degree Programme on Computer Science and Engineering of the Faculty of

Computer Systems and Control, Department of Computer Science

AIMS AND OBJECTIVES OF THE COURSE: To develop students’ competence and

confidence to handle mathematical methods relevant to engineering. The emphasis is on the

development of the student’s ability to use mathematics with understanding, to solve engineering

problems effectively.

DESCRIPTION OF THE COURSE: To achieve the desired objectives the course covers

appropriate topics of Mathematics for undergraduate courses in all engineering disciplines:

Indefinite and Definite integrals; Power series; Fourier Series; Introduction to Ordinary differential

equations; Multivariable calculus: partial differentiation, optimization problems, double integrals

and applications.

PREREQUISITES: High School Mathematics, Mathematics Part I, Physics

TEACHING METHODS: Lectures and seminars: traditional mode; application of software

packages; digital projector

METHOD OF ASSESSMENT: One 2-hour midterm assessment and one 2-hour assessment at the

end of semester (total 30%); written examination at the end of semester (70%).


BIBLIOGRAPHY:

Key text

1. Croft A., R. Davison, Mathematics for Engineers: A Modern Interactive Approach with

MyMathLab, 3rd

Ed., Prentice Hall, 2010

2. Donevska A., B. Donevski, Calculus and Analytic Geometry, TU-Sofia, 2007

3. Stoynov Y., E.Varbanova, Higher Mathematics for Engineering Students - Part 2, TU-

Sofia, 2013.

4. Stroud K. A., D. J. Booth, Engineering Mathematics, 7th

Ed., Industrial Press, Inc., 2013.

Supplementary

1. Kreyszig E., Advanced Engineering Mathematics, 10th Ed., Wiley, 2011

2. James G., D. Burley, D. Clemen, Advanced Modern Engineering Mathematics, 4th

Ed.,

Prentice Hall, 2011.

3. http://www.mathcentre.ac.uk/resources/uploaded/46836-tutoring-in-msc-web.pdf

4. http://www.math.com/school/glossary/glossindex.html

http://www.mathcentre.ac.uk/resources/uploaded/46836-tutoring-in-msc-web.pdf

http://www.math.com/school/glossary/glossindex.html

13


Name of the course

Fundamentals of logical design

Code:

BCSCe21

Semester:

III

Type of teaching:

Lectures, tutorial and

laboratory work

Lessons per week:

L – 15 hours; TW – 15

hours, LW – 15 hours.

Number of credits:

5

LECTURER:

Diana Grigorova (FCSC) – tel.: 965 3523 e-mail: [email protected]



Computer Science and Engineering in the bachelor programme of the Faculty of Computer Systems

and Control.

AIMS AND OBJECTIVES OF THE COURSE: The aim of the course is to give fundamental

knowledge for analysis and synthesis of computer components.

DESCRIPTION OF THE COURSE: The course is an introductory course in computer logic and

digital system design. The main topics concern: Boolean algebra, fundamentals of combinational

logic circuits, fundamentals of sequential synchronous and asynchronous circuits. The material is

illustrated with examples of basically computer components analysis and synthesis

PREREQUISITES: Discrete mathematics.

TEACHING METHODS: Lectures using video-presentation with beamer. Tutorial works on

given problems. Laboratory works with a program simulator.

METHOD OF ASSESSMENT: Exam during the exam session with duration two academic hours,

students give written answers to four tasks. Final mark is calculated based on the written exam

(70%), tutorial work (20%) and laboratory work (10%).


BIBLIOGRAPHY: ...

1. Fundamentals of Logic Design, Charles H. Roth, Jr., 5th edition, 2006 Cengage Learning, ISBN-

13: 978-0-495-07308-6

2. Digital Design and Computer Architecture, David Harris and Sarah Harris, 2nd

Edition, 2012

Elsevier, ISBN 978-0-12-394424-5

3. Hardware and Computer Organization, Berger, A. S., Elsevier, 2005, ISBN 0-7506-7886-0

http://www.ee.surrey.ac.uk/Projects/Labview/index.html

http://www.asic-world.com/digital/tutorial.html


http://www.ee.surrey.ac.uk/Projects/Labview/index.html

http://www.asic-world.com/digital/tutorial.html

14


Name of the course

Databases


Type of teaching:


Lessons per week:



LECTURER:






AIMS AND OBJECTIVES OF THE COURSE: The aim of this course is to provide the basis for

a solid education in the fundamentals of database technology and to show the way in which this

field is currently developing and is likely to develop in the future.

DESCRIPTION OF THE COURSE: The main topics concern: Introduction into Databases (DB),

Basic terms and concepts, DB architecture, Users and DB administrators, External view, conceptual

view and internal view of DB, Mapping, Database Management System (DBMS), Data redundancy,

Data integrity, Data analysis and it’s life cycle, Entity-Relationship (ER) modeling, Entities,

Attributes, Primary and foreign keys, Candidate keys, Relationships and their characteristics, ER

diagram creating, Problems with ER models, Enhanced ER models (EER), ER/DB relations

mapping, DB normalization, Normal forms: 1NF, 2NF, 3NF, BCNF, 4NF, and 5NF, DB models,

SQL basics, CREATE statements, SELECT statement, Joining tables in SELECT statement,

Aliases, Subquiries, UNION, MINUS, and INTERSECT clauses, Views, Working with views,

INSERT, UPDATE, and DELETE statements, Transactions, Concurrency and transactions,

Transaction schedules, „ ost updates” scenario, Uncommited dependency, „ nconsistency”

scenario, Serialization, Concurrency, Locking mechanism, Deadlock, Two-phase locking, Security,

DBMS level protection, GRANT statement, etc.

PREREQUISITES: Computing I, Computing II, Programming Languages


in teams.

METHOD OF ASSESSMENT: Written exam (80%), laboratory works (20%).


BIBLIOGRAPHY: 1. http://dgotseva.com – материалите на курса. 2. Elmasri and Navathe,

Fundamentals of Database Systems, Addison Wesley, 2010. 3. Abraham Silberschatz, Henry Korth,

S. Sudarshan, Database System Concepts, McGraw-Hill Science/Engineering/Math, 2010. 4. Nenad

Jukic, Susan Vrbsky, Svetlozar Nestorov, Database Systems: Introduction to Databases and Data

Warehouses, Prentice Hall, 2013. 5. Database Design. Know it all, Elsevier, 2009. 6. Pro SQL

Server 2008. Relational Database, Design, and Implementation, Après, 2009. 7. Dyer, R. MySQL in

a Nutshell, O’Reilly, 8. 8. arry Rockoff, Data nalysis with icrosoft ccess : From

Simple Queries to Business Intelligence, Cengage Learning PTR, 2011.



15


Name of the course:

Information Security


Type of teaching:


Lessons per week:

L – 2 hours, LW – 1 hours


LECTURER:

Assos. Prof., PhD Roumen Trifonov (FCSC), tel.: 965 2838, e-mail: [email protected]


COURSE STATUS IN THE CURRICULUM: Obligatory subject for the students of specialty


and Control at TU-Sofia.

AIMS AND OBJECTIVES OF THE COURSE: The aim of the course is to acquaint students

with the basic principles, standards and technics in the field of technologies for computer security.

This will help them in future to professionally solve tasks for choice of effective tools for

protection of computer systems and networks and use in practice.

DESCRIPTION OF THE COURSE: The course discusses the problems concerning design,

building and applying methods and technical tools ensuring computer security. The lectures begin

with introduction to basic definitions and key futures in the field. It presents the most important

politics, approaches, standards and attacks in network and information security, also the proper

technics for protection of network, firewall, protected e-messages interchange, DNS,

DDoS/Botnets and Web-application protection. The laboratory work helps to better rationalization

of lecture material and contribute to formation of practical skills.

PREREQUISITES: Basic knowledge in informatics.

TEACHING METHODS: Lectures (with slides, multimedia projector) and additional text

materials; laboratory work (based on instructions) with computer.

METHOD OF ASSESSMENT: written examination at the end of the first semester.

INSTRUCTION LANGUAGE: English.

BIBLIOGRAPHY: 1. International standards publications ISO, ITU, ETSI, etc.. -

http://www.itu.int/ITU-T/index.html 2. ENISA information - http://www.enisa.europa.eu/ 3.

Special publications of NIST - http://csrc.nist.gov/ 4. O. Nakov, R. Trifonov, others, Computer

Security, Avangard Prima 2012


http://www.itu.int/ITU-T/index.html

http://www.enisa.europa.eu/

http://csrc.nist.gov/

16


Name of the course:

Operating Systems

Code: BCSCe22

Semester: 3

Type of teaching:

Lectures and Laboratory exercises

Hours per week:

L – 2 hours; LE – 2 hours


LECTURER:

Assoc. Prof. Dr. George Ilinchev Popov

Technical University of Sofia, Computer Systems Department, tel. 9652112, [email protected]

COURSE STATUS IN THE CURRICULUM: Compulsory for the students speciality „Computer

Science and Engineering“ – bachelor degree (Faculty of Computer Systems and Control, Technical

University-Sofia).

AIMS AND OBJECTIVES OF THE COURSE: The aim of the course is to ensure that the

students understand the extent of the use of an operating system prior to a detailed study of

internals. The topics of the course address both the use of operating systems and their design and

implementation. A lot of the principles involved in operating systems use have wider applicability

across the field of computer science, such as concurrent programming. Studying internal design has

relevance in such diverse areas as dependable programming, algorithm design and implementation,

building secure and safe systems, etc.

DESCRIPTION OF THE COURSE: The discipline gives the fundamental concepts that are

applicable to a variety of the operating systems. The emphasis is on solving problems encountered

in designing the operating systems, regardless of the underlying hardware. The main topics are:

overview of operating systems, operating systems principles, processes and concurrency, CPU

scheduling and dispatching, file systems, memory management, device management, distributed

systems, security and protection. UNIX, Linux, Windows, and others modern systems are included

as examples of existing systems.

PREREQUISITES: Basic knowledge in structure and functionality of computer devices and

system, programming languages (C/C++, Pascal), software engineering.

TEACHING METHODS: Lectures (with slides, multimedia projector) and text materials;

laboratory exercises (based on instructions) with a tutorial for every laboratory theme; project

consulting; web site of the course.

METHOD OF ASSESSMENT: Written examination, based on two assessments during the

semester (80%) and classes (20%).Every student has to demonstrate his own project. He is asked

about problems encountered in the designing and implementation, and his decision.


BIBLIOGRAPHY 1. Silberschatz A., Galvin P. and Gagne G.,. Operating Systems Concepts, Ninth Edition,

John Wiley & Sons, Inc. , 2012.

2. Tannenbaum, A. and A. S. Woodhul. Operating Systems Design and Implementation,

3ed, Prentice Hall Professional Technical Reference, 2006.

3. Stallings, W., Operating Systems – Internals and Design Principles. Prentice Hall, 2007.

17


Name of the course

Programming languages


Type of teaching:


Course work

Lessons per week:



LECTURER:






AIMS AND OBJECTIVES OF THE COURSE: The aim of the course is to teach the students

with the algorithmic and assembler programming languages regardless of their environment. The

accent of the course is upon the syntax and semantics of the language constructs. Different

approaches are presented for achieving a given aim and the advantages and the disadvantages of the

concrete implementations.

DESCRIPTION OF THE COURSE: The main topics concern: The alphabet – basic and extend,

Identifiers, Constants-literal and named, different type of constant present – numeric, character,

string, logic, Comments, Directives, Data classifications, Definition and declaration, Storage

specifiers, Declarator – different kinds, complex declarator – reading rules, abstract declarator –

typed names, specific modifiers, Integers, real, characters, enumerated data – type specifiers, value

range, inner presenting, Arrays – arrange arrays into memory, pointers, relationship between arrays

and pointers. Structures and unions, E pressions in С – operands, rules of precedence, execution of

the operators, side effects, data conversion (usual arithmetic conversion and assignment

conversion), Statements in C, Structure and execution of C program, Multiple files structure,

Calling functions, Parameters of main function, etc.

PREREQUISITES: Computing I, Computing II, basic knowledge of algorithms


in teams, and course work description preparation and defense.

METHOD OF ASSESSMENT: One 1.5-hour assessment at end of semester (60%), laboratories

(20%), course work (00%)


BIBLIOGRAPHY:

1. http://dgotseva.com – course materials.

2. erningan, B., D. Ritchi. The С rogramming anguage, rentice_hall, 7.

3. http://www.cprogramming.com/.

4. http://cprogramminglanguage.net/.

5. http://www.cs.cf.ac.uk/Dave/C/CE.html.



http://www.cprogramming.com/

http://cprogramminglanguage.net/

http://www.cs.cf.ac.uk/Dave/C/CE.html

18


Name of the course

Computer Architectures

Code:

BCSCe20

Semester:

3

Type of teaching:


Lessons per week:


Number of credits:

4

LECTURER:

Prof. Ph.D. Plamenka Borovska, Phone.: 965 25 24, e-mail: [email protected],


COURSE STATUS IN THE CURRICULUM: Compulsory for Bachelor degree students of the

specialty “Computer Science and Engineering” of the Faculty of Computer Systems and Control at

the Technical University of Sofia

AIMS AND OBJECTIVES OF THE COURSE: The goal of the course is to provide a solid

background for students: to learn the concepts and mechanisms relating to the design of modern

computer systems and be able to explain how these concepts and mechanisms interact; to acquire

knowledge about the architecture of computer systems; to apply this knowledge to solve new

problems of computer design.

DESCRIPTION OF THE COURSE: The acquired knowledge and skills in this course could be

applied in traditional engineering and specialized, high-tech field of computer and information

technology for modern computer systems and multi-core platforms.

Upon completion of the course students will:

• know the concepts, principles, models and technologies for design and implementation of

effective computer architectures;

• To understand and apply the theory in analysis and design of computer architectures in terms of

finding the right balance between increasing demands for increasing performance on the one hand

and the existing technological limitations on the other.

• be able to do a comparative analysis and assess the advantages and disadvantages between

alternative solutions

PREREQUISITES: Knowledge of Programming, Operating Systems, Digital and microprocessor

technology.

TEACHING METHODS: Lectures using video - presentation with beamer , laboratory works

aimed at study, implementation and analyses of sample problems and case studies; course work

aimed at implementation and analyses of solving certain problem by given Grid and Cloud

Architecture.


students give written answers to 3 compulsory and 5 optional questions, problems or tasks (60%),

laboratory works (25%), course work (15%).


BIBLIOGRAPHY: 1. P. Borovska, Lectures and laboratory exercises http://cs.tu-sofia.bg > Computer Architectures

http://cs.tu-sofia.bg/enmoodle;

2. J. L. Hennessy and D. A. Patterson, Computer Architecture: A Quantitative Approach,(5th

edition), 2012;

3. W. Stallings, Computer Organization and Architecture (9th Edition), 2012;

4. WWW Computer Architecture Page: http://arch-www.cs.wisc.edu/home

5. TPC: www.tpc.org

6. SPEC: www.spec.org


19


Name of the course:

Computer Networks

Code:

BCSCе30

Semester:

IV

Type of teaching:


Lessons per week:


Number of credits:

5

LECTURERS:

Associate Prof., PhD Georgi Naydenov (FCSC)

tel.: 965 21 94, e-mail: [email protected]


Associate Prof., PhD Petko Stoyanov (FCSC)

тел. 9 5 94, e-mail: [email protected]


COURSE STATUS IN THE CURRICULUM: Compulsory course in English for the students of

specialty “Computer Science and Engineering” in the bachelor programme of the Faculty of

Computer Systems and Control.


with the basic principles, standards and tendencies of development in the field of computer

networks. This will help them in future to professionally solve system tasks in the area of network

communications.

DESCRIPTION OF THE COURSE: The course discusses the problems concerning design,

building and application of computer networks. The lectures begin with introduction to computer

networks, principles of building, historical development and their contemporary classification.

Open system interconnection model of ISO is presented. Teaching course includes basic principles

of building and functioning of Local Area Networks (LAN) illustrated by practical technical

solutions in LAN Ethernet. The lectures on the most popular in the world computer network

Internet present its basic characteristics, principles of functioning and application. The laboratory

work helps to better rationalization of lecture material and contribute to formation of practical

skills.

PREREQUISITES: Basic knowledge in informatics.

TEACHING METHODS: Lectures with slides, multimedia projector and additional text

materials; laboratory work based on instructions with a tutorial for every laboratory theme.

METHOD OF ASSESSMENT: Final mark is based on a written examination during the exam

session with duration two academic hours in the end of the fourth semester. Students must answer

40 questions concerning the lectures and the laboratory works.


BIBLIOGRAPHY:

Tanenbaum A., Computer Networks, Prentice Hall PTR, 4th edition

Douglas C., Computer Networks and Internets, Prentice Hall PTR, 5th edition

Peterson L., Davie B., Computer Networks, ELSEVIER, 4th edition

Scott Phil, Computer Networks Lectures, http://ironbark.bendigo.latrobe.edu.au/



http://ironbark.bendigo.latrobe.edu.au/

20


Name of the course:

Development of Linux-based

Software

Code:

BCSCe28

Semester: 4

Type of teaching:

Lectures and Laboratory exercises

Hours per week:

L – 2 hours; LE – 2 hours


LECTURER:

Assoc. Prof. Dr. Daniela Gotseva, tel. 965 23 38; [email protected]

Technical University of Sofia, Computer Systems Department




AIMS AND OBJECTIVES OF THE COURSE: The course aims to give students basic

knowledge and skills to apply the approaches, methods and tools for programming in real time as

teach the basics of construction and realization of basic mechanisms in programming with a low

level in UNIX like systems, the characteristics of the establishment of processes and threads in the

language C.

DESCRIPTION OF THE COURSE: The main topics concern: file system - tips, organization,

attributes, security, input / output system - flows. Programming in C / C + +; Processes, threads,

synchronization; Interaction between processes - messages, semaphores, shared memory, network

programming concepts. Client-server programs communication organisation. Network

programming in C. Special attention take for UNIX/Linux OS: basic shell commands, shell

programming, utility programming.

PREREQUISITES: Basic knowledge in structure and functionality of computer devices and

system, programming language C/C++, software engineering.

TEACHING METHODS: Lectures (using slides, multimedia projector) and text materials.

METHOD OF ASSESSMENT: One assessment at the end of the semester (80%) and exercises

(20%).


BIBLIOGRAPHY: 1. http://dgotseva.com – course materials. 2. Robert Love, Linux System

rogramming: Talking Directly to the ernel and C ibrary, O’Reilly, 3. 3. Robert ove, inu

Kernel Development, Addison-Wesley Professional, 2010. 4. Michael Kerrisk, The Linux

Programming Interface: A Linux and UNIX System Programming Handbook, No Starch Press,

2010. 5. W. Richard Stevens, Stephen A. Rago, Advanced Programming in the UNIX Environment,

Addison-Wesley Professional, 2013. 6. Christopher Hallinan, Embedded Linux Primer: A Practical

Real-World Approach, Prentice Hall, 2010.



21


Name of the course

Object-Oriented

Programming


Type of teaching:

Lectures and laboratory work,

Course work

Lessons per week:



LECTURER:

Prof. Ph.D. Ognian Nakov (FCSC) – tel.: 965 25 36, email: [email protected]

COURSE STATUS IN THE CURRICULUM: Compulsory for the students in Computer science

and engineering in bachelor programme of the Department of Computer Systems.

AIMS AND OBJECTIVES OF THE COURSE: At the end of the course the students are

expected to be able to understand object-oriented programming and design technology and practical

skills – how to use class libraries, how to define a class of objects using concrete object-oriented

programming language.

DESCRIPTION OF THE COURSE: The course objectives is to acquaint students with the object-

oriented conception, basic ideas and their realization in different object-oriented programming

languages; to teach object-oriented analysis and design; to give object-oriented programming

training, using class libraries for an individual design which consists of number of classes.

PREREQUISITES: Some programming languages and program algorithms.

TEACHING METHODS: Lectures, using slides, case studies, laboratory and course work, work in

teams and course work description preparation and defence.

METHOD OF ASSESSMENT: Two аssessments, laboratories, course work


BIBLIOGRAPHY:

1. Stroustrup, B. The C++ Programming Language, 4th Edition. Addison-Wesley Professional,

2013.

2. Prata, S. C++ Primer Plus (6th Edition), Addison-Wesley Professional, 2011.

3. Stroustrup, B. Programming: Principles and Practice Using C++ (2nd Edition). Addison-

Wesley Professional, 2014.

4. Meyers, S. Effective C++: 55 Specific Ways to Improve Your Programs and Designs (3rd

Edition), Addison-Wesley Professional, 2005.

5. Malik D. S. C++ Programming: From Problem Analysis to Program Design. Cengage

Learning; 6 edition, 2012.

6. Deitel P., H. Deitel. C++ How to Program (Early Objects Version) (9th Edition), Prentice

Hall; 9 edition, 2013.

7. http://www.cplusplus.com/doc/tutorial/


http://www.cplusplus.com/doc/tutorial/

22


Name of the course: Programmable Logic Systems

Code: BCSCe31

Semester: IV

Type of teaching:


Lessons per week:

L-2h, LW- 2h.


LECTURER: Assoc. Prof. Ph.D. Peter Manoilov,

Phone : 965 -2484, Email : [email protected]

Technical University of Sofia, Faculty of Computer Systems and Control, Dept. of

Computer Systems and Technologies.

COURSE STATUS IN THE CURRICULUM: Compulsory for regular education of the student

specialty "Computer science and engineering", Bachelor degree, Faculty of Computer Systems and

Control, Technical University of Sofia.

AIMS AND OBJECTIVES OF THE COURSE: The aim of this course is to give knowledge and

skills in the area of CAD design and implementation of computer units and systems on the

contemporary programmable logic devices (integrated circuits).

DESCRIPTION OF THE COURSE: The syllabus considers the basic topics of the theory and

practice of programmable logic devices design and utilization: types of programmable logic,

hardware design and development, hardware description languages (HDL), design methodology and

CAD systems for hardware and software co-design and implementation on contemporary

programmable logic devices.

PREREQUISITES: Basic knowledge on microelectronics, combinatorial and sequential

logic devices, digital circuit design, computer architectures, programming languages.

TEACHING METHODS: Lectures, using white board and slide presentations, laboratory

work, using PC-based CAD systems and programmable VLSI chips on reference boards.

METHOD OF ASSESSMENT: Written work during the semester(forms 70% of the final mark)

and laboratory work (forms 30% of the final mark).


BIBLIOGRAPHY:

1.Manoilov P. – Lectures on Programmable Logic Systems, in Moodle, TU – Sofia, 2013.

2. Chu P. – FPGA prototyping by VHDL examples, John Wiley & Sons, 2008.

3. Mano M., M. Ciletti – Digital Design with an introduction to the Verilog HDL, Prentice

Hall, 2013.

4.Salcic Z., A. Smailagic - Digital Systems Design and Prototyping: Using Field

Programmable Logic and Hardware Description Languages, Springer, 2001.

5. Stefanov T., E. Deprettere , Marinov M., Nikolov H., Popov A. – Embedded Systems,

TU – Sofia, 2012.

23


Name of the course

Computer Periphery


Type of teaching:

Lectures and Laboratory

work

Lessons per week:



LECTURER: Ass. Prof. Sergey Nedev, Ph.D. (FCSC), tel.: 965 3525, email: [email protected]


COURSE STATUS IN THE CURRICULUM: This course is compulsory for the students from

the speciality Computer Science and Engineering in the bachelor programme of the Faculty of

Computer Systems and Control.

AIMS AND OBJECTIVES OF THE COURSE: The general aim of this course is to make

students familiar with the logical structure and organization of the peripheral devices (printers,

plotters, HDDs, CDs, DVDs, monitors, etc.) as a part of the state-of-the-art computer systems as

well as with the information media carriers applied.

DESCRIPTION OF THE COURSE: The following topics are included in the course content:

physical presentation of information over different physical carriers, faults detection and correction

during the process of storage of information, organization of write/read operations in devices which

use magnetic-media carriers, methods for registration of visual information, organization of write

operation using indication, optical disks based memories, organization of the read process from the

carriers of visual information, reliability of computer periphery, etc.

PREREQUISITES: The subject has the input links with the following disciplines: Physics,

Chemistry, Machine Mechanics, Materials Science, Theoretical Electrical Engineering.

TEACHING METHODS: Lectures, presented using additional technical tools. The laboratory

exercises output with protocols.

METHOD OF ASSESSMENT: Two one-hour written tests at the middle and at the end of the

semester (80%) and laboratories (20%).


BIBLIOGRAPHY: 1. Dakovski L., Computer periphery, e-book. 2. Rosch ., W. L., Hardware

Bible, Sixth Edition, Que Publishing, 0-7897-2859-1, 2003. 3. Rosenthal, J., K. Irwin, PC Repair

and Maintenance: A Practical Guide, 1584502665, Charles River Media, 2004. 4. Bhambri P.

Computer Peripherals and Interfaces. LAP LAMBERT, 2013. 5.Mueller S. Upgrading and

Repairing PCs. Que Publishing, 2013. 6.Hitachi Data Systems Academy. Storage Concepts. HDS

Academy, 2012. 7. Poynton C. Digital Video and HD. Morgan Kaufmann, 2012. 8. Stan S. The

CD-ROM Drive: A Brief System Description. Springer, 2010.

24


Name of the course: High-Performance Computer Systems


Type of teaching: Lectures, Laboratory Work Course work

Hours per week: L – 2 hours, LW – 2 hours


LECTURER: Prof. Ph.D. P. Borovska (FCSC) – tel.: 965 2524, email: [email protected]


COURSE STATUS IN THE CURRICULUM: Compulsory for the students of specialty Computer Science

and Engineering in the bachelor programme of the Faculty of Computer Systems and Control.

AIMS AND OBJECTIVES OF THE COURSE: At the end of the course the students are expected to

know the concepts, principles, models and architectural styles of high-performance computer systems and to

apply them in the design and development of effective infrastructure of high-performance computer systems,

to make comparative analyses and to evaluate the advantages and disadvantages of the alternative decisions.

DESCRIPTION OF THE COURSE: The main topics concern: Taxonomy. Architectural styles.

Technological specifics; Scalable high-performance computer systems; Vector processors; Massively

parallel processors; Clusters of servers and workstations; Parallel input-output; Resource management and

scheduling of computer clusters; Symmetric and CC-NUMA multiprocessors; System communication

networks for high-performance computer platforms; Parameters of communication performance of system

communication networks; Performance parameters of high-performance computer systems; Supercomputers;

Metacomputers. Virtual supercomputers; Resource brokers of computational resources; Infrastructure for

management of computational resources.

PREREQUISITES: Computers Organization, Computer Architecture.

TYPE OF TEACHING: Lectures using video-presentation with beamer, laboratory works end with

presentation of the results, parallelism profiles and estimation of the performance parameters of the parallel

system for the certain task.

METHOD OF ASSESSMENT: Exam during the exam session with duration two academic hours, students

give written answers to 3 compulsory and 5 optional questions, problems or tasks (60%), laboratory works

(25%), course work (15%).

LANGUAGES OF INSTRUCTION: English.

BIBLIOGRAPHY: 1. Hwang K., Zhiwei X., Scalable Parallel Computing: Technology, Architecture, Programming,

WCB/McGraw-Hill, 1998.

2. Rajkumar Buyya, High Performance Cluster Computing, Prentice Hall, 2005.

3. Borovska. P., Computer Systems, Siela, 2009.

4. Borovska P., M. Lazarova, Parallel Information Processing, Siela, 2007.

5. Veygant P., Clusters for High Availability, Prentice Hall, 2005.


25


Name of the course:

Parallel Software Engineering


Type of teaching: Lectures, Laboratory Work Course Work



LECTURER:

Prof. Ph.D. P. Borovska (FCSC) – tel.: 965 2524, email: [email protected]




AIMS AND OBJECTIVES OF THE COURSE: At the end of the course the students are expected to know

the concepts, principles, models and paradigms of parallel information processing and to apply them in the

design and development of parallel software; to be able to develop effective programming implementations, to

make profiles, estimate and analyze the performance, to verify and evaluate the parallel software

implementations.

DESCRIPTIONOFTHECOURSE: The main topics concern: Main concepts and paradigms of parallel

programming; Parallel programming with message passing. Message passing model. Standard interface for

message passing MPI; Parallel programming using data parallelism. SPMD style of parallel programming;

Parallel programming using functional parallelism; Parallel programming of Monte Carlo methods. Parallel

random number generators; Parallel programming using shared memory. OpenMP; Parallel programming

using combination of MPI and OpenMP. Hybrid parallel programming implementations; Parallel

programming for multicore processors; Application programming interfaces for multithreaded programming.

PREREQUISITES: Programming languages, Programming environments, High-performance computer

systems.


presentation of the results, parallelism profiles and estimation of the performance parameters of the parallel

system for the certain task.





BIBLIOGRAPHY: 1. Borovska P., M. Lazarova, Parallel Information Processing, Siela, 2007.

2. Michael J. Quinn, Parallel Programming in C with MPI and OpenMP, McGraw Hill Higher

Education, International Edition, 2003.

3. Barry Wilkinson, Michael Allen, Parallel Programming Techniques and Applications Using

Networked Workstations and Parallel Computers, 2nd Ed., Pearson Prentice Hall, 2005.

4. Chandra, Rohit, Leonardo Dagum, Dave Kohr, DrorMaydan, Jeff McDonald, Ramesh Menon,

Parallel Programming in OpenMP, Morgan Kaufmann Pubishers, San Francisco, 2001.

5. Veygant P., Clusters for High Availability, Prentice Hall, 2005.

6. Multi-Core Programming, Increasing Performance through Software Muri-threading, Intel

Corporation, April, 2006.


26


Name of the course

Advanced Software Technologies

(C#)


Type of teaching:


Lessons per week:


Number of

credits: 5

LECTURER:

Assoc. Prof. Mariana Goranova, PhD, MSc, Eng., Technical University of Sofia, Faculty of

Computer Systems and Control, Department of Programming and Computer Technologies (PCT),

phone: 965-3324, e-mail: [email protected]

COURSE STATUS IN THE CURRICULUM: Compulsory for bachelor degree students of the

specialty ”Computer Science and Engineering” of the Faculty of Computer Systems and Control at

the Technical University of Sofia; Educational level: bachelor.

AIMS AND OBJECTIVES OF THE COURSE:

To develop a student’s ability to solve problems using advanced software technologies of the .NET

Framework and the programming language C# separately and in team problems. The subjects

studied and the skills developed in this course are applied in the development of the diploma

projects.

DESCRIPTION OF THE COURSE:

The main topics concern: Object-oriented programming and component programming

methodologies; introduction to C# programming language: classes, methods, properties;

inheritance, interfaces, polymorphism, indexers, attributes, exceptions, delegates and events;

windows applications; data base access using ADO.NET; XML Web services.

PREREQUISITES: The course assumes that the students are aware of the basic operation of a computer system,

programming fundamentals and object-oriented programming.

TEACHING METHODS:

Lectures, using a beamer, case studies, laboratory work in teams, preparation of exercises and

laboratory works, solve a problem using C#.

METHOD OF ASSESSMENT: Exam.

LANGUAGE OF INSTRUCTION: English.

RECOMMENDED LITERATURE:

1. M. Goranova, V. Dimitrova , D. Gotseva , Manual Programming C #, Publishing Technical

University - Sofia , 2006.

2. Donis Marshal, Programming Microsoft Visual C # 2005 : The Language, Microsoft Press, 2006.

3. M. Goranova, V. Dimitrova, Advanced Software Technologies (C #), Technical University

Publishing Complex, Sofia, 2009 .

4 . Jeffrey Richter, CLR via C #, Microsoft Press, 2010 .

5 . P. Pialorsi, M. Russo, Programming Microsoft LINQ in Microsoft. NET Framework 4 , O'Reilly

Media, Inc., 2010 .

6 . Christian Nagel, Bill Evjen, Jay Glynn, Karli Watson, Morgan Skinner, Professional C # 4.0 and.

NET 4 , Wiley Publishing, Inc., 2010 .

7 . Svetlin Nakov , Veselin Kolev et al , Introduction to Programming with C #, Telerik Academy

for Software Engineers , 2011.

8 . Joseph Albabari, Ben Albabari, C # 5.0 in a Nutshell: The Definitive Reference, O'Reilly, 2012 .

9 . Http://cs-tusofia.eu/moodle

http://cs-tusofia.eu/moodle

27


Name of the course

Embedded Systems

Code:

BCSСe37

Semester:

V

Type of teaching:


Lessons per week:

L–30 hours; LW–30 hours

Number of credits:

4

LECTURER: Assoc. Prof. Asen Todorov, Ph.D. (Faculty of Computer Systems and Control),

ph.: 9 5 4, е-mail: [email protected] , Technical University of Sofia, Bulgaria


Computer Science and Engineering in the bachelor program of the Faculty of Computer Systems

and Control.

AIMS AND OBJECTIVES OF THE COURSE: The aim of the course is to help students to learn

and to be able to apply the suitable methods, approaches, and technical tools for analysis, design,

and application of popular microprocessor families, ACISC, and single-chip microcomputers in

accordance with their engineering needs. Also, the students should have the skills to upgrade

themselves their knowledge in this broad engineering area.

DESCRIPTION OF THE COURSE: Course examines: the requirements for "embedded

systems", algorithm design, the design specifics of the input and output interface software systems

for design of embedded systems design the properties of a processor, dual-and hierarchical

architectures of embedded systems, tools and methods setup and documentation of embedded

systems.

PREREQUISITES: The successful completion of this course is based on the knowledge and

practical skills, obtained in some previous courses as: „Theoretical electrotechnics”,

„Semiconductor devices”, „Еelectrical measurements”.


in teams and course work description preparation. Students have at their disposal these lecture notes

well in advance, so they are able to prepare themselves for further fruitful discussions. Various

supported materials are also available at: http://cs-tusofia.eu/ incl. labs preparation instructions,

keywords, references, etc

METHOD OF ASSESSMENT: Exam during the exam session with duration of two academic

hours (90 min), students give written answers to set of 7 questions. Each correct answer gives 0,5 or

point (n). ark “e cellent” ( ) is awarded when n ≥ 5,5; “very well” (5) - when n ≥ 4,5; “well”

(4) – in case of n ≥ 3,5, “satisfactory” (3) - when n=3. The final mark is arranged as a result from

the written e am’s results (8 %) and this of the laboratory exercises (20%).


BIBLIOGRAPHY: 1. Lecture notes.

2. EMBEDDED HARDWARE know it all. Newnes

3. EMBEDDED SYSTEMS WORLD CLASS DESIGNS. Newnes

4. Steve Heath, Embedded Systems Design, Second edition, 2003

5. Tammy Noergaard, Embedded Systems Architecture, Third edition, 2005

6. Neil Weste, Kamran Eshraghian, Principles of CMOS VLSI Design, Addison-Wesley Publishing,

Second edition, 2001

7. Stuart R. Ball, Analog Interfacing to Embedded Microprocessor Systems, Second edition, 2004

http://cs-tusofia.eu/

28


Name of the course

Integrated Digital Technologies


Type of teaching:

Lectures and Seminars

Lessons per week:

L – 2 hours; S – 1 hour


LECTURER:

Prof. DSc. Ph.D. Kamen Fillyov (FKSU) – tel.: 965 3515, email: [email protected]



Computer and Software Engineering in the bachelor programme of the Faculty of Computer Systems

and Control.

AIMS AND OBJECTIVES OF THE COURSE: The aim of the course is the students to have

basic knowledge of the design and manufacturing of VLSIs and of the main technology processes

of production of VLSI and VLSI with mixed structures, of the Hybrid Integrated Circuits and

Multichip Modules, as well Electronics system, based on them, also knowledge of the Electro-

Magnetic Compatibility, Noises and Electromigration in the VLSIs and Electronic Systems and use

these knowledge in solving of engineering problems.

DESCRIPTION OF THE COURSE: The main topics concern: Design and Manufacturing of

VLSIs and VLSIs with mixed structure; Main technology processes of production of modern

monolithic submicron VLSI; Technology processes of Hybrid Integrated Circuits and Multichip

Modules; Interconnections; SMD Technologies; Electro-Magnetic Compatibility, Noises and

Electromigration in the VLSIs and Electronic Systems.

PREREQUISITES: Physics, Digital Circuits, Analysis and Synthesis of Logical Circuits.

TEACHING METHODS: Lectures using video-presentation with beamer. Seminar using

presentation of SMD and Wave Soldering equipment, visual control equipment. Visits in enterprises

are planned.

METHOD OF ASSESSMENT: Two one-hour assessments at mid and end of semester (total 70%), laboratories (20%), Lecture attendance - (10%)


BIBLIOGRAPHY: 1. Weste, Neil, Harris, David, Principles of CMOS VLSI Design - A Circuits and Systems

Perspective, 4th Edition Addison-Wesley, MA, 2010. 2. Ali, Jamnia, Practical Guide to the Packaging of

Electronics, Second Edition: Thermal and Mechanical Design and Analysis, 2013.


29


Name of the course

Programming Frameworks Code: BCSCe36 Semester: 6

Type of teaching:


Lessons per week:



LECTURER:




science and engineering” – bachelor degree (Faculty of Computer Systems and Control of TU-

Sofia).

AIMS AND OBJECTIVES OF THE COURSE: The course introduces traditional and modern

means for Windows programming in.NET Frameworks; graphical interface (GDI/GDI+)

programming; document/view architecture; multitasking basics and memory management; object

construction/destruction and usability in classical/visual/.NET environments; fundamentals of

serialization; internet programming basics – API functions, basic classes and class hierarchies;

exception handling mechanisms, writing code complete and code prone to hacker attacks.

DESCRIPTION OF THE COURSE: The course introduces specific and common language

adjustments in connection with the development environment. Principles and realization of inter-

language connections in program modules of a specific product. Traditional and modern means for

Windows programming, including.NET Frameworks. Graphical interface programming (GDI /

GDI+). Document/view architecture. Multitasking basics. Memory management, objects

construction/ destruction and lifetime. Generations. Serialization. Internet programming basics –

API functions basic classes and class hierarchies. Exception handling mechanisms and writing code

complete. Code, prone to hackers attacks.

PREREQUISITES: Basic knowledge in operation systems, universal program languages, software

engineering, such as and knowledge about special features, structure and functionality of computer

devices and system.

TEACHING METHODS: Lectures in multimedia variant; developed web site with all lecture and

practical matherials of the course; practical work in laboratory. Published tutorial for every

laboratory theme.


INSTRUCTION LANGUAGE: Bulgarian.

BIBLIOGRAPHY: 1. John Sharp, Microsoft Visual C# 2013 Step by Step (Step by Step Developer), 2013.

2. Templeman Julian, Microsoft Visual C++/CLI Step by Step (Step by Step Developer), Microsoft Pres, 2013.

3. Bruce Johnson, Professional Visual Studio 2013 (Wrox Programmer to Programmer), Wrox, 2014.

4. Prata, S. C++ Primer Plus (6th Edition), Addison-Wesley Professional, 2011.

5. Stroustrup, B. Programming: Principles and Practice Using C++ (2nd Edition). Addison-Wesley Professional,

2014


30


Name of the course

Software Design and

Software Testing


Type of teaching:

Lectures and Laboratory

work, Course Project

Lessons per week:



LECTURER: Assoc. Prof. Dr. Stoyan Bonev Bonev (FCSC), e-mail: [email protected]


COURSE STATUS IN THE CURRICULUM: Compulsory for the students speciality “Computer

Science and Engineering” – bachelor degree (Faculty of Computer Systems and Control of TU-

Sofia).

AIMS AND OBJECTIVES OF THE COURSE: The aim of the course is to teach the students

with the practice concepts of software engineering – design, implementation, debugging and

maintenance of software products.

DESCRIPTION OF THE COURSE: The course includes problems concerning models and stages

of software life cycle - software development method including design, development, testing and

debugging, support and maintenance. Various programming styles are under discussion –

imperative (procedure oriented) using C,C++,C# as implementation language, logic programming

using Prolog and functional programming using Lisp.

PREREQUISITES: Basic knowledge, practical skills and experience in universal procedure

oriented programming languages like C, C++, Java. Material covered is to be useful for software

engineers – designers, managers, developers and quality assurance engineers.


materials; web site of the course; laboratory work (based on instructions) with a tutorial for every

laboratory theme.

METHOD OF ASSESSMENT: Written examination (test work for fixed time).


BIBLIOGRAPHY:

Schach St., Object-Oriented and Classical Software Еngineering, Asken Assoc. Inc. Publ., IRWIN,

8th ed., 2010. B. Hambling (editor), Software Testing ISEB Foundation, BCS Publishing Products,

2009. A. Hunt, D. Thomas, Pragmatic Unit Testing in C# with NUnit, The Pragmatic Bookshelf, 3e,

2010, Sommerville I., Software Engineering, Addison Wesley, 9e, 2010, K.Louden, Programming

Languages, Principles and Practice, IE Cengage Learning, 3e, 2012. R. Sebesta, Concepts of

Programming Languages, Addison Wesley, 10e, 2012.

31


Name of the course

Agent-Based Technologies


Type of teaching:


Course work

Lessons per week:



LECTURERS:

Assoc. Prof. PhD Adelina Aleksieva-Petrova, phone.: 965 26 52, еmail: [email protected]


COURSE STATUS IN THE CURRICULUM: Compulsory for the students specialty Computer

science and engineering BEng programme of the Faculty of Computer Systems and Control

AIMS AND OBJECTIVES OF THE COURSE: At the end of the course the students are expected

to be able to apply the methodologies and software tools for design and deployment of agent based

applications, to assess in which cases use agent-based applications and how to implement the

communication between them, to implement intelligent agents, multi-agent systems and mobile

agents and use them in solving of engineering problems.

DESCRIPTION OF THE COURSE: The main topics concern: Agent based software technologies

– motivation and application of agent based technologies in Web business services; Web services

and software agents – interoperability, integration of software agents; Agents - definition,

infrastructure, interaction of agents; Service oriented architecture based on agents; Intelligent agent

- definition, properties, characteristics, classification, tools for deployment; Multi-agent systems -

nature, basic elements, properties, communication and distribution of the task; GAIA methodology

for designing of multi-agent architecture - roles model and interaction model, analysis and design;

Methodology based on messages for agent-based analysis and design - concepts and notations,

analysis; Mobile agents - nature, field of application; Java-based agent platforms - specifications

IEEE FIPA, architecture of FIPA, platforms Cougaar, AgentFactory, 3APL platform, Jason

(AgentSpeak APL); JADE platform - architecture, packages, messaging service, administration and

development of applications, programming, communication, detection of agents; UBIWARE

platform - architecture, programming language for semantic agents (S-APL).

PREREQUISITES: Programming and Computing III, Programming languages, Analysis and design of algorithms.

TEACHING METHODS: Lectures, using slides, case studies, laboratory, work in teams.

METHOD OF ASSESSMENT: Two academic hour assessments. The exam consists of answers on questions and tasks.


BIBLIOGRAPHY: 1. Lectures and laboratory exercises http://cs.tu-sofia.bg. 2. Aleksieva-Petrova

A., Gancheva V., Manual in Agent-Based Technologies, Technical University of Sofia, 2012. 3.

Bellifemine, F.L., Caire, G., Greenwood, D. Developing Multi- gent Systems with DЕ, ohn illey &

Sons Ltd, 2007. 4. Wooldridge, M. J. An Introduction to MultiAgent Systems, John Willey & Sons Ltd, 2009.

5. Danny Weyns, Architecture-Based Design of Multi-Agent Systems, Springer, ISBN 3642010636, 2010. 6.

Mark d'Inverno, Michael Luck, Understanding Agent Systems (Springer Series on Agent Technology),

Springer, ISBN-10: 3642073824, 2010. 7. Gerhard Weiss, Multiagent Systems (Intelligent Robotics and

Autonomous Agents series), The MIT Press, ISBN-10: 0262018896, 2013.

32


Name of the course: Bioinformatics


Type of teaching: Lectures, Laboratory, Work Course work



LECTURER: Prof. Ph.D. P. Borovska (FCSC) – tel.: 965 2524, email: [email protected]




AIMS AND OBJECTIVES OF THE COURSE: At the end of the course the students are expected to:

• know the biological data and techniques for their detection and e traction;

• know the algorithms and methods for storing and analyzing biological data and to apply them in

practice;

• acquire knowledge and skills to compare and to use various software tools for analysis, modeling,

processing and visualization of nucleotide and protein sequences.

DESCRIPTION OF THE COURSE: The main topics concern: Fundamentals of bioinformatics. Biological

sequences. Analysis of biological sequences. Basic principles of molecular biology. Biological databases.

Protein and DNA / RNA data bases. Sequences alignment. Arrange the pairs of sequences. Methods and

algorithms for sequence alignment. Software tools for bioinformatics. Prediction of the RNA secondary

structure - Methods and software tools. Evolutionary analysis of biological data. Software to predict genes.

PREREQUISITES: Object-oriented programming, parallel programming, high-performance computer

systems, data structures and algorithms.


presentation of the results for the certain task.





BIBLIOGRAPHY: 1. E-learning materials - lectures and laboratory exercises http://cs.tu-sofia.bg/ Bioinformatics.

2. Borovska P., Gancheva V., Georgiev I., Parallel Algorithms and models for in silico biological experiments

on high-performance computing clusters and supercomputer BlueGene / P, TU-Sofia, 2012.

3. Heitor S. Lopes, Leonardo M. Cruz, Computational Biology and Applied Bioinformatics, on-line book,

ISBN-13: 9789533076294, pp. 442, 2011

4. David Mount, Bioinformatics: Sequence and Genome Analysis, ISBN-13: 978-0879697129, book, March

2013

5. Mitchell L. Model, Bioinformatics Programming Using Python: Practical Programming for Biological Data,

ISBN-13: 978-0596154509, book, 2013

6. Sung W.K., Algorithms in Bioinformatics: A Practical Introduction, CRC Press, 2009.

7. Ramsden J., Bioinformatics: An Introduction (Computational Biology), Springer, 2010.


http://cs.tu-sofia.bg/

http://www.amazon.com/Bioinformatics-Introduction-Computational-Jeremy-Ramsden/dp/1849967644%3FSubscriptionId%3D0CTNNE6VGVCK904KF6G2%26tag%3Dbiowww-20%26linkCode%3Dxm2%26camp%3D2025%26creative%3D165953%26creativeASIN%3D1849967644

33


Name of the course Computer Graphics


Type of teaching:

Lectures and Laboratory work,

Course project

Lessons per week:



LECTURER: Assoc. Prof. Ph.D. Milena Lazarova (FCSC), tel. 965-3285, email: [email protected]


COURSE STATUS IN THE CURRICULUM: Compulsory course for the “bachelor” degree

students in specialty “Computer science and engineering” in Faculty “Computer systems and

control”, TU-Sofia.

AIMS AND OBJECTIVES OF THE COURSE: To provide an overview of modern interactive

graphics systems and an insight into the most important special techniques required for developing

efficient interactive graphics applications. The students should obtain an understanding of the

important special tools required and problems encountered while building graphics applications.

DESCRIPTION OF THE COURSE: The main topics concern: overview of modern interactive

graphics systems; 2D model transformations using homogeneous coordinates; 2D viewing pipeline

– graphics windows and viewports; basic raster algorithms; developing efficient interactive graphics

applications; 3D image modeling; projections; 3D viewing pipeline; elimination of hidden surfaces;

illumination models; color models; image rendering using local and global illumination models; ray

tracing; spline curves and surfaces; fractals; computer art and animation. OpenGL is used as the

platform for practical C programming exercises, and as an example of a modern system which

incorporates many of the fundamental ideas of computer graphics.

PREREQUISITES: Mathematics, Algorithms & Data Structures; Programming Languages and

Programming Environments.

TEACHING METHODS: Lectures, using slides, case studies, demo programs and multimedia

presentations, course works assignments

METHOD OF ASSESSMENT: final exam.


BIBLIOGRAPHY: Course web site: cs.tu-sofia.bg g/bgmoodle/course /view.php?id=71; Hughes J., A.

van Dam, M. McGuire, D. Sklar, J. Foley, S. Feiner, K. Akeley, Computer Graphics: Principles and Practice,

Addison-Wesley, 2013; Shreiner D., The Khronos OpenGL ARB Working Group, B. Licea-Kane, G. Sellers,

OpenGL Programming Guide: The Official Guide to Learning OpenGL, Addison-Wesley, 8th ed., 2013;

Wolff D., OpenGL 4.0 Shading Language Cookbook, Packt Publishing, 2011; Shirley P., M. Ashikhmin, S.

arschner, Fundamentals of Computer Graphics, А eters, 9; Gortler S., Foundations of 3D Computer

Graphics, MIT Press, 2012; Angel E., D. Shreiner, Interactive Computer Graphics: A Top-Down Approach

with Shader-Based, Addison-Wesley, 2011; Wright R., N. Haemel, G. Sellers, B. Lipchak, OpenGL

SuperBible: Comprehensive Tutorial and Reference, Addison-Wesley, 2011; Matsuda K., R. Lea, WebGL

Programming Guide: Interactive 3D Graphics Programming with WebGL, Addison-Wesley, 2013.


34


Name of the course:

Systems on Chip Design

Code: BCSCe45.2

Semester: VII

Type of teaching:

Lectures and laboratory work Lessons per week:

L-2h, LW- 1h.


LECTURER: Assoc. Prof. Ph.D. Peter Manoilov,

Phone : 0895 590 576, Email : [email protected],

Technical University of Sofia, Faculty of Computer Systems and Control, Dept. of

Computer Systems and Technologies.

TYPE OF TEACHING: Lectures and laboratory work.

COURSE STATUS IN THE CURRICULUM: Optional course for regular education of the

student specialty "COMPUTER SCIENCE AND ENGINEERING ", Bachelor degree, Faculty of

Computer Systems and Control, Technical University-Sofia.

AIMS AND OBJECTIVES OF THE COURSE The aim of this course is to give knowledge and

skills in the area of CAD design of Systems on Chip (SoC) on currently usable VLSI chips.

DESCRIPTION OF THE COURSE: The syllabus considers the basic topics of the theory and

practice of Systems on Chip (SoC) design : microelectronic technology, art of circuit design,

computer architectures, hardware description languages (HDL), design methodology and CAD

systems for hardware and software co-design on contemporary VLSI chips.

PREREQUISITES: Basic knowledge on microelectronics, digital and mixed signal circuit design,

computer architectures, programming languages.

TEACHING METHODS: Lectures, using white board and slide presentations, laboratory work,

using PC-based CAD systems and programmable VLSI chips on reference boards.

METHOD OF ASSESSMENT: Written exam (70%) and laboratory work (30%).

BIBLIOGRAPHY:

1. Manoilov P. – Lectures on System on Chip Design, in Moodle, TU – Sofia, 2013.

2. Chu P. – FPGA prototyping by VHDL examples, John Wiley & Sons, 2008.

3 . Mano M., M. Ciletti – Digital Design with an introduction to the Verilog HDL, Prentice Hall,

2013.

4. Wolf W. - Modern VLSI Design, IP – based design, Prentice Hall, 2009.

5. Stefanov T., E. Deprettere , Marinov M., Nikolov H., Popov A. – Embedded Systems, TU –

Sofia, 2012.

35


Name of the course

Java Technologies


Type of teaching:

Lectures and laboratory

work

Lessons per week:



LECTURER:

Prof. Ph.D. Ivan Momtchev(FKSU) – tel.: 965 2052, email: [email protected]

COURSE STATUS IN THE CURRICULUM: Compulsory for the specialty Computer Science

Bachelor Eng program.

AIMS AND OBJECTIVES OF THE COURSE: At the end of the course, participants will be

able to use the techniques and tools provided by the programming language Java, to apply the

exception handling mechanism, object serialization, to master multithreads programming approaches

and techniques.

DESCRIPTION OF THE COURSE: Revision of Java Programming Techniques - Classes and

Objects; Controlling Access to Members of a Class; Collections in Java – Arrays, Lists; Strings;

Console Input; Inheritance, Polymorphism; Interfaces; AWT and Swing introduction.

Exceptions handling – safety, checked and unchecked. Java I/O -Output Streams, input Streams,

Filter Streams, Readers and Writers, Threads – Creating, States, Running, Synchronization,

Deadlock, Thread Scheduling, Thread Pools.

PREREQUISITES:

Basic skills in object-oriented programming.

TEACHING METHODS:

Lectures, using internet sites and multimedia projector, case studies, laboratory and course work,

work in teams, protocols and course work description preparation and defense

METHOD OF ASSESSMENT:

Two - hours assessments at end of semester, or course work preparation and defense.


BIBLIOGRAPHY

1. Ivan Momtchev, Java Technologies, http://refg.tu-sofia.bg/JTech, 2007- 2013

2. Ivan Momtchev, http://refg.tu-sofia.bg/JavaBg 2004 - 2013

3. Ivan Momtchev, http://refg.tu-sofia.bg/AdvJava/; 2011-2013

4. The Java Tutorial http://download.oracle.com/javase/tutorial/ 2013

5. Bruce Eckel , Thinking in Java (4th Edition), Prentice Hall 2008;


http://refg.tu-sofia.bg/JTech

http://refg.tu-sofia.bg/JavaBg

http://refg.tu-sofia.bg/AdvJava/

http://download.oracle.com/javase/tutorial/

36


Name of the course

Programming Technologies for

Secure Code


Type of teaching:


Lessons per week:



LECTURER:




science and engineering” – bachelor degree (Faculty of Computer Systems and Control of TU-

Sofia).

AIMS AND OBJECTIVES OF THE COURSE: The course introduces the vulnerability of the

code in different programming technologies local or external attacks, as well as software tools and

practices for protection. The aim of the discipline is provide knowledge about information

protection and to give students skills for identification of possible risks in certain systems and for

application of proper means for protection.

DESCRIPTION OF THE COURSE: The course includes: threat modeling, the principle of least

privilege, defense in depth, authentication, luring attack, running as non-privileged user, writing

code that can be used by a non-admin, auditing, security context, security context in the .NET

Framework, token, privileges, granting end revoking privileges, daemon, run a program as another

user, impersonation, impersonate a user, impersonation in ASP.NET, COM authentication level,

COM impersonation, initialize security for COM, configurating security for a COM client, store

secrets on a computer, programmatically log off or reboot the computer, overruns attacks, safe

exception handling, security enhancements in the .NET Framework, points to cryptography in

.NET, ASP security, server-side security controls, defining roles, configuration file encryption,

cryptographic elements, protecting secret data, using CS #5 to make the attacker’s job harder,

Protecting secrets in Windows 2000 and later, difference between LSA secrets and DPAPI,

encrypting secret data in memory, different ways of storing secret data – rising the security bar up.



devices and system.



laboratory theme.



BIBLIOGRAPHY: 1. Hamid R. Nemati and Li Yang, Applied Cryptography for Cyber Security

and Defense: Information Encryption and Cyphering, IGI Global, 2010. 2. Bryan Sullivan and

Vincent Liu, Web Application Security, A Beginner's Guide, McGraw-Hill Osborne Media, 2011.

3. Michal Zalewski, The Tangled Web: A Guide to Securing Modern Web Applications, No Starch

Press, 2011. 4. Mike Shema, Hacking Web Apps: Detecting and Preventing Web Application

Security Problems, Syngress, 2012. 5. Michael Howard, David LeBlanc and John Viega, 24 Deadly

Sins of Software Security: Programming Flaws and How to Fix Them, McGraw-Hill Osborne

Media, 2009.


37


Name of the course

Distributed systems and

Computer Communications

Code: BCSCe45.3 Semester: 6

Type of teaching:


Lessons per week:



LECTURER:

Prof. Grisha Spasov PhD (FEA), tel.: 659 724, еmail: [email protected]

Technical University of Sofia, branch Plovdiv

COURSE STATUS IN THE CURRICULUM: Eligible for the students specialty “Computer

Science and Engineering” М.Sc. programme of the Faculty of Electronics and Automatics, Technical

University of Sofia, branch Plovdiv.

AIMS AND OBJECTIVES OF THE COURSE: At the end of the course the students are expected

to have knowledge for basic principles for creating distributed systems and client-server

applications, together with the architecture of Middleware for distributed systems.

DESCRIPTION OF THE COURSE: The main topics concern: Introduction to distributed systems.

Hardware and software aspect of the client-server model. Communication protocols of the

application layer. Middleware protocols and distributed applications –RPV, RMI, MQS. Distributed

processes – client-server, threads, code migration, software agents. Naming in distributed systems-

DNS, X.500. Synchronization of distributed work. Co-ordination and replication of resources. Co-

ordination models. Replication models. Security policy in distributed systems. Distributed file

systems – NFS, AD. Web based distributed systems. Web services - SOA. Cloud computing - SaaS,

PaaS, IaaS. Multimedia networking applications. Protocols for real-time interactive applications.

PREREQUISITES: From B.Sc. programme: Operating Systems, Computer Architectures, Programming Languages, Computer Networks.

TEACHING METHODS: Lectures, using slides and multimedia presentations, laboratory work,

using demo-programs and case study.

METHOD OF ASSESSMENT: Written exam on the theory and defense of the case study. The final grade is constructed on the exam results (totally 60%), the case study (30%) and the laboratory work (10%).

INSTRUCTION LANGUAGE: Bulgarian. BIBLIOGRAPHY:

1.George Coulouris, Jean Dollimore, Tim Kindberg, Gordon Blair, “D STR BUTED

SYSTEMS, Concepts and Design”, Fifth Edition, ddison-Wesley, 2012, ISBN 10: 0-13-

214301-1. 2.A. S. Tanenbaum and M. van Steen. "Distributed Systems: Principles and

Paradigms," Second Edition, Prentice Hall, 2007, ISBN 0-13-239227-5. 3.Bill Wilder,

“Cloud rchitecture atterns”, O'Reilly edia, , rint SBN: 978-1-4493-1977-9.

../../../../AppData/Local/Microsoft/Windows/Temporary%20Internet%20Files/Content.IE5/[email protected]

../../../../AppData/Local/Microsoft/Windows/Temporary%20Internet%20Files/Content.IE5/[email protected]

38


Name of the course

Metaheuristics

Code:

BCSCe51

Semester:

7

Type of teaching:

Lectures, laboratory work

Course work

Lessons per week:


Number of credits:

5

LECTURER: Prof. Ph.D. Plamenka Borovska

Phone.: 965 25 24, e-mail: [email protected], Technical University of Sofia, Faculty of

Computer Systems and Control, Department of Computer Systems and Technologies.


“Computer Science and Engineering” in the bachelor programme of the Faculty of Computer

Systems and Control.

AIMS AND OBJECTIVES OF THE COURSE: The aim of this course is to introduce students to

the general theory of Metaheuristic and the features in the design of parallel implementations for

solving specific classes of combinatorial problems. At the end of the course the students are

expected to know and be able to apply the concepts, taxonomy, principles, specifics and

possibilities for practical implementation of metaheuristic algorithms for development of various

applications that require solving hard optimization problems.

DESCRIPTION OF THE COURSE: The main topics concern: Metaheuristics concepts;

Taxonomy ; Concepts of evolutionary computations; Genetic algorithms; Meta-genetic algorithms;

Simulated annealing; Algorithm Metropolis; Local search using memory structures; Tabu-search;

Variable Neighborhood Search (VNS); Local search; Iterative local search; Greedy Randomized

Adaptive Search Procedure (GRASP); Ant Colony Optimization; Memetic algorithms.

Upon completion of the course students will:

• know the concepts, principles, models and paradigms of metaheuristic and design of the software

for their implementation;

• be able to do a comparative analysis and assess the advantages and disadvantages between

alternative solutions

• be able to create effective program implementation, profiling, assessment and analysis of the

performance of metaheuristic algorithms;

PREREQUISITES: Knowledge of Programming Languages, Programming Environments,

Algorithms Synthesis and Analyses, Parallel Programming.

TEACHING METHODS: Lectures using video - presentation with beamer , laboratory works

aimed at study, implementation and analyses of sample problems and case studies; course work

aimed at implementation and analyses of solving certain problem by given metaheuristic algorithm.


students give written answers to 3 compulsory and 5 optional questions, problems or tasks (60%),

laboratory works (25%), course work (15%).


BIBLIOGRAPHY:

1. Lecture Presentations – Metaheuristics course, http://cs.tu-sofia.bg/

2. P. Borovska, Synthesis and analysis of parallel algorithms, TU-Sofia, г.

3. Michel Gendreau and Jean-Yves Potvin, Handbook of Metaheuristics, ISBN: 978-

1461426905, book 2012

4. http://www.metaheuristics.net/

5. METSlib Trac Frame:

http://code.100allora.it/metslib

6. http://en.wikipedia.org/wiki/List_of_NP-complete_problems


http://cs.tu-sofia.bg/

http://www.metaheuristics.net/

http://code.100allora.it/metslib

http://en.wikipedia.org/wiki/List_of_NP-complete_problems

39


Name of the course

Artificial Intelligence


Type of teaching:


Lessons per week:



LECTURER:

Assoc. Prof. Ph.D. Dimitar Dimitrov (FA) – tel.:029652636, email: [email protected]

COURSE STATUS IN THE CURRICULUM: Optional for the students of specialty Computer

Science in the bachelor programme of the Faculty of Computer Systems and Control.

AIMS AND OBJECTIVES OF THE COURSE: Understanding the essential principles of

intelligent behaviour, corresponding computational algorithms, and ideas for building practical

applications of intelligent behavior systems. Getting working knowledge and skills in knowledge

representation, reasoning, and architectures to design simple intelligent agents for diagnostic,

decision support and control systems.

DESCRIPTION OF THE COURSE: This is an introductory course. The field of Artificial

Intelligence (AI) is presented as unified field from the perspective of rational behaviour. Both

approaches to AI - the symbolic (logical) and the behavioural (numerical) are presented as

complementary (not contradictory). The main covered topics include: Intelligent agents,

environments and behaviours. Principle of rationality, rational reasoning and rational acting. Formal

logic methods for knowledge representation and reasoning in intelligent systems. Problem solving

by searching – informed and heuristic search methods. Acting rationally – planning and learning. AI

and Robotics – intelligent connection of perception to action. Outputs: other special disciplines and

diploma project.

PREREQUISITES: Mathematics I, II, III, Programming and Computer I, II Application, Logic Modelling and Programming.

TEACHING METHODS: The basic didactic approach is “understands trough implementation”.

Lectures using multimedia presentations, slides, set of prototype computer programme handouts,

laboratory and homework, work in teams and discussions. The laboratory and course work is

provided with the supporting programming language Prolog.

METHOD OF ASSESSMENT: One three-hours final exam (50%), plus laboratories (40%) plus class attendance, accuracy, etc. (10%).


BIBLIOGRAPHY: 1. S. Russel. P. Norvig. Artificial Intelelgence. Prentice Hall, 2010. 2.. The

Cambridge Handbook of Artificial Intelligence, ISBN: 9780521871426, 2014. 3. R. Scott. Artificial

Intelligence with Visual Prolog. Prolog Development Center A/S, 2010. 4. http://aitopics.org/

Internet's largest collection of information about AI, 2014. 6. R. Vasilev, D. Dimitrov. Software for

perceptual anchoring in autonomous mobile robot.. Control Systems © 2012 Institute of Systems

Engineering and Robotics ISSN 1310 – 8255R. 7. Siegwart and I. Nourbakhsh, Introduction to

Autonomous Mobile Robots. MIT Press, 2004. 8. M. R. Genesereth, N. J. Nilsson. Logical

Foundations of Artificial Intelligence. Morgan Kaufman Publ. Inc., 1987.


http://aitopics.org/

40


Name of the course

Fundamentals for Internet

Programming

Code:

BCSCе49

Semester:

7

Type of teaching:


Lessons per week:


Number of credits:

5

LECTURER:

Prof. Ognyan Nakov Nakov Ph.D. (FCSC), tel.: 965 3513, email: [email protected]




and Control.

AIMS AND OBJECTIVES OF THE COURSE: Detailed outlook of the course's content:

DHTML; script languages: JavaScript/JScript; Dynamic HTML (cascade stylesheets (CSS)); object

model and collections; script and events; filters and transitions; data binding; structured graphics;

implementation of Active X controls; multimedia effects; ASP (Active Server Pages) technology,

basics and comparison with PHP; XML(Extensible Markup Language).

DESCRIPTION OF THE COURSE: The course introduces in modern technologies in Internet

programming: JavaScript/ Jscript script language; Dynamic HTML (cascade stylesheets (CSS));

object model and collections; script guiding events; filters and transitions; data binding; structured

graphics; implementation of Active X controls; multimedia effects; ASP (Active Server Pages)

technology, basics and comparison with PHP; XML(Extensible Markup Language). In practice

students get familiar and work with the following products apart from the given above: IE 6;

InterDev 6; FrontPage; Paint Shop Pro; Web Servers - IIS, PWS.

PREREQUISITES: Basic programming knowledge.

TEACHING METHODS: Lectures in multimedia; web site with full materials of the course;

laboratory work (based on instructions) and course work description preparation and defence.


students give written answers to questions from the subject.


BIBLIOGRAPHY: Esposito, Dino. Programming Microsoft ASP. NET MVC. O'Reilly Media,

Inc., 2011; Nixon, Robin. Learning PHP, MySQL, JavaScript, and CSS: A Step-by-Step Guide to

Creating Dynamic Websites. " O'Reilly Media, Inc.", 2012; Duckett, Jon. HTML and CSS: Design

and Build Websites. John Wiley & Sons, 2011; McFarland, David Sawyer. Javascript & jQuery: the

missing manual. " O'Reilly Media, Inc.", 2011; McFarland, David Sawyer. CSS3: The Missing

Manual. " O'Reilly Media, Inc.", 2012; Freeman, Eric, and Elisabeth Robson. Head First HTML5

Programming: Building Web Apps with Javascript. " O'Reilly Media, Inc.", 2011; Purewal, Semmy.

Learning Web App Development. " O'Reilly Media, nc.", 4; Шурман Е., Dynamic HT в

действие, СофтПрес, ; WEB Database Development - .NET edition, Microsoft Press, 2002;

Sceppa David, Programming ADO, Microsoft Press, 2001; Microsoft Corp., SQL Server

administration, certification course


41


Name of the course:

Management of IT projects


Type of teaching:


Lessons per week:



LECTURER:



COURSE STATUS IN THE CURRICULUM: Compulsory for the students of specialty

Computer Science in the bachelor programme of the Faculty of Computer Systems and Control.

AIMS AND OBJECTIVES OF THE COURSE: The course introduces a complex and

multifaceted process of managing information technology projects, including issues on the one hand

with the functional design of the system and the activities associated with seemingly side, but very

important for the ultimate success circumstances, such as determining the mental compatibility

between members of development team, ensuring the protection of the entire system and other

breakthroughs. The subject application is targeted by most of the topics discussed are related to

examples from the practice of other local and foreign companies.

DESCRIPTION OF THE COURSE: Basic concepts and strategies for building information

systems, technologies for the rapid creation of projects (Rapid Application Development - RAD);

Manage IT projects and evaluating the management of risk in IT projects, modeling and planning

process of management of IT projects. Evaluation of psychological factors in the process of forming

the team, automation of the process of development, management and evaluation of IT projects;

Threats to security of IT systems to major attacks and ways to overcome them.



devices and system.



laboratory theme.



BIBLIOGRAPHY: Boehm B., Rapide Application Development (RAD) Strategies, USC, Intel

Presentation,., Chonkroun M., Developpement rapide d’applications (RAD), Techniques de

l’ingenieur, 2010., Farlan M. C., Rapide Application Development with Mozilla, Prentice Hall,

2003., Haag Stephen, Maeve Cummings, Management Information Systems, McGraw-Hill &

Pittsburg State University, 2010., Hugnes J., Leblanc B., Marley Ch., RAD, une methode pour

delelopper plus vit, 2011.,. , Harvard Business Review on Managing Projects, Harvard Business School

Press, 2009, M. Solomon, Project Management Professional, Fourth Edition, Pearson 2009, Ian

Sommerville, Software Engineering, Addison-Wesley Publishing Company, 9th edition, 2010, Heagney J.,

Fundamentals of project Management, Fourth Edition, 2011, Andrew P. Sage, Systems Engineering and

Management, Principles and Practices, Second Edition, 2011, Barker S., Cole R., Brilliant Project

Management, Pearson Educated Limited, 2011, M. Solomon, D. Garvin, M. Roberto, Harvard Business

Review on Managing Projects, Harvard Business School Press, 2009, PMP Project Management

Professional Study Guide, Fourth Edition, 2013, Eric Verzuh, The Fast Forward MBA in Project

Management(Portable MBA series) Wiley Fourth edition, 2011, Susan Land, Douglas Smith, John

Walz, Lean Six Sigma Software Process Definition, Version IEEE 2011


42


Name of the course

Computer Integrated

Manufacturing

Code:

BCSCе48.

Semester:

VII

Type of teaching:

Lectures and laboratory

work

Lessons per week:

L – 2 hours;LW – 1 hour

Number of credits:

4

LECTURERS:

Prof. Ph.D. T.Neshkov (FME) – tel.965 2764

Technical University of Sofia, Assos.prof.Dobrin Dotzev (FME) – tel.965 2140



Computer and Software Engineering in the bachelor programme of the Faculty of Computer

Systems and Control.

AIMS AND OBJECTIVES OF THE COURSE: . To introduce the basic models and typical

strategies of CIM taking place in industrial plants and in the production automation.

DESCRIPTION OF THE COURSE: . The main topics concern: Computer Integrated

Manufacturing (CIM) classification, control objectives, configurations, models and strategies;

Fundamentals of CAD/CAM,CAPP and MRP -I,MRP-II,MRP-III, Multimedia Technologies in

CIM, Information flow and Shop Floor Control in IM, Factory of the Future, CIM Hardware and

software systems and examples, Intelligent manufacturing, Virtual and e-Manufacturing,

Knowledge based systems.

PREREQUISITES: . Basic knowledge in the fields of regulation and control devices and control

systems for automated complexes obtained in the B.Sc. degree course.

.TEACHING METHODS: Lectures, using slides, case studies, tutorial and laboratory work from

laboratory manual, work in teams, protocols preparation and defence, preparing of the special report

in the field of CIM.

METHOD OF ASSESSMENT: Exam during the exam session with duration one academic hour,

students give written answers to .special test.. Final mark is calculated based on the written exam

(.90%), laboratory work (.10.%), ....

INSTRUCTION LANGUAGE: Bulgarian/English

BIBLIOGRAPHY: Neshkov,T. Intelligent Manufacturing Systems, Heron press, Sofia, 2014,

Neshkov,T. Intfrduction to speciality MECHATRONIC SYSTEM, Sofia, 2013, Mitchell, F., CIM

Sysytems. An Introduction To Computer Integrated Manufacturing, Prentice Hall International Inc.,

1991. Groover, M., Automation, Production Systems And CIM, Prentice Hall International Inc.,

2011, Groover, M., E. Zimmers, CAD/CAM Computer Aided Design And Manufacturing, Prentice

Hall International Inc., 2010,Neshkov, T., S. Jordanova et all. Process Control and Production

Automation, TU-Sofia,2007.

43


Name of the course

Intelligent Systems

Code: BCSCe48.1 Semester: 7

Type of teaching:


Lessons per week:



LECTURER:

Assoc. Prof. Dr. Roumen Trifonov (FCSC), tel.: 965 24338 email: [email protected]


COURSE STATUS IN THE CURRICULUM: Compulsory subject for the students from specialty

Computer Science and Engineering, Bachelor degree, Faculty of Computer Systems and Control.

AIMS AND OBJECTIVES OF THE COURSE: The discipline introduces students in problems of

Artificial intelligence. It is basic for this science area and deals with computer methods for problem

solving, models of intelligence, and models of knowledge representation (logical models, set models,

production models, frame models and respective problem solving methodology).

At the end of the course the students are expected to be able to use methods of Artificial intelligence,

to have basic knowledge on simulation software for Artificial intelligence problems, and use it in

solving of engineering problems.

DESCRIPTION OF THE COURSE: The main topics concern: 1.Artificial intelligence – an

introduction. 2. Methods for problem solving. 3. Models of intelligence. 4. Logical models of

knowledge description. 5. Set models of knowledge description. 6. Production models. 7. Frame

models. 8. Methods for searching. 9. Expert systems. 10. Neuron nets.

PREREQUISITES: Discrete structures, analyses and synthesis of logical circuits, logical programming.

TEACHING METHODS: Lectures using slides and laboratory works with protocols description

preparation and defence.

METHOD OF ASSESSMENT: Two-hour writing exam at end of the semester (80%) and laboratories (20%).


BIBLIOGRAPHY: Nilsson,N. Principles of Artificial Intellgence, Tioga, Palo Alto,California,

2009.


44


Name of the course

Image processing

Code: BCSC56 Semester: 8

Type of teaching:


Lessons per week:



LECTURER:

Assist. Prof. Ph.D. M. Lazarova (FCSC) – tel.: 965 3139, email: [email protected]


COURSE STATUS IN THE CURRICULUM: Compulsory for the students of specialty

Computer Science in the bachelor programme of the Faculty of Computer Systems and Control.

AIMS AND OBJECTIVES OF THE COURSE: At the end of the course the students are

expected to know and be able to implement fundamental algorithms and methods for image

processing as well to use their knowledge in order to apply them in different real life problems.

DESCRIPTION OF THE COURSE: The main topics concern: Characteristics of digital images;

Structures for description, presentation and analysis digital images; Pixel based operations with

images; Geometric operation with images. Methods for image interpolation; Linear operations with

images. Convolution and correlation; Selective image processing; Discrete transformations in

frequency domain; Non-linear operations with images. Image restoration and reconstruction;

Morphological operation with images; Image compression.

PREREQUISITES: Mathematics, Algorithms synthesis and analyses, Computer graphics.

TEACHING METHODS: Lectures using video-presentation with beamer, laboratory works for за

development, experiments, analyses and discussion on given examples and problems.


students give written answers to questions, problems or tasks (80%), laboratory works (20%).


BIBLIOGRAPHY: Course web site: cs.tu-sofia.bg/enmoodle/course/view.php?id=67; Gonzales R., R. Woods,

Digital Image Processing, Prentice-Hall, 2008; Petrou M., C. Petrou, Image Processing: The Fundamentals Wiley,

2010; Gonzalez R., R. Woods, S. Eddins, Digital Image Processing Using MATLAB, Gatesmark Publishing, 2009;

Burger W., M. Burge, Principles of Digital Image Processing: Fundamental Techniques, Springer, 2011; Burger W., M.

Burge, Digital Image Processing: An Algorithmic Introduction using Java, Springer, 2012; Burger W., M. Burge,

Principles of Digital Image Processing: Advanced Methods, Springer, 2013; Solomon C., T. Breckon, Fundamentals of

Digital Image Processing: A Practical Approach with Examples in Matlab, Wiley, 2011; Parker J. R., Algorithms for

Image Processing and Computer Vision, Wiley, 2010; Nixon M., Feature Extraction & Image Processing for Computer

Vision, Academic Press, 2010; Marques O., Practical Image and Video Processing Using MATLAB, Wiley-IEEE

Press, 2011; Russ J., The Image Processing Handbook, CRC Press, 2011; Burger W., M. Burge, Principles of Digital

Image Processing: Core Algorithms, Springer, 2009.


45


Name of the course:

Information Systems


Type of teaching:


Lessons per week:



LECTURER:

Assoc. Prof., PhD Roumen Trifonov (FCSC), tel.: 965 2838, e-mail: [email protected]


COURSE STATUS IN THE CURRICULUM: Obligatory subject „ nformation Systems” for the

students of specialty Computer Science and Engineering in the bachelor programme of the Faculty

of Computer Systems and Control at TU-Sofia.


with the theory and practice for design and development of information systems and Data Bases and

with new trends in the domain. This will help them in future to professionally to know and apply

the basic methods for development of information model and languages for model presentation;

phases and methods for design and development of information systems, different information

system architectures;

DESCRIPTION OF THE COURSE: The course discusses the problems concerning Information

model, Description levels of information models, Basic conceptual models – Hierarchical model,

Network model, Rational model, Object-Oriented model; Design of Data Bases, description

languages of conceptual data model - E-R, ORM, UML; Phases of design – Survey of the current

statement, Data modelling, Business rules, Functional constraints, Processing, External models,

Model verification; Architectures of information systems, Client-Server, Three-layered architecture,

WEB-based application; Contemporary Data Bases, Distributed Data Bases, Data Warehouses;

Data Analysis. The laboratory work helps to better rationalization of lecture material and contribute

to formation of practical skills.

PREREQUISITES: Basic knowledge in Programming and Data Bases.


materials; laboratory work (based on instructions) with computer.

METHOD OF ASSESSMENT: written examination at the end of the semester.


BIBLIOGRAPHY:

1. Jan Speelpenning, Data Modeling and Relational Database Design, ORACLE Edition, 2011

2. http://troels.arvin.dk/db/rdbms/links/;


http://troels.arvin.dk/db/rdbms/links/

46


Name of the course

Multimedia Systems


Type of teaching:

Lectures and Laboratory work

Lessons per week:



LECTURER: Assoc. Prof. Ph.D. Milena Lazarova (FCSC), tel. 965-3285, email: [email protected]


COURSE STATUS IN THE CURRICULUM: Compulsory course for the “bachelor” degree

students in specialty “Computer science and engineering” in Faculty “Computer systems and

control”, TU-Sofia.

AIMS AND OBJECTIVES OF THE COURSE: The course aims to introduce students to the

approaches, methods and tools for the creation and processing of various types of media

information, including images, sound and video.

DESCRIPTION OF THE COURSE: The main topics concern: overview of computer multimedia

– introduction, definitions, classification; of multimedia computer system structure; devices for

input of multimedia information; devices for output of multimedia content; multimedia projects –

development principles; stages of creating a multimedia product; presentation of multimedia

information – images, audio and video data; images – file formats, vector and raster images,

compression, means for processing graphics images; audio information – file formats, compression;

means for audio processing; video data – file formats, compression; means for video processing;

synchronization of multimedia flows.

PREREQUISITES: Mathematics; Computer Periphery; Programming Languages and

Programming Environments.

TEACHING METHODS: Lectures, using slides, case studies, demo programs and multimedia

presentations, course works assignments

METHOD OF ASSESSMENT: final exam.


BIBLIOGRAPHY: Savage M., K. Vogel, An Introduction to Digital Multimedia, Jones & Bartlett

Publishers, 2013; Campbell R., Ch. Martin, B. Fabos, Media Essentials: A Brief Introduction, Bedford/St.

Martin's, 2012; Adobe Creative Team, Adobe Flash Professional CS6 Classroom in a Book, Adobe Press,

2013; Osborn J., AGI Creative Team, Adobe Flash Professional CS6 Digital Classroom, Wiley, 2012;

Roberts-Breslin J., Making Media: Foundations of Sound and Image Production, Focal Press, 2011; Rogers

Y., H. Sharp, Jenny Preece Interaction Design: Beyond Human - Computer Interaction, Wiley, 2011;

Musburger R., Single-Camera Video Production, Focal Press, 2010; Alten S., Recording and Producing

Audio for Media, Cengage Learning, 2011; Owens J., G. Millerson, Video Production Handbook, Focal

Press, 2011; Ulrich K., Flash Professional CS6: Visual QuickStart Guide, Peachpit Press, 2012; Labriola M.,

J. Tapper, Adobe Flex 4.5 Fundamentals: Training from the Source, Adobe Press, 2011.


47


Name of the course

Business Economics

Code: BCSC58-2 Semester: 8

Type of teaching:


Lessons per week:



LECTURER:

Prof. Dr Ognyan Andreev (Faculty of Management)

tel.: 965 2672, email: [email protected]


COURSE STATUS IN THE CURRICULUM: Optional Managerial course for the students of

specialty Computer Science in the bachelor programme of the Faculty of Computer Systems and

Control.

AIMS AND OBJECTIVES OF THE COURSE: Teaching in the discipline of Economy provides

the students with knowledge on the functioning of enterprises under market conditions. This enables

fast and competent solving of problems related to economy of management of business

organizations.

DESCRIPTION OF THE COURSE: The teaching course provides basic The firm – the main

economical subject in the business activity, Function of the firm in the market condition, Business

policy of the firm, Resources of the firm, Production outcomes and working capacity, Expense and

prices of the production, Placement of the production, Incomes, Finance and financial analysis

PREREQUISITES: Technological Practice, Mathematics & Statistics.

TEACHING METHODS: Lectures, using laptop and multimedia projector, case studies, seminars

and team work.

METHOD OF ASSESSMENT: Final E am in the end of semester (8 %), students’ work and

performance during the semester (20%).


BIBLIOGRAPHY: Rickett Martin, Economics of Business Enterprise, Eduard Elgar Publishing, Davenport, H., The Economics of Enterprise, New York, 2009;


48


Name of the course

Virtual Reality


Type of teaching:


Lessons per week:



LECTURER:

Prof. Ph.D. Eng. Stoyan Maleshkov (FKSU) – tel.: 965 2052, email: [email protected]


COURSE STATUS IN THE CURRICULUM: Compulsory for students of the specialty Computer

Science taught in English language, Bachelor of Engineering Programme, Department of

Programming and Computer Technologies.

AIMS AND OBJECTIVES OF THE COURSE: The basic objectives of the course are to study

the methods of modelling and editing of geometric objects with complex shape and hierarchical

structure and mastering the principles and techniques of visualization with specialized computer

systems. Fundamental knowledge and abilities for solving specific problems with the use of

advanced software products are developed.

DESCRIPTION OF THE COURSE: At the end of the course the students will be acquainted with

the principles and methods for building-up and for visualization of geometric models in virtual

reality systems, will develop knowledge and abilities for describing and applying advanced

materials, lights and cameras in virtual reality systems, will have knowledge of interaction

techniques with virtual worlds in web environment and will gain practical skills in designing and

implementing applications for controlling the visualization and the interaction with the used in

virtual reality systems.

PREREQUISITES: Mathematics, Software Engineering, Analysis and Design of Algorithms, Computer Graphics.

TEACHING METHODS: Lectures, given using digital projector and laboratory work with

individual assignments developed in team.

METHOD OF ASSESSMENT: Two hours exam at the end of the semester and assessment of the individual assignment developed in team in the framework of the laboratory work.


BIBLIOGRAPHY: 1. Lecture Notes; 2.Grigore Burdea, Philippe Coiffet: Virtual Reality Technology,

Second Edition, John Wiley & Sons, 2003; 3. Sherman, . R., А. Craig, Understanding irtual Reality:

Interface, Application, and Design, The Morgan Kaufmann Series in Computer Graphics, 2002; 4. by

Craig, A., W. R. Sherman, J. D. Will, Developing Virtual Reality Applications: Foundations of Effective

Design, Morgan Kaufmann, 2009; 5. Alan B. Craig, Understanding Augmented Reality: Concepts and

Applications, Morgan Kaufmann, 2013; 6. Manocha, D., P. Calamia, M, C. Lin, L. Savioja, N. Tsingos,

Interactive Sound Rendering, SIGGRAPH 2009, SIGGRAPH Course Notes, 2009.

(http://gamma.cs.unc.edu/SOUND09/); 7. Otaduy, M., T. Igarashi, J. J. LaViola, Jr., Interaction: interfaces,

algorithms, and applications, SIGGRAPH 2009, SIGGRAPH Course Notes, 2009; 8. Hughes, Andries van

Dam, Morgan McGuire, David F. Sklar. Computer Graphics: Principle and Practice, 3-rd Edition, Addison

Wesley, 2013; 9. Functionality Description of the 3D Studio Max package (Harper, J., Mastering Autodesk

3ds Max 2013, Sybex, 2012.)


49

DESCRIPTON OF THE COUSE

Name of the course:

Marketing in High Technologies

Code: BCSCe58.1 Semester: VI

Type of teaching:

Lectures and Tutorials

Lessons per week:

L - 2 T -2

Number of credits:

5

LECTURER: Prof. Dr. Mladen Stefanov Velev tel.: 02/965 29 94 , email: [email protected]


COURSE STATUS IN THE CURRICULUM: Elective managerial course for the students of

bachelor degree of "Computer Science and Engineering" specialty from the Faculty of Computer

Sciences.

AIMS AND OBJECTIVES OF THE COURSE: Upon competition of the course students will

gain knowledge about the nature and role of marketing in high-technologies management,

competitiveness and the successful activity and growth of firm. The goal of "Marketing in High

Technologies" course is to form in students marketing oriented way of thinking.

DESCRIPTION OF THE COURSE: The course introduces students to basic issues of marketing

policy and practice, main problems of marketing of high technologies, methods and techniques

needed to the marketing activity in firms. Among some of the main topics covered in the course are:

Markets and marketing systems. Marketing management. Marketing concepts. Marketing mix.

Market segmentation. Contemporary tendencies in the development of high technologies and

models for their management. Strategic marketing planning. Information systems in marketing.

Research and development. Closed and open innovations. Role of marketing. Marketing

communications. Functions of advertisement and types of advertisement. Competitiveness and

competitive advantage.

PREREQUISTES: Basic knowledge in Economics, Management, Quantitative methods and

Statistics, Informatics, Computer Systems and other.

TEACHING METHOODS: Lectures, supported by multimedia and tutorials during which case

studies and practical tasks are analyzed and solved.

METHOD OF ASSESSMENT: Written exam at the end of the semester, which constitutes 70%

of the final mark and performance during tutorials and lectures, which constitutes the other 30%.

INSTRUCTION LANGUADGE: English

BIBLIOGRAPHY: 1) Davidow, W. H. Marketing High Technology. An Insiders View. The Free

Press. 2012; 2) Kotler, Ph. et al. Marketing Management. Pearson. 2nd

Ed. 2012; 3) Mohr, J.,

Sengupta, S. and Slater, S. Marketing of High-Technology Products and Innovations. 2nd

Ed.

Pearson Education. Pearson Prentice Hall. 2009; 4) Porter, M. Competitive Strategy: Techniques for

Analyzing Industries and Competitors. Free Press. 2004.

50


Name of the course

Managing High Technologies

Code: BCSC58-3 Semester: 8

Type of teaching:


Lessons per week:



LECTURER:

Prof. Dr Ognyan Andreev (Faculty of Management)

tel.: 965 2672, email: [email protected]


COURSE STATUS IN THE CURRICULUM: Optional Managerial course for the students of

specialty Computer Science in the bachelor programme of the Faculty of Computer Systems and

Control.

AIMS AND OBJECTIVES OF THE COURSE: The goal of the discipline is to establish basic

managerial thinking and abilities. In the end of the semester, the students will be able to:

recognize and use management terminology and methods;

analyze different management issues in the hi-tech field;

competently use and apply the decision making approaches and processes.

DESCRIPTION OF THE COURSE: The knowledge and abilities in the field of management are

vital prerequisites for students’ realization in the practice – in the field of manufacturing and

services – as specialists or managers. Main topics of the course include: Organizational

Environment. Development of Management Theory. Managing Technology-Intensive

Organizations. Managing in an E-Business Environment. Operations Management in Hi-Tech

Sector. Hi-Tech Project Management. Human Resources Management. Financial Management.

PREREQUISITES: Technological Practice, Mathematics & Statistics.

TEACHING METHODS: Lectures, using laptop and multimedia projector, case studies, seminars

and team work.

METHOD OF ASSESSMENT: Final E am in the end of semester (8 %), students’ work and

performance during the semester (20%).


BIBLIOGRAPHY: Davenport, H., The Economics of Enterprise, New York, 2009; Heizer, J. & B.

Render, Principles of Operations Management, 11th

ed., Pearson Education/Prentice Hall, 2014;

Kerzner, H., Project Management: A Systems Approach to Planning, Scheduling and Controlling,

Van Nostrand Reinhold, 10th

ed., McGraw-Hill/Irwin, 2011.


DESCRIPTION OF THE COURSE -...

Documents

Transcript of DESCRIPTION OF THE COURSE -...