Introduction to computers; Information Technology Basics; How Computers Work; Assembling a Computer; Operating System Fundamentals; Windows 9x Operating Systems; Windows NT/2000 Operating Systems; Windows XP; Multimedia Capabilities; Advanced Hardware Fundamentals for Servers; Networking Fundamentals; Printers and Printing; Preventive Maintenance and Upgrading; Troubleshooting PC Hardware; Troubleshooting Software.

- Credit: 3/lab
- Prerequisite: None

Starting Concept of Computer Programming; Introducing with the C editor's environment; Introduction to Data Types; Different Types of Operators; Different types of Expression Evaluation; Type casting; Introduction to Conditional Operators; if statement; switch statement; goto statement; Introduction to loops (while, do-while, for); Concept and use of array; Declaring one and two-dimensional arrays; Storing and accessing array elements manually and through loops; Introduction to string. scanning and printing strings; Different types of string manipulation; Introduction to pointers; use of pointes; Calling and accessing pointer type variables; Introduction to function; Defining and calling functions; Sending and receiving parameters; Scope of variables; Introducing call by value and call by reference. Introduction to structure and union; Use of structures; Defining and accessing structures; Nested structure; File manipulation; Creating file; Opening file in different modes; Storing and retrieving information from file. Introduction to object oriented Programming.

- Credit: 3/lab
- Prerequisite: None

Philosophy of Object Oriented Programming (OOP): Advantages of OOP over Structured programming: Encapsulation. Classes and objects access specifiers. Static and non-static members, Constructors, Destructors and copy constructors, Array of objects, object pointers and object references, Inheritances, Single and multiple inheritance, polymorphism, overloading, abstract classes, virtual functions and overriding, Exception: Object Oriented I/O: Template functions and classes: Multi- threaded Programming.

- Credit: 3/lab
- Prerequisite: CSC 1102

Introduction to Logic, Sets and Functions; Basics of Algorithms, Integers and Matrices; Counting and Probability Theory; Mathematical Reasoning; Introduction to Relations; Overview of Graphs; Trees; Semi groups and Groups.

- Credit: 3
- Prerequisite: CSC 1102

Internal data representation; Abstract data types, Elementary data structures: arrays, lists, Introduction to Elementary data structure (Arrays, Iteration and Recursion); Concept and details of Stacks and queues; Linked lists; Complexity Analysis (Space and time complexity); Introduction to Sorting; Searching; Tree (Basic terminology, Binary tree, Binary tree representation, Binary tree traversal), Complexity analysis, Simulations.; Binary search tree; Set and disjoint set union; Priority queues; Hashing; Graphs (Definition and terminology, Representation techniques).

- Credit: 3/Lab
- Prerequisite: CSC 1203, CSC 1204

Hardware organization and architecture and software architecture, Instruction types and their formats; Assemble program format, Assembly process, system services, Addressing methods, High level control structure formation. Use of subroutines and macros; Numeric processing and string processing; Concurrent processes and high level linking; Disk geometry, file system and file I/O handling; Digital logic, Memory systems, Interfacing and communication, Functional organization, Multiprocessor and alternative architectures, Performance enhancements, Contemporary architectures.

- Credit: 3/Lab
- Prerequisite: CSC 1203

Introduction to Database Systems; Advantages of DBMS, File processing system, Data Abstraction, Schemas and instances, Data Independence, Database languages, Role of DBA, Database users, Data models, Risk of Database approach, Components of database environments, DBMS system structure; Entity Relationship Modeling; Logical Database Design and Relational Model; Normalization; Relational Algebra; Structured Query Language. Basic SQL statements, data manipulation language, data definition language, simple queries, nested queries, different types of joins, constraints, aggregate functions, views.

- Credit: 3/Lab
- Prerequisite: CSC 1203

Introduction to operating system; Computer-System Structures; Operating system structure; Processes; CPU Scheduling; Process Synchronization; Deadlocks; Memory Management; Virtual Memory; File-System Interface. Kernel and Service; Interrupt Processing; Processor Management; File Organization; File systems; Backup and Recovery; Interdependencies of the four Management; Performance Measurement; Monitoring and Evaluation; Design principles; Tools of designing; Module interface approach and evaluation of an existing operating systems; Communication and networking; Various server setup.

- Credit: 3/Lab
- Prerequisite: CSC 2106

An overview of Java, Java and Object Oriented Programming; Inheritance and Overloading; Interface and Packages, Exception handling; Threading and Multithreading; Java I/O and New I/O; Graphical User Interface using Swing; Generics, Utilities and Collections; Graphical User Interface and Applets; Network Programming; Database Programming. Introduction and overview of XML,DTD,XSCHEMA; SAX/DOM/JAXP; JAXB; Java Servlet & Servlet containers; Java Server Pages (JSP) and java Beans™ ; Java Server Faces/JWEBUNIT; Introduction to Apache Struts; Introduction to java.RMI; SOAP/SAAJ/UDDI/WSDL webservices; Performance issues, JDK tuning, testing, profiling, benchmarking, deploying desktop applications, JUnit.

- Credit: 3/Lab
- Prerequisite: CSC 2105

Introduction to Software Modeling and UML; Use Case Diagram; Class Diagram; CRC Cards; Relationship, Sequence Diagram, Object Diagram and Collaboration Diagram, Activity Diagram; Statechart Diagram; Component Diagram; Deployment Diagram; COCOMO (Software Project Estimation); OO Software metrics; Introduction to Design Patterns; Project on UML.

- Credit: 3/Lab
- Prerequisite: CSC 2107, CSC 2105

Introduction to Algorithms; Performance Analysis; Divide and Conquer Algorithms; Dynamic Programming; Greedy Algorithms; Graph Algorithms; Shortest Path Problem; Back Tracking; Network Flows; Elementary Geometric Methods; NP - Completeness.

- Credit: 3/Lab
- Prerequisite: CSC 2105

Structured Query Languages; DDL; Constraints; DML; Database Transaction; QUERY; Index, Synonym, Sequence; Controlling user access; Privileges (System and Object), Creating and Dropping Users, Changing password, Role (standard and user), Grant, Public and Admin option, Sys and System user, Sysdba and sysoper privileges; Concurrency Control; Oracle Utilities; Database Administration; An introduction to PL/SQL; Object Relational database.

- Credit: 3/Lab
- Prerequisite: CSC 2107

Basic Mathematical Concepts; Finite Automaton; Non-determinism and Non-regular languages; DFA minimization and conversion of NFA, RE; Turing Machine; Context Free Grammar and Push Down Automata; Decidability and Undecidability; Recursion theorem and Rice's theorem, Halting problem; Theory of NP completeness; Space complexity.

- Credit: 3
- Prerequisite: CSC 2211

Introduction to Software Engineering; Software Process Models; Project management, planning and scheduling; Risk analysis and management; Software configuration management and quality assurance; Software Matrices; Requirements Engineering; OO Software Engineering and design; Testing Strategies; GUI Design; Testing Strategies.

- Credit: 3
- Prerequisite: CSC 2210

Introduction to the .Net Framework, Programming in C#; Windows Applications: Creating User Services, Creating and Managing Components and .NET Assemblies, Consuming and Manipulating Data, Testing and Debugging, Deploying , Maintaining and Supporting, Configuring and Securing; Web Applications: Creating User Services, Creating and Managing Components and .NET Assemblies, Consuming and Manipulating Data, Testing and Debugging, Deploying a, Maintaining and Supporting, Configuring and Securing; Creating, Managing, Testing, Debugging, Creating and Manipulating Data and Deploying Microsoft Windows® Services, Serviced Components, .NET Remoting Objects, and XML Web Services; Security Issues.

- Credit: 3/Lab
- Prerequisite: CSC 2209

Introduction to network and data communication concepts, Protocol concepts and functionality, Network Architectures - OSI Model and TCP/IP Model; Physical Layer: Signals, Analog and Digital Signals, Data Rate Limits, Transmission impairments; Transmission Media: Guided media, Wireless media; Digital Transmission: Line Coding, Block Coding, Sampling, Transmission Mode; Analog Transmission: Modulation of digital data, Telephone modems, Modulation of analog signals. Multiplexing: FDM, WDM, TDM; High Speed Digital Access: DSL, Cable Modems, and SONET; Data Link Layer: Error Detection and Correction, Data Link Control and Protocols; Point-to-point Access: PPP, Multiple Access; Local Area Networks; Wireless LAN: IEEE 802.11, Bluetooth; Internetworking devices, Frame Relay, ATM.

- Credit: 3
- Prerequisite: CSC 2208

Recurrent problems (Tower of Hanoi, Lines in the plane, Josephus problem), Sum, Integer Functions, Number Theory, Binomial Coefficients (Basic identities, Practice, Tricks of the trades, generating functions); Special Numbers, Generations Functions (Domino Theory, basic maneuvers, solving recurrences), Discrete Probability, Asymptotic, Random Numbers, Polynomial Arithmetic.

- Credit: 3
- Prerequisite: CSC 2211, MAT 3101

Introduction; Roots of Ethics; Decision making and Professionalism; Cyber History and Cyber Etiquette; Computer Crime and Information war; Information, Privacy and Law; Risk and Reliability; E-commerce and Business Ethics; Social Issues; Software Engineering Ethics.

- Credit: 3
- Prerequisite: MIS 3201

Fundamental Concepts of Graph; Paths, Cycles, and Trails. Vertex Degrees and Counting. Directed Graphs), Trees and Distance (Basic Properties. Spanning Trees and Enumeration. Optimization and Trees), Matchings and Factors (Matchings and Covers. Algorithms and Applications. Matchings in General Graphs), Connectivity and Paths (Cuts and Connectivity. k-connected Graphs. Network Flow Problems), Coloring of Graphs (Vertex Colorings and Upper Bounds. Structure of k-chromatic Graphs. Enumerative Aspects) Planar Graphs (Embeddings and Euler's Formula. Characterization of Planar Graphs. Parameters of Planarity), Edges and Cycles (Line Graphs and Edge-Coloring. Hamiltonian Cycles. Planarity, Coloring, and Cycles), Additional Topics (Optional) (Perfect Graphs. Matroids. Ramsey Theory. More Extremal Problems. Random Graphs. Eigenvalues of Graphs).

- Credit: 3
- Prerequisite: CSC 2211

Introductory concepts and Phases of compiler ; Lexical Analyzing; Introduction to FLEX; Syntax Analyzing; Parsing; Syntax Directed Translation and Type checking; Introduction to YACC or BISON; Intermediate Code Generations; Storage allocation strategies; Code Optimization.

- Credit: 3
- Prerequisite: CSC 3113

Introduction; Knowledge representation; Intelligent Agent; Rational Agent & Omniscience Agent, Structure of intelligent agent, Types of agents, Properties of Environment; Uninformed Search ; Informed Search; Game Playing; Constraint Satisfaction Problem; Logic Programming; Decision Tree; Neural Networks.

- Credit: 3/Lab
- Prerequisite: CSC 2211

Introduction and Practical use of HTML & XHTML; Introduction and Practical use of XML; Introduction and Practical use of XSL, & XSLT; use of XQuery, & Schema; XPATH, & XLINK; use of JavaScript; use of PHP; Database Connectivity with PHP; XML use with ASP.NET.

- Credit: 3/Lab
- Prerequisite: CSC 3115

Introduction to Computer Networks; Application Layer; Transport Layer; Network Layer; Data Link Layer; Network Security; Advanced Topics on Networking.

- Credit: 3
- Prerequisite: CSC 3116

Introduction to Computer Graphics; Scan Conversion; Clipping; Review of Vectors & Homogeneous Co-ordinate System; Transformations; Basics of OpenGL; Projections; Animation in OpenGL; Hidden Surface Removal; Lighting basics in OpenGL

- Credit: 3/Lab
- Prerequisite: CSC 2211, MAT 2202

Overview of Project Management; Planning Phase; Estimation and Budgeting; Scheduling; Hands-on MS-Project; Risk and Change Management; Development Management; System Test Process; Project Control; Final Phases & Other Issues.

- Credit: 3
- Prerequisite: CSC 3114

Introduction : System and software reqs. eng., Error propagation, Types and cost of requirements defects, definitions. Requirements Engineering Processes: RE evolutionary process, RE basic process, RE in software lifecycle, Process vs. product specifications. Requirements Analysis, Modeling and Specification: Problem analysis, Solution space, Requirements prioritization. Requirements Elicitation: Critical issues, Four worlds of RE, Desirable properties of requirements, Requirements traceability, goal-orientation, other elicitation techniques. : Use cases, episodes, scripts, completeness of scenarios, mis-use cases, anti-goals. Enterprise Requirements: Modeling Techniques: Agent-oriented enterprise modeling, Business modeling with UML, Conventional enterprise modeling techniques. Functional Requirements: Semi-formal Structural Models. Functional Requirements: Formal Structural Models. A Formal OO-RML/Telos: Deficiencies of SA, RML/Telos Essentials, A Formalization. Metamodeling: Models, Metaclasse, Metamodels, Metamodels for UML and other notations. Functional Requirements: Behavioral Models: Decision-oriented, State-oriented, Function-oriented behavioral models. Non-Functional Requirements: Why, What – definitions and classifications, How – product- and process-oriented approaches. Requirements Verification: Model Checking, Model Finder.

- Credit: 3
- Prerequisite: CSC 3114

Introduction to CRM core competencies; organizational challenges; CRM implementation trends and common CRM implementation planning strategies; define selling-chain management's core competencies; SM business drivers and aspects of SM infrastructure; Business drivers for implementing ERP, core aspects of ERP infra-structure; common ERP applications in industry and common ERP implementation planning strategies; SCM core competencies; planning and execution processes; supply chain fusion; management issues and common SCM implementation planning strategies; E-Procurement business drivers; operating resource procurement; Common E-Procurement business problems; buy-side and sell-side applications and common E-Procurement implementation planning strategies; Core knowledge management application classes; business drivers for KM; Core KM architectural characteristics and common KM implementation planning strategies.

- Credit: 3
- Prerequisite: MIS 3201

Security in Computer Networks; Cryptography Algorithms; Attacks, Services and Mechanisms; Electronic Mail Security; World Wide Web Security; IP Security; Web Security; Secure Electronic Transaction(SET); Classification of Intruders / Hackers, Intrusion Techniques, Techniques for Learning Passwords, Intrusion Detection; Viruses and Other Malicious Content, Trojan Horse, Zombie, Types of Viruses, Macro Virus, Email Virus, Worms, Anti-Virus Software, Advanced Anti-Virus Techniques; Concept and Methodologies about Firewalls.

- Credit: 3
- Prerequisite: CSC 3116

Basics of Embedded programming; Introduction to Smart Card programming with java card; Introduction to J2ME,CLDC,CDC, Developing User Interface with CLDC; Game Programming for small devices; Generic Connection Framework(GCF) ,Wireless Messaging API; Introduction to Real Time Java(RTJ) specification; Introduction to Microcontrollers.

- Credit: 3/Lab
- Prerequisite: CSC 3115, EEE 2205

Review of mathematical foundations for formal methods; Formal languages and techniques for specification and design including specifying syntax using grammars and finite state machines; Analysis and verification of specifications and designs; Use of assertions and proofs; Automated program and design transformation.

- Credit: 3
- Prerequisite: CSC 3114

Introduction: assets, threats, countermeasures; network security models, security functions: confidentiality, authentication, integrity, nonrepudiation, access control, availability, passive and active attacks, end-to-end vs link-to-link encryption. Classical Cryptography: key ideas, steganography, ciphers, cryptanalysis, cryptographic strength. Symmetric-Key cryptography: Feistel cipher; DES: basics, rounds, e-box, s-box, p-box, key box; Modes of Operation: ECB, CBC, CFB, OFB; Double DES, Triple DES, IDEA, RC5, AES, problems with symmetric key cryptography. Public-Key cryptography: requirements, confidentiality, authentication, modular arithmetic, Diffie-Hellman key exchange, RSA, attacks against RSA, hybrid cryptosystems, Elliptical Curve, Quantum Cryptography. Digital Signatures: characteristics, MAC's, one-way hash functions, signing and verification, birthday attack, public-key certificates, disavowed signatures, arbitrated digital signatures, chaffing & winnowing. Mutual Authentication: basics, replay attacks, man-in-the-middle, interlock protocol, Andrew Secure RPC, Needham Schroeder, Wide-Mouth Frog, Neuman-Stubblebine, Woo-Lam. BAN-Logic. Key Management: distribution, KDC, announcements and directories, public key certificates, X509 certification authorities, PGP web of trust, control vectors, key generation and destruction, key backup. Intruders and Programmed Threats: host access, password systems and attacks, one-time passwords, token cards, biometrics, trapdoors, programmed threats: trapdoors, logic bombs, trojan horses, viruses, worms, countermeasures, intrusion-direction. Firewalls: internet security policies, firewall design goals, firewall controls, TCP/IP, packet filtering routers, application-level gateways, circuit-level gateways, firewall architectures, VPNs. Web Security: WWW, web servers, CGI, active content, Java applets, Java security model: sandbox, class loaders, bytecode verification, security manager, Java attacks, bypassing Java, mobile code cryptography.

- Credit: 3
- Prerequisite: CSC 3223

Programming languages for embedded systems: desirable characteristics of programming languages for embedded systems, low-level versus high-level languages, main language implementation issues: control, typing, exception handling, modularity and multi-threading. Major programming languages for embedded systems: Assembly, C/C++, Ada, Java and Esterel. Timing characteristics of embedded systems: hard, soft and firm systems; fail-safe and fail-operational systems. Guaranteed-response, best-effort, event and time-triggered systems. Timing constraints in embedded systems. Performance analysis of embedded systems: software timing characterization and analysis methods. Runtime and Operating systems: real-time and non-realtime applications. Task assignment and scheduling: characteristics of tasks, task assignment and multi-tasking. Static and dynamic scheduling under constraints. Memory management and synchronization for embedded software: mutual exclusion, deadlock, starvation and lockouts; priority assignment, inversion; event flags and signals. Software optimization techniques under constraints: size, performance, embeddability metrics. Compilation techniques for embedded software: code generation, retargetability, code optimization. Examples of embedded and real-time software systems. Real time databases: transaction handling and consistency management.

- Credit: 3
- Prerequisite: CSC 3114

Quality: how to assure it and verify it, and the need for a culture of quality. Avoidance of errors and other quality problems. Inspections and reviews. Testing, verification and validation techniques. Process assurance vs. Product assurance. Quality process standards. Product and process assurance. Problem analysis and reporting. Statistical approaches to quality control.

- Credit: 3
- Prerequisite: CSC 3114

Evolution of Operating Systems, Multiprogramming and Time Sharing, Scheduling, Virtual Systems, Distributed Systems, Real-time systems, Object-oriented systems; Introduction to Operating System; UNIX files , Directories and Security; UNIX file system; UNIX Shell, tools and batch facilities; UNIX System Administration; UNIX shell programming; Perl scripting; Communication and networking; Various server setup; Security, Multimedia, and Mobile computing. Concurrency Management, Web Server System, Emerging Trends. Mutual Exclusion, Deadlock Starvation, Processes, Threads, Clients, Servers.

- Credit: 3/Lab
- Prerequisite: CSC 2208

Referencing conceptual models that help the strategist understand the interactions between competition, technology and corporate capabilities as they consider their organization's future; Analytical concepts to practical policy/strategy decision-making; contemporary policy and management issues specific to e-governance. Discussion about how government activities best included in an e-government package and how e-government initiatives can be evaluated; the roles of the public administrator and the general public in the new e-democracy.

- Credit: 3
- Prerequisite: CSC 3222

Multimedia Systems: Introduction; Signals; Information Theory and Codes; Images; Audio; Video; Vector Graphics and Virtual Reality; Transmission of multimedia between devices; Media Presentation and Synchronization.

- Credit: 3
- Prerequisite: CSC 3222

Introduction to simulation modeling of dynamic systems that will include theoretical studies and hands-on modeling workshops; System analysis and modeling with applications and case studies drawn primarily from ecology and economics; modeling software packages including Stella, Madonna, StarLogo, etc; Different modeling strategies and way to formulate, build and analyze models; Investigation of alternative modeling software packages.

- Credit: 3/Lab
- Prerequisite: CSC 3223, 2211

Bayesian Decision Theory: A solid treatment of classification theory in terms of Bayesian costs, decision functions and the geometry of decision regions for continuous and discrete random variables. Classification error probabilities and bounds; missing features; Bayesian belief networks. Maximum-Likelihood And Bayesian Parameter Estimation, and Bayesian Recognition Using A Priori Partially Unknown Distributions: General theory; Sufficient statistics; Large sample behavior for arbitrary distributions; Principal component analysis and discriminants; EM algorithm. Nonparametric Recognition: Parzen windows classifiers; K-Nearest-Neighbor classifiers. Support Vector Machines. Multilayer Neural Networks: Introduction to feedforward operation and classification; Backpropagation algorithm; Behavior considerations. Decision Trees: CART (classification and regression trees). Algorithm-Independent Machine Learning: Resampling for estimating statistics and classifier accuracy --- Bootstrap; Boosting. Unsupervised Learning And Clustering: Mixture densities and identifiability; K-Means clustering; Unsupervised Bayesian learning; Decision-directed approximation; Hierarchical clustering; Minimum spanning trees. Applications to estimation and recognition of 3D geometry from 3D range data or from multi-view images.

- Credit: 3
- Prerequisite: CSC 3224, CSC 4121

Introduction to knowledge discovery and data mining in databases and to present basic concepts relevant to real data mining applications, as well as reveal important research issues related to the knowledge discovery and mining applications; Fundamental concepts underlying knowledge discovery , data mining and hands-on experience with implementation of some data mining algorithms applied to real world cases. Research issues as well as mining strategies and issues relating specific industrial sectors; Systems for data mining.

- Credit: 3
- Prerequisite: CSC 4121, CSC 2107

Overview of human-computer interaction strategies from a number of perspectives including that of the engineer, cognitive psychologist, and end-user; Major themes include the design and evaluation of usable interfaces, matching computer systems with the cognitive capabilities of users and an investigation of novel paradigms in human-computer interaction; A team-based project, dealing with the design, development, and evaluation of a computer-based device to support distributed human communication.

- Credit: 3
- Prerequisite: CSC 4121

Introduction and overview, Linear inequalities, Geometry of linear programming, The linear programming problem, Structural optimization, FIR filter design, Applications in control, Network optimization, Duality, The simplex method, The barrier method, Convergence analysis of the barrier method, Primal-dual interior-point methods, Self-dual formulations, Large-scale linear programming, Integer linear programming.

- Credit: 3
- Prerequisite: CSC 4121, MAT 3101

Special topics not covered in other programming courses. Latest industry trends and development will be covered as the class topic.

- Credit: 3
- Prerequisite: CSC 3115

Special topics not covered in other programming courses. Latest industry trends and development will be covered as the class topic.

- Credit: 3
- Prerequisite: CSC 3115

Special topics not covered in other programming courses. Latest industry trends and development will be covered as the class topic.

- Credit: 3
- Prerequisite: CSC 3115

The course will be structured around four activities: lectures on research strategy and tactics, statistical methods, and experimental design; discussions of technical papers; and preparation, review of written assignments, How refereeing works, time & stress management and Library Skills: On-line literature searching and document retrieval. Significant reading, reviewing, and writing - the kinds of writing computer scientists do. How scientific publishing works. Structure of a undergraduate thesis, writing an abstract, common problems of technical writing. Students will be expected to participate actively in class discussions.

- Credit: 3
- Prerequisite: Graduating year

Development of significant software system, employing knowledge gained from courses throughout the program. Includes development of requirements, design, implementation, and quality assurance. Students may follow any suitable process model, must pay attention to quality issues, and must manage the project themselves, following all appropriate project management techniques. Success of the project is determined in large part by whether students have adequately solved their customer's problem.

- Credit: 3
- Prerequisite: Pre-graduating year

Development of significant software system, employing knowledge gained from courses throughout the program. Includes development of requirements, design, implementation, and quality assurance. Students may follow any suitable process model, must pay attention to quality issues, and must manage the project themselves, following all appropriate project management techniques. Success of the project is determined in large part by whether students have adequately solved their customer’s problem.

- Credit: 3
- Prerequisite: For Grad. year and CSC 3297

Study of problems in the field of Computer Science.

- Credit: 3
- Prerequisite: At least 100 credits should be completed.

Foundations of Information Systems in Business; Competing with Information Technology; Computer Hardware and Computer Software; Data Resource Management; Telecommunications and Networks; Electronic Business Systems and Enterprise Business Systems ; Electronic Commerce Systems; Decision Support Systems and Planning Fundamentals for Developing Business/IT Strategies; Implementation Challenge of Developing Business/IT Strategies and Developing Business/IT Solutions; Security and Ethical Challenges; Enterprise and Global Management of Information Technology.

- Credit: 3
- Prerequisite: CSC 1203

Mechanics: 1. Kinematics (a) Graphical representations of displacement-time, velocity-time and acceleration-time. (b) Motion in two and three dimensions - projectile motion. 2. Applications of Newton’s laws of motion, Free body diagrams, Analyses of frames of trusses, Friction, Equilibrium of forces. 3. Work-kinetic energy theorem. Power, Conservative forces. Conservation of energy. 4. Conservation of linear momentum for a system of particles. Center-of-mass motion. Elastic and inelastic collision in one dimension. 5. Rotational kinematics. Angular momentum of a single particle. Conservation of angular momentum. Moment of Inertia, Balancing of rotating masses. 6. Gravitation: Gravitational field. Kepler’s laws. 7. Robotics: Introduction to robotics, essential components of a robot & their kinematics, links, frames, spatial motions, programming robots, clocks, sensors, actuators and control. Thermodynamics: 1. Zeroth, 1st and 2nd law of thermodynamics. 2. Reversible and irreversible processes, Carnot cycle, Rankine cycle, Auto cycle, Diesel cycle and their Efficiency. 3. Clausius’ theorem. Entropy. Absolute scale of temperature. Clausius Clapeyron equation. Thermodynamic functions. 4. Maxwell’s thermodynamic relations. Problem’s involving thermodynamic relations and functions. Gibbs phase rule.

- Credit: 3
- Prerequisite: None

Laboratory works based on PHY 1101.

- Credit: 1
- Prerequisite: None

Electrostatics: 1. Coulomb’s Law. Electric field. and calculation of electric field. 2. Electric flux, Gauss’ law and its application in electric field calculation. 3. Electric potential and its calculation in various cases. 4. Capacitors. Calculation of capacitance. Parallel and series combination of capacitors. Electrostatic energy in a capacitor. Electrostatic field energy. Dielectrics. Current Electricity: 1. Electric current. Ohm’s Law and resistance. Direct-current circuits. Kirchhoff’s rules. RC circuits. 2. Magnetic field. Force on current conducting conductors in a magnetic field. Motion of a point charge in a magnetic field. The Hall effect. 3. Biot-Savart law and its applications. Ampere’s law and its applications. 4. Faraday’s law. Motional emf. Application of Faraday’s law. LR circuits. Electromagnetic oscillations, LC and LRC circuits. Optics: 1. Lens Aberrations, Microscopes and Camera. 2. Waves- Simple Harmonic motion, Travelling and Standing waves, Doppler effect. 3. Interference of light. 4. Diffraction of waves. Diffraction from a single slit. Diffraction grating. 5. Polarization of electromagnetic waves. 6. Laser basics and applications, Optical effects in crystals, Nonlinear optics-an introductory discussion. 7. Elementary discussion on fiber optics.

- Credit: 3
- Prerequisite: PHY 1101

Laboratory works based on PHY1203.

- Credit: 1
- Prerequisite: PHY 1102

Differential Calculus: Limit, continuity and differentiability, successive differentiation of various types of functions, Leibnitz’s rule, Taylors theorem in finite and infinite forms. Maclaurin’s theorem in finite and infinite forms. Lagrange’s form of remainders. Expansion of functions. Evaluation of limit of indeterminate forms by L’ Hospital’s rule. Partial differentiation, Euler’s theorem. Equations of Tangent and normal. Determination of maximum and minimum values of functions and points of inflexion. Applications, curvature, radius of curvature and center of curvature. Co-ordinate Geometry: Change of axes, transformation of co-ordinates and simplification of equations of curves. Pair of straight lines, conditions under which general equations of the second degree may represent a pair of straight lines. Homogeneous equations of second degree. Angle between the pair of lines. Pair of lines joining the origin to the point of intersection of two curves. Standard equations of circle, parabola, ellipse and hyperbola with explanations. Conic together with its Cartesian and polar equations. Discussions of the general equation of second degree in x and y for for representing a conic. Representation of a point in a space. Rectangular Cartesian co-ordinates. Distance and Division formulae. Direction cosines and direction ratios of a line. Angle between two lines. Projection of a segment.Projection of the joint of two points on a line. The equation of a plane, its normal form and intercept form. Angle between two planes. The equation of a line in symmetrical form. Equations of sphere, paraboloid and ellipsoid.

- Credit: 3
- Prerequisite: None

Integral Calculus: Definitions of integration. Integration by the method of substitution. Integration by parts. Standard integrals. Integration by the method of successive reduction. Definite integrals, its properties and its use in summing series. Wallis formula, improper integrals, Beta function and Gamma function. Area under a plane curve in cartesian and polar co-ordinates. Area of the region enclosed by two curves in cartesian and polar co-ordinates. Trapezoidal rule, Simpson’s rule. Arc lengths of curves in Cartesian and polar co-ordinates, parametric and pedal equations. Intrinsic equation, volume of solid of revolution. Volume of solids of revolutions by shell method. Area of surface of revolution. Ordinary Differential Equations Degree and order of ordinary differential equations. Formation of differential equations. Solutions of first order differential equations by various methods. Solutions of general linear equations of second and higher orders with constant co-efficients. Solution of homogeneous linear equation Applications. Solution of differential equations of the higher order when the dependent and independent variables are absent. Solution of differential equation by the method based on the factorization of the operators.

- Credit: 3
- Prerequisite: MAT 1102

Matrices: Definition of matrix. Different types of matrices. Algebra of matrices. Adjoint and inverse of a matrix. Rank and elementary transformations of matrices. Normal and canonical forms. Solution of linear equations. Matrix polynomials. Eigen values and eigenvectors. Vectors: Scalars and vectors; equality of vectors. Addition .and subtraction of vectors. Multiplication of vectors by scalars. Scalar and vector product of two vectors and their geometrical interpretation Triple products and multiple products. Linear dependence and independence of vectors. Differentiation and integration of vectors together with elementary applications. Definition of line, surface and volume integrals, Gradient, divergence and curl of point functions. Various formulae, Gauss’s theorem, Stoke’s theorem, Green’s theorem. Fourier Analysis Real and complex forms. Finite Fourier transform. Fourier integral. Fourier transforms and their uses in solving boundary value problems.

- Credit: 3
- Prerequisite: MAT 1205

Introduction, Solution of algebraic and transcendental equations: Method of iteration, False position method, Newton-Rhapson method, Solution of simultaneous linear equations: Cramer’s rule, Iteration method, Gauss-Jordan Elimination method, Choleski’s process, Interpolation: Diagonal and horizontal differences, Differences of a polynomial, Newton’s formula for forward and backward interpolation, Spline interpolation, Integration: General quadrature formula, Trapezoidal rule, Simpson’s rule, Weddle’s rule, Solution of ordinary differential equations: Euler’s method, Picard’s method, Milne’s method, Taylor’s series method, Runge-Kutta method. Least squares approximation of functions: Linear and polynomial regression, Fitting exponential and trigonometric functions.

- Credit: 3
- Prerequisite: MAT 2202

Probability theory, discrete and continuous probability distributions, sampling theory and estimation, test of hypothesis, regression and correlation analysis, analysis of variance, decision making using probabilities, decision trees, application of game theory.

- Credit: 3
- Prerequisite: MAT 1205

Practical Grammar: Phonetic Symbols; Vocabulary; Article; Adjectives; Verbs; Number, Parts of Speech; Voice; Tense; Sentences; Clause; Prepositions; Punctuation; Letters and Messages, Basic English Conversations and Pronunciation; listening.

- Credit: 3
- Prerequisite: None

English as a Language, Aspects of Paragraphing, Forms of Discourse (Exposition, Narration, Description, Persuasion), grammar, tenses, gerund, question forms, expressing quantity, research paper - steps, format and documentation.

- Credit: 3
- Prerequisite: ENG 1101

This course is designed to help the students in learning the techniques and acquiring the skills needed to communicate effectively in the business world. The course deals with the basic English in the practice to communication in different business situation. Various techniques of communication such as business letters, reports, project proposal and other media form an integral part of the course.

- Credit: 3
- Prerequisite: ENG 1202

The purpose of this course is to acquaint engineering and science students with certain management principles and techniques having applications in engineering and scientific fields. Topics covered are principles and functions of management, managerial work roles, functions of organizations, finance, product development, operations management, quality, project planning and management, human resources management, operations research and engineering management in practice.

- Credit: 3
- Prerequisite: ENG 2101

The broad objective of the course is to understand and explain the different aspects of the management principles. Throughout the course the students will be introduced to theoretical dimension of principles of management (planning, decision making, staffing, communicating, leading, motivating, controlling) as well as application and implementation of these concepts and theories in the real world situation.

- Credit: 3
- Prerequisite: BBA 1204

This course evaluates, from the management point of view, marketing as a system for the satisfaction of human wants and a catalyst of business activity. The course deals with the issues at all levels from producer to consumer and emphasizes the planning required for the efficient use of marketing tools in the development and expansion of markets. Further, it solely introduces students on the principles, functions, tools, and strategies for marketing. Topics include how individual and organizational consumers make decisions, segmenting markets and estimating customer economic value, positioning the firm’s offering, effective marketing research, new product development, pricing strategies, communicating with customers and estimating advertising’s effectiveness, and managing relationships with sales force and distribution partners.

- Credit: 3
- Prerequisite: None

This course deals with the accumulation and use of accounting data in business, fundamental procedures and records, income measurement and preparation of financial statement. It introduces concepts, principles and system of book keeping and accounting. The whole accounting process (from transaction to financial statements preparation) is the main focus of this course.

- Credit: 3
- Prerequisite: None

The broad objective of the course is to understand and explain the different aspects of the management principles. Throughout the course the students will be introduced to theoretical dimension of principles of management (planning, decision making, staffing, communicating, leading, motivating, controlling) as well as application and implementation of these concepts and theories in the real world situation.

- Credit: 3
- Prerequisite: None

Advanced and comparatively critical levels of mathematical tools are introduced in this course. Methods of solving business problems are reviewed at length. Topics covered in this course will include compact notation (vector, matrix and summation), linear programming-simplex method, elementary probability and statistics, application of differential calculus and integral calculus.

- Credit: 3
- Prerequisite: MAT 1101

This course is designed to provide the students with the basic ideas of our daily life science. The course consists of three basic areas of science, Basic Physics, Basic Chemistry and Basic Biology. Basic Physics consists of elementary physics, magnetism, properties of light, electricity and properties of heat. Basic Chemistry consists of introduction to chemistry, molecular properties, chemical formulas and names, chemical bonding, acids and bases, oxidation and reductions, organic chemistry and metals. Basic Biology consists of cells, food and diet, variation, heredity and genetics, the balance of nature, ecology and ecosystems, pollution and conservation.

- Credit: 3
- Prerequisite: None

This course is designed to acquaint the students with the basic statistical tools and concepts, and enable them to relate their learning with the real world situation. This course helps the students to apply statistical tools in making business decisions. Due emphasis will be given on topics like collection of data, tabulation and graphical presentation, measures of central tendency, measures of dispersion, normal distribution and standard scores, basic concepts of probability, sampling and sampling distribution, estimation, hypothesis testing, chi-square, nonparametric statistics, regression and correlation, time series analysis and index number.

- Credit: 3
- Prerequisite: MAT 1102

The intention of this course is to introduce the students to principles essential to understanding the basic economizing problem and specific economic issues and policy alternatives for dealing with them. Two fortunate outcome of this course are an ability to reason accurately and dispassionately about economic matters and a lasting interest in economics. Topics included are concept of demand and supply, elasticity, theory of production, theory of cost, market structure, unemployment, inflation, fiscal and monetary policies.

- Credit: 3
- Prerequisite: MAT 1202 or MAT 1205, CSC 1204

Number systems and codes, Digital logic: Boolean algebra, De-Morgans law, Logic gates and their truth tables, canonical forms, combinational logic circuits, minimization techniques, Arithmetic and data handling logic circuit, decoders and encoders. Multiplexers and Demultiplexers. Combinational Circuit design, Flip-flops, race around problems, Counters: Asynchronous and Synchronous counters and their applications. Synchronous and asynchronous logic design: state diagram, Mealy and Moore machine. State minimization and assignments. Pulse mode logic. Fundamental mode logic design.

- Credit: 3
- Prerequisite: PHY 1203

Laboratory works based on EEE 2105.

- Credit: 1
- Prerequisite: PHY 1204

Introduction, drafting instruments and materials, lettering, alphabet of lines, dimensioning, geometric construction, conic sections, orthographic projection, isometric and oblique views, free hand sketching, construction of scale, sections and conventions, surface development. Making plan, section and elevation of residential building.

- Credit: 1
- Prerequisite: None

Units, DC sources, resistance and conductance, Ohms law, power and energy, series and parallel circuits, Kirchhoff’s laws, Mesh and Nodal analysis, Y-Delta Conversion, Circuit theorems, Electrical field, Capacitors, Magnetic Circuits, Inductance, Transient analysis of R-C and R-L circuits with DC excitation.

- Credit: 3
- Prerequisite: PHY 1101

Laboratory works based on EEE 1201.

- Credit: 1
- Prerequisite: PHY 1102

Alternating current, AC quantities, sinusoidal waveforms, AC Circuit Analysis: RC, RL, RLC series and parallel circuits, Power and Power Factor. Network Theorems. Dependent sources. Resonance and Q factors, Polyphase systems - balanced and unbalanced, Coupled circuits, Filters.

- Credit: 3
- Prerequisite: EEE 1201

Laboratory works based on EEE 2101.

- Credit: 1
- Prerequisite: EEE 1202

Introduction to different types of microprocessors (8 bit, 16 bit etc.) Introduction sets. Hardware organization. Microprocessor interfacing. Introduction to available microprocessor IC’s. Microprocessor applications. Design of digital computer subsystem. Flow of information and logical flow diagram in timing and control signals. System organization: Hardware structures. Design of control unit of digital computer. Introduction to micro- programming. Multiprogramming, real time and time sharing computer systems. Data and instructions. Data systems, addressing of operative memory. Machine instructions. Channel programs. Assembler program. Program execution. Program execution. Interrupt systems, I systems. Interconnection of computers. Operating systems. Control program. File handler. Program structure. Virtual memory.

- Credit: 3
- Prerequisite: EEE 2205, CSC 2106

VLSI technology: Terminologies and trends, MOS transistor characteristics and equations, NMOS an CMOS inverters, DC and transient characteristics, Pass transistors and pass gates, CMOS layout and design rules, Complex CMOS gates, Resistance and capacitance, Estimation and modeling, Sign propagation, delay, noise margin and power consumption, Interconnect BICMOS circuits. CMI building blocks, Adders, Counters, Multipliers and barrel shifters. Data paths, Memory structures PLAs and FPGAs. VLSI testing, Objectives and strategies.

- Credit: 3/Lab
- Prerequisite: EEE 2205

Introduction to VHDL. Basic VHDL constructs. Design of combination logic (adders, multipliers, compurgators, multiplexers, demultiplexers, ALU5 etc.) and sequential logic (flip-flops, registers, shift registers, random number generators, counters, FSM etc.) with behavioral VHDL descriptions. Use of an industrial EDA tool for functional and post-route simulations, logic synthesis and automatic place and route. Writing test benches. Design of FSMs. Converting algorithms to hardware using ASM charts and top-down design methodologies with CPLDs and FPGAs as target technologies, emphasis on FSM design techniques. Controlloer-datapath partitioning. algorithms that describe datapath element. N Design of simple and RISC processors. Pipelining.

- Credit: 3/Lab
- Prerequisite: EEE 2205

Overview of communication systems, signal spectra, Amplitude modulation and demodulation: DSB-SC, SSB, VSB. Frequency modulation and demodulation: NBFM, WBFM and Phase Modulation (PM). Pulse Modulation: PAM, P0 Delta Modulation, Frequency division and time dMsion multiplexing and their application. Digital Modulation systems, Modems, Introduction to telegraphic theory. Radio wave propagation, effects of ionosphere and earths curvature. Introduction to satellite communication. Introduction to cellular mobile communication. Introduction to telephony, different types of switching, SPC and digital switching systems, time and space switching. Introduction to ATM, SON, SONET and optical communications. RADAR and its applications.

- Credit: 3
- Prerequisite: EEE 3101

Laboratory works based on EEE 4105.

- Credit: 1
- Prerequisite: EEE 3102

Semiconductors, Junction diode characteristics, Bipolar Junction Transistor: characteristics, small signal low frequency h-parameter model, hybrid pi-model, Amplifiers: Voltage and Current amplifiers. Introduction to JFET, MOSFET, PMOS, NMOS and CMOS: biasing and application in switching characteristics and application. Introduction to rectifiers, filters, regulated power supply. Introduction to IC fabrication techniques.

- Credit: 3
- Prerequisite: EEE 1201

Laboratory works based on EEE 2101.

- Credit: 1
- Prerequisite: EEE 1202

Diode logic gates, transistor switches, transistor-transistor gates, MOS gates, Logic Families: TTL, ECL, IIL and CMOS logic with operation details. Propagation delay, Product and noise immunity, Open collector and high impedance gates. Electronic circuit for flip-flops, counters and registers, memory systems. PLAs, A/D and D/A converters with applications. S/H circuits. LED, LCD and optically coupled oscillators. Non-linear applications of OP-AMPs. Analog switches. Linear wave shaping; diode wave shaping techniques; clipping and clamping circuits, comparator circuits, switching circuits. Pulse transformers pulse transmission. Pulse generation. Monostable, bistable and astable multivibrators; Schmit trigger; blocking oscillators and time base circuit. Timing circuit, simple voltage sweeps, linear current sweeps.

- Credit: 3
- Prerequisite: EEE 2101

Laboratory works based on EEE 3101.

- Credit: 1
- Prerequisite: EEE 2102