History

### B.Sc. in CE

#### Admission Requirements

- Minimum GPA
**3.5**both in**SSC**and**HSC** - O'Level in minimum
**5**subjects with a GPA**2.50**and A'Level in**2**subjects with a minimum GPA**2.00** - International Baccalaureate or High School Diploma
- Other 12 years equivalent degree (must have the equivalence certificate from Ministry of Education)
- Engineering Students must have
**Math**and**Physics**in their__HSC with at least__.**B**grade

#### Scholarships Info

Starting from the admission, IUB offers a wide-range of scholarships and financial aid to its students.

**Full Tuition Waiver**is granted to students who have secured a GPA of 5.0 (without 4th subject) on a scale of 5.0 in both SSC & HSC exam or Students with 3 A's in A' Levels and 7 A's in O' Levels**Discount tuition waiver**is granted to students based on performance and financial need.**50% financial discount**for siblings and spouse.**On-campus employment**program is also available.

#### Tuition Fees & Other Charges

Application fee | Tk. 1000 |

Admission Fees | Tk.17,500 (Once in 4 year) |

Library, Laboratory & Student Activities fees | Tk.6,000 |

Regular students | Tk.5,500 (per credit) |

#### Credit Transfer Facility

- B.A., B.Sc., B.S.S., B.Com (pass) graduates are also eligible for admission. These students may apply to transfer their credits in relevant courses.
- Syllabi of IUB are designed to suit credit transfers and postgraduate studies abroad.

#### BSc. In Computer Engineering

In order to obtain a B.Sc. in Computer Engineering, a student must complete a minimum of 126 credits of coursework.

Foundation Courses |
41 | |

Major |
70 | |

Core Courses |
28 | |

CCR 201 | Discrete Mathematics | 3 |

CCR 203 | Data Structure | 3 |

CCR 204 | Computer Hardware & Digital Logic | 3 |

CCR 204L | Lab work based on CCR 204 | 1 |

CCR 205 | Programming Concepts | 3 |

CCR 205L | Programming Concepts Lab | 1 |

CCR 212 | Microprocessor & Assembly Lang | 3 |

CCR 212L | Lab work based on CCR 212 | 1 |

CCR 305 | Object Oriented Programming -I | 3 |

CCR 305L | Object Oriented Programming Lab | 1 |

CCR 311 | Computer Organization & Architecture | 3 |

CCR 413 | Design of Operation System | 3 |

Concentration |
36 | |

ECR 101 | Introduction to Electrical Engineering | 3 |

ECR 101L | Lab work based on ECR 101 | 1 |

CEN 210 | Electronics Devices & Circuits | 3 |

CEN 210L | Lab work based on CEN 210 | 1 |

CEN 330 | Data Communication | 3 |

CEN 404 | Embedded Systems | 3 |

CEN 412 | Wireless Networking & Mobile Comm | 3 |

CEN 430 | Computer Networks | 3 |

CEN 430L | Computer Networks Lab | 1 |

CEN 432 | Electrical Drives & Instrumentation | 3 |

CEN 445 | Software Engineering | 3 |

Minor in Computer Engineering |
15 | |

Students who wish to do minor in Computer Engineering must take the following courses |
||

CCR 204 | Computer Hardware & Digital Logic | 3 |

CCR 204L | Lab work based on CCR 204 | 1 |

CCR 205 | Programming Concepts | 3 |

CCR 205L | Programming Concepts Lab | 1 |

CEN 210 | Electronics Devices & Circuits | 3 |

CEN 210L | Lab work based on CEN 210 | 1 |

CEN 330 | Data Communication | 3 |

Optional Courses (Any 3) |
9 | |

CEN 401 | Database Management | 3 |

CEN 401L | Lab work based on CEN 401 | 1 |

CEN 405 | MIS & System Analysis | 3 |

CEN 414 | Digital System Design | 3 |

CEN 420 | Image Process & Pattern Recognition | 3 |

CEN 425 | Artificial Intelligence | 3 |

CEN 435 | Computer Graphics | 3 |

CEN 440 | Computer Simulation and Modeling | 3 |

CEN 450 | Computer and Network Security | 3 |

CEN 455 | Web Application & Internet | 3 |

CEN 465 | E-Commerce & Web Database | 3 |

CEN 470 | Introduction to Parallel Programming | 3 |

CEN 475 | VLSI Design & Testing | 3 |

CEN 480 | Computer Vision | 3 |

CEN 485 | Telecommunication Engineering | 3 |

CEN 490 | Special Topic in Computer Engineering | 3 |

Internship Program or Senior Project |
6 | |

CSC 498 | Senior Project | 6 |

CSC 499 | Internship Programme | 6 |

Minor |
15 | |

MAT 103 | Mathematical Foundation of Comp Sci. | 3 |

MAT 201 | Calculus - I | 3 |

MAT 251 | Calculus - II | 3 |

MAT 303 | Linear Algebra and Differential Equation | 3 |

Any one from the following |
||

MAT 401 | Graph Theories | 3 |

MAT 403 | Intro. to Mathematical Modeling | 3 |

MAT 405 | Optimisation Techniques | 3 |

MAT 410 | Numerical Methods | 3 |

MAT 420 | Computational Geometry | 3 |

MAT 430 | Intro to Discrete Dynamical System | 3 |

Total Credits |
126 |

### Four year Plan

Semester01 | Semester02 | Semester03 | |

Total 13 cr. ENG101 HUM1/SOC1 MAT102 PHY101+L |
Total 13 cr. CSC101 ENG102 HUM/SOC 1 PHY102+L |
Total 14 cr. CCR205+L ENG105 HUM/SOC 2 ECR101+L |
Year 1
Total 40 cr. |

Total 13 cr. CCR204+L HUM/SOC 2 MAT103 MAT212 |
Total 14 cr. CCR201 CCR203 CCR212+L CEN210+L |
Total 13 cr. CCR305+L CCR311 CEN330 MAT201 |
Year 2
Total 40 cr. |

Total 12 cr. CEN404 CEN412 CENOP1 MAT251 |
Total 13 cr. CEN413 CEN430+L CENOP2 MAT303 |
Total 12 cr. CEN432 CEN445 CENOP3 MAT OP1 |
Year 3
Total 37 cr. |

Total 6 cr. CSC498 or CSC499 |
Year 4
Total 6 cr. |

**Description of Courses**

**CCR 201 Discrete Mathematics (3 credits): **Advanced counting techniques: generating functions of sequences, recurrence relations, solving recurrence relations by substitution and generating functions, method of characteristic roots, solution of inhomogeneous recurrence relations. Algebraic structures: semigroups and monoids, groups, subgroups and homomorphisms, cosets and Lagrange's theorem, normal subgroups, rings and fields, lattices and Boolean algebra. Coding and channels: optimal coding, Huffman's algorithm for constructing an optimal code. Faneaux algorithm. Introduction to graphs.(*Prerequisite: CSC 101, MAT 103*)

**CCR 203 Data Structures (3 credits ): **Elementary data structure: Elements of data representation and storage. Arrays and Linked Lists (singly linked list and doubly linked list). Abstract data types: Stack, Queue, Priority Queue. Comparative analysis of different implementations of ADTs (Array based and linked list based). BST (Binary Search tree), Heap. Efficient Priority Queue (Heap based). Complexity analysis of dictionary operations (Insertion/Deletion/search) on ADTs. Data structure as a facilitator of smart searching and sorting algorithms (Binary search, Heap sort). Graphs (Connectivity graph, Directed and Undirected graph). Balanced search tree: Red Black Tree. (*Prerequisite: CCR 205*)

**CCR 204 Introduction to Computer Hardware and Digital Logic (3 credits): **Digital and analog systems. Number systems and codes; logic gates, Boolean algebra, arithmetic circuits, latches, register, counters, MSI logic circuits, flip-flops, A-D and D-A converters, IC logic families, memory devices, PLD, ASIC, FPGA. (*Prerequisite: PHY 102*)

**CCR 204L Lab work based on CCR 204 (1 credit )**

**CCR 205 in Programming Concepts (3 credits): **A course in advanced programming with data structures and algorithm design. The emphasis is increasingly on structured design techniques and program development. Topics include programming. design techniques, advanced language features, pointers an dynamic allocation, implementation of data structures; recursion, programming of sorting and searching algorithms; low level programming in C; data file handling. Introduction to data abstraction and basic concepts of object-oriented programming. (*Prerequisite: CSC 101*)

**CCR 205L Lab work based on CCR 203 and CCR 205 ( 1 credit)**

**CCR 212 Microprocessor and Assembly Language (3 credits): **Organization of a computer. Introduction to 80X 86 families of microprocessors; Microprocessor Architecture, addressing mechanism, Instruction set, Instruction format. Assembly Language programming: assembling, linking, running and debugging programs. Controlling program development; Interrupt system. Microprocessor interfacing with memory and other devices. 8086 based system design, Programmable peripheral Interface: 8255A, 8251A, DMA controller 8237, Interrupt controller 8259A. Overview of advanced processors: 80386, Pentium and Multicore processors. (*Prerequisite: CCR 204*)

**CCR 305 Object-Oriented Programming I (3 credits): **Objects and classes; Constructors and destructor; Abstract Data Structures, Function chaining; Friend functions; Function and operator overloading; Composition and Inheritance; Dynamic polymorphism using virtual functions; Exception handling; Template functions and classes; Standard Template Library; Programming Languages C++/ Java/ C#. (*Prerequisite: CCR 205*)

**CCR 305L Lab work based on CCR 305 (1 credit)**

**CCR 311 Computer Organization and Architecture (3 credits): **Computer system: computer structures, components, functions. Memory: cache memory mapping, internal memory, external memory. I/O devices: modules, programmed and interrupt driven I/O, DMA, I/O channels and processors. Interfaces, central processing unit: Computer arithmetic: hardware design algorithms. Instruction cycle, Instruction pipelining, control units design: Hardware and microprogrammed, parallel organizations, RISC, CISC, Multicore Processor organization. (*Prerequisite: CCR 212*)

**CCR 413 Operating Systems (3 credits): **Overview: Background, Computer-system structures, Operating system structures. Process Management: Processes and threads, Process synchronization, Deadlocks, CPU scheduling. Storage Management: Memory management, memory allocation, addressing, Swapping, paging, segmentation, Virtual memory organization, demand paging. File system, structure and access methods: File-system interface, File-system implementation, File protection. I/O Systems: I/O Systems, Mass-storage structure, Computer systems performance, network and security. Distributed Systems: Structure, file systems and coordination. (*Prerequisite: CCR 311*)

**CEN 210 Electronic Devices and Circuits (3 credits):** Basic Semiconductor and pn-junction theory: Energy Bands, Conductors, Insulators and semiconductors, p-type and n-type semiconductors, Majority and minority carriers, Drift and Diffusion Current. P-N junction as a circuit element: operational principle of p-n junction diode, contact potential, current-voltage characteristics of a diode, simplified dc and ac diode models, dynamic resistance and capacitance. Diode applications: Half wave and full wave rectifiers, rectifiers with filter capacitor, clamping and clipping circuits. Zener diode: characteristics of a zener diode, zener shunt regulator. Introduction to power diodes: schottky diode, tunnel diode, gun diode, varactor diode. Bipolar junction Transistors (BJT): Basic structure, BJT characteristics and regions of operation, BJT Currents, BJT Terminal Voltages, BJT voltage amplification. Bipolar Junction Transistor Biasing: The dc load line and bias point, biasing the BJT for discrete circuits, small signal equivalent circuit models, h parameters. Single-stage BJT amplifier circuits and their configurations: Voltage and current gain, input and output impedances. Introduction to multistage amplifiers; Power amplifiers: Class A, Class B and Class C amplifiers; Introduction to power transistors: Field-Effect Transistors (FET), Junction Field-Effect Transistors (JFET), Metal-Oxide-Semiconductor Field-Effect-Transistor (MOSFET), FET Biasing and Small-Signal Analysis, Metal Semiconductor Field Effect Transistor(MESFET), Insulated Gate Bipolar Transistors (IGBTs), Static Induction Transistors (SITs) and COOLMOS. Introduction to operational amplifier (Op-Amp); Electronic circuit analysis using PSPICE. (*Prerequisite: ECR 101*)

**CEN 330 Data Communication (3 credits):** ): Data: representation, signal encoding, signal analysis; Data Transmission Channel: channel capacity, transmission line characteristics, Baseband and Broadband transmission; Transmission media: guided and unguided; Transmission networks; Transmission modulation techniques, modems and interfaces; Multiplexing techniques; Error handling; Switching techniques; Introduction to advanced data communication technologies and Internet.

**CEN 404 Embedded Systems (3 credits):** Provides a detailed overview of the important topics in the field. Typical examples of embedded systems; real time and safety critical issues; constraint driven design; systems integration; hardware-software partitioning and time-to-market considerations will be addressed. The subject will examine programmable devices, micro-controllers, application specific standard processors: importance of interrupts; re-configurable logic; system-on-a-chip; finite state machines; dataflow architectures; and distributed embedded systems. Software for embedded systems, including: programming languages and software architectures; interrupt servicing; multi-tasking; task communications and scheduling; verification: hardware-software co-simulation; and real-time operating systems will be introduced. (*Prerequisite: Senior Standing*)

**CEN 412 Wireless Networking & Mobile Computing (3 credits): **Several topics related to wireless networking and mobile computing will be covered in this course. The topics include: cellular networks, multiple access protocols, channel assignment and resource allocation, mobility and location management, handoffs, routing, authentication, call admission control and QoS provisioning, network layer issues, wireless data networking (WAP, GSM, GPRS, CDMA, WCDMA), mobile ad hoc networks. (*Prerequisite CEN 330*)

**CEN 401 Database Management (3 credits): **Introduction to database and DBMS. Database development process, Database architecture; Database languages and Interfaces. E-R Model, Enhanced E-R model; Database Design Relational Data model, Integrity constraint, Transferring ERD to Relations; Introduction to normalization; Relational Algebra; Introduction to Structure Query Language; Programming with SQL and PL/SQL. Database security and administration. Object oriented data modeling; Distributed database. Specific database systems: Oracle. MS SQL Server. (*Prerequisite: CCR 203*)

**CEN 401L Lab work based on CEN 401 (1 credit)**

**CEN 405 MIS and Systems Analysis (3 credits): **Information attributes. Management Information System: subsystems. Information system components and design factors. Systems and models; Systems analysis: systems development life cycle models. Feasibility analysis, Structured analysis; systems prototyping. Tools for determining system requirements; data flow diagrams; decision table and decision trees;. system design and implementation: application architecture, user interface design. Front-end and backend, database design, software management and hardware selection. Object oriented analysis: use-case modeling, Unified Modeling Language. Case Studies of Information Systems. (*Prerequisite: CEN 401*)

**CEN 410 Introduction to Digital Signal Processing (3 credits):** The mathematics of signals and linear systems. Fourier and Laplace transforms, discrete Fourier and Z transforms. Analogue filters: approximation theory, Butterworth, Bessel, Chebyshev and elliptic filters. Filter impulse and frequency responses, stability, and sensitivity. Sampling continuous signals: the sampling theorem, reconstruction, and aliasing. The discrete Fourier transform (DFT) and the fast Fourier transform (FFT). Fundamentals of the design and realisation of finite impulse response (FIR) and infinite impulse response (IIR) digital filters. Digital processing of analog signals, including applications of digital signal processing (DSP) and programmable DSP chips. The representation and modelling of non-deterministic (random) signals, correlation functions, and power density spectra. (Prerequisite: *MAT 303*)

**CEN 414 Digital System Design (3 credits): **Design of memory subsystems using SRAM and DRAM; PLA design; Microoperations: Inter-register transfer, arithmetic operations, logic operations, shift operations; Design of various components of a computer: ALU, control unit (hardwired, microprogrammed); Computer bus standards; Design of a computer; Digital Systems in control, communication and instrumentation. (*Prerequisite: CCR 204*)

**CEN 420 Image Processing and Pattern Recognition (3 credits): **Digital image representation: acquisition, storage and display systems; sampling and quantization: uniform and non-uniform sampling; image geometry: perspective transformation, synthetic camera approach, stereo imaging; image transforms: fast Fourier transform, discrete Fourier transform, sine/cosine transform; image enhancement; spatial and frequency domains; smoothing and sharpening; gray-level binary images: thresholding, half-toning; image restoration: degradation model; constrained and unconstrained restoration; inverse filtering; Wiener filtering; image compression: source encoding/decoding, channel encoding/decoding. (*Prerequisite: CCR 203, MAT 303, Senior standing*)

**CEN 425 Artificial Intelligence (3 credits): **Principal ideas and development of artificial intelligence; theorem proving,; problem solving methods; search space; generation pruning and searching; knowledge representation techniques; heuristic search; puzzle solvers; expert system and data processing; simulative and cognitive process; natural language analysis and synthesis; representation design and design knowledge. (*Prerequisite: Senior standing*)

**CEN 430 Computer Networks (3 credits):** Basic concepts, categories of networks, network topologies, OSI model and TCP/IP protocol suite, TCP/IP applications, FTP, SMTP, HTTP and WWW, transport layer protocols, Internetworking devices, repeaters, bridges and routers, routing algorithms, IP addressing, sub netting, domain name systems, Network programming: Client-Server programming, socket programming, data link control protocols, LAN types and technology, MAC protocols, high speed LANs and Gigabit Ethernet, Wireless LANs, MAN, Circuit switching and Packet switching, ISDN, Frame Relay and ATM, SONET/SDH. Spectrum and bandwidth, Digital Transmission, encoding, modulations and demodulations, multiplexing: FDM, TDM and WDM, interfaces and modems, transmission media, fiber optic and wireless media, error detection techniques. (*Prerequisite: MAT 251, Senior Standing*)

**CEN 432 Electrical Drives and Instrumentation (3 credits):** Single phase transformers; Principles of operation of DC, Induction and Stepper motors; Thyristor and microprocessor based speed control of motors. Introduction to amplifiers; Basic differential amplifiers; logarithmic amplifiers; Temperature compensation of Logarithmic amplifiers; Antilog amplifier; Chopper stabilized amplifier. Frequency and voltage measurements using digital techniques: Digital frequency meter, digital voltmeter. Recorders and display devices: Oscilloscope, Spectrum analyzers and logic analyzers. Data acquisition system and interfacing to microprocessor based systems. Transducers: terminology, types, principles and application of piezoelectric, photovoltaic, thermoelectric, variable reactance and opto-electronic transducers. Noise reduction in instrumentation. (*Prerequisite: MAT 251, Senior Standing*)

**CEN 435 Computer Graphics (3 credits): **Graphics devices; graphics coordinate systems; programming tools for graphics; lines and curves; turtle graphics; elementary clipping: Cohen–Sutherland algorithm; generating curves in two dimension; elementary ray-tracing; drawing objects in two dimension; transformation of pictures; affine transformation; elementary three-dimensional object modeling; orthographic and perspective projections. (*Prerequisite: CCR 205, MAT 303, Senior standing*)

**CEN 440 Engineering and Technology Management (3 credits):** Concepts of engineering and technology management, innovation process, technological change, technological organizations, motivation and leadership theories applicable to engineers and scientists, engineering and R&D projects, resource management in current and emerging technologies, and strategic management of technological system interfaces, communication and team building for engineering driven organization, engineering economic analysis and economics of technology innovation, project management, productivity analysis, technology forecasting, assessment, acquisition and transfer, technopreneurship, venture financing, corporate governance and organizational transformation management. (*Prerequisite: Senior Standing*)

**CEN 445 Software Engineering (3 credits): **Introduction to the principles of software engineering. Software as product and process. Project management and planning; tracking and scheduling; risk analysis and quality assurance techniques.; configuration management. Project and process metrics, size and function oriented metrics. Software testing techniques: black box and white box techniques. Testing strategy: unit, integration and system testing.. Concepts of object-oriented, event-driven and network programming, client-server architecture, web engineering. The course focuses on taking a group development project from beginning to end. (*Prerequisite: Senior Standing*)

**CEN 450 Computer & Network Security (3 Credits): **): Introduction; nature and types of security attacks, model for network security, Fiestel cipher structure; conventional encryption algorithms, DES and triple DES, public key cryptography, message authentication, hash function, RSA and Diffie-Hellman algorithms, digital signature, digital certificate, key distribution, system security, intrusion and password protection, intrusion detection system, viruses, worms and anti-virus techniques, firewall architecture and design, trusted system, network security, Kerberos, X.50g, e-mail security, PGP and S/MIME, IP Security architecture, secure socket layer, secure electronic transaction, network management security and SNMP, JAVA security, CGI security, security features of windows NT, UNIX and LINUX. (*Prerequisite: CEN 430, Senior Standing*)

**CEN 455 Web Applications & Internet ( 3 credits): **Web Technology – OSI & TCP/IP architecture, Internet Routing, IP addressing & Domain Name System. World Wide Web – overview of popular browsers; Anatomy of Web presentations. Designing HTML files- Mark up tags, hypertext linking, Images & graphics, Tables, Forms, Multimedia. Scripting languages- JavaScript, CGI. DHTML: Cascading Style Sheet, scripting. Web Servers – IIS, PWS, Apache. Understanding HTTP, Client and Server side scripts. Concept of designing dynamic Web pages: ASP, PHP, with MS Access, SQL server. Working with remote data services - using ASP, PHP technologies with MySQL and Oracle database. Web security: Cryptography, Digital signature, Digital Certificate, Authentication & Firewall. (*Prerequisite: CCR 305, CEN 401, Senior Standing*)

**CEN 460 Multimedia Systems (3credits): **Multimedia system architecture, Text, images and graphics, audio, video and animation. Data compression, JPEG and MPEG, DVI, AVI, multimedia files standards; overview of multimedia storage and retrieval technologies. Video and Image display systems, multimedia communication and database systems, multimedia user interfaces, and applications of multimedia systems. (*Prerequisite: CCR 205, MAT 303, Senior Standing*)

**CEN 465: E-Commerce and Web database (3 credits): **Electronic Commerce environment - Modes of Web based business. Networking overview, Intranet, Intranet, Extranet, VPN, and VAN. Security and authentication. Cryptography and key management. Digital Signature and Digital certificate. Electronic Cash and Electronic Payment schemas: EDI, EFT, payment and purchase order process, online electronic cash, CyberCash, Ecash. Master/visa Secure Electronic Transaction. Internet architecture and services- ISP connectivity methodologies, Web applications, Web servers and Web browses, Overview of Web database design development and management. Three–tier client-server Web DBMS architecture, Integrating database with Internet, Web database security and access controls. (*Prerequisite: CEN 401, Senior Standing*)

**CEN 470 Introduction to Parallel Programming (3 credits): **Parallel architectures; linear, mesh, binary, and hypercube connections; routing mechanisms; communication models; scalability; parallel algorithms; searching, sorting, matrix algorithms; parallel programming; message passing paradigm; shared memory paradigm. (*Prerequisite: CCR 203, CCR 311, MAT 303, Senior Standing*)

**CEN 475 VLSI Design and Testing (3 credits):** VLSI Technology: MOS transistor and inverter characteristics, complex CMOS gates and functional circuits. Design and operation of large fan-out and fan-in circuits; Clocking methodologies; Techniques for data path and data control design. VLSI layout partitioning, placement routine, and writing in VLSI Reliability aspects and testing of VLSI. (*Prerequisite: CEN 210, Senior Standing*)

**CEN 480 Computer Vision (3 credits):** Introduction, 2D image, 3D vision, stereo vision; edge detection, image segmentation, boundary features, shape features, spatial moments, texture analysis, and mathematical morphology; Marr's paradigm, active vision; 3D vision, Marr's paradigm, active and purposive vision; applications, autonomous vehicles, augmented reality environments, CAD modeling, games and movies; rigid body transformations, calibration problems, correspondence and flow, epipolar geometry, structure from stereo, and structure from motion. (*Prerequisite: MAT 303, Senior Standing*)

**ECR 101 Introduction to Electrical Engineering (3 credits):** Passive electrical components. Electric circuit concepts and relationship to field theory. Kirchhoff's laws. Node and mesh analysis of resistive networks. Network theorems. Controlled sources. Transient conditions. Sources of periodic signals. Average and r.m.s. values. Circuit models of diodes and transistors. Combinational logic principles and circuits. RLC circuits; sinusoidal circuit response; mutual inductance and transformers; operational amplifiers; computer aided circuit design; state space circuit representations and time responses; homogenous and particular solutions for first and second order linear differential equations; computer aided analysis of signals and systems, including state space representations; continuous time signals, sinusoids and signal norms; convolution, impulse and step responses; phasors; AC circuits (transient and steady state responses); complex power; frequency responses of circuits and systems; three-phase circuits. (*Prerequisite: PHY 101*)

**MAT 101 Basic University Mathematics (3 credits):** Review of sets. Number system. Algebra of complex numbers. Matrices, definition, addition and multiplication of matrices. Systems of linear equations and matrices , Gaussian elimination, reduction to echelon form, and their properties, inverses and determinants, solution of linear systems. Plane analytic geometry: Review of conic sections, transformation of coordinates, second-degree equations, polar coordinates and parametric equations. Concepts of three-dimensional geometry. Functions and graphs. Limits and continuity. Tangent lines and rates of change, the derivative and techniques of differentiation, derivatives of algebraic, trigonometric, inverse trigonometric, logarithmic and exponential functions. Antiderivatives and indefinite integral, integration by substitution, integration by parts, integration of rational functions, integration using tables.

**MAT 103 Mathematical Foundation of Computer Science (3 credits):** Logic of compound statements, logic of quantified statements, valid and invalid arguments, methods of proofs, mathematical induction; review of sets, Cartesian products and relations, equivalence relations, matrices of relations, partial order relations, fuzzy sets and relations.; algebra of functions, one-one and onto functions, bijections and inverse functions, finite and infinite sets, countable and uncountable sets, growth of functions; basics of counting, permutations and combinations, binomial and multinomial theorems, principle of inclusion-exclusion; construction of simple algorithms, pseudo-codes and flowcharts, recursive algorithms, complexity of algorithms, correctness of algorithms; number theory: integers, divisibility, Euclidean algorithm, prime factorization, congruence, fields ^p. (*Prerequisite: CSC 101, MAT 101*)

**MAT 201 Calculus I (3 credits):** Functions (and their visualization. limits, derivatives and integrals. Successive differentiation. Additional techniques of integration. Interpretations of the derivative, applications of the derivative to geometry, mechanics , marginality and optimization. Newton's method. Introduction to modeling. Definite integral, interpretations and properties of the definite integral, applications of the definite integral to geometry, mechanics, economics and modeling. Approximating definite integral, approximation errors and Simpson's rule, improper integrals. Taylor polynomials and series, convergence of series, finding and using Taylor's series, indeterminate forms, Fourier series. First order differential equations: Slope fields, Euler's method, separation of variables, linear equations, applications and modeling. (*Prerequisite: MAT 101 or equivalent*)

**MAT 212 Probability and Statistics (3 credits): ** Preliminary concepts,; types of data; histograms and frequency distributions; univariate methods; measurement of central tendency and central dispersion; mean, median and mode; standard deviation and other methods; concepts of probability; events and space;. Simple, compound and complementary events; conditional probability; discrete and continuous distributions; sampling and estimation; bivariate methods; linear regression, least square approach, covariance and correlation coefficient. (*Prerequisite: MAT 101 or equivalent*)

**MAT 251 Calculus II (3 credits):** Calculus of vector functions, change of parameter, arc length, unit tangent and normal vectors, curvature, motion along a curve. Functions of several variables, visualization , limits and continuity, partial derivatives, differentiability and chain rules , Jacobians, tangent planes, total differentials, exact differential equations, directional derivatives and gradients, optimization. Double and triple integrals, change of variables, double integrals in polar coordinates, triple integrals in cylindrical and spherical polar coordinates, surface area and volumes. Vector calculus: Vector fields, divergence and curl, line integrals, independence of paths, conservative vector fields, Green's theorem, surface integrals, divergence and Stokes' theorems. (*Prerequisite: MAT 212 and MAT 201*)

**MAT 303 Linear Algebra and Differential Equations (3 credits):** Systems of linear equations and matrices, vector spaces and subspaces, linear dependence and independence, dimensions and bases, linear transformations and matrices, eigenvalues and eigenvectors, changes of coordinates, orthogonality, diagonalization. First order ordinary differential equations (existence and uniqueness of solutions, solution techniques, direction fields and stability, modeling applications). Second and higher order linear equations (existence and uniqueness, fundamental set of solutions of homogeneous equations, Wronskian, reduction of order, equations with constant coefficients, method of undetermined coefficients, method of variation of parameters, solutions in series, Laplace transform method, modeling applications). Systems of linear differential equations (existence and uniqueness of solutions, eigenvalue method for homogeneous systems, method of variation of parameters for systems, Laplace transform method for systems, modeling applications).Introduction to nonlinear systems. (*Prerequisite: MAT 251*)

**MAT 401 Graph Theories (3 credits):** Graphs and subgraphs, trees, connectivity, Eule tours and Hamjlton cycles, matchings, graph colorings, plana graphs and Euler's formula, directed graphs, network flows, counting arguments, graph algorithms. (*Prerequisite: MAT 103,MAT 251*)

**MAT 403 Introduction to Mathematical Modeling:** An introduction to techniques of mathematical modeling involved in the analysis of meaningful and practical problems in many disciplines including mathematical sciences, operations research, engineering and the management and life sciences. Students will be encouraged to recognize and formulate problems in mathematical terms, solve the resulting mathematical problems and interpret the solution in real terms. (*Prerequisite: MAT 303 and Permission of the instructor*)

**MAT 405 Optimization Techniques (3 credits):** Discrete , deterministic models of interest to social sciences. Linear programming, duality, simplex method, sensitivity analysis, convex sets. Selections from assignment, transportation, network flow, nonlinear programming problems. (*Prerequisite: MAT 303*)

**MAT 420 Computational Geometry (3 credits):** Polygon triangulation; Polygon partitioning; Convex hull in two and three dimensions; Voronoi diagrams; Combinatorics; Sweep algorithms; Polygon intersection; Robot motion planning. (*Prerequisite: CSC 305, Senior standing*)

**MAT 430 Introduction to Discrete Dynamical Systems (3 credits):** Iterations, orbits, graphical analysis, fixed and periodic points, bifurcations, the quadratic family, transition to chaos, iteration of two-dimensional maps, complex dynamics, Julia set, introduction to fractals. (*Prerequisite: MAT 303, Senior Standing*)

**CEN 498 Senior Project (6 credits)**: Students must register for either CSC 498 or CSC 499.

**CEN 499 Internship (6 credits)**: Students must register for either CSC 498 or CSC 499.

### For further information please contact:

Independent University, Bangladesh(IUB)

School of Engineering & Computer Science(SECS)

Level 4, Academic building

Plot-16, Block-B, Aftabuddin Ahmed Road

Bashundhara R/A, Dhaka-1229.

Tel: 8401645-52, 8401790, 8401991

### web: http://cse.iub.edu.bd