Computer Science and Engineering (CS) 

About | Degree Program | Courses Description | Courses | Research Groups | Graduate Program
 
Show as multiple pages

Computer Science and Engineering (CS)

 

Computer Science is the study of information and algorithms within the context of real and abstract computing devices. Computer scientists are interested in such topics as the representation and storage of information; algorithms to access, display, edit, and transform information; programming languages to express algorithms; and hardware and software processors to execute algorithms. These concerns lead to practical developments in computer systems software, such as operating systems and compilers; in application areas, such as artificial intelligence, computer graphics, and computational biology; and also to theoretical investigations of computers, algorithms, and data.

 

Computer engineering is a closely related field concerned with the design and practical application of computer hardware and software systems to the solution of technological, economic, and societal problems. The computer engineer analyzes a problem and selects from a variety of tools and technologies those most appropriate for its solution. A computer engineer can expect to be involved in hardware design, software creation, and systems integration.

 

After acquiring enough knowledge and experience in computer engineering in the first three years, we motivate our students to engage in industrial training projects. In their fourth year, while taking several elective courses with which they can customize their careers according to their specific interests, they are also expected to propose and realize a graduation project.

 

The graduate of the computer engineering department will gain the following skills:

 

  • Capability to design and analyze application software in terms of both hardware and software aspects and requirements.
  • Capability to use their computer engineering and problem solving skills in real life situations/applications.
  • Capability to acquire knowledge to follow up the developments in Computer Sciences and computer engineering.
  • Excellent verbal and communication skills.

 

 


FENS– Computer Science and Enginnering (CSE) Undergraduate Program

Course Group

ECTS Credits

Course Code and Name - Explanations

ECTS Credits

Pre-requisite (*)

UNIVERSITY COURSES

60

At least 60 ECTS credits (10 courses) from the courses listed in Table 1 of IUS Academic Regulations. These courses must include Physics and Calculus II

See IUS curriculum for a list of these courses.

In addition the noncredit compulsory courses must be completed as described in Academic Regulations.

FACULTY COURSES

24

At least 24 ECTS credits (4 courses) from FENS faculty courses will be taken, in addition to the required courses.Introduction to Computer Engineering must be taken.

 

REQUIRED COURSES

 

All courses in this list must be taken

 

 

72

MATH 201 Linear Algebra

6

 

MATH 204  Discrete Mathematics

6

 

CS 201 Introduction to Programming          

6

CS 205

CS 204 Advanced Programming

 

6

CS 201

CS 302 Algorithms and Data Structures

 

6

CS 204 

CS 304 Computer Architecture

 

6

CS 201, 303

CS 305 Programming Languages

 

6

CS 204

CS 306 Database Management

 

6

CS 307 Operating Systems

 

6

CS 302, CS 304

CS 308 Software Engineering

 

6

CS 204

CS 303 Logic Design

6

 

MATH 205  Numerical Analysis

6

 

 

AREA

ELECTIVES

 

Minimum 54

ECTS credits

(9 courses)

from this list

of courses

must be taken.

 

Program Coordinator

may propose equivalent courses to replace the courses in

this list with

the approval of

the FENS Dean.

 

 

 

 

54

CS 203 Programming in C

6

CS 201

CS 309 Advanced Logic Design

6

CS 201,303

CS 310 Human Computer Interaction

6

CS 201

CS 401 Advanced Computer Architecture

6

CS 304

CS 402 Compiler Design

6

CS 305

CS 404 Artificial Intelligence

6

CS 302

CS 405 Computer Graphics

6

CS204, MATH201

CS 406 Advanced Computer Graphics

6

CS 405

CS 407 Theory of Computation

6

CS 302

CS 408 Computer Networks

6

CS 204

CS 410 Advanced Algorithm Design and Analysis

6

CS 302

CS 411 Advanced Software Engineering

6

CS 308

CS 412 Web Application Development

6

CS 204, CS 306

CS 413 Multimedia Systems

6

CS 307

CS 414 Computer Vision

6

CS 302

CS 415 Pattern Recognition

6

MATH 201

CS 416 Parallel Processing

6

CS 307

CS 417 Design of Network Protocols

6

CS 408

CS 418 Distributed Operating Systems

6

CS 307

CS 419 Computer and Network Security

6

CS 408 

CS 420 Network Programing

6

 

CS 421 Mobile Programing

6

 

CS 422 Wireless and MobileNetworks

6

 CS 408

CS425 Communication Networks

6

 

BIO 310 Bioinformatics

6

 

EE 431 Digital Signal Processing

6

 

EE 434 Digital Communications

6

 

EE 435 Microprocesssors I

6

 

EE 437 Introduction to Robotics

6

 

EE 438 Introduction to Machine Learning

6

 

IE 407 Management Information System

6

CS204 

DESIGN

PROJECT

12

CS 491 Seminar in Computer Sciences and Eng.

6

 

CS 492 Graduation Project

6

 

IUS  ELECTIVES

18

Minimum of 18 ECTS credits (3 courses) from courses offered by FASS or FEBA degree programs.

INTERNSHIP

 

Must be completed as described in IUS Internship Regulations (total 60 work days).

 

TOTAL

240

240 ECTS credits are needed to graduate as a Computer Science and Engineer.

       

        

        (*)  A prerequisite may only be waived with the joint approval of the Program Coordinator and the Course Lecturer.

         Note: If more than necessary number of courses is taken from any group above, extra courses taken may be accounted from the other group only by the proposal of program coordinator and approval of faculty academic council.

 

Summary Degree Requirements:

 

Course Category

ECTS points

University Courses

60

Faculty Courses 

24

Required Courses

 72

Area Electives

54

Design Project

12

IUS Electives

18

Internship

60 Days

Total

240

 

 

 

 


CS 203 Programming in C

Design and analysis of programs in C. Students are expected to be familiar with structured programming concepts such as loops, conditionals, and primitive data types. Topics covered include pointers, single and multi-dimensional arrays, lists, stacks, queues, trees, and bit manipulation.

 

CS 302 Algorithms and Data Structures

A systematic study of the complexity of some elementary algorithms and data structures, such as: sorting, searching, graphs, trees, and hash tables. The course introduces formal tools for algorithm analysis such as order notation and recurrences, and techniques for efficient algorithm design such as divide and conquer. Emphasis is placed on the notion of abstract data types and comparative analysis of implementation efficiency. High-level programming (in Java or C) can be used throughout the course to illustrate these concepts.

 

CS 303 Logic Design

Number systems and conversion, Boolean algebra, the assertion level concept; minterm and maxterm expansions, Karnaugh maps and Quine McCluskey minimization, combinatorial logic circuit design, NAND and NOR gate based design. State machines and sequential circuits, flip-flops, minimization of state tables, state assignment. Higher-level digital system design using SSI-MSI blocks such as multiplexers/decoders, adders, memory and programmable gate arrays; bus oriented systems. Laboratory includes hardware design and CAD experiments.

 

CS 304 Computer Architecture

An introduction to modern computer architectures, Topics include: assembly language, design of digital logic circuits, organization of central processors (instruction sets, register transfer operations, control, microprogramming data representation, and arithmetic algorithms), memory and input/output organization.

 

CS 305 Programming Languages

This is a course on the principles, fundamental issues, and intrinsic tradeoffs involved in the design and implementation of contemporary programming languages. This includes an overview of the history and evolution of languages, and an introduction to formal methods of language translation. The course focuses on the different programming paradigms (imperative, object-oriented, functional, and logic), and uses languages such as C, C++, Java, Scheme, and Prolog to illustrate key concepts of each paradigm.

 

CS 306 Database Management

An introduction to fundamental concepts in the design and implementation of modern database management systems, with a focus on relational database systems, Topics include: entity-relationship and relational approaches to data modeling, database design theory, structured query processing with the SQL language, storage organization, indexing techniques. In addition to these traditional topics, the course also covers a sample of emerging topics, such as XML, distributed databases, and data mining.

 

CS 307 Operating Systems

This course introduces students to fundamental concepts of operating systems. It emphasizes structures, mechanisms, and principles, as well as key design issues and tradeoffs, behind modern operating systems.  Topics include: processes, synchronizations and concurrency control, memory management, I/O and disk management. The course uses particular implementations of Unix-like and Windows operating systems to illustrate some concepts.

 

CS 308 Software Engineering

State of the art techniques in software design and development, Techniques covered will be illustrated and applied through hands-on laboratory work. Structured design, structured programming, top-down design and development, segmentation and modularization techniques, iterative enhancement, design and code inspection techniques, correctness, and chief-programmer teams, Course includes the development of a large software project.

 

CS 309 Advanced Logic Design

An introduction to the design and implementation of computer logic using methods commonly used in industry, Principles of discrete logic design are presented, including Boolean algebra, truth tables, logic gates, timing diagrams; finite-state machine design, logic optimization using both hand-compiled (Karnaugh maps) and automated techniques, along with the basics of the Verilog hardware description language (HDL). All aspects of logic design will be presented in conjunction with Verilog HDL. Design approaches using families of integrated programmable logic, as well as discrete gate logic will be covered.

 

CS 310 Human Computer Interaction

Human factors issues in the development of software, the use of database systems, and the design of interactive systems. Science base (theories, models, usability studies, and controlled experimentation), and software engineering with user interface development environments, Issues include: programming and command languages; menus, forms, and direct manipulation; graphical user interfaces, computer-supported cooperative work, information search and visualization; input/output devices; and display design.

 

CS 401 Advanced Computer Architecture

Input/output processors and techniques, Intra-system communication, buses, caches, Addressing and memory hierarchies, Microprogramming, parallelism, and pipelining

  

CS 402 Compiler Design

The design and implementation of compiler and run-time systems for high-level languages, and examines the interaction between language design, compiler design, and run-time organization. Topics covered include syntactic and lexical analysis, handling of user-defined types and type-checking, context analysis, code generation and optimization, and memory management and run-time organization.

 

CS 404 Artificial Intelligence

An introduction to areas and issues in artificial intelligence, including search, inference, knowledge representation, learning, vision, natural languages, expert systems, robotics. Implementation and application of programming languages (e.g., Lisp, Prolog, Smalltalk), programming techniques (e.g., pattern matching, discrimination networks), and control structures (e.g., agendas, data dependencies).

 

CS 405 Computer Graphics

A comprehensive introduction to computer graphics modeling, animation, and rendering, Topics covered include basic image processing, geometric transformations, geometric modeling of curves and surfaces, 3-D viewing, visibility algorithms, shading, ray tracing, and animation.

 

CS 406 Advanced Computer Graphics

A survey of state of the art rendering techniques in computer graphics, as well as fundamental and classical topics that are not usually covered in an undergraduate computer graphics course. Topics include: the object orientation of the graphics pipeline and scene graphs, analytical methods in graphics and the implementation of robust geometric algorithms, a survey of both photorealistic and non-photorealistic rendering, as well as recent texture synthesis methods and a survey of the different morphing methods.

 

CS 407 Theory of Computation

An introduction to the fundamental ideas and models underlying computing: finite automata, regular sets, pushdown automata, context-free grammars, Turing machines, undecidability, and complexity theory. 

 

CS 408 Computer Networks

An introductory course about computer networks, The emphasis will be on the basic performance and engineering tradeoffs in the design and implementation of computer networks. Students will learn not only what computer networks are and how they work today, but also why they are designed the way they are and how they are likely to evolve in the future. We will draw examples primarily from the Internet. Topics to be covered include: LAN, congestion/flow/error control, routing, addressing, naming, multicasting, switching, internetworking, quality of service, and network security. There will be both written and programming assignments, and a substantial project involving the design and implementation of a complete protocol stack.

 

CS 410 Advanced Algorithm Design and Analysis

Advanced techniques for the design and analysis of computer algorithms to efficiently solve basic computational problems, The course discusses specific algorithms for many problem areas (searching, sorting, graphs, linear programming, computational geometry, and string matching), as well as general techniques for algorithm design and analysis (dynamic programming, greedy strategy, amortized analysis). It also introduces concept of dealing with hard/intractable problems, namely NP-Completeness and approximation algorithms. A variety of other advanced topics may be covered at the discretion of the instructor, such as parallel algorithms, randomized algorithms, geometric algorithms, low-level techniques for efficient programming, and cryptography.

 

CS 411 Advanced Software Engineering

Advanced methods and procedures for managing medium and large-scale software systems, with emphasis on modern techniques in software development used by practitioners. Topics include project planning, scheduling, cost estimation, project organizational types, staffing and training considerations, leading and motivating computer personnel, and methods for measuring and controlling a project. Students are required to complete a class project.

 

CS 412 Web Application Development

This course will introduce the PHP scripting language. Students will download and install the Apache Web Server, PHP, and MySQL database. In addition, the PHP installation in the SIS labs will be utilized. The course will cover programming concepts, client server architecture, database access and XHTML/Cascading style sheets. Students will write a full scale web application as their final project.

 

CS 413 Multimedia Systems

Multimedia systems, digital video compression techniques, operating system support for digital audio and video, as well as network and transport protocols for multimedia. An emphasis will be placed on current design issues.

 

CS 414 Computer Vision

Image understanding and analysis, study of the underlying image segmentation techniques, object measurements including shape and texture analysis, feature selection and extraction, multispectral image analysis, 3D imaging, computerized tomography, stereometry and stereoscopic imaging.

CS 415 Pattern Recognition

An introduction to basic concepts and classical techniques of pattern recognition, Topics include: Bayes decision theory, parametric and nonparametric classification techniques, discriminant functions, supervised and unsupervised learning, feature selection, neural networks.

 

CS 416 Parallel Processing

Data parallelism, multi-processor architectures, process communication, data sharing, synchronous parallelism, multi-computer architecture, data partitioning, distributed memory, scheduling parallel program, object oriented parallel programming.

 

CS 417 Design of Network Protocols

Methods and solutions in design of distributed application layer protocols: Architecture, ports, layering, protocols, authentication, connection-less and connection-oriented protocols, chaining, referral, multicasting, replication and caching.

 

CS 418 Distributed Operating Systems

Concepts and design of distributed systems, basic distributed algorithms for classical problems such as mutual exclusion and global snapshots, fault tolerance, distributed object-oriented middleware platforms, client/server architecture, underlying communication paradigms and protocols.

 

CS 419 Computer and Network Security

Introduction to Network Security, Hackers and Crackers, Internal Security, Hacking, Spoofing Attacks, Personal Privacy, Firewalls, Vulnerability Assessment Tools (Scanners), Intrusion Detection Systems, Logging Tools, Password Security, Sniffers, Denial-of-Service Attacks, Viruses and Worms, Trojans, Network Architecture Considerations, Secure Application Development, Languages, and Extensions, Wireless Security Auditing, Building Security into the Network, Troubleshooting Tools and Methodology, Cryptography, Firewall Security and Concepts.

 

CS 420 Network Programming

Browsing pages on the Web,  Parsing and rendering HTML,  Sending email with SMTP, Receiving email with POP and IMAP, Writing multithreaded servers,  Installing new protocol and content handlers into browsers,  Encrypting communications for confidentiality, authentication, and guaranteed message integrity, Designing GUI clients for network services, Posting data to CGI programs, Looking up hosts using DNS, Downloading files with anonymous FTP, Connecting sockets for low-level network communication.

 

CS 421 Mobile Programming

WAP, Bluetooth, and 3G: A Brief Introduction, WML and WML Script Programming, Introduction to J2ME, Introduction to MIDP, MIDP 2.0 and the JTWI, Java APIs for Bluetooth Wireless Technology, Writing Quality Code for Smartphones, Making Java Code Portable, Writing Optimized Code, Advanced 3G Programming, Mobile Messaging Applications, Mobile Databases and Synchronization Engines, Mobile Databases for MIDP Devices, XML and Mobile Web Services, Advanced Mobile Security

 

CS 422 Wireless and MobileNetworks

Mobile Agent Platforms and Systems, Mobile Agent-based Service Implementation, Wireless Local Area Networks, Wireless Protocols, Protocols for Wireless Applications, Network Architecture Supporting Wireless Applications, XML, RDF, and CC/PP, Architecture of Wireless LANs, Routing Protocols in Mobile and Wireless Networks, Handoff in Mobile and Wireless Networks, Signaling Traffic in Wireless ATM Networks, Two-phase Combined QoS-based Handoff Scheme

 

 


CS 299

Social, Legal, and Ethical Issues in Computing

CS 201

Introduction to Programming

CS 204

Advanced Programming

CS 302

Algorithms and Data Structures

CS 303

Logic Design

CS 304

Computer Architecture

CS 305

Programming Languages

CS 306

Database Management

CS 307

Operating Systems

CS 308

Software Engineering

CS 312

Web Application Development

CS 313

Theory of Computation

CS 408

Computer Networks

CS 493

Graduation Project I

CS 494

Graduation Project II

CS 402

Introduction to Compilers

CS 403

Distributed Systems

CS 404

Artificial Intelligence

CS 405

Computer Graphics

CS 413

Developing the Interactive Web

CS 414

Computer Vision

CS 415

Pattern Recognition

CS 416

Cryptography

CS 417

Introduction to Data Mining

CS 418 / EE 418

Machine Learning

CS 420

Network Programming

CS 421

Architecture and Implementation of Database Management Systems

CS 423

Parallel Computing

CS 425

Communication Networks

CS 426

Software Engineering II

CS 427

Computer and Network Security

CS 445

Human Computer Interaction

CS 498

Special Topics in Computer Science I

CS 499

Special Topics in Computer Science II


 

Soft Computing Research Group

Social Networks Research Group

Cloud Computing and Mobile Research Group


FACULTY OF ENGINEERING AND NATURAL SCIENCES

 

COMPUTER SCIENCE AND ENGINEERING (CS)

GRADUATE PROGRAM

 

Graduate Admission Criteria

 

The basic admission requirements for entering a graduate program leading to an M.A. or M.Sc. degree at any faculty will be a corresponding B.A or B.Sc. degree with a certain minimal grade point average or higher and satisfactory TOEFL and GRE (Graduate Record Exam) or IUS Graduate Program Entrance Examination Test.

 

The normal period for completion of graduate studies leading to M.A. or M.Sc. degree will be two years or four semesters. The normal requirements for a Master degree will be a successful completion of 30 graduate level credit hours (60 ECTS points) with Cumulative Grade Point Average (CGPA) of 3.0 or higher and a successful completion of the Master's Comprehensive Exam and the Master's thesis, or as prescribed by the faculty.

 

The basic admission requirements for entering graduate program leading to Ph.D. at any faculty will be a corresponding B.A. or B.Sc. degree with grade point average 3.0 or higher, and satisfactory results in TOEFL and/or GRE examinations or the already completed M.A. or M.Sc. degree in the same discipline.

 

The normal period for completion of graduate studies leading to a Ph.D. degree will be five to six years or ten to twelve semesters, respectively four years or eight semesters if the candidate has already completed a corresponding M.A. or M.Sc. degree. The normal requirements for a Ph.D. degree will be a successful completion of a total of 60 graduate level credit hours, including the Master's program courses (120 ECST points) completed at IUS and another accredited university, with the Cumulative Grade Point Average of 3.0 or higher, a successful completion of the comprehensive exams, recommended languages exams and the Ph.D. thesis, as prescribed by each program.

 

Graduate Grading Criteria

 

A student's academic performance in each course will be assessed by the letter grades and the corresponding quality points: A- excellent (4.0), B-very good (3.0), C-good (2.0), D-satisfactory (1.0) in the case of a satisfactory performance. A satisfactory performance in non-credit courses will be graded by a letter S. An unsatisfactory performance will be assessed by F-failing (0.0) or W -withdrawn (0.0), in which cases the student will have to repeat the course. An incomplete performance in case of illness or some other valid reason will be evaluated by I -incomplete (0.0).


 

 

 

 

Grading System

 

 

 

 

Letter Grade

 

 

Coefficient

 

Numeric

Grade

 

 

A

 

 

4.0

 

96-100

 

 

A-

 

 

3.7

 

92-95

 

 

B+

 

 

3.3

 

88-91

 

 

B

 

 

3.0

 

84-87

 

 

B-

 

 

2.7

 

80-83

 

 

C+

 

 

2.3

 

76-79

 

 

C

 

 

2.0

 

72-75

 

 

C-

 

 

1.7

 

68-71

 

 

D+

 

 

1.3

 

64-67

 

 

D

 

 

1.0

 

60-63

 

 

F

 

 

0.0

 

59 and below

 

 

 

A student's overall semestral or cumulative performance will be evaluated by the:

• Grade Point Average (GPA): the semestral sum of (the number of credits multiplied by quality points) divided by the total semestral number of credits taken.

• Cumulative Grade Point Average (CPGA) evaluated as total credits received for all courses from the enrolment divided by the total credits of those courses taken.

 

 

Profile of Graduate Studies

 

In the initial phase of development the IUS will offer graduate education yielding Master of Arts M.A. or Master of Science M.S. degrees and Ph.D. degrees of the following profiles:

 

Master Graduate Programs Profile

 

Profile

Degree in English

Degree in Bosnian

Visual Arts and Visual Communications Design (VACD)

Master of Arts (M.A.)

Magistar umjetnosti

Social and Political Sciences (SPS)

Master of Arts (M.A.)

Magistar društvenih nauka

Economics (ECON)

Master of Arts (M.A.)

Magistar društvenih nauka

Management/Leadership Studies (MAN)

Master of Business and Administration (M.B.A.)

Magistar ekonomije

International and Public Relations (IR)

Master of Arts (M.A.)

Magistar društvenih nauka

Biological Sciences and Bioengineering (BIO)

Master of Science (M.S)

Magistar prirodnih nauka

Computer Sciences and Engineering (CS)

Master of Science (M.S)

Magistar prirodnih nauka

Industrial Engineering (IE)

Master of Science (M.S)

Magistar prirodnih nauka

Microelectronics (EL)

Master of Science (M.S)

Magistar prirodnih nauka

 

 

 

 

 

 

 

Doctoral Graduate Programs Profile

 

Profile

Degree in English

Degree in Bosnian

Visual Arts and Visual Communications Design (VACD)

Doctor of Philosophy (Ph.D.)

Doktor umjetnosti

Social and Political Sciences (SPS)

Doctor of Philosophy (Ph.D.)

Doktor društvenih nauka

Economics (ECON)

Doctor of Philosophy (Ph.D.)

Doktor društvenih nauka

Management/Leadership Studies (MAN)

Doctor of Philosophy (Ph.D.)

Doktor ekonomskih nauka

International and Public Relations (IR)

Doctor of Philosophy (Ph.D.)

Doktor društvenih nauka

Biological Sciences and Bioengineering (BIO)

Doctor of Philosophy (Ph.D.)

Doktor prirodnih nauka

Computer Sciences and Engineering (CS)

Doctor of Philosophy (Ph.D.)

Doktor prirodnih nauka

Industrial Engineering (IE)

Doctor of Philosophy (Ph.D.)

Doktor prirodnih nauka

Microelectronics (EL)

Doctor of Philosophy (Ph.D.)

Doktor prirodnih nauka

 

 

 

 

For all of the above M.A., M.S., and Ph.D. degrees, apart from general degree title, each diploma will include the name of studying program as to define narrow scientific field.

 

 

M.A., M.Sc. and Ph.D. Degrees Requirements and Curriculum

 

The description of the detailed requirements and the curricula for M.A. (M.B.A or M.P.A) and M.Sc. degrees offered during the initial phase of the founding of the University will be specified before the first enrolment of the graduate students in each of the faculties. General graduate study courses fall in the category of either area electives or free electives. The scientific activity of the candidates will also be evaluated and IUS will pay great attention to student scientific activity – research and publications.

 

M.A. and M.Sc. Summary of Degree Requirements

 

Course Category

Credits

ECTS

Credits earned from regular courses level 500 and above

30

60

Master Thesis

15

30

Scientific Activity

15

30

Published papers

                0-15

                      0-30

Conference Papers

                1-10

                      2-20

Research Projects

                1-10

                      2-20

Patents

                0-10

                      0-20

Total

 60

   120

 

 

 

The normal period for completion of graduate studies leading to a Ph.D. degree will be five to six years or ten to twelve semesters, respectively four years or eight semesters if the candidate has already completed a corresponding M.A. or M.Sc. degree. The normal requirements for a Ph.D. degree will be a successful completion of a total of 60 graduate level credit hours including the Master's program courses, (120 ECTS points) completed at IUS and another accredited university, with the cumulative grade point average of 3.0 or higher, a successful completion of the comprehensive exams, recommended languages exams and the Ph.D. thesis, as prescribed by each program.

 

Ph.D. Summary of Degree Requirements

 

Course Category

Credits

ECTS

Credits earned from regular courses level 500 and above

60

120

Credits transferred from completed master studies

                30

                      60

Additional required credits

                30

                      60

Ph.D. Dissertation

30

  60

Scientific Activity

30

  60

Completed Master Thesis

                5

                      10

Published Papers

                3-18

                      6-36

Conference Papers

                3-21

                      6-42

Research Projects

                1-15

                      2-30

Patents

                0-10

                      2-20

Total

 120

   240

 

The tentative lists of some of the 500 and 600 level courses are presented in the Description of the Faculties and Profiles.

 

COMPUTER SCIENCE AND ENGINEERING (CS) Curriculum

 

Course Code

Course Name

Credit

ECTS Points

CS 501

Advanced Data Structures and Algorithms

3

6

CS 503

Theory of Computation

3

6

CS 505

Numerical Methods

3

6

CS 507

Cryptography

3

6

CS 513

Topics in Natural Language Processing

3

6

CS 515

Neural Network

3

6

CS 522

Advanced Topics in Database

3

6

CS 523

Information Retrieval

3

6

CS 531

Parallel Processing and Algorithms

3

6

CS 533

Computer Networks

3

6

CS 534

Distributed Systems

3

6

CS 538

Software Design and Engineering

3

6

CS 541

Multimedia Information Processing

3

6

CS 543

Computer Graphics and Visualization

3

6

CS 545

Human Computer Interaction

3

6

CS 590

Master Thesis

 

 

CS 601

Advanced Computer Vision

3

6

CS 602

Cryptography and Network Security

3

6

CS 603

Advanced Machine Learning

3

6

CS 604

Data Mining

3

6

CS 605

Wavelet and Application

3

6

CS 607

Fuzzy Logic with Applications

3

6

SARA 517

Advanced Mathematics for Engineers and Scientist

3

6

SARA 604

Fuzzy Sets and Fuzzy Linear Programming

3

6

CS 790

PhD Dissertation

 

 

 

Copyright 2004-2010 - IUS Webmaster   International University of Sarajevo Hrasnička cesta 15, 71210 Sarajevo, BiH / Tel:+387 33 957 101/102 - Fax: +387 33 957 105 / E-Mail: info@ius.edu.ba