Computer Science _|_Grafiku i Kurseve

Formimi i pergjithshem: 25 kredite

Lendet Baze: CSE 130, FIZ 151, KIM 143, MAT 154, MAT 155, MAT 175, MAT 263,

Formimi baze: 36 kredite

Lendet Baze: CSE 130, EGR 240, FIZ 151, MAT 175, MAT 263,

Lendet me Zgjedhje: CIT 122, EGR 141, EGR 241, FIZ 152, MAT 185, MAT 385, MAT 390,

Formimi special: 60 kredite

Lendet Baze: CSE 230, CSE 231, CSE 240, CSE 247, CSE 250,

Lendet me Zgjedhje: CN 301, CN 302, CN 303, CN 307, CSE 251, CSE 262, CSE 271, CSE 325, CSE 335, CSE 337, CSE 343, CSE 345, CSE 346, CSE 361, CSE 364, CSE 370,

Pershkrimet e Lendeve

- (3)

CIT 122 - Computer Animation (3)
Computer Graphics and animation is an increasingly critical component of human-computer-interaction, computer games, movie industry, and scientific and engineering visualization. This course covers the fundamental concepts underlying computer graphics, animation, discusses the characteristics and constraints of the different techniques and how they fit together, and teaches students the skills to create animations and computer games.This course is lab-intensive.Offered fall, winter.Satisfies the university general education requirement in the formal reasoning knowledge foundation area.

CN 301 - Fundamental computing algorithms (3)
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 (3)
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 (3)
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 (3)
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

CSE 130 - Introduction to Computer Programming (4)
Introduction to digital computers and algorithmic programming.Topics include:data storage and manipulation, control structures, functions and subprogramming, abstract data types, recursion, and regular expressions. Introduction to object-oriented programming.Students cannot receive credit for both CSE 130 and EGR 141. Offered fall, winter.(Cross-listed with CIT 130).Satisfies the university general education requirement in the formal reasoning knowledge foundation area.

CSE 230 - Object-Oriented Computing I (3)
Introduction to object-oriented computer programming using a high-level programming language. Classes, member functions, inheritance, polymorphism and operator overloading. Design methodologies and introduction to software engineering principles and practices. Basic data structures are introduced.

CSE 231 - Object-Oriented Computing II (3)
A second course in object-orientated programming with emphasis on data abstraction and object oriented design.The basic data structures in computer science, including stacks, queues, files, lists, trees and graphs, are covered in detail.Concepts of design, analysis and verification are discussed in the context of abstract data types.Examples of applications taken from numeric and symbolic domains are used.

CSE 240 - Data Structures (3)
Basic data structures (arrays, pointers), abstract data structures (trees, lists, heaps), searching, sorting, hashing, recursive algorithms, parsing, space-time complexity, data types; data abstraction and algorithms for sorting and searching, application of graph algorithms and combinatorics in programming, NP-complete problems, software engineering and project management, case studies and lab exercises will be implemented using a high level programming language. Prerequisite:CSE 130

CSE 247 - Introduction to Computer Networks (3)
An introduction to networking methodologies, protocols and implementation. Topics covered include topologies, networking hardware, remote network access, security, Internet servers and protocols;including web and mail server setup, firewalls, VPN and router configuration. Hands-on laboratory using various platforms such as Microsoft and Linux Networking systems also using various tools such as ethereal.Prerequisite: CSE 130

CSE 250 - Operating Systems (3)
Basic concepts of operating systems.

CSE 251 - Web Programming (3)
An introduction to web technologies.Topics covered include use of modern web development tools, Hypertext Markup Language(HTML), server-side processing, and client-side processing using languages such as JavaScript. Students will use these tools to create interactive and dynamic web sites. Satisfies the university general education requirement in the knowledge application integration area. Prerequisite for knowledge application:completion of the general education requirement in the formal reasoning knowledge foundation area. Prerequisite: CSE 121 or CSE 130.

CSE 262 - Information and Knowledge Management (3)
Uses the idea of information as a unifying theme to investigate a range of issues in computer science, including database systems, artificial intelligence, human-computer interaction, multimedia system, and data communication. Prerequisites: CSE 130 or CSE 121 or MAT 263

CSE 271 - Information Management (3)
The task of organizing large volumes of information of potentially different kinds is a daunting one. Typically, resolution of the associated problems depends on the use of an underlying database technology, often involving networking. This course addresses both the technical and social issues involved. Prerequisites: CSE 130 or CSE 121 or MAT 263

CSE 325 - Telecommunication (3)
Fundamental concepts and techniques used in transmitting information over wire-line, optical, wireless networks and satellite communication.Concepts in digital modulation and coding theory.Introduction to cables and signals, bandwidth, spectrum, noise, and channel capacity, bit-error rates, spread spectrum communications, modulation and coding, traffic statistics and the theory of space-division and time-division switching networks. Prerequisite: CSE 240

CSE 335 - Programming Languages (3)
Fundamental concepts in programming languages.Several high-level languages are studied in depth and their approaches to the fundamental issues in language design are compared.Issues include:data types and structures, control structures, binding times, run-time, storage organization, flexibility vs.efficiency, compiled vs.interpreted languages, strong vs.weak typing, block structure and scope of names. The 4 Major Programming Paradigms and various multi-paradigm programming languages are discussed. Prerequisite:CSE 130.

CSE 337 - Projektimi i software-ve dhe praktikave (3)
Hyrja ne Inxhinierin software dhe praktika. pikat kryesore perfshijne modelet e proceseve software, manaxhimin e projektit, analizen e kerkesave, sigurine dhe cilesine e software dhe testimin e sistemit.

CSE 343 - Theory of computation (3)
Metodat formale ne llogaritje, duke perfshire automatat me gjendje te fundme, automatat pushdown dhe makinat Turing. Gjuhet regular and context-free. Modelet llogaritese jane perdorur per te diskutuar problemet e llogaritshmerise.

CSE 345 - Database Design and Implementation (3)
Introduction to the design and implementation of database systems.Topics include designing a practical database for an application using normal forms, understanding relational database schemas, planning and implementing a database using software such as MySQL, Oracle or Microsoft SQL Server, advanced database topics in redundancy, replication, load balancing, compatibility, ODBC and JDBC, and database systems administration.(Cross-listed with CIT 345).Prerequisite: CSE 240.

CSE 346 - Information Organization and Retrieval (3)
Advanced techniques for information management. Analysis of advanced indexing structures. Information retrieval, feedback strategies, text searchings, automatic indexing. Database query optimization and system support. Web based retrieval. Prerequisite: CSE 345.

CSE 361 - Design and Analysis of Algorithms (3)
Fundamental computing algorithms, Computer algorithms, their design and analysis. Strategies for constructing algorithmic solutions, including divide-and-conquer, dynamic programming and greedy algorithms. Development of algorithms for parallel and distributed architectures. Computational complexity as it pertains to time and space is used to evaluate the algorithms. A general overview of complexity classes is given. Offered fall, winter.Prerequisite: CSE 240

CSE 364 - Computer Organization (3)
Digital logic and digital systems, Machine level representation of data, Assembly language and Assembly level machine organization, Memory system organization and architecture, Interfacing and communication, Functional organization, Multiprocessing and alternative architectures, Architecture for networks and distributed systems. Prerequisite: CSE 240

CSE 370 - Introduction to Intelligent Systems (3)
This course covers the core topics of Artificial Intelligence, namely: agents and environment, search, knowledge representation, reasoning, and learning. The last 3 topics are covered using logic as the common formalism for coherence. The course introduces a broad range of basic concepts, terminology, and applications, in addition to providing some specific, widely applicable methodologies. Prerequisites: CSE 240

EGR 141 - Zgjidhja e problemeve ne inxhinjeri (3)
General methods of problem solving and principles of algorithmic design using a high-level language such as Visual Basic .NET. Introduction to MATLAB. Applications will be drawn from problems in mechanical, electrical and computer engineering and computer science. Offered fall, winter.

EGR 240 - Elektronika (3)
An introduction to the fundamentals of electrical and computer engineering; DC and AC circuits; transient analysis of first-order circuits, digital logic circuits, combinatorial logic design, sequential circuits, introduction to electronics, operational amplifiers, DC electromechanical machines. Laboratory. Offered fall, winter.

EGR 241 - Elektronika Dixhitale (3)
Nnjohurite baze per qarqet e Elektronikes Dixhitale sic jane portat logjike, qarqet kombinatoriale dhe sekuenciale si dhe parimet kryesore te veprimit te tyre.

FIZ 151 - Hyrje ne Fizike I (4)
Mekanika klasike dhe termodinamika .Per studentet e shkencave dhe te inxhinierise. Studentet duhet te ndjekin tre seanca te laboratorit te edukimit te pergjithshem gjate semestrit. Ky kurs synon pervetesimin e fenomeneve , koncepteve dhe ligjeve te mekanikes klasike dhe termodinamikes dhe motivimin e studenteve permes shembujve praktik nga jeta e perditshme qe demonstrojne rolin e fizikes ne disiplina te tjera si: inxhinieria, kimia , mjekesia, etj. Permbush kerkesat e edukimit te pergjithshem universitar ne shkencat natyrore dhe njohurite teknologjike ne fushat e kerkimit.

FIZ 152 - Hyrje ne Fizike II (4)
Synimi i ketij kursi eshte aplikimi i koncepteve dhe modeleve te mesuara ne kursin e Hyrjes ne Fizike I per te kuptuar konceptet e reja dhe parimet e elektromagnetizmit, optikes dhe fizikes modern ; analizimi i situatave fizike dhe aplikimi i nocionve te mesuara ne kurset e matematikes; njohja e aplikimeve te njohurive te fizikes ne shkencat e tjera ;pajisja e studenteve me nje njohje te qarte dhe llogjike te koncepteve baze dhe ligjeve te fizikes .Permbush kerkesat e edukimit te pergjithshem universitar ne shkencat natyrore dhe njohurite teknologjike ne fushat e kerkimit. Parakusht per aplikimet e njohurive ne fushen e integruar : kompleton kerkesat e edukimit te pergjithshem ne shpjegimin e qarte te njohurive themelore ne shkencat natyrore dhe njohurite teknologjike.

KIM 143 - Kimi I (4)
Konceptet themelore. Simbolet. Formulat dhe ekuacionet. Stekiometria. Termokimia. Struktura e atomit dhe ligji periodik i elementeve. Lidhja kimike. Struktura e molekules dhe hibridizimi.Gjendja e gazte dhe teoria kinetike. Gjendja e lenget tretesirat, tretesirat koloidale. Kinetika kimike. Ekuilibrat kimike. Konceptet per acidet dhe bazat, ekuilibrat jonike dhe elektrolitet e dobet. Tretshmeria dhe produkti i tretshmerise.Termodinamika kimike. Energjia e lire. Elektrokimia dhe reaksionet redoks. komponimet komplekse.

MAT 154 - Kalkulus I (4)
Konceptet e funksionit, derivatit, rregullat e derivushmerise, integrimi, llogartja e siperfaqeve dhe volumeve, aplikime te ndryshme te kalkulusit ne inxhinjeri, ekonomi, finance, shkenca shoqerore, etj. Ploteson kerkesat e te gjitha programeve per nje formim te pergjithshem.

MAT 155 - Kalkulus II (4)
Rregullat dhe teknikat e integrimit, vargjet dhe serite, integralet e pacaktuara, dhe aplikimet e tyre ne industri dhe ekonomi.

MAT 175 - Algjeber Lineare (3)
Studimi i hapesirave te pergjithshme vektoriale, sistemeve lineare te ekuacioneve, transformimeve dhe kompozimeve lineare, eigenvalues, eigenvectors, diagonalizimi, modelimi dhe ortogonaliteti. Siguron nje kalim ne matematiken formale.

MAT 185 - Ekuacione Diferenciale (3)
Nje hyrje ne metodat baze te zgjidhjes se ekuacioneve diferenciale te zakonshem, perfshire metodat e koeficenteve te pacaktuar, variacioni i parametrave, serite, transformimet e e Laplasit dhe metodat numerike. Ekuacionet me variable te ndashem, homogjene dhe lineare. Aplikime.

MAT 263 - Matematike Diskrete (3)
Koncepte dhe metoda te matematikes diskrete me nje rendesi te aplikimeve te tyre ne shkencat kompjuterike. Logjika dhe vertetimet, bashkesite dhe relacionet, algoritmet, induksioni dhe rekursioni, kombinatorika, grafet dhe pemet.

MAT 385 - Teori Algoritmesh (3)
Introduction to algorithms and its importance, mathematical foundations: growth functions, complexity analysis of algorithms, summations, recurrences, sorting algorithms design and analysis: Insertion sort, divide and conquer, merge sort, heap sort, radix sorting. Hash table, B trees, Binomial Heaps, Fibonacci Heaps. Dynamic Programming: Introduction, Matrx chain multiplication, Greedy Algorithms. Elementary Graph algorithms: Minimum spanning trees, Single source shortest path, all pair shortest path. String matching: Robin – Karp algorithm, Knuth – Morris Pratt algorithm, Algorithm for parallel computers, parallelism, the PRAM models, simple PRAM algorithms. P and NP Class, some NP – complete problems.

MAT 390 - Teori kodesh (3)
Communication processes. Channel matrix. Probability relation in a channel. The measure of information. Entropy function – Properties of entropy function. Channel capacity. Special types of channels. Binary symmetric channel. Encoding. Block code. Binary code. Binary Huffman code. Shannon – Fano Encoding procedure. Noiseless coding theorem. Shannon’s first theorem. Error – correcting codes. Examples of codes. Hadamard matrices and codes. Binary Colay code. Matrix description of linear codes. Equivalence of linear codes. The Hamming codes. The standard array. Syndrome decoding.