GRADUATE PROGRAM

All the graduates from the Computer science or the other disciplines satisfying the conditions designated by the Computer Science  program are accepted.  The graduates from the other disciplines must have a B.S. degree.

 LIST OF GRADUATE COURSES

Computer Engineering Department

CS 500 M.S. Thesis (Non-Credit)

CS Object-Oriented Programming Languages and Systems (3-0-0)

CS 511 Discrete Mathematics (3-0-0)

EZ 501 Research Methods (3-0-0)

CS 590 Graduate Seminar (Non-Credit)

CS 590 Graduate Seminar (Non-Credit)

5 elective courses 

 Total minimum credit: 24

Number of creditable courses (min.) : 8 

 DOCTOR OF PHILOSOPHY PROGRAM

CS 502 Analysis of Algorithms (3-0-0)

CS 512 Probability Theory and Stochastic Processes (3-0-0)

EZ 501 Research Methods (3-0-0) (Should be taken, if not taken during MS)

CS 690 Research Topics in CS (Non-Credit)

CS 600 Doktora Tezi (Non-Credit)

5 elective courses 

 Total minimum credit: 21

Number of creditable courses: 7 

GRADUATE COURSES’ CONTENTS

CS 500 M.S. Thesis

Program of research leading to M.S. degree, arranged between a student and the faculty member. Students register to this course in all semesters starting from the beginning of their third semester while the research program or write-up of the thesis is in progress.

CS 501 Object-Oriented Programming Languages and Systems                           (3+0+0) 3

Introduction to object-oriented programming languages, introduction to object-oriented programming, class, object, method, entities, encapsulation, message passing, inheritance, polymorphism, programming with Smalltalk, C++, Java.

CS 502 Analysis of Algorithms                                                                                (3+0+0) 3

Basic concepts in algorithms, mathematical requirements, recursive equalities and inequalities, complexity measurements, O, and other notations. complexity analysis of classical algorithms in different fields, sorting, searching, graphs, mapping, matrix operations, transformations, introduction to NP-C complexity.

CS 503 Programming Languages                                                                             (3+0+0) 3

Brief historical perspective, concept of binding, run-time structure of Pascal-like languages, parameter passing, type constructors, abstract data types, encapsulation, type compatibility, type checking, polymorphism, statement-level control structures, unit-level control structures, coroutines, exceptions, concurrent units, current research issues.

CS 504 Real-Time Programming                                                                             (3+0+0) 3

Real-time software nature, real-time operating systems, real-time communication, job scheduling and resource management, formal methods, programming languages and tools, real-time kernels, Tempo, PSOS+, RT kernel, real-time programming using kernels, design issues.

CS 505 Advanced Topics in Software Engineering                                                  (3+0+0) 3

Project concept, project, definition, project operations, modelling, principles of system engineering, project management techniques, planning, organization, control, evaluation, reporting and delivering the project, cost/advantage analysis, risk analysis, project definition methods, job definition and planning, network planning and PERT, critical path method, resource analysis, estimating the project scope, date and cost, planning probability, project control methods, control points, investigation, modification of control, reporting, subject management, software maintenance concept, life cycle maintenance, CASE tools.

CS 511 Discrete Mathematics                                                                                   (3+0+0) 3

Prime numbers, prime number relativity, mod and congruence relation, Fermat and Chinese remainder theory, product functions, recurrence relations and solution methods, exponential generator function, convolutions, algebraic structures, groups, group codes, chains, Polya counting method, modular arithmetic, Graphs and trees; connection, Euler and Hamilton Graphs, Searching and sorting on trees, relativity.

CS 512 Probability Theory and Stochastic Processes                                              (3+0+0) 3

Probability space and classification of stochastic processes, Markov and half-Markov chains in discrete and continous parameter space, introduction to renewal theory, birth and death processes and queue theory application.

CS 521 Database Management Systems                                                                 (3+0+0) 3

Introduction to database concepts, the theory of relational database model, semantic database models, extended relational data model, deductive database, distributed database, object oriented database and expert database systems, uncertainty in database systems, and other recent research topics.

CS 522 Object-Oriented Database Systems                                                            (3+0+0) 3

Introduction to object-oriented database systems, object-oriented database system manifesto, exodus storage manager, ORION object-oriented DBMS, O2 object-oriented DBMS, R trees, R+ trees and R* trees, implementation issues for object-oriented database systems.

CS 523 Distributed Database Systems                                                                    (3+0+0) 3

An overview of distributed database, a review of databases, concurrency control in centralized DBMSs, concurrency control in distributed databases, serializability theory 3, two phase locking, timestamp ordering serialization, graph checking, time interval technique, optimistic methods, handling replicated data multiversion data, distributed database design, recovery query processing in distributed DBMSs.

CS 531 High Capacity Networks                                                                              (3+0+0) 3

High capacity local area and wide area networks; Fast Ethernet, FDDI, DQDB, introduction to broadband-ISDN and ATM: B-ISDN ATM protocol reference model, ATM switching, switching techniques, single-level and poly-level switches, performance in switches, traffic method, traffic modelization for different source types, service quality, traffic and jammed control and bandwidth method, ATM network management; operation and management techniques.

CS 532 Basic Protocols in Computer Networks                                                       (3+0+0) 3

Routing, optimality principle, finding the shortest path, flooding method, distance vector and network connection algorithms, flow and congestion control, threshold flow design, traffic control, congestion preventing, bridges, routing in internet, OSPF and BGF protocols, point to point transportation, transportation services, TCP  protocol, OSI reference model, ANSI notation, CMIP protocol, SNMP protocol, internet management, network security, basic cryptography, and digital signature.

CS 533 Data Security and Protection in Computer Networks                                (3+0+0) 3

Symmetric ciphers,(classical and modern), Data Encryption Standard(DES), authentication, key management, asymmetric (public key) ciphers, and digital signatures.

CS 534 Cryptograpy                                                                                                 (3+0+0) 3

Introduction, history, classical methods, symmetric algorithms and DES, technical analysis of information. selective topics in number theory, arithmetic algorithms, RSA, El Gamal, digital signature, DSS, protocols, applications.

CS 541 Image Processing                                                                                         (3+0+0) 3

Introduction, image enhancement, contrast and alteration dynamic boundaries, smoothing, image restoration, reducing noise and fuzziness, image coding, sampling, lossless coding methods, Huffman coding, coding methods with loss, transformation coding, mixed-transformation coding, interframe coding, coding based on model, pyramit coding, image seperation, thresholding, defining edges, connecting edges, dividing regions, establishin image in projections, fourier-slice method, filtering and reflecting back method, establishing arithmetic image, binary image processing and parallel algorithms, recognition of image, fourier descriptors, moments, geometric descriptors, model adaptation.

CS 542 Computer Vision                                                                                           (3+0+0) 3

Introduction to computer vision, forming vision, modeling the vision, methods of obtaining vision, low-level problems, smoothing, defining edges, linking edges, multi-scale approaches, medium-level problems, establishing scene, toning, obtaining vision from motion and stereo, range visions, high-level problems, conceptual networks, generalized cylinders and Hough transformation.

CS 543 Pattern Recognition                                                                                     (3+0+0) 3

An introduction to the machine recognition of one, two or higher dimensional patterns, statistical and linguistic approaches, survey of application areas, Bayes Decision Theory, decision boundaries, classifiers and discriminant functions, estimation of parameters, clustering,  feature selection, structural approaches to PR, neural network recognizers, applications.

CS 551 Parallel Processing and Multiprocessor Systems                                         (3+0+0) 3

Introduction to parallel processing, Flynn’s classificaton, gained parameters, UMA, NUMA, COMA models, vector supercomputers and SIMD models, Pram and VLSI models, system interconnection architectures: common way, multi gate memories, crossbar, key module, multi layer interconnection network, rotated network, pocket consistent problem, obsevable way protocols, guide based protocols, hardware based synchronization mechanisms, multicomputer structures, message transmission mechanism, parallelism in programs, program partitioning and job arrangement, program flow mechanisms, vector process principles, multivectoral multiprocessors, chained vector processes, SIMD order, delay and hide techniques, multifibre work principles,  fine grain multicomputers, measurable and multifibre architectures, and Data flow architecture.

CS 552 Parallel Programming                                                                                   (3+0+0) 3

Introduction to parallel programming, application fields, problems related to parallel algorithms: synchronization, communication, critical sections, synchronization mechanisms: semaphores, monitors and the others, verification methods and application examples, communicaiton principles based on message transmission, randezvous structure, parallel programming methods in operating systems, parallel programming languages: CSP, OCCAM, ADA and the others, design and examination of the classical parallel programming algorithm examples.

CS 553 Distributed Computing                                                                                   (3+0+0) 3

Distributed file services, disc service, motion service, classification and catalogue services, OSI file service, deadlock in distributed systems, deadlock sensitive algorithms in central and distributed systems, solving deadlock, resource protection, access supervision approaches, access matrix model, data flow model, security kernel mechanism, distributed matrix access control, distributed security kernel verification, communication security and user authentication, security topics in distributed computer system’s  interprocess communication, digial signatures, security services and mechanismsdağıtılmış in distributed systems, security services in ISO/OSI models.

CS 554 Distributed Operating Systems                                                                      (3+0+0) 3

Introductin to distributed systems, communication in distributed systems, dağıtılmış sistemlerde haberleşme, client-server architecture, remote method calling, synchronization in distributed systems, clock synchronization, Lamport algorithm, Ricart ve Agrawala algorithms, Goscinski distributed synchronized algorithms, distributed system models,  classification services, nmes, paths, adresses, process management in distributed systems,  remote transaction on the processes, emigration of the processes, process emigration mechanism in Demos/MP, resource allocation, resource managers, load sharing algorithms, load balancing algorithms, distributed operating system examples.

CS 561 Artificial Intelligence                                                                                     (3+0+0) 3

Introduction, programming language: LISP: array, tree, heap, queue and table structures, information display: production rules, including hierarchies, propositional account, infeerence rules, frames, semantic networks, restrictions and systematical approaches, search, hypothesis and testing, depth first search, width first search, intuitional search, optimal search, game trees and  reflexive search,  minimax search, alpha-beta reduction, learning description trees, artificial neural networks, perceptrons, genetic algorithms, expert systems, natural language process, speech recognition, computer vision.

CS 562 Expert Systems                                                                                              (3+0+0) 3

Basic Concepts, inference machine, database, data collection, data representation and control, automatic comparison, indefiniteness representation, practical problem solving, practical and theoretical progress in expert systems, known expert system samples, software tools and architecutes for expert system design, and expert system design.

CS 563 Artificial Neural Networks                                                                             (3+0+0) 3

Application fields of artificial neural networks, linear sensors, multi layer sensors, vector quantifiers, radial based function networks, expert mixtures, multiradial based function network, combination of multiexperts, combination of multi learners, comparison of classifying algorithms, genetic algorithms.

CS 571 Object-Oriented Analysis  and Design of the Information Systems             (3+0+0) 3

Analysis and design of information systems, object orientation, object oriented analysis and design of Coad-Yourdon, application of OOD criterion, examination of the other approaches; Booch, Rumbaugh, Shlaer-Mellor ve Jacobsen approaches.

CS 581 Simulation Modelling and Analysis                                                                (3+0+0) 3

Fundamental theoretical concepts of discrete simulation, a selected simulation language to be taught, overview of analog computer simulation, review of basic probability and statistics, selecting input probability distribution, random number generators, output data analysis for a single system, statistical techniques for comparing alternative systems, simulation languages and GPSS.

EZ 501 Research Methods                                                                                   ( 3+0+0 ) 3

It is aimed to improve the students’ ability of thinking and studying scientifically and make them able to use the scientific method by staying away from every sort of prejudice at their studies and researches by this lesson. Method information, which will be able to carry on a research in scientific discipline and reach the conclusion, is given with this aim. Within this scope; the subjects, Information and Its Source, Definition of Science, Its Function and Sorts, Definition of Scientific Method and Its Basic Qualities, Definition of Research, Its Sorts and Qualities, Research Proposal and Report Preparation are discussed. Research subject is also examined in details and studied under the title of The Process and The Techniques of The Research as Introduction, Method, Findings and Interpretation, Abstract, Judgement and Proposals. In the Introduction part; Problem, Objective, Importance, Hypothesis, Restraint and Definitions, in the Method part; Research Model, Universe and Sample, Data and Their Collection, Handling, Solution and Interpretation of Data take place. In a research, content of Findings and Interpretation, Abstract, Judgement and Proposals and ‘how they should be written’ are discussed. Forming Bibliography, Indicating Bibliography, Techniques of Quotation are studied. Discussion of a Research Proposal and a Thesis Proposal which will be prepared by the students. In a scientific article, Title, Authors and their Addresses, Introduction, Short Summary, Material and Method, Conclusions, Writing of Acknowledgement, Forming of the Bibliography and Attribution to the Resources are discussed. How Scanning/Evaluation Article will be written is studied.

CS 590 Graduate Seminar                                                                                         Non-Credit

A senior course for computer engineering design: Engineering design concepts, development of a detailed design for a computer engineering problem and presentation of the results in the form of project reports and seminars

CS 600 Ph.D. Thesis                                                                                                   Non-Credit

Program of research leading to Ph.D. degree, arranged between a student and the faculty member. Students register to this course in the fifth semester while the research program or write-up of the thesis is in progress.

CS 690 Research Topics in CS                                                                                   Non-Credit

To increase the interest of the students for studying in different fields of computer science. Ph.D. students have to take this course and to fullfill te requirements.

CS 8XX Special Studies in CS                                                                                    Non-Credit

The study chosen under the supervision of a faculty member (adviser) of the M.S. student.

CS 8XX Advanced Studies in CS                                                                                Non-Credit

An advanced topic study chosen under the supervision of a faculty member (adviser) of a group of the Ph.D students or an individual student.