Shkencat Kompjutacionale _|_Grafiku i Kurseve

Formimi i pergjithshem: 0 kredite



Formimi baze: 48 kredite



Lendet me Zgjedhje: CN 300, CN 301, CN 302, CN 303, CN 307, CN 309, CN 399, CN 400, CN 402, CN 508,


Formimi special: 0 kredite




Pershkrimet e Lendeve

- (0)

CN 300 - Numerical Analysis (8)
Building upon calculus and computer programming, the course covers basic numerical methods, including linear and nonlinear algebraic equations, interpolation and approximation, ordinary differential equations, numerical integration and differentiation, finite element and perturbation. Development of numerical algorithms to provide solutions to common problems formulated in science and engineering. Develop the basic understanding of the construction of numerical algorithms, the applicability and limits of their appropriate use. Numerical algorithms, standard algorithms for numerical computation such as: root finding for nonlinear equations, interpolation and approximation of functions by simpler computational building blocks (for example - polynomials and splines). numerical differentiation and divided differences numerical quadrature and integration, numerical solutions of ordinary differential equations and boundary value problems; Prerequisite:Major standing in CS.

CN 301 - Fundamental computing algorithms (8)
Simple numerical algorithms Sequential and binary search algorithms Quadratic sorting algorithms (selection, insertion) O(N log N) sorting algorithms (Quicksort, heapsort, mergesort) Hash tables, including collision-avoidance strategies Binary search trees Representations of graphs (adjacency list, adjacency matrix) Depth- and breadth-first traversals Shortest-path algorithms (Dijkstra's and Floyd's algorithms) Transitive closure (Floyd's algorithm) Minimum spanning tree (Prim's and Kruskal's algorithms) Topological sort, Prerequisite:CSE 240.

CN 302 - Cryptographic algorithms (8)
Historical overview of cryptography Private-key cryptography and the key-exchange problem Public-key cryptography Digital signatures Security protocols Applications (zero-knowledge proofs, authentication, and so on); Prerequisite:Major standing in CS.

CN 303 - Geometric algorithms (8)
Topics: Line segments: properties, intersections Convex hull finding algorithms, Geometric Duality, Linear Programming, various geometric algorithms such as :The closest pair problem: plane sweep algorithms, etc; Prerequisite:Major standing in CS.

CN 307 - Computational Linguistics (8)
Using the world wide web and other internet-based electronic resources, using text, lexical, and speech corpora and databases, using computers in linguistic experiments (including phonetic and perceptual experiments), basic principles of computational phonology, morphology, syntax, and semantics, computational techniques for statistical analysis, tokenization, part-of-speech tagging, context-free grammars for natural language, parsing techniques. Cross-listed as CSE 344, Prerequisites: CSE 370

CN 309 - Special Topics in Computational Sciences (8)
Nje kurs i avancuar ne nje disipline shkencore llogaritese te till si Algjebra Llogaritese, Gjeometria Llogaritese, Biologjia Llogaritese, etj.

CN 399 - Special Topics in Computational Science (8)
A variety of advanced topics within Computational Science. Subject areas discussed in any particular semester will depend upon the interests of both the students and the instructor. Students should check with the Department of Computing and Information Science to determine what topic will be offered during specific semesters and which prerequisites, if any, are appropriate.

CN 400 - Independent Research in Computational Science (10)
A variety of advanced topics within Computational Science. Subject areas discussed in any particular semester will depend upon the interests of both the students and the instructor. Students should check with the Department of Computing and Information Science to determine what topic will be offered during specific semesters and which prerequisites, if any, are appropriate.

CN 402 - Cryptographic algorithms and information security (10)
Structure of the integers,prime factorization,congruences, multiplicative functions,primitive roots and quadratic reciprocity,and selected Applications (zero-knowledge proofs, authentication, Private-key cryptography and the key-exchange problem, Public-key cryptography, Digital signatures, Security protocols); Prerequisite:Major standing in CS.

CN 508 - Advanced Data Structures (10)
Topics: Randomized Trees, Fractional cascading, Persistence, Entropy, working sets and doubly-exponential series, Self-adjusting data structures, Searching in integer universes, Hash tables, Data structures for strings, Deliberate imbalance, Decomposeable search problems, Data structures for trees Prerequisite: CN 301 or CSE 240.