**Course Code: **MAT 101

**Course Title: ****Differential and Integral Calculus**

**Credit Hour: **3.00

**Prerequisite:** N/A

**Content**: Functional Analysis and Graphical Information: function, properties of functions, graphs of functions, new function from old, lines and family of functions, Limit: Limits (an informal view), one sided limits, the relation between one sided and two sided limits, computing limits, Continuity: continuity and discontinuity, some properties of continuity, the intermediated value theorem. Derivatives: slop and rate of change, tangent and normal, derivative of a function, physical meaning of derivative of a function, techniques of differentiation, chain rule, successive derivatives. Derivative in graphing and applications: analysis of functions, maximum and minimum, Expansion of functions: Taylor's series, Maclaurian's series, Leibniz; Rolle's and Mean Value theorems, Partials and total derivatives of a function of two or three variables. Different technique of integration: integration, fundamental integrals, methods of substitutions, integration of rational functions, integration by parts, integrals of special trigonometric functions, reduction formulae for trigonometric functions. Definite integrals: general properties of definite integral, definite integral as the limit of sum and as an area, definition of Riemann integral, Fundamental theorem of integral calculus and its applications to definite integrals, determination of arc length, Improper integrals, Double integrals, Evaluation of Areas and Volumes. Introduction to MATLAB and LAB Sessions.

** **

**Course Code: **MAT 102

**Course Title: ****Co-Ordinate Geometry and Linear Algebra**

**Credit Hour: **3.00

**Prerequisite:** MAT 101

**Content**: Coordinate Geometry: Coordinates, polar coordinates, straight lines, Changes of axes, Pair of straight lines, Circle, Parabola, Ellipse, Hyperbola, rectangular coordinate, plane. Vector Analysis: Vector components, vector components in spherical and cylindrical system, vector operators, scalar and dot product, application of vector geometry, Derivative of vector, del, gradient, divergence and curl, physical significance, integration of vector. Line, surface and volume integration, Theorems (Green's, Gauss's, Liouville's, Stoke's) and their applications. Linear Algebra: Systems of Linear Equations (SLE): introduction to SLE, solution of a SLE, solution of a system of homogeneous LE, Gaussian and Gauss-Jordan elimination, Determinants: factorization, determinant, fundamental properties of determinants, minors and cofactors, Cramer's rules for solving a SLE, Algebra of Matrices: Matrix, some special types of matrices, transpose, adjoint and inverse of a matrix, algebraic operation on matrices, quadratic forms solution of a LE by applying matrices, Vector Space: space and subspace, Euclidean n-space, basis and dimension, rank and nullity, Linear Transformations (LT) and its Matrix Representations: LT from to , properties of LT, matrix representation of a LT, diagonalization of LT, Eigen Values and Eigen Vectors: polynomials of matrices and linear operators, eigen values and vectors, diagonalizability, Cayley-Hamilton theorem, characteristic and minimum polynomial Inner Product Spaces: inner product spaces, Cauchy-Schwarz inequality, orthogonality, Gram-Schmidt orthogonalization process, linear functional and adjoint operators, Some Applications of LA.

** **

**Course Code: **MAT 201

**Course Title: ****Differential Equation and Numerical Analysis**

**Credit Hour: **3.00

**Prerequisite:** MAT 102

**Content**: Basic Definitions and Terminology: differential equation (de), classifications of de, formation and solution of a de and further terminology, Ordinary de (ode), des of the first order and first degree: variable separable, homogeneous equations, exact equations, linear equations, Linear Equations with constant coefficients: linear and nonlinear de, solution of linear de, 2nd order des, 2nd and higher order homogeneous des, Method of Variation of Parameter; Method of undetermined coefficients; System of Linear de: operator method matrices and system of linear first order equations, homogeneous linear systems, undetermined coefficients, variation of parameters, Solution by Series. Errors in Numerical Calculations: numbers and their accuracy, errors and their computation, a general error formula, error in a series approximation, Solution of Algebraic and Transcendental Equations: bisection, iteration, false position, Newton-Raphson methods, Interpolation: finite difference, forward, backward and central differences, Newton's formula for interpolation, Stirlings formula, Lagrange's interpolation formula, divided differences and their properties, Numerical Differentiation and Integration, Matrices and Linear Systems of Equations, Numerical Solution of Ordinary Differential Equations.

**Course Code: **MAT 203

**Course Title: ****Mathematical Methods**

**Credit Hour: **3.00

**Prerequisite:** MAT 201

**Content**: Complex Variable: Complex number system. General functions of a complex variable. Limits and continuity of functions of a complex variable and related theorems Complex differentiation and the Cauchy-Riemann equations. Mapping by elementary functions. Line integral of a complex function. Cauchy's integral theorem. Cauchy's integral formula, Taylor's and Laurent's theorems. Singular points. Residue, Cauchy's residue theorem. Evaluating of residues, contour integration, conformal mapping. Laplace Transform: Definition, Laplace transformation of some elementary functions. Sufficient conditions for existence of Laplace transform. Inverse Laplace transforms of derivatives. The unit step function. Periodic Function's. Some special theorems on Laplace transforms. Partial fraction. Solutions of differential equations by Laplace transform. Evaluation of improper integrals. Fourier Series: Definition, Fourier Co-efficient, half-range Fourier Series, Fourier series in different intervals. Fourier Series, convergence of Fourier Series, Fourier Analysis, Fourier integral. Z- Transformation and its application. Application of Laplace Transforms and Fourier series in Circuits. Introduction to MATLAB and LAB Sessions

**Course Code: **STA 206

**Course Title: ****Statistics and Probability **

**Credit Hour: **3.00

**Prerequisite:**

**Content**: Introduction to Statistics: what is statistics, statistical data, statistical methods, scope and limitation of statistics, Populations and Samples, collection and presentation of data, Grouped Data and Histograms, Some Graphical Methods: bar charts, time plots, Pie charts, scatter plots, box and Whisker plots, Measure of Central Tendency: mean, median and mode. Measure of Variations, Measure of Skewness, Moments and Kurtosis, difference between Variation and Skewness. Correlation and Regression Analysis: significance of the study of correlation, types of correlation, difference between correlation and regression Analysis, Sampling and Sampling Distributions, Survey Sampling Methods. Probability: Probability: meaning of probability, classical definition of probability, statistical probability, some theorems in probability, distribution function. Probability distributions: Binomial, normal and exponential distributions.

** **

**Course Code: **PHY 101

**Course Title: ****Physics I**

**Credit Hour: **3.00

**Prerequisite:** N/A

**Content**: Vectors and motions: The SI units, position, displacement, velocity, acceleration, vectors & scalars, adding vectors, components of vectors, unit vectors, projectile motion. Forces: Newton’s laws of motion, friction, Newton’s gravitation, concepts of work & energy, conservation laws, planets & satellites, concepts of equilibrium. Oscillations: Simple harmonic motion, pendulum, resonance, transverse & longitudinal waves, Lissajous’ figures, musical sounds, beats, Doppler effect. **Thermodynamics:** Temperature & heat, Laws of thermodynamics, engines, refrigerators. Electromagnetism: Coulomb’s law, Gauss’ Law, Ohm’s Law, Ampere’s Law, Maxwell’s equations, magnetic materials, corpuscular & wave properties of light**. ****Atomic physics and relativity:** Basic postulates of relativity, relativity of time, length & velocity, a new look at energy, the photoelectric effect, Schrodinger’s equation, Heisenberg’s uncertainty principle, lasers.

** **

**Course Code: **ETE 202

**Course Title: ****Electronic Devices and Circuits I**

**Credit Hour: **3.00

**Prerequisite:** N/A

**Content**: Basic Laws and Theories of Electrical Circuit (Ohm’s Law, KVL and KCL, Current divider and voltage divider rule, Nodal and Mesh Analysis, Superposition Theorem, Source transformation, Thevenin’s theorem, Norton’s theorem, Maximum power transfer theorem), Basic Elements of Electronics (Semiconductor, Diode, Applications), Diodes (Ideal diode, I-V characteristic of a diode, Analysis of diode circuits, Zener diodes, Applications), Clipper and Clamper circuit (Introduction to clipper and clamper circuit, Analysis of clipper and clamper circuit, Applications), Rectifiers (Half wave rectifier, Full wave rectifier, Applications), Bipolar Junction Transistors (BJT) (Basic principles of BJT, Operation of BJT, Analysis of BJT circuits), Biasing of BJTs (Biasing topologies, DC Load line operating point, Fixed bias Configuration, Emitter stabilized bias, voltage divider bias configuration, collector feedback bias configuration, bias stabilization against variation in I CO , V BE & β, Bias compensation, Small signal equivalent circuit), Junction Field Effect Transistors (JFET) (JFET structure and operation, Biasing topologies, Analysis of JFET circuits), MOSFETs (Metal Oxide Semiconductor Field Effect Transistors)( MOSFET structure and operation, Threshold voltage and body effect, V-I characteristic of enhancement type MOSFET, Different MOSFET biasing problem solving)

** **

**Course Code: **ETE 203

**Course Title: ****Electronic Devices and Circuits I Lab**

**Credit Hour: **1.00

**Prerequisite:** N/A

**Content**: Study of the Semiconductor Diode Characteristics, Characteristics of Zener Diode, Study of Half wave and Full wave rectification, Study of Clipping and Clamping Circuits, Common Base Transistor Characteristics, Common Source JFET Characteristics.

**Course Code: **ETE 204

**Course Title: ****Digital Electronics**

**Credit Hour: **3.00

**Prerequisite:** ETE 202

**Content**: Introduction to Digital Electronics and Design Concepts, Introduction to Logic Circuits (Variables and Functions, Inversion, Truth Tables, Logic Gates and Networks, Boolean Algebra, Synthesis Using AND, OR and NOT, NAND and NOR Logic Networks), Optimized Implementation of Logic Gates (Karnaugh Map, Strategy for minimization, Minimization of POS forms), Number Representation and Arithmetic Circuits (Positional Number Representation, Addition of Unsigned Numbers, Signed Numbers, Fast Adders BCD), Combinational Circuits (Multiplexers ( Decoders, Encoders, Code Converters), Sequential Circuits (Flip flops, Registers, Counters, Other Counters), Analog-to-digital conversion (ADC), Digital-to-analog conversion (DAC), Integrated Circuit (IC) logic families: TTL, CMOS and ECL logic families, Memory Devices: ROM architecture, EPROM, EEPROM, ROM applications. RAM architecture, static and dynamic RAM, DRAM structure and read/write operations.

**Course Code: **ETE 205

**Course Title: ****Digital Electronics Lab**

**Credit Hour: ****1**.00

**Prerequisite:** N/A

**Content**: Study of basic logic gates, Design and implementation of combinational logic circuits using basic gates, Design and implementation of adder and subtractor, Design and implementation of combinational logic circuits using MUX, Design and implementation of asynchronous decade up counter including the 7-segment display using JK FFs, Design and implementation of 3-bit synchronous up counter using JK FFs, Implementation of a 4-bit register and shift register using D FFs, Design and implementation of 4-bit ring counter and twisted ring counter using D FFs.

** **

**Course Code: **CSE103

**Course Title: ****Structured Programming**

**Credit Hour: **3.00

**Prerequisite:** CSE101

**Content**: Introduction to Basics of Computer and Programming, C Fundamentals. Introduction to C Programming (input, output, variables, data type, operators, and expressions). Structured Program Development in C: Basic of Flow Chart, Control Statements 1(if, if...else, switch, top-down and stepwise refinement). Program Control: Control Statements 2 (for, do…while, switch, break and continue), Nested Loop, Loop Control Statement (break, continue, goto). Introduction to Functions (Math Library Functions, Function Definitions, Function Prototypes and Argument, Recursive functions, References and Reference Parameters, passing arguments to functions and passing arguments by reference. Introduction to Arrays (Arrays, Declaring Arrays, Examples Using Arrays, Passing Arrays to Functions, arrays of strings), Searching Arrays, Sorting Arrays, Multidimensional Arrays, passing multi-dimensional array directly to function. Pointers (Pointer Variable Declarations and Initialization, NULL Pointer, Passing Arguments to Functions by Reference with Pointers, Pointer Expressions and Pointer Arithmetic, Arrays of Pointers, Function Pointers). Characters and Strings (String Input, String Manipulation, Comparison Functions, Search Functions, and Memory Functions).

** **

**Course Code: **CSE 104

**Course Title: ****Structured Programming Lab**

**Credit Hour: **3.00

**Prerequisite: **CSE101

**Content**: Introduction and Basics. Variables, Datatypes, Operators. Structured Program Development in C: Basic of Flow Chart, Control Statements 1(if, if...else, switch, top-down and stepwise refinement), Program Control: Control Statements 2 (for, do…while, switch, break and continue), Nested Loop, Loop Control Statement( break, continue, goto). Introduction to Functions (Math Library Functions, Function Definitions, Function Prototypes and Argument, Recursive functions, References and Reference Parameters, passing arguments to functions and passing arguments by reference. Introduction to Arrays (Arrays, Declaring Arrays, Examples Using Arrays, Passing Arrays to Functions, arrays of strings), Searching Arrays, Sorting Arrays, Multidimensional Arrays, passing multi-dimensional array directly to function. Pointers (Pointer Variable Declarations and Initialization, NULL Pointer, Passing Arguments to Functions by Reference with Pointers, Pointer Expressions and Pointer Arithmetic, Arrays of Pointers, Function Pointers), Characters and Strings (String Input, String Manipulation, Comparison Functions, Search Functions, and Memory Functions).

**Course Code: **CSE 201

**Course Title: ****Object Oriented Programming**

**Credit Hour: **3.00

**Prerequisite:** CSE103, CSE104

**Content**: Review of Structured programming and Introduction to of OOP. Class, Object, Access modifiers. Methods/functions and function overloading. Constructor and Destructor. Friend function and Friend class. Inheritance and inheritance hierarchies in C++.Polymorphism and Encapsulation. Virtual function, pure virtual Function, Abstract class and file operations.

** **

**Course Code: **CSE 202

**Course Title: ****Object Oriented Programming Lab**

**Credit Hour: **3.00

**Prerequisite: **CSE103, CSE104

**Content**: Class, Object, Access Modifiers, Member function, Inline function, Static Members of a Class, User defined datatype, Scope resolution operator. Constructor and Destructor, Friend function and Friend class. Inheritance. Static and Dynamic Memory Allocation. Pointer in class, Copy Constructor. Polymorphism, Virtual Function, Pure virtual function, Abstract class. Overloading. Preprocessors. Files I/O.

**Course Code: **CSE 203

**Course Title: ****Computer Organization and Architecture**

**Credit Hour: **3.00

**Prerequisite: **N/A

**Content**: Introduction to Computing Organization and Architecture (COA). Processor Technology and performance Trends, Sequential and parallel computing, von Neumann-type computer, Processors, Memory, Performance evaluation. Instruction set architecture (1), Arithmetic logic unit design Machine code instructions, Instruction length, Instruction set, Addressing, CISC and RISC. Memory architecture (1), Memory devices, SRAM, DRAM, Hierarchical structure. Cache memories, Virtual memories. Processor architecture (1), Addition and subtraction, Multiplication, Division, Instruction control, Pipelining, Superscalar, Simultaneous multithreading, Grid and Supercomputer.

**Course Code: **CSE 204

**Course Title: ****Operating Systems**

**Credit Hour: **3.00

**Prerequisite: **N/A** **

**Content**: Introduction to Operating Systems. Basic Unix Command, Vi, Text Editor, Shell Programming. Processes and Threads, Scheduling, Inter-process communication. Deadlocks, Memory Management, File system.

**Course Code: **CSE 205

**Course Title: ****Discrete Mathematics**

**Credit Hour: **3.00

**Prerequisite: **N/A

**Content**: Introduction, Growth of Functions, Divide-and-Conquer. Hash Table, Binary Search Tree. Dynamic Programming, Greedy Algorithm. Graph Algorithms. String Matching, Computational Geometry, NP–completeness.

** **

**Course Code: **CSE 207

**Course Title: ****Data Structures**

**Credit Hour: **3.00

**Prerequisite: **CSE103, CSE104

**Content**: Introduction to data structure. Array and Pointers, Linked List, Sorting & Searching, Stack, Queue, Graph, Tree.

**Course Code: **CSE 208

**Course Title: ****Data Structures Lab**

**Credit Hour: **3.00

**Prerequisite: **CSE103, CSE104

**Content**: Introduction to data structure. Array and Pointers, Linked List, Sorting & Searching, Stack, Queue, Graph, Tree.

**Course Code: **CSE 303

**Course Title: ****Database Systems**

**Credit Hour: **3.00

**Prerequisite:** N/A

**Content**: Introduction to Database Management systems. Relational Databases. Relations, tuples, null values. ER diagrams. Relational Algebra. Structured Query Language. Database design – Normalization. Triggers and indexes. Database security and Different RDBMS.

** **

**Course Code: **CSE 305

**Course Title: ****Algorithms**

**Credit Hour: **3.00

**Prerequisite: **CSE205, CSE207, CSE208

**Content**: Introduction, Growth of Functions, Divide-and-Conquer. Hash Table, Binary Search Tree. Dynamic Programming, Greedy Algorithm. Graph Algorithms. String Matching, Computational Geometry. NP-completeness.

** **

**Course Code: **CSE 306

**Course Title: ****Algorithms Lab**

**Credit Hour: **3.00

**Prerequisite: **CSE205, CSE207, CSE208** **

**Content**: Insertion Sort, Growth of Functions. Divide-and-Conquer: Merge Sort and Quick Sort. Greedy Algorithm. Dynamic Programming. Graph Algorithms.** **

** **

**Course Code: **CSE 307

**Course Title: ****Microprocessor and Interfacing**

**Credit Hour: **3.00

**Prerequisite:** CSE203

**Contents:** Introduction of Microprocessor and its use, Microprocessor and Memory Basics, Computer System Architecture, Types of Microprocessors, 8086 Microprocessor Internal Block Diagram, Register organization in 8086.8086 Microprocessor Register, General Purpose Registers of 8086, Segment Register, Segment: Offset, 8086 Pointer and Index Registers, Overview of 8086 Microprocessor. Binary Math, Signed Unsigned Operations, one’s and two’s complement of number representation. Assembly language programming- Instruction set programming, Instruction formats, addressing modes, instruction set, Simple programs involving logical, branch and call instructions, Sorting, evaluating arithmetic expressions, string manipulations. The Processor Status and the Flags Register, How the Processor Determines That Overflow Occurred, Flow Control Instructions, How the CPU Implements a Conditional Jump, Types of Conditional Jump, Looping Structures. Arrays and Addressing Modes, DUP Operator, Location of Array Elements, Addressing mode of Arrays. String Instructions, Direction Flag, moving a String, store a String, load a String, Scan a String, Compare String. Text & Graphics Programming, Display modes, Kinds of adapter, 16-Color Display, Monochrome Display. Data Communications, serial data transmission, serial communication standards, serial interface implementation. Getting Acquainted with Arduino, Arduino: Buttons, PWM, and Functions, Arduino: Serial Communication and Processing, I2C, Modbus RTU, TCP/TP Communication and SPI Interfaces, Wireless Communication, Arduino: Interrupts and Hardware Handling. How to collect data from external environment via sensors and send/receive data to cloud, learning about python interfacing Program to collect real time, data plotting simultaneously. Project showcasing, demonstrations, produce lab and project reports using appropriate format, grammar, and citation styles for International Journal.

** **

**Course Code: **CSE 309

**Course Title: ****Data Communication and Computer Networks**

**Credit Hour: **3.00

**Prerequisite: **N/A

**Content**: Data representation, Data Flow, Network Criteria, Physical Structures (Type of Network Connections, Physical Topology), LAN, MAN, WAN, ISP, Protocols. OSI Model, Layers in the OSI Model, TCP/IP protocol Suites, Addressing. Physical Layer: Digital and Analog Signals, Periodic Analog Signals, Transmission Impairment, Data Rate Limits, Performance (Bandwidth, Throughput, Delay), Serial and Parallel Transmission. Data Link Layer: Error detection and Correction-Redundancy, Line Coding, Block Coding, CRC; Modulation Techniques, Multiple Access Protocols-Random Access and Channelization. Data Link Layer: Framing, Flow and Error Control, Simplest Protocol, Stop and Wait Protocol, Stop-and-wait ARP, Go-back-N ARP, Selective Repeat ARP, Network Layers-Logical Addressing, IPV4 Addresses, Classful Addressing, classless Addressing, Demonstration of NS-2. Network Security-Privacy, Cryptography, Public Key Algorithm, Management of Public Key, Communication Security, QoS

** **

**Course Code: **CSE 401

**Course Title: ****System Analysis and Design**

**Credit Hour: **3.00

**Prerequisite:** CSE201, CSE202, CSE303

**Content:** System Analysis Fundamentals. System Roles and Development Methodologies. Automated tools for Systems Development. Determining System Requirements and Design Strategies and Information gathering. Project Management: Project Scheduling, PERT Diagram, CPM, DFD. Object Oriented Systems Analysis and Design and UML. Costs and benefits of different approaches to implementing new systems.

**Course Code: **CSE 404

**Course Title: ****Software Engineering**

**Credit Hour: **3.00

**Prerequisite: **CSE401

**Content**: Introduction to Software Engineering as a Discipline. Software Life Cycles. Software Requirement Specification and Analysis. Object Oriented Analysis and Design. Architectural and Design patterns. SQA, Project management, Testing.

**Course Code: **CSE 410

**Course Title: ****Artificial Intelligence**

**Credit Hour: **3.00

**Prerequisite:** CSE305, CSE306

**Content:** Introduction to Artificial Intelligence (AI), history, success and failures, mission and vision. Intelligent Agents. Knowledge and Representation. Expert Systems: General Concepts and Design. The Foundations of Logic, Formalized Symbolic Logic: First Order Predicate Logic (FOPL). AI Languages: PROLOG. Problem Solving by Searching: uninformed & informed searches and Game Theory. Stochastic Searching Tool: Genetic Algorithms (GA). Introduction to Fuzzy Logic and fuzzy systems.

** **

**Course Code: **CSE 412

**Course Title: ****Programming with Java**

**Credit Hour: **3.00

**Prerequisite: **CSE103, CSE104, CSE201, CSE202

**Content**: Introduction to Object Oriented Programming. Basic features of Java. Inheritance, Encapsulation, Abstraction & Polymorphism in Java. Abstract Class, Interface, Overloading, Overriding. Exception Handling, Read and write data using Java streams. Java Collection and Generics. Complete a project with Object Oriented Design in Java.

** **

**Course Code: **CSE 413

**Course Title: ****Programming with Java Lab**

**Credit Hour: **3.00

**Prerequisite: **CSE103, CSE104, CSE201, CSE202

**Content**: Introduction to Object Oriented Programming. Basic features of Java. Inheritance, Encapsulation, Abstraction & Polymorphism in Java. Abstract Class, Interface, Overloading, Overriding. Exception Handling, Read and write data using Java streams. Java Collection and Generics.

**Course Code: **CSE 417

**Course Title: ****Automata and Theory of Computation**

**Credit Hour: **3.00

**Prerequisite:** CSE305, CSE306

**Contents: **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 480

**Course Title: ****Web Technology**

**Credit Hour: **3.00

**Prerequisite: **CSE103, CSE104

**Content**: Introduction to Web Technologies. HTML5, CSS3 with it’s new components. JavaScript, jQuery, AJAX. Data transmission, formats and processes. XML and JSON. Cyber Security and Secured Protocols.

**Course Code: **CSE 402

**Course Title: **Wireless and Mobile Computing

**Credit Hour: **3.00

**Prerequisite: **CSE 412

**Content**: Basic concept of telecomm network and wireless programming, The J2ME architecture, CDLC and KVM, The connected and limited devices configuration, Mobile information device profile, MIDP Programming, Low level user interface API, Event handling, Record management system, Network management, Using push registry in J2ME, SMS programming, .Net framework for wireless programming, Bluetooth and IrDA Communication, Programming PDA

**Course Code: ** CSE 403

**Course Title: **E-Commerce

**Credit Hour: **3.00

**Prerequisite: ** N/A

**Content**: An introduction to e-commerce principles, theories, technologies and applications. This course gives an overview of the impact of new technologies on commercial paradigms and practices, legal issues and business ethics. The course also comprises an advanced managerial issues regarding the use of cutting-edge e-Business applications. It provides students with a deeper understanding of new technologies and recent theory in e-commerce and their implications for e-business thought and practice.

** **

**Course Code: **CSE 405

**Course Title: **Computer Graphics

**Credit Hour: **3.00

**Prerequisite: **MAT 102 & CSE 305

**Content**: Introduction to Graphical data processing, Fundamentals of interactive graphics programming, Architecture of display devices and connectivity to a computer, Implementation of graphics concepts of two-dimensional and three-dimensional viewing, clipping and transformations, Hidden line algorithms, Raster graphics concepts: Architecture, algorithms and other image synthesis methods, Design of interactive graphic conversations.

** **

**Course Code: **CSE 406

**Course Title: **Embedded System Design

**Credit Hour: **3.00

**Prerequisite:** CSE 307

**Contents: **Background, history, classifications, programming languages for embedded systems. Combinational logic and transistors, RT-level combinational and sequential components, customized single purpose processor design. Structure of microcontrollers, CPU, memory and I/O structure, various microcontrollers, ARM. I/O and memory mapping, addressing modes, interrupts and traps, bus protocols, DMA, system bus configurations, RAM, ROM, SDRAM, flash, basic I/O interfaces. Parallel ports, LEDs, pushbutton, keypad, 7-segment display, LCD display, touchscreen, timers and counters, serial Interface, networked embedded systems. C-language primer, state machines, streams, circular buffers. Development environment, hardware/software debugging techniques, performance analysis, use of hardware debugging modules. CPU and hardware acceleration, multiprocessor performance analysis. Design methodologies and flows, requirement analysis, specifications description, system analysis and architecture design, quality assurance.

** **

**Course Code: **CSE 407

**Course Title: **Database Management System-II

**Credit Hour: **3.00

**Prerequisite:** CSE 303

**Content:** Basic Concepts, Ordered Indices, Tree Index Files, Static Hashing, Dynamic Hashing, Comparison of Ordered Indexing and Hashing; Measures of Query Cost, Selection Operation, Sorting, Join Operation, Evaluation of Expressions; Transformation of Relational Expressions, Catalog Information for Cost Estimation, Statistical Information for Cost Estimation, Cost-based optimization; Transaction Concept, Transaction State, Concurrent Executions, Serializability; Lock-Based Protocols, Timestamp Based Protocols; Failure Classification, Storage Structure, Recovery and Atomicity, Log-Based Recovery, Recovery With Concurrent Transactions; Data Mining, Decision tree, Bayes theory, Randomize tree; Database System Architectures: Centralized and Client-Server Systems, Server System Architectures, Parallel Systems, Distributed Systems, Network Types; I/O Parallelism, Interquery Parallelism, Intraquery Parallelism, Intraoperation Parallelism, Interoperation Parallelism; Distributed Data Storage, Distributed Transactions, Commit Protocols; Database Design, Database Tuning Security and Authorization, Multidimensional query.

** **

**Course Code: **CSE 408

**Course Title: **Computer Modeling and Simulation

**Credit Hour: **3.00

**Prerequisite: **CSE 207

**Content**: System Models- Entities, Attributes, States, Activities, Types of Models, Static & Dynamic Models, Deterministic & Stochastic Activities. Principles used in Modeling. System Simulation Continuous & Discrete event simulation Languages- GPSS, SIMULA, CSMP, DYNAMO. Probability concepts in Simulation- Random number, stochastic processes, Birth-Death process. Parameter estimation & input/output validation. Statistical Hypothesis Testing. Queuing Systems, M/M/I & M/M./m queues, Bulk arrival & Bulk service systems. Queuing networks. Computational algorithms & approximation techniques. Workload characterization & performance evaluation of computer systems. Evaluation of program performance. Case studies.

**Course Code: **** **CSE 409

**Course Title: **Advanced Programming Languages

**Credit Hour: **3.00

**Prerequisite: **** **CSE 103, CSE 201

**Content**: This course will cover functional and logic programming, concepts of programming language design, and formal reasoning about programs and programming languages. The topics included are: Functional Programming (ML/OCaml); Small-step and large-step operational semantics; Denotational semantics; Fixpoints, fixpoint induction; Axiomatic semantics; Type theory, Untyped and simply typed lambda calculus; Partial evaluation, non-determinism, Logic programming

**Course Code: **CSE 411

**Course Title: **Compiler Design

**Credit Hour: **3.00

**Prerequisite:** CSE 305 and CSE 207

**Content**: Introduction to Compilers. Lexical analyzer, Regular expression, Non-deterministic finite automata and deterministic finite automata, Context free grammar, Ambiguous grammar, Parsing techniques, Syntax directed translation, type checking. Intermediate code, Symbol table, Data structure for symbol table, Run time storage administration, Error detection and recovery, code optimization, code generation. Use of tools – LEX and YACC. Design of a compiler for a subset of a programming language.

** **

**Course Code: **CSE 414

**Course Title: **Software Quality Assurance and Testing

**Credit Hour: **3.00

**Prerequisite:** CSE 404

**Content:** Software Testing Life Cycle (STLC), SDLC vs STLC; Testing Levels; Testing methods; Testing types: Specification-based vs. code-based, black-box vs. white-box, functional vs. structural testing; unit, integration, system, acceptance, and regression testing; Load, Performance, Stress, Unit Testing; Verification vs. validation; Test planning: scenario, case, traceability matrix; ISO Standards; Agile testing; Testing Estimation techniques; Introduction to software reliability, quality control and quality assurance; Formal verification methods; static and dynamic program verification. Testing Internet Applications - Security and Performance Testing, Debugging, Test Driven Development (TDD), Behavior Driven Development (BDD).

**Course Code: **CSE 415

**Course Title: **Visual Programming

**Credit Hour: **3.00

**Prerequisite: **None

**Content**: Visual user interface, visual specifications, visual reasoning, visual database systems and multimedia computing.

**Course Code: **CSE 416

**Course Title: **.NET Programming using C#

**Credit Hour: **3.00

**Prerequisite: **CSE 412 and CSE 413

**Content**: Overview on C#, .NET and Visual Studio IDE, how to use the Visual Studio .Net IDE, C# Data types and the first basic Console application. Data Types, Common Type System, Type Conversion & Casting, Unboxing, Boxing, Operators, Namespace, Classes & Objects Properties and accessors, new Keyword Method & parameter & return type (value, ref, out type), Constructor, Destructor, Access modifier, Types of class, Encapsulation, Overloading, Inheritance (Single, Multiple), Overriding, Polymorphism (static, dynamic/abstract, sealed, virtual keywords), Array (Multidimensional, Jagged, Array objects, params keyword, passing array to function) Foreach Loop, Strings Class (Basic library functions with reference) , C# - Polymorphism, Compile Time Polymorphism, Run Time Polymorphism, Virtual vs Override vs New, Virtual and Overridden for method overriding, Method Hiding using new Keyword, Combining Method Overriding and Hiding, Sealed Class, Static Class and Static Constructor, Partial Class, Properties and Accessors, C# - Exception Handling, C# - File I/O, Regular Expressions, Introduction to Windows Forms basics, Delegates, Events, Anonymous Methods , Database concepts (MS SQL server). Collections, Generics, how to use SQL Server Management Studio, Windows Form Application with SQL Server Management Studio integration for data manipulation, Problem Solving using windows forms and database, Project showcasing, demonstrations and project reports.

** **

**Course Code: **CSE 418

**Course Title: **Routers and Routing Basics

**Credit Hour: **3.00

**Prerequisite:** CSE 309

**Content: **WANs and Router; Introduction to Routers; Configuring a Routers; Learning about other Devices; Managing Cisco IOS software; Routing and Routing Protocols; Distance Vector Routing Protocols; TCP/IP Suite Error and control messages; Basic Router Troubleshooting; Intermediate TCP/IP; Access control lists (ACLs) ; Case Study: Routing Case Study

** **

**Course Code: **CSE 419

**Course Title: **Management Information System

**Credit Hour: **3.00

**Prerequisite: **N/A

**Content**: Introduction to MIS, Components on IS, Structures of IS, Implementation of different IS, DSS, AIS, Project Planning, Production cycle, Data processing, Processing cycle, etc.

** **

**Course Code: **CSE 421

**Course Title: **WAN Technology

**Credit Hour: **3.00

**Prerequisite: **CSE 309

**Content**: Public data networks, Routing strategies and flow control in packet switch networks, and X.25 standard. Circuit switched data networks and X.21 interface.

**Course Code: **CSE 422

**Course Title: **Systems Programming

**Credit Hour: **3.00

**Prerequisite: **CSE 201, CSE 207** **

**Content**: This is an advanced course in UNIX system facilities. It complements the operating systems course, in that it provides hands-on experience with such facilities as signals, semaphores and file locks. Familiarity with the C language is assumed. About 40% of the course is devoted to UNIX shell programming and some useful utilities like sed and awk. The rest of the course does the UNIX system calls in detail – unbuffered I/O, directories, process creation, signals, pipes, record locks, interprocess communication, terminal handling and some tcp/ip calls.

** **

**Course Code:** CSE 423

**Course Name:** Advanced Computer Architecture

**Credit Hours: **3.00

**Prerequisite:** CSE 203

Pipelined processor design, Cache memory, Memory system design, Concurrent processors, Vector processors and multiprocessors, Array processors, Parallelism in multiprocessors and Multicomputers, Compute-intensive processors and Multicomputers, Automatic Vectorization, Hypercube systems and Key application, Data flow computation.

**Course Code: **CSE 424

**Course Title: **Parallel Programming

**Credit Hour: **3.00

**Prerequisite:** CSE 201, CSE 207

**Content**: PRAMs; machines- SIMD; Numerical methods- matrix operations. PDE solutions; Graph problems- connected components, shortest paths, spanning trees; combinatorial search; the class NP and P-completeness. **Writing distributed programs:** socket related system calls (stream and datagram), Remote Procedure Calls (RPC), Writing network utilities. Using utilities for the development, of distributed programs. Demonstration/ hands-on-experience on the issues involved in managing large network systems. Study of the performance of Ethernet LAN under varying load conditions. PRAMs; machines- SIMD; architectures’ meshes, arrays, hypercubes; basic algorithms- Pointer jumping, prefix computation, Loader election; sorting- Cole’s sorting networks; Numerical methods- matrix operations. PDE solutions; Graph problems- connected components, shortest paths, spanning trees; combinatorial search; the class NP and P-completeness. Socket related system calls (stream and datagram), Remote Procedure Calls (RPC), Writing network utilities. Using utilities for the development, of distributed programs. Demonstration/ hands-on-experience on the issues involved in managing large network systems. Study of the performance of Ethernet LAN under varying load conditions, some important Synchronization problems, language and abstraction mechanism for synchronization, axiomatic verification of mutual exclusion. Communications Networks, Client/server architecture, Logical clocks and ordering of messages. Distributed mutual exclusion and dead lock detection algorithms and their analysis. Agreement protocols’ fail stop and non-fail stop protocols. Backward and Forward error recovery, operation based and state based approach, synchronous and asynchronous check pointing.

**Course Code: **CSE 425

**Course Title: **Peripherals and Interfacing

**Credit Hour: **3.00

**Prerequisite: **CSE 307

**Content**: **Organization of a Microcomputer:**** **Design and operation of Interface between Computer and the outside world; Sensors, transducers and signal conditioning, Interfacing Memory, and 1/0 Devices such as monitors, printers, disk drives and some other smart interface cards; IEEE488 and other buses and interfacing Scientific Instruments. Study of Microcomputer’s Chips, Microprocessor Peripheral Chips. Application to peripheral subsystems-PPI, PIC, DMAC, PCI etc. Interfacing Data Converters, general-purpose programmable peripheral devices, serial I/O and data communication.

**Course Code: **CSE 426

**Course Title: **Advanced Computer Network

**Credit Hour: **3.00

**Prerequisite: **CSE 309

**Content**: Network types, Network protocol hierarchy’s overview of OSI and TCP/IP model? LAN and MAN: Topologies, Bus/ Tree and Star using metallic media, optical fiber bus, the ring topology, Medium Access control protocols CSMA/CD, Token ring and FDDI, MAC performance, LAN/MAN Standards, High Speed LANs, Fast Ethernet, 100VG- any LAN, ATM LAM, Fibre channel, wireless LAN, and Gigabit Ethernet, **WAN:** Public data networks, Routing strategies and flow control in packet switch networks, and X.25 standard. Circuit switched data networks and X.21 interface. **ISDN and Broadband ISDN:** ISDN-Principles, user interface and services, ISDN channels, user access and protocols, Broadband ISDN- functional architecture and protocols. **Frame Relay and Cell Relay:** Frame relay services and protocols, architectures, call control and data transfer, ATM-Overview, virtual channels and paths, ATM cells, header error control, transmission of ATM cells, traffic and congestion control, ATM switches. **Satellites and Cellular Radio:** Geosynchronous and low-orbit satellites, VSATs, protocols for multiple access up-link channel, cellular radio, analog and digital cellular systems, GSM, persona! communication services. **Internetworking:** Network interconnection, bridges and routers, connectionless and connection-oriented Internet working, routing and fragmentation, Firewalls IP protocol rind IP addresses,

Internet control protocols- ICMP, ARP, RARP, multicasting. Domain name system and Name Servers. **Distributed Applications:** Simple Network management protocol, Telnet and FTP, Electronic mail, 1 SMTP and MIME. The WWW-client and servers, writing wave page in HTML and Java, locating information the on the web, video on demand. **Network Security:** Type of attack, privacy with conventional encryption, Message authentication and Hash function public key encryption and digital signature.

**Course Code: **CSE 428

**Course Title: **Enterprise System Design and Development

**Credit Hour: **3.00

**Prerequisite: **CSE 201

** **

**Content**: This module gives an overview of some of the different tiered application architectures (1, 2, 3, N tiers) and some sample designs. The course teaches some of the foundation skills required for building medium to large scale web-based applications, with a B2B e-commerce focus. The course introduces J2EE and Microsoft .NET as two technology architectures for implementing enterprise applications. Java Servlets and Java Server Pages (JSP), Java application servers, integration of data from multiple data sources and distribution of business logic in component-based applications. Multiple application-end delivery formats are considered including web browsers and WAP phones.

** **

**Course Code: **CSE 429

**Course Title: **Digital Image Processing

**Credit Hour: **3.00

**Prerequisite: **CSE 103,104 and MAT 101

** **

**Content**: Introduction to image processing: Image processing applications, image processing goals, image function, image representation, sampling and quantization, gray scale, binary (black and white), and color images, histograms, noise in images. Color image models: RGB, HIS, YIQ models. Image enhancement, convolution and filtering: Point processing, histogram equalization, histogram modeling, and histogram specification, spatial filtering – image smoothing, median filtering Edge detections: Sobel, Prewit, Laplacian and Canny edge detectors Image segmentation: Thresholding Shape detection, image matching and texture: image moments, central moments, moment invariants, template matching, area correlation, texture description, Image morphology: Basic morphological concepts, structuring elements, erosion, dilation, thinning, thickening, opening, and closing operations.

** **

** **

** **

** **

**Course Code: **CSE 430

**Course Title: **Neural Network and Pattern Recognition

**Credit Hour: **3.00

**Prerequisite: **CSE 201

** **

**Content**: Introduction to Neural Network; ANN approach to recognition; ANN models, Design and development of ANN; back propagation model.

Introduction to pattern recognition. General pattern recognition concepts. Statistical pattern recognition. Supervised learning using parametric and non-parametric approaches. Linear discriminant functions and the discrete and binary feature cases. Unsupervised learning and clustering. Syntactic Pattern Recognition: Syntactic recognition via parsing and other grammars, graphical approach to syntactic pattern recognition, learning via grammatical inference. Neural Pattern Recognition: Neural pattern associators and matrix approaches, unsupervised learning in neural pattern recognition.

**Course Code: **CSE 431

**Course Title: **Computational Geometry

**Credit Hour: **3.00

**Prerequisite: **CSE 201

** **

**Content**: Problems in computational geometry, worst case complexity of geometric algorithms; expected complexity of geometric algorithms and geometric probability, geometric intersection problems, nearest neighbor searching, point inclusion problems, distance between sets, polygon decomposition, the Voronoi diagram and other planner graph, updating and deleting from geometric structures.

** **

**Course Code: **CSE 432

**Course Title: **Introduction to Quantum Computer

**Credit Hour: **3.00

**Prerequisite: **N/A

** **

**Content**: Introduction: What is Quantum Computer? Why do we need Quantum Computer? What is the present status of the subject and how far can we go? Definitions of Classical Computer, Quantum Computer and their differences. Introduction to quantum mechanics: Basic ideas of quantum mechanics; Probability interpretation; Measurement problem; Hilbert space; Schrodinger equation, Quantum information: Qubit; Quantum gates; No cloning theorem; Quantum teleportation; Quantum data compression; Quantum cryptography; The universal quantum computer; Universal gate; Church-Turing principle; Quantum algorithms; Simulation of Physical systems; Shor’s factorization algorithm; Grovers’s search algorithm; Experimental quantum information processors; Quantum error correction, Basic ideas of quantum computers and intelligent machines, Summary of entire course and a short of introduction to the present goals of Quantum Computer, tutorial, progamming.

** **

**Course Code: **CSE 433

**Course Title:**

**Credit Hour: **3.00

**Prerequisite: **N/A

** **

** **

**Content**: Introduction to Computer Security, Principles of Modern Cryptography, Network Security, Security Risk Management and Audit, Blockchains and Secure IoT, Data Privacy, Ethical and Legal Aspects of Security,

** **

**Course Code: **CSE 434

**Course Title: **Pattern Recognition

**Credit Hour: **3.00

**Prerequisite: **CSE 410

**Content**: Introduction to pattern recognition: Sensing, Segmentation, feature Extraction, Calssification, post processing, Design Cycle, learning, statistical methods, Bayes theorem, structural methods and hybrid method. Linear Classifier, Perceptron Algorithm, Least Sqaure Method, Non-Linear Classifier, Two Layer Perceptron, BackPropagation Algorithm, Template Matching – Bellman’s Principle, Edit Distance, Correlation Based Measurement, Context Dependent Classification-Bayes Classifier, Markov Chain, Viterbi Algorithm, Non-Parmetric Decision Making, Clustering.

**Course Code: **CSE 435

**Course Title: **Bioinformatics

**Credit Hour: **3.00

**Prerequisite:** CSE 305 and CSE 306

** **

**Contents: **Introduction; Molecular biology basics: DNA, RNA, genes, and proteins; Graph algorithms: DNA sequencing, DNA fragment assembly, Spectrum graphs; Sequence similarity; Suffix Tree and variants with applications; Genome Alignment: maximum unique match, LCS, mutation sensitive alignments; Database search: Smith-Waterman algorithm, FASTA, BLAST and its variations; Locality sensitive hashing; Multiple sequence alignment; Phylogeny reconstruction; Phylogeny comparison: similarity and dissimilarity measurements, consensus tree problem; Genome rearrangement: types of genome rearrangements, sorting by reversal and other operations; Motif finding; RNA secondary structure prediction; Peptide sequencing; Population genetics; Recent Trends in Bioinformatics

** **

** **

**Course Code: **CSE 436

**Course Title: **Introduction to Robotics

**Credit Hour: **3.00

**Prerequisite:** CSE 305 and CSE 306

** **

**Contents: **Basics of Robotics and Linear Algebra, Representing positions and rotations, Rotational transformations and parameterizations of rotations, Homogeneous transformations, kinematic chains and Denavit–Hartenberg (DH) convention, DH convention and forward kinematics, Inverse kinematics and angular velocity, Jacobian, Trajectory design and configuration space, Configuration space with examples and motion planning introduction, Motion planning: potential field and Probabilistic Roadmaps (PRM).

** **

**Course Code: **CSE 438

**Course Title: **Smart Phone Application Development

**Credit Hour: **3.00

**Prerequisite: **CSE 412 AND CSE 413

**Content: **Introduction to Android, Java Overview, Android Widgets, Layout Designs, Utilization of media files – text, mp3, jpeg, jpg, Activity States, Internal/External and Temporary/Permanent Data Storage.

** **

**Course Code: **CSE 440

**Course Title: **Human Computer Interaction

**Credit Hour: **3.00

**Prerequisite:** N/A

** **

**Content: **Introduction to Biomedical Engineering, Science and Scientific literature, Cells and Electrophysiology, Physiology, Bio-signal Origination, measurement, processing, and analysis, Medical device and health care technologies, Biomechanics, Computational Biomechanics, Biomaterials, Statistical Methods for Biomedical Engineering, Research Ethics, Engineering systems approach to analysis and modeling of human anatomy and physiology, Biomedical Engineering Practice, Radiation Imaging, Radiographic Imaging Systems, Diagnostic Ultrasound Imaging, Biomedical Optics and Lasers, Artificial organs.

**Course Code: **CSE 447

**Course Title: **VLSI Design

**Credit Hour: **3.00

**Prerequisite:** ETE202

**Content**: VLSI technology: Top down design approach, technology trends and design styles. Introduction to MOS technology, PMOS, NMOS, and CMOS transistor structures. Physics of MOS transistors, Fluid model, Electrical characteristics, Operation of MOS transistor as a switch and an amplifier, MOS inverters, MOS Fabrication steps, stick diagrams, design rules and layout, MOS circuits, delay analysis, susperbuffers, Dynamic MOS circuits Registers, counters and Memory realizations, Hierarchical view of VLSI System Design, Behavioral description, High Level Synthesis Scheduling, allocation and data path synthesis, Logic synthesis multilevel minimization, PLA reduction, regular structure circuits, Synthesis of FSM-ASM chart representation and realization, Layout synthesis, Placement and routing, Testing of VLSI, Testing of stuck-at faults, Testing of PL As, RAM, Boundary scan technique.

** **

** **

** **

**Course Code: **CSE 498

**Course Title: **Social and Professional Issues in Computing

**Credit Hour: **3.00

**Prerequisite:** N/A

**Content**:

Introduction to the social implications of computing, Social implications of networked communication, Growth of, Control of, and access to the Internet, Gender – Related issues, Cultural issues, International Issues, Accessibility Issues (e.g. underrepresentation of minorities, Women and disabled in the computing profession), Public policy issues (e.g. electronic voting). Making and evaluating ethical arguments, Identifying and evaluating ethical choices, Understanding the social context of design, Identifying assumptions and values. Professional Ethics: Community values and the laws by which we live, The nature of professionalism (Including care, attention and discipline, fiduciary responsibility, and mentoring). Keeping up-to-date as a professional (in terms of knowledge, tools, skills, legal and professional framework as well as the ability to self-assess and computer fluency), Various forms of professional credentialing and the advantages and disadvantages, Codes of ethics, conduct, and practice(IEEE, ACM, SE, AITP, and so forth), Dealing with harassment and discrimination, Historical examples of software risks (such as the Therac-25 case), Implications of software complexity, Risk assessment and Risk Management; Risk removal, risk reduction and risk control. Security Operations: Physical security, Physical access controls, Personnel access controls, Operational security, Security polices for systems/networks, Recovery and Response, Dealing with problems (both technical and human). Foundations of Intellectual Property, Copyrights, patents, and trade secrets, Software Piracy, Software Patents, Transactional issues concerning Intellectual Property. History and examples of computer crime, “Cracking” (“Hacking”) and its effects, Viruses, Worms, and Trojan Horses, Identity Theft, Crime Prevention strategies.

**Course Code: **ETE 315

**Course Title: **Digital Signal Processing

**Credit Hour: **3.00

**Prerequisite: **CSE 307

** **

**Content**: **Introduction:** Digital Signal Processing and its benefits: Key DSP Operations, Real-time signal processing, Applications. **Discrete Transform:** Fourier series, OFT, FFT and other discrete transforms, Z-transforms and its applications in signal processing, correlation and convolution with examples, **Filters:** FIR, IIR and adaptive filters. An overview of spectrum estimation and analysis.

** **

**Course Code: **ETE 463

**Course Title: **Optical Fiber Communication

**Credit Hour: **3.00

**Prerequisite: **CSE 309

** **

**Content**: Light propagation through optical fiber: Ray optics theory and mode theory. Optical fiber: Types and characteristics, transmission characteristics, fiber joints and fiber couplers. Light sources: Light emitting diodes and laser diodes. Detectors: PIN photo-detector and avalanche photo-detectors. Receiver analysis: Direct detection and coherent detection, noise and limitations. Transmission limitations: Chromatic dispersion, nonlinear refraction, four wave mixing and laser phase noises. Optical amplifier: Laser and fiber amplifiers, applications and limitations. Multi-channel optical system: Frequency division multiplexing, wavelength division multiplexing and co-channel interference.