BSSE Catalog
| Course Title | Applied Physics |
| Credit Hours | 3+1 |
| Prerequisites by Course(s) and Topics | None |
| Textbook (or Laboratory Manual for Laboratory Courses) | R. C Hibbeler, A. Gupta, “Engineering Mechanics , Statics and Dynamics,” Eleventh Edition, Pearson, 2010 David Halliday, Robert Resnick, Kenneth S. Krane, Physics , Vol. 2 Wiley |
| Reference Material | 8.02 T Electricity and Magnetism Course, MIT Open Course Ware, Spring 2005 http://ow.mit.edu/OcwWeb/Physics/8.02TSpring-2005/CourseHome/index.htm Giancoli, D.C, Physics for Scientists & Engineers, Vol.2. Prentice Hall. |
| Topics Covered | General Principles of Mechanics, Force Vectors /Introduction, Force Vectors in 2 dimensions, Force Vectors in 2 dimensions, Force Vectors in 3 dimensions, Force Vectors in 3 dimensions, Force Vectors in 3 dimensions, Force Vectors in 3 dimensions, Moment of a force/Introduction, Moment of a force/Principle of moment, Moment of a couple/Introduction, Moment of a couple/Problems, Electric charge and Coulomb’s law, Electric charge and Coulomb’s law, Problems of Coulomb’s law, Problems of Coulomb’s law, Electric field/problems , Electric field/problems , Gauss’s Law, Applications of Gauss’s Law, Applications of Gauss’s Law/ Electric potential energy and potential, Electric potential energy and potential, Electric potential/Applications, Magnetic fields, Magnetic fields, Sources of the Magnetic fields, Sources of the Magnetic fields, Faraday’s Law of Induction, Equilibrium of a Rigid body/friction, Equilibrium of a Rigid body/friction |
| Course Title | Calculus and Analytic Geometry |
| Credit Hours | 3 |
| Prerequisites by Course and Topics | Intermediate level mathematics |
| Textbook (or Laboratory Manual for Laboratory Courses) | Calculus by Thomas Finney 11th edition |
| Topics Covered | Preliminaries, Real numbers and real line, Lines, circles and parabolas, Functions and their graphs, Preliminaries continued, Identifying functions, Composite functions, Combining functions (shifting and scaling), Trigonometric functions, Limits and continuity, Rates of change and limits, Limits using limit laws, Precise definition of limit, Limits and continuity, One sided limits and limits at infinity, Continuity, Tangents and derivatives, Differentiation, The derivative as a function, Differentiation Rules, Differentiation, The derivative as a rate of change, Derivatives of trigonometric functions, Differentiation, Chain Rule, Implicit differentiation, Related rates, Application of Derivatives, Extreme values of functions, Mean value theorem, Monotonic functions and first derivative test., Concavity and curve sketching, Midterm, Application of Derivatives, Applied Optimization problems, Indeterminate forms and L’Hopital Rule, Antiderivatives, Integration, Estimating with finite sums, The definite Integral, The fundamental theorem of calculus, Integration, Indefinite integrals and the Substitution Rule, Substitution and Area between two curves, Application of Integration, Volume by slicing and rotation about axis, Volume by cylindrical shell, Application of Integration, Length of Plane Curves, Areas of Surface of Revolution, Transcendental Functions, Inverse functions and their derivatives, Natural Logarithms, The Exponential function, Transcendental Functions, Inverse Trigonometric functions, Hyperbolic functions, Integration by parts, Anything pending / revision |
| Reference Material | Calculus by Howard Anton 10th edition |
| Course Title | Multivariate Calculus |
| Credit Hours | 3 |
| Prerequisites by Course and Topics | CSC102 |
| Textbook (or Laboratory Manual for Laboratory Courses) | Thomas’ Calculus 13th edition |
| Reference Material | Calculus by Howard Anton 10th edition |
| Topics Covered | Topics, Techniques of Integration, Using basic integration formulas, Integration by parts, Trigonometric Integrals, Techniques of Integration, Trigonometric Substitutions, Integration by partial fractions, Techniques of Integration, Numerical Integration, Improper Integrals, Conic Sections and Polar Coordinates, Calculus with parametric curves, Polar coordinates, Conic Sections and Polar Coordinates, Areas and lengths in polar coordinates, Conic Sections, Infinite Sequences and Series, Sequences, Infinite Series, The integral and Comparison Tests, Infinite Sequences and Series, Ratio and Root Tests, Alternating series and conditional convergence, Infinite Sequences and Series, Power series, Taylor and Maclaurin Series, Midterm Examination, Partial derivatives, Functions of several variables, Limits and continuity in higher dimensions, Partial derivatives, Partial derivatives, Chain rule, Directional derivatives and Gradient Vectors, Partial derivatives, Tangent planes and Differentials, Extreme values and Saddle points, Taylor’s formula for two variables, Multiple Integrals, Double integrals, Double integrals in polar form, Multiple Integrals, Triple integrals, Substitution in Multiple integrals, Integration in Vector Fields, Line integrals and vector fields, Path independence, Integration in Vector Fields, Green’s Theorem in the plane, Stokes and Divergence Theorems, Intro to Transforms:, Anything pending / Revision |
| Course Title | Introduction to Information and Communication Technology |
| Credit Hours | 3+1 |
| Prerequisites by Course(s) and Topics | None |
| Textbook (or Laboratory Manual for Laboratory Courses) | Parker, Charles S., and Deborah Morley. Understanding Computers: Today and Tomorrow. Ft. Worth, TX: Dryden Press, 2020, 16th Edition. |
| Reference Material | Would be provided on student demand |
| Topics Covered | Brief history of Computer, 5 generations of Computers, Computer Elements: Processor, Memory, Hardware, Software, Application Software its uses and Limitations, System Software its Importance and its Types, Methods of Input and Processing, Types of Computer (Super, Mainframe, Mini and Micro Computer), Input Devices. Keyboard and its Types, Terminal (Dump, Smart, Intelligent), Pointing Devices, Voice Input, Output Devices. Soft- Hard Copies, Monitors and its Types, Printers and its Types, Plotters, Computer Virus and its Forms, Storage Units: Primary and Secondary Memories, RAM and its Types, Cache, Hard Disks, Working of Hard Disk, RAID, Optical Disk Storages (DVD, CD ROM), Magnetic Tapes, Backup System, Data Communications: Data Communication Model, Data Transmission, Digital and Analog Transmission, Modems, Asynchronous and Synchronous Transmission, Simplex. Half Duplex, Full Duplex Transmission, Communications, Medias (Cables, Wireless), Protocols, Network Topologies (Star, Bus, Ring), LAN, WAN anf types IP, MAC address, DNS, Internet: A Brief History, Birthplace of ARPA Net, Web Link,Internet Services provider and Online Services Providers, Tiers of internet, Mid term, Functions and Features of Browser, Search Engines, Some Common Services available on internet, E-commerce, Cyber Security, Number System/Base Conversion, Number System/Base Conversion , ASCII/Unicode, Boolean Algebra/Truth Tables, Basics of digital logic |
| Course Title | Digital Logic Design |
| Credit Hours | 3+1 |
| Prerequisites by Course(s) and Topics | None |
| Reference Material | Reference Books: Digital logic and computer design by Morris ManoLogic and Computer Design Fundamentals By M. Morris Mano & Charles R Kime. |
| Course Outline | Course Introduction, Introductory concepts: Digital vs analog quantities, Binary digits, Logic levels and waveforms, Basic Logic Functions, Different types of Number Systems and their basics, Conversion between different number systems and arithmetic operations, Signed numbers and arithmetic operations involving signed binaries, Binary coded decimal (BCD), Digital Codes, Error Codes: Parity bits (Even and odd parity), Logic gates, An introduction to HDL, An introduction to programmable and fixed-function logic , Boolean operations and expressions, Laws and rules of Boolean algebra, Boolean analysis of Logic circuits, Logic simplification using Boolean algebra, Standard forms of Boolean expressions: SOP and POS forms, Boolean expressions and truth tables, The Karnaugh map, SOP and POS minimization using the Karnaugh map, Implementing combinational logic, The universal property of NAND and NOR gates, Combinational logic using NAND and NOR gates, Pulse waveform operation, Combinational circuits: Adder, half adder and full adder, Parallel binary adders, Ripple carry and look-ahead carry adders, Combinational circuits: Subtractor, comparators, Decoder, Encoder, Multiplexer (Data selectors) and Demultiplexer, Code converters, Parity generator/checker, Latches: D-Latch, S-R Latch, Gated latches, Flip flops: D-flip flop and J-K flip flop, Edge-triggered operation, Asynchronous present and clear inputs, Flip flop operating characteristics and applications, One-shots, The Astable Multivibrators, Shift register operations, Types of shift register data I/Os, Bidirectional shift registers, Shift register counters, Shift register applications, Finite state machines, Synchronous and Asynchronous counters, Up/Down synchronous counters, Design of synchronous counters, Cascaded counters, Programmable Logic Devices: SPLDs, CPLDs, FPGAs, Semiconductor memory basics, RAM, ROM, Programmable ROMs, PAL’s PLA’s, An introductory to some CAD tools, Review of the course |
| Course Title | Linear Algebra and Differential Equations |
| Credit Hours | 3 |
| Prerequisites by Course(s) and Topics | CSC102 |
| Reference Material | |
| Topics Covered | · Systems of Linear Equations and matrices · Determinants · Euclidean and General Vector Spaces · Eigen values and Eigen Vectors · Linear Transformation · Differential equations (First and second order) |
| Course Title | Probability and Statistics |
| Credit Hours | 3+0 |
| Prerequisites by Course(s) and Topics | Calculus and Analytical Geometry |
| Reference Material | 1 – Probability and Statistics for Engineers and Scientist (9th Edition) By Walpole 2 – Probability and Random Process for Electrical Engineering (3rd Edition) Alberto Leon- Garcia |
| Topics Covered | Introduction to Probability and Statistics. Motivation , for the course. Course outline. , Sample space, events, Venn diagram, unions, intersections, De Morgan Law, Mean Median Mode, standard deviation, variance, Probability of an event, Mutually exclusive events, probability of sample space, axioms of probability, independent events, conditional probability, Bayes Theorem, Expected value, Variance, Random Variable, Bernoulli Random Variable, Expected value and Variance of Bernoulli, Examples of Bernoulli random variable., Binomial Random Variable, Expected value and , Variance of Binomial random variable., Examples of Binomial random variable., Geometric Random Variable. Expected value and , variance of geometric random variable., Example of Geometric random variable., Exponential Random Variable, Expected value and , variance of geometric random variable, Example of exponential random variable., Poisson Random Variable. Expected value and , Variance of Poisson random variable., Correlation, Normal distribution, Probabilistic Modeling Example 1, |
| Course Title | Probability and Statistics |
| Credit Hours | 3+0 |
| Prerequisites by Course(s) and Topics | CSC102 |
| Textbook (or Laboratory Manual for Laboratory Courses) | 1 – Probability and Statistics for Engineers and Scientist (9th Edition) By Walpole 2 – Probability and Random Process for Electrical Engineering (3rd Edition) Alberto Leon- Garcia |
| Reference Material | |
| Course Goals | |
| Topics Covered | Sample space, events, Venn diagram, unions, intersections, De Morgan Law, Mean Median Mode, standard deviation, variance, Probability of an event, Mutually exclusive events, probability of sample space, axioms of probability, independent events, conditional probability, Bayes Theorem, Expected value, Variance, Random Variable, Bernoulli Random Variable, Expected value and Variance of Bernoulli, Examples of Bernoulli random variable., Binomial Random Variable, Expected value and, Variance of Binomial random variable., Examples of Binomial random variable., Geometric Random Variable. Expected value and , variance of geometric random variable., 10, Example of Geometric random variable., Exponential Random Variable, Expected value and , variance of geometric random variable, Example of exponential random variable., Poisson Random Variable. Expected value and , Variance of Poisson random variable., Correlation, Normal distribution, Probabilistic Modeling |
| Course Title | Computer organization and Assembly Language |
| Credit Hours | 3+1 |
| Prerequisites by Course(s) and Topics | Digital Logic Design |
| Reference Material | Reference Books: Computer Organization and Architecture by William Stallings (8th Edition)Computer Systems: A Programmer’s Perspective, 3/E (CS:APP3e), Randal E. Bryant and David R.O’ Hallaron, Carnegie Mellon UniversityComputer System Architecture, M. Morris Mano, Latest EditionAssembly Language Programming for Intel- Computer, Latest Edition |
| Course Outline | Computer abstractions and technology: The historical perspective and some important design considerations, Language of the computer: Operation and Operands of HW, Signed and Unsigned Numbers, Representing Instructions in the Computer, Logic Operations, Instruction for Making Decisions, Supporting Procedures in HW (Stack),Addressing Modes, Intro to Compilers, A Sort procedure and its assembly, Pointers versus Arrays, Arithmetic for computers: Addition and subtraction, Multiplication, Multiplication and division, Floating Point representation and arithmetic,CPU Performance Factors, The processor (Single Cycle): Building a Datapath,Simple Implementation Scheme (Control),The processor (Pipelined): Pipelined Data path and Control, Introduction to Stalling and Forwarding, Data and control hazards,Pre-mid review, The processor (Pipelined): Exceptions, Memory hierarchy: A top-level view, Cache Memory, Main Memory, Virtual Memory, Storage, I/O and OS Support: Introduction, Dependability, Reliability, and Availability, Storage Devices, Connecting Processors, Memory, and I/O Devices, Interfacing I/O Devices to the Processor, Memory, and Operating System, I/O Performance Measures: Examples from Disk and File Systems Designing an I/O System, Parallelism and I/O: Redundant Arrays of Inexpensive Disks, Introduction to OS Support, Multicores, Multiprocessors, and Clusters: Introduction, The Difficulty of Creating Parallel Processing Programs, Shared Memory Multiprocessors, Hardware Multithreading, SISD, MIMD, SIMD, SPMD, and Vector, Introduction to Graphics Processing Units, Review of the course |
| Course Title | Operating Systems |
| Credit Hours | 3+1 |
| Prerequisites by Course(s) and, Topics | CSC231 |
| Textbook (or Laboratory Manual for Laboratory Courses) | Operating System Concept Essentials, by Silbershatz, Galvin, and Gagne, John Wiley & Sons. ISBN 978-0-470-88920-6. |
| Reference Material | |
| Topics Covered | Operating systems basics, Types of operating systems, Operating System Kernel, operating system Shell, system call, Interrupts, process concept and scheduling , inter-process communication using shared memory and message passing, inter-process communication using message passing, multithreaded programming, Advantages of Multithreaded applications, multithreading models, threading issues, Process synchronization, critical section, synchronization hardware, synchronization problems, Semaphores, monitors, process scheduling algorithms, First Come First Serve Scheduling, Shortest Job First Scheduling, Priority Scheduling, Round Robin Scheduling, Multi-level queues, Deadlocks, Safe state Detecting and recovering from deadlocks, memory management, swapping contiguous memory allocation, Memory Management Techniques, segmentation & paging, Virtual memory management, demand paging |
| Course Title | Object Oriented Programming |
| Credit Hours | 4(3+1) |
| Prerequisites by Course(s) and, Topics | CSC131 |
| Textbook (or Laboratory Manual for Laboratory Courses) | C++ How to Program by Deitel and Deitel (10th Edition) |
| Reference Material | Object Oriented Programming in C++, 4th Edition by Robert Lafore |
| Topics Covered | Contents, Introduction to objects, classes, get and set functions, Constructors, destructors, data hiding, encapsulation, Inline functions, Function overloading, Function templates, Storage Classes: extern, auto, static, register, const qualifier, Scope rules, Vectors, Function pointers, access functions and utility functions, Const objects and const member functions, Composition, Friend functions, Operator overloading=method overloading,, explicit constructors, proxy classes, Friend classes, this pointer, static class members, Base and derived classes, protected members, Relationship between base and derived classes, Inheritance hierarchy, Constructors and destructors in inheritance, Polymorphism, virtual functions, abstract classes and pure virtual functions, Dynamic binding, virtual destructors , Templates, Overloading function templates,, Class Templates, Templates and friends, Templates and inheritance, templates and static members, Streams output, input, stream manipulators, Exception handling, attempt to divide by zero, constructors destructors and exception handling, exceptions and inheritance, |
| Course Title | Data structures and Algorithms |
| Credit Hours | 3+1 |
| Prerequisites by Course(s) and, Topics | CSC231 |
| Textbook | |
| Reference Material | , 1. Data Structures and Algorithms in C++ by Adam Drozdek, 2. Data Structures and Algorithm Analysis in Java by Mark A. Weiss, 3. Data Structures and Abstractions with Java by Frank M. Carrano & Timothy M. Henry, 4. Data Structures and Algorithm Analysis in C++ by Mark Allen Weiss, Java Software Structures: Designing and Using Data Structures by John Lewis and Joseph Chase |
| Topics Covered | An Introduction to data structure, linear non- linear data structures, operations on data structures, Introduction to array data structure, operations on array data structures(Insertion, deletion, searching sorting, and merging), searching an unsorted array, Recursion and analyzing recursive algorithms, binary search for sorted arrays, complexity analysis, big O, Sorting algorithms (selection, insertion, bubble), Sorting algorithms (shell, radix, bucket), Divide and Conquer Algorithms(merge sort, quick sort) , Abstract data types, Introduction to link list, Link list ADT, single link list, new, delete, ->, next, memory management, doubly link list, circular link list, operations on link list(insertion, deletion, searching), sorted linked list, Introduction to stack data structure, stack as ADT, operations on stack(push and pop),applications of stack( parenthesis count, infix to postfix and postfix evaluation), Mid Term, Introduction to queue data structures, queues ADT, types of queues(simple queues,), operations on the queues(enqueue, dequeue), hashing and indexing, open addressing and chaining,, Introduction to tree data structure, Tree ADT, types of trees, Binary Tree, Tree traversals (prefix. Infix, postfix), Binary search trees, M-way tress, balanced trees, Heaps, priority queue, Graphs, Adjacency matrix and adjacency list representation, Breadth-first and depth-first traversal, implementation through adjacency matrix/list, Topological order, Shortest path algorithms, |
| Course Title | Discrete Structures |
| Credit Hours | 3 |
| Prerequisites by Course and Topics | None |
| Textbook (or Laboratory Manual for Laboratory Courses) | Discrete Mathematics with application SusannaS.Epp (Latest edition whatever it may be, otherwise 5th edition), 2nd edition is readily available., Discrete Mathematics and its application KennethH.Rosen. 7th edition |
| Reference Material | Foundation of discrete mathematics AlbertD.Polimeni,H. J.Straight |
| Topics Covered | Introduction to Mathematical Reasoning(1), Logical form and Logical Equivalence, Conditional Statements, Valid and invalid Arguments, Introduction of Mathematical Reasoning(2), Application: Digital Logic Circuits, Application: Number Systems and Circuits for addition., Number Theory & Mathematical Induction, Introduction, Rational Numbers, Divisibility, Division into Cases and the Quotient Remainder Theorem, Sequences, Principles of Mathematical Induction, Algorithms, Correctness of Algorithms, Set Theory, Basic Definitions, The Empty Set, Power sets, Properties of Sets, Partitions, Boolean algebra, Russell’s Paradox and Halting Problem , Counting Techniques 1, Counting and Probability, Possibility Trees and Multiplication Rule, Counting Techniques 2, Counting Elements of Disjoint Sets, Counting Subsets of a Set, Functions 1, Functions Defined On General Sets, One-To-One, Inverse Functions, MIDTREM EXAM, Functions 2, Finite State Automata, the Pigeonhole Principle., Recursion, Recursively Defined Sequences., Solving Recurrence Relations by Iteration, Efficiency of Algorithm, Real Valued Functions of Real Variable and Their Graphs, O-Notations, Efficiency of Algorithm, Efficiency of Algorithms-I, Efficiency of Algorithms-II, Graphs, Introduction, Paths and Circuits, Matrix Representation of Graphs, Isomorphism of Graphs, Boolean Algebra, Project presentations, Final exam |
| Course Title | Embedded Systems |
| Prerequisites by Course(s) and Topics | CSC 221- Computer organization and assembly language |
| Reference Material | 8088 Reference Data Sheet8051 Reference Data Sheet |
| Course Goals | Introduction To Embedded Systems,on Each Topic Introduction to the course. ,(assume 15-week instruction and one- hour lectures) Role of embedded systems in daily life ,Computer Hardware ,Computer Hardware and Software, Number system, Computer data : Binary ,notation, Bits & Bytes, ASCII coding system, Computer Organization ,Memory concepts, Files, Operating system , Computer Buses , Introduction To bus standards for embedded systems Data Buses, Control , buses and address buses. Data Transfer modes, Computer Reset Circuitry , Address Decoding , Full Address Decoding, Partial Address Decoding ,Address Decoding , Block Addressing Decoding, MxN Decoding ,Introduction to 8051 Micro Controller Architecture ,8051 Pin Configurations , Basic Input Out Put functions of 8051 ,Blinking LEDS, Switch Debouncing, 7 Segment Display ,Address and Data Decoding 8051 ,Address and Data Processing of memory with 8051 ,Interrupts vs Polling ,Interrupt Based IO, Polling Based IO, Writing ISR ,Interrupts II ,Interrupt Priority Levels and Interrupt handling based on priority ,8051 Timers Programming ,Introducing delays using Interrupts , Timer 0, Timer 1, Timer 2 Serial Communication 8051 ,UART Standards and Uart Programming,Controlling Baud Rate, 8051 Interfacing With External Peripherals ,LCD, Servo Motor, Wifi module , Introduction to Aurdino Microcontroller ,Aurdino Architecture and Basic IO processing , Aurdino Interfacing with Peripherials ,LCD, Servo Motor, Wifi module. |
| Course Title | Database Management System |
| Credit Hours | 3+1 |
| Prerequisites by Course(s) and Topics | CSC231 |
| Course Contents | This course offers an introduction to database systems, their internal architecture, theoretical underpinning, management and use in the organizations. The main topics include: Database Engine Core Technology: Data layout, indexing, query processing algorithms, query optimization, transactional concurrency control, logging and recovery, security and authorization.Data Models and Languages:The Relational model of data, formal relational languages (relational algebra and calculus), and the SQL language. Extensions to the relational model including object-relational features, XML and associated query languages.Database Design: Entity-Relationship modeling, functional dependencies and normalization, logical relational schema design, physical design and database tuning.Database Application Development: Application-level database APIs including host-languages embedding library interface like JDBC. |
| Textbook (or Laboratory Manual for Laboratory Courses) | (Latest Editions) Elmasri, Ramez, Navathe, Shamkant B., (2011) Fundamentals of Database Systems, 6th Edition, Reading Massachusetts: Addison WesleyConnolly, Thomas M., and Begg, Corolyn E., (2015) Database Systems: A Practical Approach to Design, Implementation, and Management, 6th Edition, New York: Addison Wesley |
| Reference Material | Kroenke, David M., and Auer, D. J. (2014) Database Processing: Fundamentals, Design and Implementation, 13th Edition, New Jersey: Prentice HallHoffer, J. A., Venkataraman, R., Topi, H. (2013) Modern Database Management, 11th Edition, New Jersey: Prentice HallSilberschatz, A. Korth, H. F. and Sudarshan, S. (2011) Database System Concepts, 6th Edition, New York: McGraw Hill Inc.Date, C. J., (2004) An Introduction to Database Systems, Eighth Edition, Reading Massachusetts: Addison WesleyRamakrishman, Raghu and Gebrke, Johannes, (2003) Database Management Systems, Third Edition, New York: McGraw Hill Inc.Kochhar, Neena, Gravina, Ellen, Nathan, Priya, (1999) Introduction to Oracle: SQL and PL/SQL, Student Guide, Oracle Corporation, Redwood Shores, CA |
| Topics Covered | Introduction, File-based Systems, Database Examples, Basic Definitions, DBMS History, Typical Functions and Services, Database Architecture and Data Models, Relational Model, Terminology, Mathematical Foundation, Languages, Constraints and Views, Relational Algebra, Queries in Relational Algebra and Queries in Relational Calculus, File Organization: Record Format, Page Format, Heap Files, Sequential Files, Clustered Files, and Hash Files, Indexing: Definition, Uses, Types of Indexes, B+ Tree indexes, and Hash Indexes, Query Execution Plans, Entity Types, Attributes, and Keys,, Relationship Types, Roles, and Structural Constraints, Strong and Weak Entity Types., ER Diagrams, Naming Conventions and Design Issues, UML Notation, Normalization, The Purpose, Data Redundancy, Update Anomalies, Functional Dependencies,Normal Forms based on Primary Key and other Normal Forms, Design Methodologies: Conceptual, Logical and Physical, Logical Database Design, Physical Database Design, Introduction to Transaction Processing, Transaction and System Concepts, Desirable Properties of Transactions. Characterizing Schedules Based on Serializability. Characterizing Schedules Based on Recoverability, Two-Phase Locking Techniques for Concurrency Control, Concurrency Control Based on Timestamp Ordering, Multiversion Concurrency Control Techniques, Optimistic Concurrency Control Techniques, Granularity of Data Items and Multiple Granularities Locking, Using Locks for Concurrency Control, Other Concurrency Control Issues., Database Recovery Concepts, Backup Mechanism, Log File, Checkpoint Facility, Recovery Techniques based on Deferred Update, Immediate Update and Shadow Paging, Database Backup and Recovery from Catastrophic Failures, Query Processing, Query Optimization, Security, Revision, |
| Course Title | DESIGN AND ANALYSIS OF ALGORITHMS |
| Credit Hours | 3 |
| Prerequisites by Course(s) and, Topics | CSC232 |
| Textbook (or Laboratory Manual for Laboratory Courses) | Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms, Third Edition (3rd ed.). The MIT Press. |
| Reference Material | MIT Courseware, Algorithms in C++; Robert Sedgewick , Algorithm Design; Jon Kleinberg and Eva Tardos |
| Topics Covered | Details, Introduction to Algorithms, Characteristics, Correctness, Properties of Algorithms, Role of algorithms in computing, Problem Solving, Analyzing the Problem, Problem specification, Analysis on nature of input and size of input , Sorting Problem, Quadratic Sorting (Bubble Sort, Selection Sort, Insertion Sort with analysis, Running time, Order of Growth, RAM Model, Asymptotic Notations, Best, average and worst case analysis with examples, Correctness of algorithm, Assertions, Loop Invariants, Pre-condition and Post-condition of Algorithm, Analysis of different Algorithm exercises, Recursion and recurrence relations, Methods to solve recurrences, Iterative Method, Substitution Method with examples, Master Method with examples, Divide and Conquer Algorithm, Merge Sort Algorithm average, best and worst case analysis, Quick Sort, Best, average and worst case analysis. Decision tree of comparison based sorting, Linear Time sort (Radix sort, Bin sort) Examples with analysis, Randomization, Probabilistic Analysis and Randomized Algorithm, Hiring Problem, Expected Analysis of Hiring Problem and Randomized Quick Sort, Terminology of Trees, Binary Tree (traversal, insertion, deletion), Analysis of operations on Tree, Binary Search Tree, BST Property, Heap, Heap Property, Operations (traversal, insertion, deletion) with Analysis, AVL tree, Rotations, Double Rotations, Red-Black Tree, Insertion, Deletion and Search operations with analysis and examples, Greedy Algorithm, Elements and Properties of Greedy Algorithm, Huffman Coding, Examples and Analysis, Coin Change Problem, Multiprocessor Scheduling, Dynamic Programming, Elements and Properties of Dynamic Programming, Knapsack Problem, Activity Scheduling Problem, Matrix Multiplication., Introduction to Graph terminology, Graph Representation, Minimum Spanning Tree, Single source shortest Path, Dijkstra, Bellman ford algorithm , String Matching, Naïve Algorithm, Robin-Karp Algorithm, Finite State Automata based String Matching, Introduction to complexity classes, |
| Course Title | Introduction to Python |
| Credit Hours | 1 |
| Prerequisites by Course and Topics | CSC111 |
| Textbook (or Laboratory Manual for Laboratory Courses) | Python Programming for The Absolute Beginner by Michael Dawson, Python Programming: An Introduction to Computer Science (3rd Edition)by John Zelle |
| Reference Material | Head-First Python, 2nd edition, Paul Barry (O’Reilly, 2016) |
| Course Goals | Learn basic concepts of Python |
| Topics Covered | Introduction to Python IDE, Basic Syntax, Colab IDE, PyCharm, Anaconda, Spider, Notebook, Basic Input Output, How to take user input, How to display Output, Different Type of Variable Handling, Type Casting, Formatted Display, Built in Maths Functions, String Manipulation, How to deals with String, String concat, Searching, Sorting, Minmax, Alter, Condition and Loop, If else Condition, Short form Condition, For Loop, While Loop, Different Type of Array, List, Set, Tuple, Dictionary, Function and Classes, How to create Function, How Call Function, Recursive Function, Classes, OOP Basic Concepts, Data Structure, File Handling, How to create File, How to Save File, Doc, PPT, Excel File Handling, Basic GUI for Mobile, Kivy Framework for Mobile APP GUI, Basic GUI for Desktop, Tkinter Framework for Desktop APP GUI, Python Web Framework 1, Flask Web Tool , Python Web Framework 2, Django Web Tool, Database Connectivity with Apps, No Sql like List, MySql, Python Image Processing, OpenCV Library, Numpy Library, MatplotLib, Project presentations |
| Course Title | Advance Database Management Systems |
| Credit Hours | 3 |
| Prerequisites by Course and Topics | — |
| Textbook (or Laboratory Manual for Laboratory Courses) | Elmasri, Ramez, Navathe, Shamkant B., (2015) Fundamentals of Database Systems,7th Edition, Reading Massachusetts: Addison Wesley Silberschatz, A. Korth, H. F. and Sudarshan, S. (2011) Database System Concepts, 6th Edition, New York: McGraw Hill Inc. |
| Reference Material | • Kroenke, David M., and Auer, D. J. (2014) Database Processing: Fundamentals, Design and Implementation, 13th Edition, New Jersey: Prentice Hall • Hoffer, J. A., Venkataraman, R., Topi, H. (2013) Modern Database Management, 11th Edition, New Jersey: Prentice Hall • Date, C. J., (2004) An Introduction to Database Systems, Eighth Edition, Reading Massachusetts: Addison Wesley • Ramakrishman, Raghu and Gebrke, Johannes, (2003) Database Management Systems, Third Edition, New York: McGraw Hill Inc. • Kochhar, Neena, Gravina, Ellen, Nathan, Priya, (1999) Introduction to Oracle: SQL and PL/SQL, Student Guide, Oracle Corporation, Redwood Shores, CA |
| Topics Covered | Course introduction, Data abstraction, Database Designing, Data Models, Review of Relational Database Design, Database system architecture, Relational Model concepts, Relational database schemas, Relational database constraints, Relational Algebra, Relational Algebra, Basic Operations, Additional Operations, Extended operations, Group Functions, NULL Value, Data Manipulation Operations, Storage and File Structures, Overview of Physical Storage Media, Magnetic Disks, RAID, Tertiary Storage, Storage Access, File Organization, Organization of Records in Files, Data-Dictionary Storage, Indexing and Hashing, Basic Concepts, Ordered Indices, B+-Tree Index Files, B-Tree Index Files , Static Hashing, Dynamic Hashing, Comparison of Ordered Indexing and Hashing, Index Definition in SQL , Multiple-Key Access, Query Processing Overview, Measures of Query Cost, Selection Operation, Sorting, Join Operation, Other Operations, Evaluation of Expressions, Query Optimization, Introduction, Transformation of Relational Expressions, Catalog Information for Cost Estimation, Statistical Information for Cost Estimation , Cost-based optimization, Dynamic Programming for Choosing Evaluation Plans , Materialized views, Concurrency control and Transaction Management, |
| Course Title | Theory of Automata |
| Credit Hours | 3 |
| Prerequisites by Course(s) and Topics | CSC241 |
| Course Outline | Introduction to Automata Theory, Course goals and syllabus, Course organization and administration, First definitions, Course organization and administration, First definitions, Deterministic finite automata (DFA), Regular languages, Complement construction, Product construction, Closure properties of regular languages, Nondeterministic finite automata (NFA), From DFA to NFA, From NFA to DFA, NFAs with epsilon transitions, More closure properties of regular languages, Regular expressions (RE), From RE to NFA, From NFA to RE, Kleene algebra, Mid Exam, From NFA to RE, Kleene algebra, Kleene algebra, Kleene algebra Part I& II, Kleene algebra Part I& II Proof, Kleene algebra Part I& II Examples, State minimization Examples, Kleene algebra Part III, Kleene algebra Part III Proof, Kleene algebra Part III Examples, State minimization Examples, DFA state minimization, Introduction to Part II, Context-free grammars and languages, Context-free languages subsume regular languages, •Push Down Automata, •Push Down Automata Examples, , •Turing Machine, •Turing Machines Examples, Presentation and Open Ended Questions, Course Summary, Exam Preparation, Assignments discussion, Course Evaluation, |
| Course Title | Compiler Construction |
| Credit Hours | 3 |
| Prerequisites by Course(s) and Topics | CSC341-Theory of Automata |
| Textbook (or Laboratory Manual for Laboratory Courses) | Compilers: Principles, Techniques, & Tools Second Edition By: Alfred V. Aho, Ravi Sethi, Jeffrey D. Ullman Published By: Addison-Wesley ISBN: 9780321547989 Principles of Compilation Techniques J.P. Brenett |
| Reference Material | A Practical Approach to Compiler Construction Watson Des Published by Springer International Publishing 2017 ISBN: 978-3-319-52789-5 Modern Compiler Design First Edition By: David Galles Published By: Addison-Wesley 2005 ISBN: 9781576761052 Art of Compiler Design, The: Theory and Practice First Edition By: Thomas Pittman, James Peters Published By: Prentice Hall 1992 ISBN: 9780130481900 Engineering a Compiler First Edition By: Cooper and Torczon Published By: Morgan-Kaufmann imprint of Elsevier 2004 ISBN: 9780321547989 Compiler Construction Niklaus Wirth. Addison-Wesley, 1996. Advanced Compiler Design and Implementation, Steven S. Muchnick. Morgan Kaufmann Publishers, 1997. |
| Topics Covered | Topics, Introduction, compilation, history of compilers, the need for machine translation, approaches to machine translation, the compiler structure and organization. , Lexical Analysis, Symbol Tables, Functions of lexical analyzer, efficiency consideration in lexical analyzer, Finite state machines, Lexical analysis with finite state machines, tools for building lexical analyzers. LEX , LEX rules, lexical analyzer generators., Lexical analyzer implementation for VSL (very small language), Formal Grammars, Equivalent grammars, ambiguous grammars, Derivations, Syntax directed translation, language structure, parse trees, Syntax analysis methods, Approaches to parsing, classification of parsing methods, effective parsing algorithm, top down parsing methods, bottom up parsing methods., Recursive descent parsing methods. Handling alternatives, recursion, attribute grammars and recursive descent. Table driven top down parsing. , Bottom up parsing, shift reduce parsing method, LR Parsers, shift reduce LR parsers, and types of LR parsers, constructing SLR parse tables. Canonical LR parsing, LALR parsers. , Syntax analyzer Implementation for VSL (very small language), Error Handling: compile time error handling, lexical errors, syntax errors, panic mode recovery, phrase level recovery, error productions, global error corrections, run time errors., Semantic checking, type checking, static type checking, dynamic type checking, type conversion, semantic checks, label checks, flow of control checks, declaration checks , Semantic analyzer Implementation for VSL (very small language), Code generation, declaration and storage allocation, global and static variables, local and temporary variables,, Expression and assignment, using registers, flow of control, code generator generators., Code generator implementation for VSL (very small language), Simple code optimization, basic blocks, local optimization, common sub expression elimination, copy propagation, dead code elimination., Arithmetic transformations, constant folding, algebraic transformations, reduction in strength, packing temporaries, peephole optimization., Advance code optimization, flow graphs, connectivity matrix, loops, and Super optimizers., Global data flow analysis, Global copy propagation and dead code elimination,, Loop optimization, register optimization, super optimizers, Code optimizer implementation for VSL (very small language), Term project presentations, Final exam, |
| Course Title | Software Engineering |
| Credit Hours | 3 |
| Prerequisites by Course(s) and Topics | CSC231 |
| Textbook (or Laboratory Manual for Laboratory Courses) | “Software Engineering”, Ian Sommerville, Addison Wesley, 2010. |
| Reference Material | “Software Engineering, Theory and Practice”, Pfleeger, 2006. “Software Engineering”, Ian Sommerville, Addison Wesley, 2010. “Software Engineering: A Practitioner’s Approach”, Roger Pressman, McGraw-Hill, 2009. |
| Topics Covered | Motivations., Introduction to Software Engineering., Why does Software Engineering., Characteristics of software (What is good Software)., System and Engineering approach to Software Engineering. , Software Development Life Cycle (SDLC)., Software Processes (Waterfall, V Model,Phased development: increments and iteration, Evolutionary Process Models (Prototyping Model and Spiral Model), Agile Methods , Feasibility study., Writing a Feasibility Report., Structured activities., Selecting the Right Methodology, Examples. , Project Management Life Cycle., Planning and Managing the Project (Tracking Progress, Effort Estimation, The Project Plan, Cost and schedule estimation, risk management)., Examples, Requirements Engineering., Fact Finding and information gathering, the importance of the correct and concise information., Types of requirements., Requirements Elicitation Techniques., Examples., Prototyping Requirements, Process Management and Requirements Traceability (Validation and Verification), Examples., Documenting Requirements, SRS., Introduction to Data Modeling (Database Design)., Syntax of ER Diagram, Software Design, Analysis and Design, Characteristics of Good Design., Techniques for Improving Design., Documenting the Design., Examples., Object Oriented Analysis (OOA), Object Oriented Design (OOD), A Short Example, Introducing Unified Modeling Language (UML), UML Diagrams, Principles of System Testing., Function Testing., Performance Testing., Acceptance Testing., SQA and Testing., Test Documentation/ Test Plan., Delivering the System, Training., Documentation., Maintaining the System., The Changing System., Nature of Maintenance., Maintenance Problems., Maintenance Techniques and Tools., Evaluating Products, Processes and Resources Approaches to Evaluation., Selecting an Evaluation Technique., Assessment VS Prediction., Product Quality Models., Process Maturity Models., People Maturity Models., Software Measurement and Metrics Overview, Software Re-Engineering Overview |
| Course Title | Network Security |
| Credit Hours | 3 |
| Prerequisites by Course(s) and Topics | — |
| Textbook (or Laboratory Manual for Laboratory Courses) | Cryptography and Network Security: Principles and Practice, 5/E & 6/E William Stallings. |
| Reference Material | Will be provided when needed |
| Topics Covered | Introduction to Network Security, Classical Encryption Techniques, Block Ciphers and the data encryption standards, Advanced Encryption Standard, Public-Key Cryptography and RSA, Key Management, Hash Algorithms, Revision and Midterm, Electronic Mail Security, IP Security, Web Security, Intruders and intrusion detection, Malicious Software (viruses), Firewalls and trusted systems |
| Course Code | CSC381 |
| Course Title | Computer Graphics and Animation |
| Credit Hours | 3 |
| Textbook and Reference Material | Donald Hearn, Pauline Baker, Computer Graphics, with OpenGL, Third edition, Prentice Hall.F.S. Hill, Jr., Computer Graphics Using Open GL, Second Edition, Prentice Hall.Angel, Edward, Interactive Computer Graphics : A top-down approach with OpenGL, Addison-Wesley, 2003.Foley, van Dam, Feiner, and Hughes, Computer Graphics: Principles and Practice, Second Edition in C, Addison-Wesley.Woo, Neider, and Davis, OpenGL Programming Guide, Third edition, Addison-Wesley. Watt, 3D Computer Graphics, Third Edition, Addison-Wesley, 2000. |
| Topics Covered | Course Overview; OpenGL Introduction, Graphics Programming using OpenGL; Geometric Primitives, Input and Interaction; Event Handling in OpenGL. Basic Line and Circle Drawing Algorithms, Geometric Transformations in 2 and 3 Dimensions, Viewing in 3D, Clipping – Term Project Due, Projections, Shading and Lighting; Illumination Model |
| Course Title | Information Security |
| Credit Hours | 3 |
| Prerequisites by Course(s) and Topics | CSC 111, CSC 361 |
| Textbook (or Laboratory Manual for Laboratory Courses) | Cryptography and Network Security: Principles and Practice, 8/E William Stallings. 2020 Handbook of Information Security Management, by Micki Krause and Harold F. Tipton, ISACA Publication, 1999. Handbook of IT Auditing, D.Warren, L.Edelson, X.Parker, Coopers & Lybrand LLP, Warren, Gorham & Lamont. Boston, 1995 with 1999 supplement. |
| Reference Material | Network Security Essentials, 2/E, William Stallings ISBN-13: 978-0130351289 Prrinciples of Information Security Michael E. Whitman and Herbert J. Mattord Cengage Learning; ISBN: 1285448367 Understanding Cryptography: A Textbook for Students and Practitioners thor: Christof Paa and Jan Pelzl Springer ISBN: 3642041000 |
| Topics Covered | Introduction to Security, Information Security and Cryptography , Threats to information systems, Symmetric and Asymmetric Encryption, Attacks Services Mechanisms, Information Systems Integrity, Confidentiality and Availability, Classical Encryption Techniques, Steganography, Block ciphers and the data encryption standards , Advanced Encryption Standard, Data Compression, Public Key Cryptography, RSA Algorithm, Authentication, Secure Hash Algorithms, Revision, Midterm Exam , Information System Security Auditing, Computer Forensic and Other Security Technologies, Information Security Risk Management , Securing and protecting data and storage, Access Control and Identity Management , Access Control and Identity Management Network Security – Attack & Defense, Auditing Information Systems, Security testing, logging, and auditing, Data validation, processing and balancing controls, Email Security, Web Security, Malicious software, Incident investigation and management, Firewalls, VPNs, and intrusion detection systems, Project Submission |
| Course Title | Web Engineering |
| Credit Hours | 3 |
| Prerequisites by Course(s) and Topics | |
| Textbook (orLaboratory Manualfor Laboratory Courses) | Web Engineering: A Practitioners’ approach, Roger s. Pressman, McGraw Hill (2009)Engineering Web Applications (Data-Centric Systems and Applications) Sven Casteleyn, Florian Daniel, Peter Dolog, MaristellaMatera ISBN-10: 3540922008 |
| Reference Material | Web Engineering: The Discipline of Systematic Development of Web Applications by John Willy, Gerti Kappel, Birgit Pryyll, Siegfried Reich and Werner Retschitzegger, McGraw Hill |
| Topics Covered | Topics to be covered, Introduction of Course plan, Introduction to Web and HTTP, Introduction to Web Engineering and Web Architecture, Web Architecture (cont.), Working with HTML5 (tags i.e. head, body, paragraph, tables, div, span, anchor)., Working with HTML5 (tag attributes, lists, form), Working with HTML5 (Composite review + Quiz), Introduction to CSS (inline, on-page, and external, CSS identifiers), Applying CSS, Introduction to Responsive Web frameworks, Introduction to Bootstrap (bootstrap 12 grid architecture), Applying Bootstrap, Introduction to JavaScript (what is client-side scripting, its use and importance, JavaScript syntax and usage), Basic JavaScript (accessing & modifying DOM elements) Working with DOM, Client-side validation, Advanced Client-side scripting (jQuery) Introduction to different client-side libraries and their benefits., Advanced client-side Scripting (jQuery), Midterm Exam, Introduction to server-side scripting (what it is and why it is important). Introduction to ASP.NET (types of web applications), Page Life Cycle., Consistent Look and Feel using ASP.NET (Master pages, User Controls), State Management (Session, Cookies), Database Connectivity (introduction to ADO.Net, LINQ, Entity Framework), Applying ADO.Net (Establish DB Connection, Read Operations (Difference between DataReader, DataSet, DataTable), Applying ADO.Net (Modifying Database, Execute Scalar, Execute Non-Query), Working with Stored Procedures using ADO.Net (defining parameters and executions), Web App Security, Web attacks and their prevention, Configuring ASP.Net Applications, Testing and Debugging Web Applications, Introduction to Web API & Web Services, SaaS, On-demand Web Requests (AJAX), Large scale applications, Term Project Submission |
| Course Title | Artificial Intelligence |
| Credit Hours | 3+1 |
| Prerequisites by Course(s) and Topics | CSC332 |
| Textbook (or Laboratory Manual for Laboratory Courses) | |
| Reference Material | 1. Russell, S. and Norvig, P. “Artificial Intelligence. A Modern Approach”, 3rd ed, Prentice Hall, Inc., 2015. 2. Norvig, P., “Paradigms of Artificial Intelligence Programming: Case studies in Common Lisp”, Morgan Kaufman Publishers, Inc., 1992. 3. Luger, G.F. and Stubblefield, W.A., “AI algorithms, data structures, and idioms in Prolog, Lisp, and Java”, Pearson Addison-Wesley. 2009. |
| Topics Covered | An Introduction to Artificial Intelligence and its applications towards Knowledge Based Systems, Logic(Propositional logic, predicate logic) quantifiers, Conditional quantifiers, logical connectives, Introduction to Reasoning and Knowledge Representation, designing the knowledgebase and inference engine, Expert Systems, designing expert systems, Problem Solving by Searching, introduction to informed searching and uninformed searching, Informed Searching Algorithms, Uninformed searching algorithms, Heuristics based search algorithms, Local searches, Min-max algorithm, Alpha beta pruning, Game-playing, Case Studies: General Problem Solver, Eliza Student, Case Studies: Macsyma, Learning from examples (Machine learning, supervised learning, unsupervised learning), Natural Language Processing, Recent trends in AI and applications of AI algorithms. |
| Course Title | Artificial Neural Networks |
| Credit Hours | 3 |
| Prerequisites by Course(s) and Topics | |
| Textbook (or Laboratory Manual for Laboratory Courses) | Neural Network Design Deep Learning |
| Reference Material | |
| Topics Covered | Introduction to Machine Learning and Neural Networks, Feed Forward Neural Networks, Back propagation, optimizers, Introduction to Deep Learning, Building Blocks of Deep Neural Network, Parameters VS Hyper parameters , Convolutiona Neural Networks, Training, Parameters and Parameters Tuning and Convolutional Neural Network, Recurrent Neural Networks , Long Short Term Memory Networks(LSTM), Implementation and Practice of Deep Recurrent Network, Introduction to Generative Models, Types of Generative Models, Generative Adversarial Networks (GANs), Training of Generative Adversarial Networks (GANs), Types of GANs, Auto encoders, Types of Autoencoders, Training of Autoencoders, Regression, Linear Regression, Deep Belief Networks, Recent Data Science Trends, Different Problems and their solutions using Deep Learning |
| Course Title | Deep Learning |
| Credit Hours | 3 |
| Prerequisites by Course(s) and Topics | Machine Learning |
| Textbook (or Laboratory Manual for Laboratory Courses) | Neural Network DesignDeep Learning |
| Topics Covered | Introduction to Introduction to Deep Learning, Building Blocks of Deep Neural Network , Feed Forward Neural Networks, Deep Learning Model Parameters, Parameters VS Hyper parameters, Convolutiona Neural Networks, Training, Parameters and Parameters Tuning and Convolutional Neural Network, Implementation of CNN in Keras, Recurrent Neural Networks , Long Short Term Memory Networks(LSTM), Implementation and Practice of Deep Recurrent Network, Implementation of LSTM in Keras, Introduction to Generative Models, Types of Generative Models, Generative Adversarial Networks (GANs), Training of Generative Adversarial Networks (GANs), Types of GANs, Implementation of GANs in Keras, Auto encoders, Types of Autoencoders, Training of Autoencoders, Implementation of Autoencoders in Keras, Regression using deep learning models, Recent Data Science Trends, Different Problems and their solutions using Deep Learning |
| Course Title | Applied Physics |
| Credit Hours | 3+1 |
| Prerequisites by Course(s) and Topics | None |
| Reference Material | 8.02 T Electricity and Magnetism Course, MIT Open Course Ware, Spring 2005 http://ow.mit.edu/OcwWeb/Physics/8.02TSpring-2005/CourseHome/index.htm Giancoli, D.C, Physics for Scientists & Engineers, Vol.2. Prentice Hall. |
| Course Objectives | General Principles of Mechanics, Force Vectors /Introduction, Force Vectors in 2 dimensions, Force Vectors in 2 dimensions, Force Vectors in 3 dimensions, Force Vectors in 3 dimensions, Force Vectors in 3 dimensions, Force Vectors in 3 dimensions, Moment of a force/Introduction, Moment of a force/Principle of moment, Moment of a couple/Introduction, Moment of a couple/Problems, Electric charge and Coulomb’s law, Electric charge and Coulomb’s law, Problems of Coulomb’s law, Problems of Coulomb’s law, MID TERM EXAMINATION, Electric field/problems , Electric field/problems , Gauss’s Law, Applications of Gauss’s Law, Applications of Gauss’s Law/ Electric potential energy and potential, Electric potential energy and potential, Electric potential/Applications, Magnetic fields, Magnetic fields, Sources of the Magnetic fields, Sources of the Magnetic fields, Faraday’s Law of Induction, Equilibrium of a Rigid body/friction, Equilibrium of a Rigid body/friction |
| Course Title | Calculus and Analytic Geometry |
| Credit Hours | 3 |
| Prerequisites by Course and Topics | Intermediate level mathematics |
| Reference Material | Calculus by Howard Anton 10th edition |
| Topics Covered | Preliminaries, Real numbers and real line, Lines, circles and parabolas, Functions and their graphs, Preliminaries continued, Identifying functions , Composite functions, Combining functions (shifting and scaling), Trigonometric functions, Limits and continuity, Rates of change and limits, Limits using limit laws, Precise definition of limit, Limits and continuity, One sided limits and limits at infinity, Continuity, Tangents and derivatives, Differentiation, The derivative as a function, Differentiation Rules, Differentiation, The derivative as a rate of change, Derivatives of trigonometric functions, Differentiation, Chain Rule , Implicit differentiation, Related rates, Application of Derivatives, Extreme values of functions, Mean value theorem, Monotonic functions and first derivative test., Concavity and curve sketching, Midterm , Application of Derivatives, Applied Optimization problems , Indeterminate forms and L’Hopital Rule, Antiderivatives, Integration, Estimating with finite sums, The definite Integral, The fundamental theorem of calculus, Integration, Indefinite integrals and the Substitution Rule, Substitution and Area between two curves, Application of Integration, Volume by slicing and rotation about axis, Volume by cylindrical shell, Application of Integration, Length of Plane Curves, Areas of Surface of Revolution , Transcendental Functions, Inverse functions and their derivatives, Natural Logarithms, The Exponential function, Transcendental Functions, Inverse Trigonometric functions, Hyperbolic functions, Integration by parts, Anything pending / revision |
| Course Title | Multivariate Calculus |
| Credit Hours | 3 |
| Prerequisites by Course and Topics | ASC101- Calculus & Analytic Geometry |
| Reference Material | Calculus by Howard Anton 10th edition |
| Course Outline | Techniques of Integration, Using basic integration formulas, Integration by parts, Trigonometric Integrals, Techniques of Integration , Trigonometric Substitutions, Integration by partial fractions, Techniques of Integration , Numerical Integration, Improper Integrals, Conic Sections and Polar Coordinates, Calculus with parametric curves, Polar coordinates, Conic Sections and Polar Coordinates, Areas and lengths in polar coordinates, Conic Sections, Infinite Sequences and Series, Sequences , Infinite Series, The integral and Comparison Tests, Infinite Sequences and Series, Ratio and Root Tests, Alternating series and conditional convergence, Infinite Sequences and Series, Power series, Taylor and Maclaurin Series, Midterm Examination, Partial derivatives, Functions of several variables, Limits and continuity in higher dimensions, Partial derivatives, Partial derivatives, Chain rule , Directional derivatives and Gradient Vectors, Partial derivatives, Tangent planes and Differentials, Extreme values and Saddle points, Taylor’s formula for two variables, Multiple Integrals, Double integrals, Double integrals in polar form, Multiple Integrals, Triple integrals, Substitution in Multiple integrals, Integration in Vector Fields, Line integrals and vector fields , Path independence , Integration in Vector Fields, Green’s Theorem in the plane, Stokes and Divergence Theorems, Intro to Transforms:, Anything pending / Revision, |
| Course Title | Computer Programming/Programming Fundamentals |
| Credit Hours | 3+1 |
| Prerequisites by Course(s) and Topics | SEN111 |
| Reference Material | Would be provided on student demand |
| Course Outline | Introduction to Program, Programming Languages, Flow Chart, Pseudo code, Algorithm, Introduction to C++, Different IDEs, Translators, Compiler, Character set, Variables, Input and output, Expressions and Operators, Conditional Statements, If and its family, Switch statement, Break and continue statement, Conditional operators, Nested if, Introduction to Iterations/loops, for loop, while loop, Examples using for and while loop, do-while loop, nested loops, Examples of do-while and nested loop, Introduction to built-in functions, Exercises using built-in functions, Midterm Exam, User defined functions, Function call, variable scope, lifetime, Call by value, call by reference using reference, call by reference using pointers, Introduction to Pointers, Pointer access and arithmetic, Collection of Variables, 1D Arrays, Operations on 1D arrays: sum, avg, max, min, searching, Functions, arrays and pointers, Introduction to structures, accessing structure members, Array of structures, pointers to structures, Filing |
| Course Title | Linear Algebra and Differential Equations |
| Credit Hours | 3 |
| Prerequisites by Course(s) and Topics | Calculus 1 and 2 |
| Textbook (orLaboratory Manualfor Laboratory Courses) | Text book: Elementary Linear Algebra by Anton 11th edition (PDF Version) Differential Equations with BVP 8th ed by Dennis G. Zill Reference Book: Linear Algebra with Applications 4th edition by Gilbert Strang. Comprehensive Course Notes and exercises, prepared by the Instructor. |
| Reference Material | |
| Topics Covered | Introduction to Linear Systems, Gaussian Elimination, Matrices and Matrix Operations, Inverse of a Matrix, Assignment 1, Elementary Matrices, Diagonal, Triangular and Symmetric Matrices, Assignment 2, Quiz 1, Applications of Linear Systems, Determinants, Properties of Determinants and Inv of A, Quiz 2, Vectors in 2 Space, Dot and Cross Product, Subspace, Linear Independence , Basis and Dimension, Assignment 3, Row, Col and Null Space, Assignment 4, Quiz 3, Eigen Values and Eigen Vectors, Diagonalization and Linear Transformation, Assignment 5, Quiz 4, Intro to DE, Concept of Solution, First order DE, Initial value problems, BVP, Modeling with first order DE, Second order DE, Method of Undetermined Coefficients, Variation of Parameters |
| Course Title | Software Requirement Engineering |
| Credit Hours | 3 |
| Prerequisites by Course(s) and Topics | — |
| Textbook (orLaboratory Manualfor Laboratory Courses) | Requirement Engineering: Processes and Techniques by Gerald Kotonya Ian Sommerville Software Engineering 9th edn by Ian Sommerville |
| Reference Material | Requirement Engineering by Steve EasterbrookRequirement Engineering by Elizabeth Hull, Ken Jackson and Jeremy Dick.Guide to SWBOK, SEI website, IEEE/ ACM, published papers |
| Topics Covered | Why Emphasize Requirements? , What are Requirements?, Requirements from User/Customer’s perspective, Issues related to system contract requirements and requirements problems., Social and Cultural Issues in Requirements Engineering, Types of Requirements (Functional, Non-Functional, Domain, Inverse etc.), The Quality of Requirements, Volatile Requirements and its types, IEE Rules for Software Requirements, Process, Process Models/System Life Cycle Models, Requirements within the System Life Cycle, Coping with the Real World, Actors and Stakeholders in the requirement Engineering Process, Requirements Verification, Tool Support to Requirement Engineering, Eliciting Requirements from Stakeholders, Planning elicitation meetings, Facilitating elicitation meetings, Specific Elicitation Techniques including Interviews, Scenarios, Prototyping, Observation etc., Latest Research Articles focusing on Importance and use of Software Requirement Engineering for a successful project. , Analyzing Requirements with Process Maps, Process-mapping methodologies, Software Modeling for Analysis (UML Modeling), Other analysis methodologies, Management of Requirement Analysis, Requirements Errors, Impact of Requirements Errors, Error Prevention in Requirements, Explanation with Real Case Studies, IEEE SRS Template Discussion, Importance of maintaining a proper document, Writing and Assembling the Requirements Document, Gathering the pieces, Key writing skills, Organizational skills and traceability, Validating Requirements, Applying validation skills, Writing testable requirements, Validation Techniques, Managing Changes to Update Your Document, What you can expect, Navigating the change process, Integrating Requirements into Your Organization, Requirements Modeling Analysis and Specifications of Real Case Studies like Banking System, Library System etc., Requirements Engineering for Agile Methods and Their Approaches to Requirements Elicitation and Management, Requirements Engineering for Web-Based Information Systems |
| Course Title | Software Construction |
| Credit Hours | 3 |
| Prerequisites by Course(s) and Topics | Introduction to Software Engineering |
| Textbook (or Laboratory Manual for Laboratory Courses) | Code Complete: A Practical Handbook of Software Construction by SteveMcConnell, Microsoft Press; 2nd Edition Object-Oriented Software Construction (Book/CD-ROM) (2nd Edition) by Bertrand Meyer, Prentice Hall; 2nd Edition |
| Reference Material | Code Complete: A Practical Handbook of Software Construction by SteveMcConnell, Microsoft Press; 2nd Edition |
| Topics Covered | Topics, Introduction to Software Construction, Introduction to software, Introduction to SDLC, Introduction to Construction, Metaphors for a Richer Understanding of Software Development, The Importance of Metaphors, How to Use Software Metaphors, Common Software Metaphors, Importance of Prerequisites of Target Software, Prerequisites and their importance , Software prerequisites , Key Construction Decisions, Choice of Programming Language, Programming Conventions, Localization Aspects of Technology, Selection of Construction Practices, Design in Software Construction, Design Challenges, Key Design Concepts, Design Building Blocks: Heuristics, Design Practices, Defensive Programming, Protecting Your Program From Invalid Inputs, Assertions, Error Handling Techniques, Exceptions, Defensive Programming, Barricade Your Program to Contain the Damage Caused by Errors, Debugging Aids, Determining How Much Defensive Programming to Leave in Production Code, Being Defensive About Defensive Programming, The General Principle of Software Quality, The Software-Quality Considerations, Characteristics of Software Quality, Techniques for Improving Software Quality, Relative Effectiveness of Quality Techniques, When to Do Quality Assurance, Collaborative Construction, Overview of Collaborative Development Practices, Pair Programming, Formal Inspections, Other Kinds of Collaborative Development Practices, Refactoring. Program Size & Software Construction., Kinds of Software Evolution, Introduction to Refactoring, Reasons to Refactor, Specific Refactoring, Refactoring Safely, Refactoring Strategies, Managing Construction, Encouraging Good Coding, Configuration Management, Estimating a Construction Schedule, Measurement, Managing Construction, Treating Programmers as People, Managing Your Manager, Integration., Importance of the Integration Approach, Integration Frequency—Phased or Incremental?, Incremental Integration Strategies, Programming Tools, Design Tools, Source-Code Tools, Executable-Code Tools, Tool-Oriented Environments, Building Your Own Programming Tools, Tool Fantasyland, Layout and Style, Layout Fundamentals, Layout Techniques, Layout Styles, Laying Out Control Structures, Individual Statements, Comments, Routines, Classes, Self-Documenting Code, External Documentation, Programming Style as Documentation, To Comment or Not to Comment, Keys to Effective Comments, Commenting Techniques, Presentation Week |
| Course Title | Software Quality Engineering |
| Credit Hours | 3 |
| Prerequisites by Course(s) and Topics | — |
| Textbook (or Laboratory Manual for Laboratory Courses) | Software Quality Assurance: From Theory to Implementation, by D. Galin, Pearson Education, 2004. Software Quality Engineering by Jeff Tian. |
| Reference Material | Papers from the literature in the field as well as sections from other texts will also be distributed, as well as a list of other useful books available in the library. |
| Topics Covered | Software Quality Introduction, Role of quality in software, Different perspectives of software quality, Quality Assurance & Engineering, Quality control, Verification and validation, SQA System Architecture , SQA System Architecture Components, Pre-project components, Contract review, Quality Planning and Control, Static analysis, Inspection Overview , Inspection Process, Formal Design Reviews/ Peer review , Walkthrough, Expert opinion, Automated Static Analysis / Automated Inspection, Defect Prevention/Process Improvement, Defect Classification and Analysis, Software Quality Models, McCall’s Model , ISO 9126 Model , FURPS Model , GQM Model , CMMI, Testing Concepts and Issues , Testing process, Testing Activities, Test cases, Test suit, Testing Techniques, Automated Testing, Automated Testing Techniques, Automated Tools, Software Maintenance , Software Configuration Management , Software Change Management, Reverse Engineering, Re-Engineering, Software Quality Measurement , Software Quality Attributes, Software Quality Metrics, Quality Management Standards |