Faculty : Faculty of Engineering and Applied Sciences
School : Computer Science and Engineering
Prerequisit Course : No Pre-Requisit Courses
Credit Hours : 3.00
Offered For : Post Graduate
Course Description :
Recursion theory such as Rice's theorem, the fixed point theorem, and the recursion theorem. The degree hierarchy and the concepts of jumps and relative computation. Basic results about the degree hierarchy. Type II Turing machine and the corresponding Type II Theory of Effectivity (computable analysis). Different models of quantum computation.
CSE516 - Complexity Theory
Faculty : Faculty of Engineering and Applied Sciences
School : Computer Science and Engineering
Prerequisit Course : No Pre-Requisit Courses
Credit Hours : 3.00
Offered For : Post Graduate
Course Description :
Introduction to time and space complexity classes and the relations between them. The polynomial hierarchy, alternating time and space complexity classes, non-uniform complexity classes, counting classes, interactive and zero-knowledge proofs, PCP and the hardness of approximation. Introduction to quantum computation, quantum classes, analog complexity classes, algebraic characterizations of complexity classes will be given.
CSE517 - Randomized Algorithms
Faculty : Faculty of Engineering and Applied Sciences
School : Computer Science and Engineering
Prerequisit Course : No Pre-Requisit Courses
Credit Hours : 3.00
Offered For : Post Graduate
Course Description :
Probabilistic inequalities, the minimax principle, limited independence, random walks, Markov chains, randomized approximation algorithms, hashing, randomized algorithms in machine learning, number-theoretic algorithms, and quantum computation.
CSE518 - Advanced Topics in Computer Science and Engineering
Faculty : Faculty of Engineering and Applied Sciences
School : Computer Science and Engineering
Prerequisit Course : No Pre-Requisit Courses
Credit Hours : 3.00
Offered For : Post Graduate
Course Description :
Introduction to molecular biology (cells, DNA, RNA, genes, proteins, transcription translation, amino acids, etc.). Sequence Alignment: Pair-wise and Multiple alignment, Local and Global alignment. Advanced concepts in similarity search. Coding and non-coding RNA molecules. Databases: Understanding, retrieving, and searching. Gene Prediction in Prokaryotes &
Eukaryotes. Profiles, and Motif finding. A Brief introduction to Protein Folding. A Brief introduction to Gene networks. Phylogeny. Microarray Analysis. Exploring bioinformatics software tools. Introduction to Perl scripting language.
CSE601 - Parallel Processor Architecture
Faculty : Faculty of Engineering and Applied Sciences
School : Computer Science and Engineering
Prerequisit Course : No Pre-Requisit Courses
Credit Hours : 3.00
Offered For : Post Graduate
Course Description :
(Prerequisite Topics from ACM/
IEEE Curriculum Recommendation: Programming Fundamentals (Fundamental
Constructs, Algorithmic Problem Solving, Data Structures, Recursion),
Programming Languages, Virtual Machines, Architecture and Organization (Digital Logic And Data Representation, Computer Organization, Memory Architecture, Functional Organization)). Parallel hardware systems: Cache coherence and memory consistency, Communication Interconnects; Parallel runtime systems: Mutual Exclusions, Concurrent Objects, Synchronization operations, Spin Locks and Monitors, Futures, Scheduling and Work Distribution, Virtualization, LargeScale Clusters and Cloud Computing, Transactional Memories.