Review of Binary number system, Boolean algebra, Simplification of Boolean Functions, Logic gates, Combinational Logic, Arithmetic and Comparator Circuits, Encoders and Decoders, Multiplexers and Demultiplexers, Flip-Flops, Sequential Logic, Registers, Counters, Programmable Logic devices. The course includes lab works based on theory taught.
Course Catalogue
Course Code: CSE 211
Course Name:
Digital Logic Design
Credit Hours:
3.00
Detailed Syllabus:
Course Code: CSE 2200
Course Name:
Design Project-I
Credit Hours:
1.00
Detailed Syllabus:
Based on object oriented programming.
Course Code: CSE 2201
Course Name:
Algorithms
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
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.