Advanced level thermodynamics, entropy, free energy, physical conversion of pure Materials and mixtures, phase rules and phase diagrams, chemical equilibrium, electrochemistry, chemical reaction rate, complex reaction kinetics, molecular reaction Dynamics, statistical thermodynamics, molecular structures.

Structures of inorganic and organometallic compounds at advanced level, chemical bond theories, group theory, ligand field theory, synthesis mechanisms in inorganic chemistry, acid-base reactions, crystal field theory, coordination chemistry.

Materials for biomedical applications; synthetic polymers, metals and composite materials as biomaterials; biopolymers, dendrimers, hydrogels, polyelectrolytes, drug delivery systems, implants, tissue grafts, dental materials, ophthalmic materials, surgical materials, imaging materials.

SEMINAR

Basics of grammar and vocabulary, listening, and speaking. Readings include newspapers, poems, and authentic documents. Language labs using multimedia systems are part of the language courses.

Basics of grammar and vocabulary, listening, and speaking. Readings include newspapers, poems, and authentic documents. Language labs using multimedia systems are part of the language courses.

Responsible leadership considering a wide range of stakeholders. Panel discussions on different sectors. Examining global leadership in relation to people, profit, and planet. Case studies on responsible leadership in global organisations.

Building efficient and effective organizations in multinational companies in order to realize the company’s international strategic objectives. Addressing global developments and new trends related to disruptive strategy. Cooperating and dealing with people and people related issues in an international context.

COMP 110 is a first course in computer programming. The objective is to introduce the principles of computer programming and algorithm development using Matlab, with particular emphasise on scientific computation and data processing. Topics covered include basic computer literacy and organization; variables, operators, expressions, data types, arrays, matrices; conditional and repetition control statements; modular programming, built-in and user-defined functions; string manipulation; text and binary file processing; structures; debugging; data plotting and visualization; graphical user interfaces.

COMP 110 is a first course in computer programming. The objective is to introduce the principles of computer programming and algorithm development using Matlab, with particular emphasise on scientific computation and data processing. Topics covered include basic computer literacy and organization; variables, operators, expressions, data types, arrays, matrices; conditional and repetition control statements; modular programming, built-in and user-defined functions; string manipulation; text and binary file processing; structures; debugging; data plotting and visualization; graphical user interfaces.

COMP 110 is a first course in computer programming. The objective is to introduce the principles of computer programming and algorithm development using Matlab, with particular emphasise on scientific computation and data processing. Topics covered include basic computer literacy and organization; variables, operators, expressions, data types, arrays, matrices; conditional and repetition control statements; modular programming, built-in and user-defined functions; string manipulation; text and binary file processing; structures; debugging; data plotting and visualization; graphical user interfaces.

This course emphasizes computational thinking and programming using Python. Gain a solid foundation in algorithmic thinking and structured programming, and perform basic, common computational tasks easily and efficiently. Examine the fundamentals of data storage, input and output, control structures, functions, sequences and lists, file I/O, graphics and objects.

Overview of computers, Programming, algorithms, and programming languages. Programming with Python: Data types, variables, operators. Control statements: conditionals, loops, iteration. String manipulation. Functions, recursion, decomposition and abstraction. Tuples, lists, dictionaries. Aliasing, mutability, cloning. Files. Object oriented programming, classes, inheritance. Testing, debugging, exception handling, program efficiency.

Object oriented programming using Java. Data types, expressions, control statements, strings, arrays. Classes, objects, methods, overloading, variable scope, memory. Recursion. Inheritance, polymorphism, abstract classes, interfaces, nested classes, anonymous classes. Exception handling. Strings and regular expressions. File I/O. Generic collections. Generic classes and methods. Lambdas and streams. Event-driven programming. Multithreading.

The aim of the course is to give qualified engineering students a unique opportunity to teach as a part of their undergraduate experience. Students are responsible for teaching sections for the course COMP130 Introduction to Programming. Students cover and teach materials such as functional decomposition, control statements, methods, recursion, strings, arrays, abstract data types, exception handling, graphical user interface and other fundamental elements of modern programming by using the Java language.

The aim of the course is to give qualified engineering students a unique opportunity to teach as a part of their undergraduate experience. Students are responsible for teaching sections for the course COMP130 Introduction to Programming. Students cover and teach materials such as functional decomposition, control statements, methods, recursion, strings, arrays, abstract data types, exception handling, graphical user interface and other fundamental elements of modern programming by using the Java language.

Basic data structures, algorithms, and their computational complexity. List, stack, queue, priority queue, map, tree, balanced tree, hash table, heap, skip list, trie, graph. Basic search, selection, sorting, and graph algorithms. Recursion.

Introduction to operating systems concepts, process management, memory management, virtual memory, input-output and device management, file systems, job scheduling, threads, process synchronization, deadlocks, interrupt structures, case studies of operating systems.

Advanced topics in algorithms, and their computational complexity. Amortized complexity analysis. Randomized algorithms. Greedy algorithms. Dynamic programming. Linear programming. Advanced graph algorithms. Turing machines and models of computation. NP-completeness reductions.

Conceptual and practical aspects of databases and database management systems. Entity-relationship model, relational model, relational algebra, Structured Query Language (SQL), normal forms and normalization, transaction management, scheduling and serializability, concurrency control and locking, indexing, recent trends in databases and NoSQL.

Principles and concepts of distributed systems, middleware, peer-to-peer systems and algorithms, design and implementation issues, virtualization, communication and coordination in distributed systems, logical clocks, causality, distributed mutual exclusion, election algorithms, consistency and replication, consistent global states, fault tolerance, distributed deadlocks, recovery, agreement protocols, distributed transactions, cloud computing.

Principles of computer networks and network protocols; Internet protocol stack with emphasis on application, transport, network and link layers; network edge and network core; client/server and peer-to-peer models; routing algorithms; reliable data transfer; flow and congestion control; protocol design and analysis; network performance metrics; software-defined networks; network programming and distributed applications.