Survey
* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
Bachelor of Science in Computer Science and Engineering (B.Sc. in CSE) Introduction to the Program The aim of this program (Bachelor of Science in Computer Science and Engineering) is to transform well qualified students to highly competent professionals having the potential of becoming the future leader in their field. CUB CSE, since its inception, has been offering an undergraduate program in Computer Science and Engineering with the focus on developing skills for ICT industries worldwide. The curriculum is designed to equip the 21st century students with the skills that is required to become an accomplished IT specialist. The program is designed for a wide range of students, including those who wish to pursue a career in software engineering, computer programming or related areas, and also those who wish to move on to study for higher degrees in the computing and information technology areas, either at home or abroad. Admission Process The university operates round the year admission system divided into trimesters i.e. spring, summer and fall. Each semester runs for a period of four months each. Students who plan to seek admission at the Canadian University of Bangladesh are required to fulfill the university admission requirement laid by UGC. The admission forms and relevant information can be collected from the Admissions Office. Completed applications along with required documents should then be submitted to the Admission Office as per deadlines. Duration of the Program All bachelors programs at CUB are designed to be of four years duration. All programs at CUB will follow a three terms per year system. 1st Term (Spring) 2nd Term (Summer) 3rd Term ( Fall) Canadian University of Bangladesh - between late January and April, - between late May and August - between late September and December Page 1 The particular dates of the terms may vary from year to year due to official holiday variables or special circumstances, but the minimum duration of each term will always be maintained. Entry Qualification The entry qualification for this program is as per the UGC requirement. Award of Degree To obtain a Bachelor of Science in Computer Science & Engineering from the Department of CSE, Canadian University of Bangladesh, a student must successfully complete a total of 152 Credits including an assigned project work and earn a CGPA of 2.5 or higher. Grading Scale Letter Grade A+ A AB+ B BC+ C D F I W AW Grade Point 4.0 4.0 3.8 3.3 3.0 2.8 2.5 2.2 1.5 0.0 0.0 0.0 0.0 Assessment Outstanding Superlative Excellent Very Good Good Average Below Average Passing Probationary Fail Incomplete Withdrawn Administrative Withdrawal Grading in any course will be based primarily on academic performance as reflected in student’s class participation, tests, assignments, mid-term and final exams or papers (most courses will use all these methods of testing). Whenever appropriate, students may also be graded on tutorials, lab work, research or other special projects. The weight assigned to each form of testing may vary from department to department, and indeed course to course. Canadian University of Bangladesh Page 2 Attendance and impression/participation in the class may also constitute a serious component of the grading. However, passing all required courses is mandatory to obtain a degree from CUB. Explanation of 'I', 'W' and 'AW' grades I Students will receive an ‘I’ (Incomplete) grade only if (a) s/he has a chance to get a regular grade (A+ to D) by submitting incomplete tasks, assignments, or project works assigned by the course teacher, or (b) s/he has appeared in the mid-term examination but not in the final examination (due to illness or other valid reason). Normally, a student will have to complete two-third of the course work to request for an ‘I’ grade. If the ‘I’ is not replaced with a regular grade within the following semester, it will be automatically converted into ‘F” grade. W Students will receive a "W" (Withdrawn) grade if s/he has withdrawn from a course within the time stipulated in the Academic Calendar. AW Students will receive an "AW" (Administrative Withdrawal) grade if s/he has been withdrawn from the course by the university authority for academic dishonesty. 4-year distribution of courses B.Sc. in Computer Science and Engineering CODE SEMESTER 1 ENG 101 MAT 101 CSE 101 COURSE DESCRIPTION PREREQUISITE CREDIT Basic English Calculus I Programming Language I 3 3 3 1 PHY 101 Programming Language I Lab Physics I PHY 101L Physics I Lab 1 CSE 101L 3 Total Credit: 14 Canadian University of Bangladesh Page 3 SEMESTER 2 ENG 102 MAT 102 PHY 102 PHY 102L CSE 102 SEMESTER 3 CSE 103 CSE 103L Introduction to Composition Calculus II Physics II Physics II Lab Discrete Mathematics ENG 103 EEE 101 EEE 101L BBA 101 Programming Language II Programming Language II Lab Public Speaking Electrical Circuits I Electrical Circuits I Lab Principles of Accounting SEMESTER 4 CSE 201 CSE 201 L EEE 201 EEE 201L BBA 102 MAT 201 Data Structure Data Structure Lab Electronic Circuit I Electronic Circuit I Lab Principles of Economics Differential Equations ENG 101 3 3 PHY 101 3 1 3 Total Credit: 13 CSE 101 3 1 ENG 102 3 3 1 3 Total Credit: 14 CSE 103 EEE 101 Total Credit: SEMESTER 5 CSE 202 CSE 202L MAT 202 MAT 203 CSE 203 CSE 203 L SEMESTER 6 CSE 204 CSE 204L CSE 205 CSE 206 3 1 3 1 3 3 14 Digital Logic Design EEE 201 Digital Logic Design Lab Statistics & Probability Matrices, Vectors & Fourier MAT 102 Analysis Algorithm CSE 201 Algorithm Lab Total Credit: 3 1 3 3 Database Systems Database Systems Lab Numerical Technique Computer Organization & 3 1 3 3 Canadian University of Bangladesh CSE 201 MAT 203 CSE 202 3 1 14 Page 4 CSE 206L SEMESTER 7 CSE 301 CSE 301L CSE 302 CSE 303 CSE 303L Architecture Computer Organization & Architecture Lab Operating Systems Design Operating Systems Design Lab Software Engineering Microprocessor Interfacing & Embedded System Microprocessor Interfacing & Embedded System Lab 1 Total Credit: 11 CSE 201 3 1 CSE 201 CSE 206 3 3 1 Total Credit: SEMESTER 8 CSE 304 CSE 304L CSE 305 CSE 305L CSE 306 CSE 306L Theory of Computation and CSE 203 Compiler Theory of Computation and Compiler Lab Simulation and Modeling CSC 203 Simulation and Modeling Lab Artificial Intelligence CSE 203 Artificial Intelligence Lab Total Credit: SEMESTER 9 CSE 307 CSE 308 CSE 308L MGT 309 CSE 310 SEMESTER 10 CSE 401 CSE 401L CSE 402 CSE 402L HUM 401 Data Communication Computer Interfacing Computer Interfacing Lab Engineering Management Concepts of Programming Language 11 3 1 3 1 3 1 12 CSE 103 3 3 1 3 3 Total Credit: 13 Computer Networks Computer Networks Lab CSE 307 System Analysis and Design System Analysis and Design Lab CSE 302 3 1 3 1 World Civilization Canadian University of Bangladesh CSE 303 3 Page 5 SEMESTER 11 CSE 403 CSE 403L CSE *** CSE**** LBA 401 CSE 404 SEMESTER 12 CSE *** CSE**** CSE 405 CSE405L CSE 406 Computer Graphics Computer Graphics Lab Option I Option I Lab Bangladesh Culture and Heritage Mobile and Application Development Option II Option II Lab VLSI Design VLSI Design Lab Project TOTAL DEGREE CREDITS: Total Credit: 11 MAT 203 3 1 3 1 3 3 Total Credit: 14 CSE 202 3 1 3 1 3 Pre-graduating year Total Credit: 152.0 11 Optional Courses (Two courses) CODE CSE 419 COURSE DESCRIPTION Distributed Database Systems CSE 419L Distributed Database Systems Lab 1 CSE 423 Pattern Recognition and Neural Networks 3 CSE 423L Pattern Recognition and Neural Networks Lab 1 CSE 427 CSE 427 L Graph Theory Graph Theory Lab Canadian University of Bangladesh PREREQUISITE CSE 204 CSE 203 CREDIT 3 3 1 Page 6 CSE 428 Digital Image Processing 3 CSE 428L Digital Image Processing Lab 1 CSE 429 CSE 429L Data Mining Data Mining Lab CSE 306 3 1 CSE 430 CSE 430L CSE 201 3 1 CSE 431 Internet and Web Technologies Internet and Web Technologies Lab Digital System Design CSE 303 3 CSE 431L Digital System Design Lab 1 CSE 432 Bioinformatics 3 CSE 433 Machine Learning 3 MIS 301 Management Information Systems Digital Signal Processing Digital Signal Processing Lab Network Security Human Computer Interaction VHDL Modeling and Logic Synthesis Cloud Computing Cloud Computing Lab Embedded System CSE434 CSE434 L CSE 435 CSE436 CSE 437 CSE 438 CSE 438L CSE 439 CSE 103 3 CSE 103 3 1 3 3 3 CSE 401 CSE 307 CSE 202 CSE 434 CSE 302 3 1 3 Detail Outline (Course Contents) of Computer Science and Engineering Undergraduate ENG 101: Basic English Synonyms and antonyms. Affixes, Present tense verb forms, sentence fragments; The writing process; from sentence to paragraph, paragraph development, transitions, descriptive and narrative paragraphs. Canadian University of Bangladesh Page 7 Reading strategies and comprehension, Past and Future tense verb form, Active and Passive, words commonly confused, Subject-verb agreement, word order, the Subjunctive; Cause and effect, comparison and contrast paragraphs. Credit: 3 Prerequisite: None MATH 101: Calculus I Differential Calculus: Limits, continuity and differentiability. Successive differentiation of various types of functions. Leibnitz’s theorem. Rolle’s theorem, Mean value theorem, Taylor’s and Maclaurin’s theorems in finite and infinite forms. Lagrange’s form of remainders. Cauchy’s form of remainders. Expansion of functions, evaluation of indeterminate forms of L’ Hospital’s rule. Partial differentiation. Euler’s theorem. Tangent and normal. Subtangent and subnormal in cartesian and polar co-ordinates. Determination of maximum and minimum values of functions. Curvature. Asymptotes. Curve tracing. Integral Calculus: Integration by the method of substitution. Standard integrals. Integration by successive reduction. Definite integrals, its properties and use in summing series. Walli’s formulae. Improper integrals. Beta function and Gamma function. Area under a plane curve and area of a region enclosed by two curves in cartesian and polar coordinates. Volumes and surface areas of solids of revolution. Credit: 3 Prerequisite: None CSE101: Programming Language I This course introduces the fundamental concepts of structured programming. Topics include fundamental programming constructs: syntax and semantics of a higher-level language, variables, expressions, and assignment, simple I/O to console and files, conditional and iterative control structures, functions and parameter passing, dynamic memory allocation; Fundamental data structures: arrays, records, strings and string processing; Software development methodology: Fundamental design concepts and principles, testing and debugging strategies; Fundamental of computers; Professionalism, codes of ethics and responsible conduct, copyrights, intellectual property, and software piracy. Canadian University of Bangladesh Page 8 Credit: 3 Prerequisite: None CSE101L: Programming Language I Lab Laboratory works based on CSE 101 Credit: 1 Prerequisite: None PHY101: Physics I Heat and Thermodynamics: Introductory Concepts and Zeroth Law, Energy Considerations, Work and Heat, Units, Thermodynamic Process, Properties and Equilibrium, First Law of Thermodynamics and It’s Applications, Reversible and Irreversible Processes, Second Law of Thermodynamics, Carnot Cycle, Efficiency of Heat Engines and Heat Pump, Carnot’s Theorem, Absolute Scale of Temperature, Entropy. Structure of Matter: Crystalline & Non- Crystalline Solids, Single Crystal and Polycrystal Solids, Unit Cell, Crystal Systems, Co-ordinations Number, Crystal Planes and Directions, Packing Factor, Miller Indices, Bragg’s Law, Defects in Solids, Point Defects, Line Defects, Bonds in Solids, Interatomic Distances, Introduction to Band Theory, Distinction between Metal, Semiconductor and Insulator. Waves and Oscillations: Differential Equation of a Simple Harmonic Oscillator, Total Energy and Average Energy, Combination of Simple Harmonic Oscillations, Issajous’ Figures, Spring- Mass System, Damped Oscillation, Forced Oscillation, Resonance, Two- Body Oscillations, Reduced Mass, Differential Equation of a Progressive Wave, Power and Intensity of Wave Motion, Stationary Wave, Group Velocity and Phase Velocity, Architectural Acoustics, Reverberation and Sabine’s Formula. Physical Optics: Theories of Light, Interference of Light, Young’s Double Slit Experiment, Displacements of Fringes and Its Uses, Fresnel Bi- Prism, Newton’s Rings, Interferometers, Diffraction of Light, Fresnel and Fraunhoffer Diffraction, Resolving Power of Optical Instruments, Diffraction at Double Slit & N – Slits, Diffraction Grating, Polarization, Production and Analysis of Polarized Light. Credit: 3 Prerequisite: None PHY101L: Physics I Lab Laboratory works based on PHY 101 Credit: 1 Prerequisite: None Canadian University of Bangladesh Page 9 ENG 102: Introduction to Composition Present tense verb forms, Affixes, Phrasal Verbs, Misplaced and dangling modifiers’ Reading strategies and comprehension. Descriptive and narrative paragraphs. Past and future tense verb forms, faulty parallelism, run-on sentences, From paragraphs to essays: thesis statements, introduction, body and support, conclusion; different types of essays. Credit: 3 Prerequisite: ENG 101 MAT 102: Calculus II Complex Variable: Complex number system. General functions of a complex variable. Limits and continuity of a function of complex variable and related theorems. Complex differentiation and the Cauchy-Riemann equations. Infinite series. Convergence and uniform convergence. Line integral of a complex function. Cauchy’s integral formula. Liouville’s theorem. Taylor’s and Laurent’s theorem. Singular points. Residue. Cauchy’s residue theorem. Vector Analysis: Multiple product of vectors. Linear dependence and independence of vectors. Differentiation and integration of vectors together with elementary applications. Line, surface, and volume integrals. Gradient of a scalar function, divergence and curl of a vector function, various formulae. Integral forms of gradient, divergence and curl. Divergence theorem. Stoke’s theorem, Green’s theorem and Gauss’s theorem. Credit: 3 Prerequisite: MAT 101 PHY 102: Physics II Electric Charge, Coulombs Law. The Electric Field: Electric Field Lines, The Electric Field Lines Due to a Point Charge, The Electric Field Lines Due to an Electric Dipole, The Electric Field Lines Due to a Line of Charge, The Electric Field Lines Due to a Charged Disk. Gauss Law: Gausss Law in Cylindrical, Planar and Spherical Symmetries. Electric Potential: Equipotential Surfaces, Potential Due to an Electric Dipole. Capacitance: Capacitors in Parallel and Series, Capacitors with a Dielectric. Electric Current, Current Density, Resistance and Resistivity, Canadian University of Bangladesh Page 10 Ohms Law. Circuits, Work, Energy and EMF, Single Loop Circuits, Potential Differences, Multiloop Circuits, RC Circuits. The Magnetic Field, Amperes Law, Solenoids and Torroids, Faradays Law of Induction, Alternating Currents, Maxwells Equations. Credit: 3 Prerequisite: PHY 101 PHY 102L: Physics II Lab Laboratory works based on PHY 102 Credit: 1 Prerequisite: PHY 101 CSE 102: Discrete Mathematics Introduction to discrete mathematical structures. A Topics include sets, propositions, Boolean algebra, relations, functions, algebraic systems, monoids, fields, groups, ring, induction, recursion, permutations and combinations, recurrence relation, generating functions and solutions, principles of counting, principles of inclusion and exclusion, discrete probability. Credit: 3 Prerequisite: None CSE 103: Programming Language II This course introduces the basic concepts and techniques of object oriented programming. Actual programs are constructed using one or more high level languages with emphasis placed on the concepts introduced in the previous course. Java is primarily chosen as the programming language in this course. Reusability, readability, and documentation are also strongly stressed. This course has mandatory laboratory sessions every week. Credit: 3 Prerequisite: CSE 101 CSE 103: Programming Language II Lab Laboratory works based on CSE 103 Credit: 1 Canadian University of Bangladesh Page 11 Prerequisite: CSE 101 ENG 103: Public Speaking This course introduces students to the fundamental principles and practices of rhetoric. They will learn the art of public speaking which involves persuasion, creative analysis and synthesis of topics, organization, language, delivery, audience awareness and adaptation and the use of supporting materials. Types of speeches will include informative, persuasive, impromptu, inspirational, and special occasion speeches. Credit: 3 Prerequisite: ENG 102 EEE 101: Electrical Circuits I 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: None EEE 101L: Electrical Circuit I Lab Laboratory works based on EEE 101. Credit: 1 Prerequisite: None BBA 101: Principles of Accounting Preliminaries: Introduction to Accounting, History and development of accounting thought, types of accounting, Accounting Principles & ethics, Accounting Equation & Transaction Analysis. Introduction to Financial Statements. Recording Business Transactions: The Accounts & their types. Double-Entry Book keeping system; Invoice, discount from purchase price, purchase return and allowances, Sale of inventory, sales discount, sales returns and allowances; Journals, ledger & Trial balance. Correcting errors in the trial balance. Canadian University of Bangladesh Page 12 The Adjusting & Closing Procedure: The adjusting process, Accrual versus cash basis Accounting, Preparation of Adjusted trial balance and financial statements, Closing entries & Reversing entries. Using accounting information in decision-making. Accounting in practice: Worksheet. Purchase book, sales book, cashbook, patty cashbook, etc. Control accounts and subsidiary accounts. Bank reconciliation statement. Cost In General: Cost in general: objectives & classifications; Costing Journals; Job order costing, Process costing & Overhead costing, cost sheet; Cost of goods sold statement. Marginal & Relevant costing: Marginal costing tools and techniques, costvolume-profit analysis. Guidelines for decision making. Budget: Capital budgeting; expenditures. Credit: 3 Prerequisite: None planning, evaluation & control of capital CSE 201: Data Structure 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 Prerequisite: CSE 103 CSE 201L: Data Structure Lab Laboratory works based on CSE 201. Credit: 1 Prerequisite: CSE 103 EEE 201: Electronic Circuit I P-N junction as a circuit element: Intrinsic and extrinsic semiconductors, operational principle of p-n junction diode, contact potential, currentvoltage characteristics of a diode, simplified DC and AC diode models, dynamic resistance and capacitance. Canadian University of Bangladesh Page 13 Diode circuits: Half wave and full wave rectifiers, rectifiers with filter capacitor, characteristics of a Zener diode, Zener shunt regulator, clamping and clipping circuits. Bipolar Junction Transistor (BJT) as a circuit element: current components, BJT characteristics and regions of operation, BJT as an amplifier, biasing the BJT for discrete circuits, small signal equivalent circuit models, BJT as a switch. Single stage mid-band frequency BJT amplifier circuits: Voltage and current gain, input and output impedance of a common base, common emitter and common collector amplifier circuits. Metal Oxide Semiconductor Field Effect Transistor (MOSFET) as circuit element: structure and physical operation of an enhancement MOSFET, threshold voltage, Body effect, current-voltage characteristics of an enhancement MOSFET, biasing discrete and integrated MOS amplifier circuits, singlestage MOS amplifiers, MOSFET as a switch, CMOS inverter. Junction Field-Effect-Transistor (JFET): Structure and physical operation of JFET, transistor characteristics, pinch-off voltage. Differential and multistage amplifiers: Description of differential amplifiers, small-signal operation, differential and common mode gains, RC coupled mid-band frequency amplifier. Credit: 3 Prerequisite: EEE 101 EEE 201: Electronic Circuit I Lab Laboratory works based on EEE 201. Credit: 1 Prerequisite: EEE 101 BBA 102: Principles of Economics Introduction to economics. Economics and engineering. Different economic systems. Fundamental economic problems. Basic elements of demand, supply and product market. Theory of utility and preferences, consumer’s surplus. Theory of production and cost. Theory of the firm and market structure. Optimization. Introducing macroeconomics. National income accounting, the simple Keynesian analysis of national income, employment and inflation. Savings, investment and decision making. Fiscal policy and monetary policy- money and interest rate, income and spending. Economics of development and planning Credit: 3 Prerequisite: None Canadian University of Bangladesh Page 14 MAT 201: Differential Equations Ordinary Differential Equations: Degree and order of ordinary differential equations, formation of differential equations. Solution of first order differential equations by various methods. Solution of general linear equations of second and higher orders with constant coefficients. Solution of homogeneous linear equations. Solution of differential equations of the higher order when the dependent or independent variables are absent. Solution of differential equation by the method based on the factorization of the operators. Frobenius method. Partial Differential Equations: Introduction. Linear and non-linear first order equations. Standard forms. Linear equations of higher order. Equations of the second order with variable coefficients. Wave equations. Particular solution with boundary and initial conditions. Credit: 3 Prerequisite: None CSE 202: Digital Logic Design 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, registers, counters, memory organizations. Credit: 3 Prerequisite: EEE 201 CSE 202L: Digital Logic Design Lab Laboratory works based on CSE 202. Credit: 1 Prerequisite: EEE 201 MAT 202: Statistics & Probability Introduction, Sets and probability, Random variable and its probability distribution. Treatment of grouped sampled data. Some discrete probability distribution. Normal distribution. Sampling theory. Estimation Canadian University of Bangladesh Page 15 theory. Tests of Hypothesis. Regression and correlation. Analysis of variance. Credit: 3 Prerequisite: None MAT 203: Matrices, Vectors & Fourier Analysis 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 102 CSE 203: Algorithm Algorithm and Data structure: Algorithm, Properties of good algorithm, Data Structure, Application Areas of Algorithm. Complexity Analysis of Algorithms, Asymptotic Notations, Recurrences, Insertion Sort and its Complexity Analysis Divide and Conquer approach & Heaps: Divide and Conquer approach and Merge Sort, Algorithm of Merge Sort, Complexity Analysis Merge Sort, Quick Sort and its Algorithm, Complexity Analysis of Quick Sort, Heap Construction Algorithm, Heap sort, Application of Heap: Priority Queue. Dynamic Programming: Algorithm of LCS, Dynamic Programming, Matrix Chain Multiplication Example, Algorithm of MCM, and Example of Longest Common Subsequence, Complexity Analysis Greedy Algorithm: Greedy Algorithm, Activity Selection Problem, Huffman Codes and it’s application, Knapsack problem, NP-Hard and NP-Complete Problems, Traveling Salesperson Problem, Complexity Analysis Graphs basic & traversal techniques: Representation of Graphs, Breadth First Search, Depth First Search, Algorithm of BFS and DFS, Minimum Spanning Tree, Kruskal and Prims Algorithm, Complexity Analysis. Canadian University of Bangladesh Page 16 Shortest Path& Backtracking: Single Source Shortest Paths, Dijkstra’s Algorithm, and Bellman-Ford Algorithm. All pair Shortest Path, Floyd Warshall Algorithm, Backtracking, n-Queen Problem, and Complexity Analysis, Branch and Bounds. Computational Geometry & Number Theory: Computational Geometry, Line Segment Properties, Convex Hull, Graham Scan Algorithm of Convex Hull, Number Theory, GCD, Modular Arithmetic, Prime Number generation, Complexity Analysis Credit: 3 Prerequisite: CSE 201 CSE 203L: Algorithm Lab Laboratory works based on CSE 203. Credit: 1 Prerequisite: CSE 201 CSE 204: Database Systems General overview and purpose of Database Management Systems (DBMSs), advantages, applications, common features and overall structure of the database. Data modeling (Relational model): structure of relational model, key constraints, referential integrity constraints, general constraints, Relational algebra: fundamental, additional and extended operations, aggregate functions, outer joins and database modification using RA. ER model: entity and relationship sets, constraints – key, mapping cardinality and participation constraints, strong and weak entity sets, E-R diagram, class hierarchies, aggregation, conceptual database design with the ER model, converting ER to relational model. Database application development (SQL): data definition and data manipulation languages, integrity constraints, basic queries, nested and complex queries, modification of the database, Views: definition, update on views, cursors, Extending DBMS functionality: stored procedures, assertions and triggers, embedded and dynamic SQL, DBMS administration: DBA, users, privileges, security etc. Relational database design: Features of good relational design, functional dependency theory - basic concept, uses, closure of a set of FDs, closure of attribute sets, canonical cover, algorithms for FDs, decomposition using FDs & its desirable properties, Normalization: atomic domains and first normal form, BCNF and 3NF, Canadian University of Bangladesh Page 17 multi-valued dependencies and fourth normal form, decomposition algorithms for different normal forms, database design process. Credit: 3 Prerequisite: CSE 201 CSE 204L: Database Systems Lab Laboratory works based on CSE 204. Credit: 1 Prerequisite: CSE 201 CSE 205: Numerical Technique Introduction: Motivation and errors in numerical techniques. Taylor series. Finite difference calculus: Forward, backward, divided, and central difference and difference of a polynomial. Interpolation: Newton’s formula, Lagrange, spline, Chebyshev and inverse. Extrapolation. Nonlinear equations: Iteration, bisection, false position, Raphson, Secant and Muller’s methods. Simultaneous linear algebraic equations: Cramer’s rule, inversion of matrices, Gauss elimination, Gauss-Jordan method, factorization and Gauss-Siedel iteration methods. Curve Fitting: Linear and polynomial regression, fitting power, exponential and trigonometric functions. Ordinary differential equations: Initial value problem, Taylor’s series method, Picard’s method of successive approximation, Euler’s method and Runge Kutta method. Boundary value problems. Numerical integration: general quadrature formula, trapezoidal rule and Simpson’s rule. Numerical differentiation Credit: 3 Prerequisite: MAT 203 CSE 206: Computer Organization & Architecture 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. Canadian University of Bangladesh Page 18 Credit: 3 Prerequisite: CSE 202 CSE 206L: Computer Organization & Architecture Lab Laboratory works based on CSE 206. Credit: 1 Prerequisite: CSE 202 CSE 301 Operating Systems Design Principle of operating systems and Operating system structure: Definition of operating system, Different kinds of operating systems (Desktop, Multiprocessor, Distributed, Clustered, Real time, Handheld systems), Operating-System Services, User Operating-System Interface, System Calls, Types of System Calls, System Programs, Operating-System Design and Implementation, Operating-System Structure, Virtual Machines Process: process management, inter- process communication, Process scheduling, Process Concept, Operations on Processes, Inter process Communication, Communication in Client-Server Systems, Basic Concepts of Process Scheduling, Scheduling Criteria and Scheduling Algorithms Multiprocessing and time sharing, Process coordination, Deadlocks: Multiple-Processor Scheduling, Thread Scheduling, Algorithm Evaluation, Deadlock Characterization, Methods for Handling Deadlocks, Deadlock Prevention, Deadlock Avoidance, Deadlock Detection, Recovery from Deadlock. Control and scheduling of large information processing systems, Resource allocation; Dispatching; Processor access methods; Job control languages Memory management: Background, Swapping, Contiguous Memory Allocation, Paging, Structure of the Page Table, Segmentation, Demand Paging, Page Replacement, Thrashing, Demand Paging, Page Replacement File systems: File Concept, Access Methods, Directory Structure, FileSystem Mounting, File Sharing, File-System Implementation, Directory Implementation, Allocation Methods Protection and security: Protection, Principles of Protection, Domain of Protection, Access Matrix, Access Control, Revocation of Access Rights, The Security Problem, Program Threats, System and Network Threats, Cryptography as a Security Tool, User Authentication, Implementing Security Defenses, Fire walling to Protect Systems and Networks Credit: 3 Prerequisite: CSE 201 Canadian University of Bangladesh Page 19 CSE 301L Operating Systems Design Lab Laboratory works based on CSE 301. Credit: 1 Prerequisite: CSE 201 CSE 302 Software Engineering Introduction, Software process model, generic model: framework activity, identifying task set, prescriptive model: waterfall model, v model, evolutionary model: spiral, Software Project Management, schedule: people and effort, time line and schedule, risk: identification, refinement, mitigation, User requirement: stakeholders, requirement gathering, process flow System requirement specification (SRS): elementary business logic, function description, use cases, priority, dependency, nonfunctional requirement, SRS standard and practice(IEEE 830), Project’s SRS Presentation, Architecture Design: Style, representing system in context, archetypes, complexity, System Design: pattern, modularity, separation of concern, information hiding, functional independence, refinement, refactoring , User Interface Design: interface design steps, interface design pattern, Data Design: data, database, data flow, Design standard and practice (IEEE 1016), Project’s Design Presentation, Implementation and Testing: unit testing, integration testing, white box testing: basis path testing: flow graph, cyclomatic complexity, control structure testing, black box testing, debugging, validation testing, System testing, User Acceptance testing, Quality Assurance: plan, task, goal, metric, six sigma quality standard and practice (IEEE 730), Deployment: direct, parallel, pilot, Maintenance: supportability, reengineering, Final Project Presentation. Credit: 3 CSE 303 Microprocessor Interfacing & Embedded System Study of microprocessor architectures, hardware modules, and interfaces; programming, software tools, development systems, and applications; and microprocessor system design methodology. Credit: 3 Prerequisite: CSE 206 CSE 303L Microprocessor Interfacing & Embedded System Lab Canadian University of Bangladesh Page 20 Laboratory works based on CSE 303. Credit: 1 Prerequisite: CSE 206 CSE 304: Theory of Computation and Compiler 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. 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: CSE 203 CSE 304L: Theory of Computation and Compiler Lab Laboratory works based on CSE 304. Credit: 1 Prerequisite: CSE 203 CSE 305: Simulation and Modeling Simulation methods, Model building, Random number generator, Simulation languages; Statistical analysis of results, Validation and verification technique; Digital simulation of continuous systems; Analogue simulation of continuous systems; Simulation and analytical methods for analysis of computer systems and practical problems in business and practice; Introduction to simulation packages. Credit: 3 Prerequisite: CSC 203 CSE 305L: Simulation and Modeling Lab Laboratory works based on CSE 305. Canadian University of Bangladesh Page 21 Credit: 1 Prerequisite: CSC 203 CSE 306: Artificial Intelligence Concepts of Artificial Intelligence: Introduction, The Foundations of AI, The History of AI, AI technique, The State of the Art; Problems and Problem Solving: Problems, Example of Problems, Problem Formulation, Problemsolving methods. Various Searching Techniques: Search Strategies, Uninformed (blind) search strategies like Breadth-First search, Uniform cost search, Depth-First Search etc. and Informed or Heuristic Search Strategies like Generate-and-test, Hill Climbing, Best-First Search, Problem Reduction, Constraint Satisfaction, MeansEnd Analysis etc. Propositional and First-Order logic: Knowledge Representation, Reasoning and Logic; Propositional Logic: Syntax, Semantics, Validity and Inference, Rules of Inference for Propositional logic; First-Order Logic: Syntax and Semantics, Using first-order logic. Inference in first order logic: Inference Rules Involving Quantifiers, Example Proof, Generalized Modus Ponens, Forward and Backward Chaining, Completeness, Resolution. Game playing: Introduction, Perfect Decisions, Imperfect Decisions, Alpha-Beta Pruning; Natural language processing: Introduction, Syntactic Processing, Semantic Analysis, Discourse and Pragmatic Processing. Planning: Basic Plan-Generating Systems, Forward Production System, Representation for Plans, Backward Production System, STRIPS, Examples with problem domain; Learning: Introduction to Learning, Inductive Learning, Learning Decision Trees, Neural Net Learning; Probabilistic Reasoning: Probability and Bayes’ Theorem, Certainty Factors and Rule-Based Systems, Bayesian Networks, Fuzzy Logic; Some Expert Systems: Representation and Using Domain Knowledge, Expert System Shells, Explanation, Knowledge Acquisition. Credit: 3 Prerequisite: CSE 203 CSE 306L: Artificial Intelligence Lab Laboratory works based on CSE 306. Credit: 1 Prerequisite: CSE 203 CSE 307: Data Communication Canadian University of Bangladesh Page 22 Physical layer communication: media, signals, and bits; time division and frequency division multiplexing, encoding; modulation, delay, bandwidth, and noise, error correction techniques, packets, error detection techniques. Network and packet communication: local area network, network topology; Ethernet, CSMA/CD, CSMA/CA, token passing rings, FDDI; wireless networks; network interconnection with repeaters, bridges, and switches; DSU/CSU; xDSI, and cable modems; store-and-forward; next-hop forwarding, wide area network, router based architecture. Dijkstra’s algorithm. Internetworking: IP addressing; address building with ARP; datagram encapsulation and fragmentation; link-state and distance-vector routing; network properties; ownership and service paradigm; UDP and TCP; TCP segment format; adaptive retransmission; protocol ports; ICMP and error handling. Network applications: client-server concepts; applications, EMAIL, DNS, TCP, and Web browsing Credit: 3 Prerequisite: CSE 308: Computer Interfacing Interface components and their characteristics, micro processor I/O. Disk, Drums and Printers. Optical displays and sensors. High power interface devices, transducers, stepper motors and peripheral devices. Credit: 3 Prerequisite: CSE 303 CSE 308: Computer Interfacing Lab Laboratory works based on CSE 308. Credit: 1 Prerequisite: CSE 203 MGT 309: Engineering Management 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 Canadian University of Bangladesh Page 23 Prerequisite: None CSE 310 Concepts of Programming Language An introduction to the structure of programming languages. A Formal specification of syntax and semantics; structure of algorithmic, list processing, string manipulating, data description, and simulation languages: A basic data types, operations, statement types, and program structure; macro language and their implementation; and run-time representation of programs and data. Credit: 3 Prerequisite: CSE 103 CSE 401: Computer Networks 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: CSE 307 CSE 401L: Computer Networks Lab Laboratory works based on CSE 401 Credit: 1 Prerequisite: CSE 307 CSE 402: System Analysis and Design Canadian University of Bangladesh Page 24 Different types of information; Source of information; Information gathering; System development methodologies and life cycle; Tools, approaches and role of design; Planning and problem definition; Evaluation and feasibility study; Cost-benefit analysis; Design of an information system; Describing process and data; Quality and testing; Project management; Design of user interface, programs, files and databases; Control and security. Credit: 3 Prerequisite: CSE 302 CSE 402L: System Analysis and Design Lab Laboratory works based on CSE 402. Credit: 1 Prerequisite: CSE 302 HUM 401: World Civilization Before history; before civilization ,Mesopotamia, Ancient Egypt & India Discussion/Early China, The Aegean World & Assyria, Hebrews and Phoenicians, Discussion/ Persian beginnings, Greek civilization, Roman Civilization, Discussion/ Roman and Han Empires ,Indian Civilization ,Midterm, Cross-cultural Exchange Early Medieval Europe ,Medieval Christianity. Discussion/The Crusades, Islamic civilization. Tang and Song China, The Mongol Empire , Discussion/Ming China, Tropical Africa and Asia, High Medieval Europe. Credit: 3 Prerequisite: None CSE 403: Computer Graphics Computer Graphics: Introduction to computer graphics: brief history, applications, hardware and software and the fundamental ideas behind modern computer graphics, Characteristics of display devices Image representation: Representing primitive’s objects: point, line, circle, ellipse, rectangle, polygon, arc and sector, Representation of Characters, Filling Algorithm, Aliasing, Anti-aliasing etc. Two Dimensional Objects: Two dimensional transformations, translation, rotation, scaling, mirror reflection, two dimensional viewing, line, circle and polygon clipping, 3D graphics pipeline, Composite and Instance transformation. Canadian University of Bangladesh Page 25 Three Dimensional Objects: Three dimensional transformations, translation, rotation, scaling, mirror reflection, three dimensional viewing, line, circle and polygon clipping, 3D graphics pipeline, Composite and Instance transformation. Projection & Curves: Projection, orthogonal and perspective projection, perspective anomalies, parallel projection, 3D curves and surfaces Hidden Surface: Hidden Surface, hidden-surface algorithms, z-buffer algorithm Color and shading models Ray Tracing & Modeling Ray Tracing, Future trends in computer graphics, modeling of 3D Objects, polygonal net model, and wire-frame model. OpenGL programming Guide. Credit: 3 Prerequisite: MAT 203 CSE 403L: Computer Graphics Lab Laboratory works based on CSE 403 Credit: 1 Prerequisite: MAT 203 LBA 401: Bangladesh Culture and Heritage Deals with the cultural and political heritage of Bangladesh from ancient times to the present and familiarizes students with the cultural milieu of the people to make them aware of Bangladesh’s national identity. Topics include ethnic origin of the people in Bangladesh, religious faiths, festivals, colonial legacy; baul culture; creativity in the arts and crafts; evolution of nationalism in the pre and post-partition East Bengal, Language Movement, struggle for autonomy, and the independence of Bangladesh. Credit: 3 Prerequisite: None CSE 404: Mobile and Application Development 1. Introduction a. Introduction to Mobile Computing b. Introduction to c. Android Development Environment 2. Factors in Developing Mobile Applications a. Mobile Software Engineering b. Frameworks and Tools c. Generic UI Development d. Android User 3. More on UIs a. VUIs and Mobile Apps i. Text-toSpeech Techniques b. Designing the Right UI c. Multichannel and Multimodial UIs 4. Intents and Services a. Android Intents and Services b. Characteristics of Canadian University of Bangladesh Page 26 Mobile Applications c. Successful Mobile Development 5. Storing and Retrieving Data a. Synchronization and Replication of Mobile Data b. Getting the Model Right c. Android Storing and Retrieving Data d. Working with a Content Provider 6. Communications Via Network and the Web a. State Machine b. Correct Communications Model c. Android Networking and Web 7. Telephony a. Deciding Scope of an App b. Wireless Connectivity and Mobile Apps c. Android Telephony 8. Notifications and Alarms a. Performance b. Performance and Memory Management c. Android Notifications and Alarms 9. Graphics a. Performance and Multithreading b. Graphics and UI Performance c. Android Graphics and 10. Multimedia a. Mobile Agents and Peer-to-Peer Architecture b. Android Multimedia 11. Location a. Mobility and Location Based Services b. Android 12. Putting It All Together (as time allows) a. Packaging and Deploying b. Performance Best Practices c. Android Field Service App 13. Security and Hacking (as time allows) a. Active Transactions b. More on Security c. Hacking Android 14. Platforms and Additional Issues (as time allows) a. Development Process b. Architecture, Design, Technology Selection c. Mobile App Development Hurdles d. Testing Credit: 3 Prerequisite: none CSE 405: VLSI Circuit Design 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 Prerequisite: CSE 202 CSE 404L: VLSI Design Lab Laboratory works based on CSE 404 Credit: 1 Prerequisite: CSE 202 CSE 406: Project Canadian University of Bangladesh Page 27 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 Optional Courses CSE 419: Distributed Database Systems Introduction to distributed databases; Replicated data, Distributed concurrency control; Deadlocks; Byzantine failures; Distributed transaction management; Query processing and optimization; Parallel database machine; Multimedia database servers; Heterogeneous multi-database systems. Credit: 3 Prerequisite: CSE 204 CSE 419L: Distributed Database Systems Lab Laboratory works based on CSE 419 Credit: 1 Prerequisite: CSE 204 CSE 423 Pattern Recognition and Neural Networks Introduction: Basic concepts, Design concepts, Examples; Decision functions: Linear decision functions, Generalized decision functions; Pattern classification by distance functions: Minimum distance pattern classification, Cluster seeking; Pattern classification by likelihood functions: Bayes classifier; Structural pattern representation: Grammars for pattern representation, Picture description language and grammars, Stochastic grammars; Structural pattern recognition: String to string distance; Matching other structures: Relational structures, Graph matching, Matching by relaxation, Random graph. Credit: 3 Canadian University of Bangladesh Page 28 Prerequisite: CSE 403 CSE 423L: Pattern Recognition and Neural Networks Lab Laboratory works based on CSE 423 Credit: 1 Prerequisite: CSE 403 CSE 427: Graph Theory Introduction to graphs as abstract connection diagrams, Fundamental concepts and definitions, Varieties of graphs; Trees: Properties, Spanning trees, Isomorphism of trees, Trees and optimization; Planar, Eulerian and Hamiltonian graphs; Cuts and connectivity of graphs, network flow problem; Graph coloring. Credit: 3 Prerequisite: CSE 203 CSE 427: Graph Theory Lab Laboratory works based on CSE 427 Credit: 1 Prerequisite: CSE 203 CSE 428: Digital Image Processing Digital image fundamentals, perception, representation; image transforms; First Fourier Transform (FFT), Discrete Cosine Transform (DCT), Karhumen and Loeve Transform (KLT), Wavelet transform and sub-band decomposition; image enhancement and restoration techniques, image compression techniques, image compression standards: JPEG, MPEG, H.261, and H.263. Credit: 3 Prerequisite: None CSE 428L: Digital Image Processing Lab Laboratory works based on CSE 428 Credit: 1 Canadian University of Bangladesh Page 29 Prerequisite: None CSE 429: Data Mining Data mining supports decision making by detecting patterns, devising rules, identifying new decision alternatives and making predictions. This course is organized around a number of well defined data mining tasks: description, classification, estimation, prediction, and affinity grouping and clustering. Students will learn to use techniques such as Rule Induction (classification trees), Logistic Regression, Discriminant Analysis, and Neural Networks. Data visualization techniques will be used whenever possible to reveal patterns and relationships. Students will use commercially available software tools to mine large databases. Teambased projects will be conducted. Credit: 3 Prerequisite: CSE 306 CSE 429L: Data Mining Lab Laboratory works based on CSE 429 Credit: 1 Prerequisite: CSE 306 CSE 430: Internet and Web Technologies Details about the Internet, Intranet, Extranet, and e-commerce will be covered. Topics include Web server management, threats, security of client and server, network security like firewall, SSL, etc., authentication and authorization, legislation, privacy and IP act, electronic payment, ebusiness, search engine, Internet protocols like TCP/IP, SGML, XML. Design and development of Web applications using Java Applets, ASP, Java Script, CGI and other Web tools is discussed. Credit: 3 Prerequisite: CSE 201 CSE 430L: Internet and Web Technologies Lab Laboratory works based on CSE 430 Credit: 1 Prerequisite: CSE 201 Canadian University of Bangladesh Page 30 CSE 431: Digital System Design Design using MSI and LSI components; Design of memory subsystem using SRAM and DRAM; Design of various components of computer: ALU, memory and control unithardwired and micro-programmed; Microprocessor based designs; Computer bus standards; Design using special purpose controllers, floppy disk controller. Credit: 3 Prerequisite: CSE 303 CSE 431L: Digital System Design Lab Laboratory works based on CSE 431 Credit: 1 Prerequisite: CSE 303 CSE 432 Bioinformatics Bioinformatics and the Internet, Overview of Molecular Biology and Biological Chemistry,The Genetic Material, Gene Structure and Information Content,Protein Structure and Function, Bioinformatics tools,The NCBI Data Model,The GenBank sequence database,DNA sequencing,Editing DNA sequences,Submitting DNA sequences to the Database,Sequence Retrieval from Biological Databases ( NCBI, EMBL, ExPasy),Sequence similarity searches ( BLAST, FASTA, EMBL databases),Sequence Alignment ( CLUSTAL X, Genedoc, Bioedit) Phylogenetic Analysis. Credit: 3 Prerequisite: None CSE 433: Machine Learning Introduction to Machine Learning; Classification of learning: Unsupervised and supervised learning, Connectionist learning, Reinforcement learning, Machine discovery; Supervised learning: Information theoretic decision tree learner, Best current hypothesis search, Candidate elimination (version space) algorithm, Learning in the first order Horn clause representation, Inductive logic programming, Application; Unsupervised learning: Hierarchical clustering, Category utility, Incremental and Canadian University of Bangladesh Page 31 nonincremental algorithms for hierarchical clustering, Applications; Connectionist learning: Introduction to Neural Network, Feedforward and recurrent network, Perceptron, Multilayer feedforward network, Backpropagation algorithm for training a feedforward network, Applications; Genetic Algorithms: Genetic operators, Fitness function, Genetic algorithm in supervised learning framework, Applications. Credit: 3 Prerequisite: MIS 301: Management Information Systems 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: CSE 103 CSE434: Digital Signal Processing Introduction to Digital Signal Processing, Filtering, Frequency response, Sampling theory, Z-transform, Discrete Fourier Transform (DFT), Fast Fourier Transform (FFT), Windowing, Correlation & Convolution, Application of Digital Signal Processing. Introduction to Digital Filters, Finite Impulse Response (FIR), Infinite Impulse Response (IIR), Different techniques of FIR and IIR filter design Credit: 3 Prerequisite: CSE 103 CSE434: Digital Signal Processing Laboratory works based on CSE 434 Credit: 1 Prerequisite: CSE 103 Canadian University of Bangladesh Page 32 CSE 435: Network Security Introduction: assets, threats, countermeasures; network security models, security functions: confidentiality, authentication, integrity, nonrepudiation, access control, availability, passive and active attacks, end-to-end vs linkto-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: CSE 401 CSE436: Human Computer Interaction An introduction to the concepts for human and computer interface. The importance of computer interface, interface quality and methods of evaluation. The relationship of interface quality to interactions with the computer. Interface design, dimensions of interface variability, dialogue tools and techniques, user centered design and task analysis. User interface implementation, I/O devices and user interface for groupware, multimedia systems and visualization. Credit: 3 Canadian University of Bangladesh Page 33 Prerequisite: CSE 307 CSE 437: VHDL Modeling and Logic Synthesis Topics treated include: Event-Driven Simulation, hardware modeling and simulation in Verilog, data types and logic system in Verilog, Structural and behavioral modeling, user-defined tasks and functions in Verilog and interactive debugging in Verilog using software tools. Credit: 3 Prerequisite: CSE 202 CSE 438: Cloud Computing Introduction to different types of computing: Edge computing, Grid computing, Distributed Computing, Cluster computing, Utility computing, Cloud computing. Cloud computing architecture: Architectural framework; Cloud deployment models; Virtualization in cloud computing; Parallelization in cloud computing; Green cloud. Cloud Bus; Cloud service models: Software as a Service (SaaS); Infrastructure as a Service (IaaS); Platform as a Service (PaaS). Foundational elements of cloud computing: Virtualization; Cloud computing operating System; Browser as a platform; Advanced web technologies (Web 2.0, AJAX and Mashup); Introduction to autonomic systems; Service Level Agreements(SLA); Security/Privacy; Cloud economics; Risks assessment; Current challenges facing cloud computing. Credit: 3 Prerequisite: CSE 430 CSE 438L: Cloud Computing Lab Laboratory works based on CSE 434 Credit: 1 Prerequisite: CSE 430 CSE 439: Embedded System Software Programming languages for embedded systems: desirable characteristics of programming languages for embedded systems, low-level versus highlevel languages, main language implementation issues: control, typing, exception handling, modularity and multi-threading. Major programming Canadian University of Bangladesh Page 34 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: CSE 302 Canadian University of Bangladesh Page 35