Course Catalogue

Course Code: CSE 2201
Course Name:
Algorithms
Prerequisite:
Credit Hours:
3.00
Detailed Syllabus:

Introduction, Growth of Functions, Techniques for analysis of algorithms; Methods for the design of efficient algorithms: divide and conquer, greedy method, dynamic programming, back tracking, branch and bound; basic search and traversal techniques; topological sorting; connected components, spanning trees, shortest paths; Flow algorithms; Approximation algorithms; Parallel algorithms, Lower bound theory; NP-completeness, NP-hard and NP-complete problems.

Course Code: CSE 2202
Course Name:
Algorithms Lab
Prerequisite:
Credit Hours:
1.00
Detailed Syllabus:

Based on theory course.

Course Code: CSE 2203
Course Name:
Computer Organization and Architecture
Prerequisite:
Credit Hours:
3.00
Detailed Syllabus:

Information representation; Measuring performance; Instructions and data access methods: operations and operands of computer hardware, representing instruction, addressing styles; Arithmetic Logic Unit (ALU) operations, floating point operations, designing ALU; Processor design: datapaths - single cycle and multicycle implementations; Control Unit design - hardwired and microprogrammed; Hazards; Exceptions; Pipeline: pipelined datapath and control, superscalar and dynamic pipelining; Memory organization: cache, virtual memory, channels; Concepts of DMA and Interrupts; Buses: overview of computer BUS standards; Multiprocessors: types of multiprocessors, performance, single bus multiprocessors, multiprocessors connected by network, clusters.

Course Code: CSE 2301
Course Name:
Database Management System
Credit Hours:
3.00
Detailed Syllabus:

Concepts of database systems; Data Models: Entity-Relationship model, Relational model; Query Languages: Relational algebra, SQL; Constraints and triggers; Functional dependencies and normalization; File organization and data storage; Indexing: primary and secondary indexes, B+ trees, hash tables; Query optimization; Transaction management; Recovery; Concurrency control; Access control and security; Semi-structured database: XML, XPath, XQuery; Object oriented and object relational databases.

Course Code: CSE 2302
Course Name:
Database Management System Lab
Credit Hours:
1.00
Detailed Syllabus:

Based on theory course.

Course Code: CSE 2303
Course Name:
Automata and Theory of Computation
Prerequisite:
Credit Hours:
3.00
Detailed Syllabus:

Introduction to Automata and Theory of Computation. Finite State Machines. Regular Expressions. Context Free Grammar. Push Down Automata. Turing Machine. Decidable and Undecidable Language.

Course Code: CSE 2305
Course Name:
Operating Systems
Prerequisite:
Credit Hours:
3.00
Detailed Syllabus:

Introduction: What is operating system? History of operating system, Operating system concepts, Operating system structure, Processes and Threads, Interprocess communication, Scheduling, Classical IPC problems, Memory Management, No memory abstraction, Virtual memory, Page replacement algorithms, Design issues for paging systems, Implementation issues, File Systems, Files, Directories, File system management, Input / Output, Principles of I/O hardware, Principles of I/O software, I/O software layers, Disks, Clocks, Thin clients, Deadlocks, Resources Detection, Recovery, Avoidance, Prevention, Virtualization and Cloud.

Course Code: CSE 2306
Course Name:
Operating Systems Lab
Prerequisite:
Credit Hours:
1.00
Detailed Syllabus:

Based on Theory course.

Course Code: CSE 303
Course Name:
Database Management System
Credit Hours:
3.00
Detailed Syllabus:

Overview: Definition of DMBS, types of DBMS, advantage & disadvantages, applications. Data

Model: ER Model, Relational Model Integrates Constraints. FD Constraints. Assertions, figures.

Database Design: Logical database design, physical database design; data storage device & data format.

File organization: Sequential file organization, Indexed file organization, direct file organization; hashing methods searching: sequential search, indexed search; reporting: Simple and complex report.

Relational Database design: Relational model, normalization, relational database design; relational query language: SQL. Query Processing, Query optimization, Database Administration: Functions: Standards, Security integrity, recovery; Concurrency control; coordination’s ; quality control: tuning and performance.

Multiple file databases: General considerations, designing the files, data entry and consistency data updating, tools for complex database manipulations. Object oriented database design.
Other types of DBMS: Network database, hierarchical database, text-oriented database, graphic-oriented database. Real time database intelligent database.

Programming: Common programming applications, important programming attributes: access to database records and fields; sorting searching, transactions among files, procedures and functions, reporting: Standard, complex, customized etc, structured aspects, variables and arrays; Handling database based on relations, network, hierarchical model; Programming projects: Create projects using menu builder, screen builder, form builder, report builder etc. Object oriented database programming.

Course Code: CSE 305 / CSE 306
Course Name:
Algorithms
Prerequisite:
Credit Hours:
3.00
Detailed Syllabus:

Algorithm and complexity, asymptotic notations, orders, designing worst case and average-case. Basic Technique divide and conquer, dynamic programming, backtracking, greedy method, branch and bound, randomization. Data structure search trees, Fibonaaci heaps, union-find problems. Application-string matching, sorting and scorching, combinatorial problems, optimization problems, computational geometric: problems. Graph algorithms, spanning trees, shortest paths, matching, rnin flow, max-flow. NP- completeness. Approximation algorithms.

Pages