B

Basic sentence structure: Giving idea of parts of speech, different tense etc. Present simple and continuous tense– active and passive: Reading and listening to passages and conversations - understanding the time sequence, introducing structure with examples, identification and doing various exercises, writing and speaking from clues (verbal and visual) and question answer session, forming questions. Noun–function as subject, object, etc.: Identification. Past simple and continuous tense – active and passive: understanding the difference, introducing structure with examples and giving exercises, writing and speaking from clues (verbal and visual) Question-answer session. State verbs and action verbs: providing list of state verbs, practice making sentences with them. Adjectives and adverbs: identification and making sentences. Use of basic modals – active and passive sentences: reading and listening to passages and conversations - understanding the time sequence Introducing structure with examples and giving exercises, making suggestions, introducing structure, question-answer session. Future simple and continuous – active and passive : Reading and listening to passages and conversations - understanding the time sequence Introducing structure with examples and giving exercises, writing and speaking from clues (verbal and visual). Word formation – functions of words: Showing the changes in the formation of words according to parts of speech, showing the changes of form of some common words, making sentences with them, vocabulary building

 

 

WRITING:

 

 

Writing formal letter / application; Situational Writing; Writing assignment – steps; Writing reflexive essay; Comparative paragraph writing;

 

Credits: 3.00

GRAMMAR

 

 

Present perfect tense – active and passive: Reading and listening to passages and conversations - understanding the time sequence, introducing structure with examples, identification and doing various exercises, writing and speaking from clues (verbal and visual) and question answer session, forming questions. Phrasal verbs, appropriate preposition, common idioms: supplying list of common expressions and showing their use in sentences.

 

Joining sentences – using coordinating conjunctions and relative pronouns: showing use in passages and practice using them. Past perfect tense: introducing structure with examples, identification and doing various exercises. Present perfect tense, past simple tense and past perfect tense: practice using them in appropriate situation. Present perfect continuous tense – active and passive: practice using them in appropriate situation. Using correct form of verbs: practice using them in appropriate situation. Conditional sentences and time clauses: understanding the structure and practice using them. Modals–present and past forms: understanding the structure and practice using them, writing suggestions on given situations. Synonyms and Antonyms: Making list of common synonyms and antonyms and using them in sentence.

 

 

 

WRITING:

 

Descriptive paragraph, narrative paragraph, summary and note-taking, writing argumentative essay

 

Credits: 3.00

 

Prerequisite: ENG 101

Differential Calculus: Limit, continuity and differentiability, successive differentiation of various types of functions, Leibnit’z theorem, Rolle’s theorem, Mean Value theorem, expansion in finite and infinite forms, Lagrange’s form of remainder, Cauchy’s form of remainder (expansion of

 

Remainder), expansions of functions differentiation and integration, indeterminate form, partial

 

Differentiation, Euler’s theorem, tangent and normal, sub tangent and subnormal in Cartesian and polar coordinates, maxima and minima of functions of single variables, curvature, asymptotes.

 

Integral Calculus: Definition of integrations, integration by the method of substitution, integration by parts, standard integrals, integration by the method of successive reduction, definite integrals, definite integral properties and its use in summing series, Walli’s formula, improper integrals, Beta function and Gamma function, multiple integral and its application, area, volume of solid of revolution, area under a plane curve in Cartesian and polar coordinates, area of the region enclosed by two curves in Cartesian and polar coordinate, arc lengths of curves in Cartesian and polar Coordinates.

 

Credits: 3.00

 

Prerequisite: None

Coordinate Geometry: Transformation of coordinates, axes and its uses; Equation of conies and its reduction to standard forms; Pair of straight lines; Homogeneous equations of second degree; Angle between the pair of straight lines; Pair of lines joining the origin lo the point of intersection of two given curves, circles; System of circles; Orthogonal circles: Radical axis, radical center, properties of radical axes; Coaxial circles and limiting points: Equations of parabola, ellipse and hyperbola in Cartesian and polar coordinates; Tangents and formals; pair of tangents; Chord of contact; Chord In terms of Its middle points; Pole and polar parametric co-ordinates; Diameters; Conjugate diameters and then- properties; Director circles and asymptotes.

 

Vector Calculus: scalars and vectors, equality of vectors; addition and subtraction of vectors; multiplication of vectors by scalars; position vector of a point; scalar and vector product of two vectors and their geometrical interpretation; triple products and multiple products of vectors; linear dependence and independence of vectors; definition of line, surface and volume integral; gradient, divergence and curl of point functions; Gauss’s theorem, Stoke’s theorem, Green’s theorem and their applications.

 

Credits: 3.00

 

Prerequisite: MAT 101

Linear Algebra: Definition of matrix; Different types of matrices; Algebra of matrices; Adjoint and inverse of a matrix; Elementary transformations of matrices; Matrix, polynomials; Calay-Hamilton theory with uses of rank and nullity; Normal and canonical forms; Solution of linear equations; Eigen values and eigenvectors. Definition and properties of vector space, subspaces, basis and dimension, change of basis; linear 'transformation (LT) its definition and properties, linear operator matrix, geometry of LT, standard plane LT.

 

Ordinary differential equation: formation of differential equations; solution of first order differential equations by various methods; solution of differential equation of first order but higher degrees; solution of general linear equations of second and higher orders with constant co-efficient; solution of Euler’s homogeneous linear differential equations.

 

Partial differential equation: introduction, linear and non-linear first order differential equations; standard forms; linear equations of higher order; equations of the second order with variable co-efficient.

 

Credits: 3.00

 

Prerequisite: MAT 111

Complex Variables. Complex number system, General functions of a complex variable, Limits and continuity of a function of complex variable and related theorems, Complex function, differentiation and the Cruchy-Riemann Equations. Line integral of a complex function,

 

Cauchy’s Integral Formula, Liouville’s Theorem, Taylor’s and Laurent’s Theorem, Singular Residues, Cauchy’s Residue Theorem.

 

Fourier analysis: Real and complex form of Fourier series. Applications of Fourier series in solving BVP. Finite transform: Fourier Integral. Fourier transforms and their uses in solving boundary value problems.

 

Credits: 3.00

 

Prerequisite: MAT 121

Frequency Distribution of Data, Population and sample, Collection and representation of statistical data, Tabulation of data, Class intervals, Frequency distribution, discrete continuous and cumulative distributions, Histograms and frequency polygons, Graphical representation data. Statistical Measures, Measures of central tendency-range, Standard deviation, Variance, Coefficient of variation, Moments skewness, Kurtosis. Correlation Theory, Linear correlation, Measures of correlation and significance, Regression and Curve Fitting, Linear and non-linear regression, Methods of least squares curve fitting. Probability, Definition of Probability and related concepts, Laws of Probability, Probability distributions, Discrete and continuous random variables, Mathematical expectation, Conditional probability. Stochastic process, Markov chain (discrete and continuous), Queuing theory-Birth process in queuing, Queuing models, (Elementary concepts).

 

Credits: 3.00

 

Prerequisite: MAT 121

Definition, Micro and Macro-economics and their relative importance in the formulation of national policies, Micro-economics, Law of diminishing marginal utility, Demand function, demand curve, Law of demand, Elasticity of demand, Supply analysis, Supply function, Factors influencing supply, Law of supply, Elasticity of supply.

 

Market Equilibrium, Equilibrium price and quality, Indifference curve, Construction of I-C, Properties of I-C, Consumer’s equilibrium with the help of I-C and budget line, Income effect, price effect, Substitution effect, Production function, Factors of production, Production possibility curves, Cost & Revenue, Total, Average, Marginal.

 

Macro-economics, Natural Income, GNP, GDP and NNP, Income circular flow diagram, Methods of measuring national income, Function of money, Value and inflation, International Trade, Terms of trade, Free trade and protection, Public Finance, Public income, Public expenditure, Public debt, Direct and indirect tax, Planning in Bangladesh.

 

Credits: 2.00

 

Prerequisite: None

Principles of accounting: accounts, transactions, the accounting procedures and financial statements; cost in general: objective and classifications; overhead costing; cost sheet under job costing, operating cost and process costing; marginal costing: tools and techniques, cost- volume-profit analysis; relevant costing: analyzing the profitability within the firm, guidelines for decision making; long-run planning and control: capital budgeting; development of accounting software tools.

 

Credits: 3.00

 

Prerequisite: None

Heat & Thermodynamics: Principle of temperature measurements: platinum resistance thermometer, thermos-electric thermometer, pyrometer; Kinetic theory of gases: Maxwell’s distribution of molecular speeds, mean free path, equipartition of energy, Brownian motion, Van der Waal’s equation of state, review of the first law of thermodynamics and its application, reversible, and irreversible processes, Second Law of thermodynamics, Carnot cycle; Efficiency of heat engines, Carnots Therom, entropy and disorder, thermodynamic functions, Maxwell relations, Clausius-Clapeyron Equation, Gibbs Phase Rule, Third Law of thermodynamics.

 

Structure of Matter: Crystalline & non-crystalline solids, single crystal and polycrystal solids, unit cell, crystal systems, co-ordinations number, crystal planes and directions, sodium chloride and CsCl structure, packing factor, Miller indices, relation between inter planar spacing and Miller indices, Bragg’s Law, methods of determination of inter planar spacing from diffraction patterns; Defects in solids: point defects, line defects; Bonds in solids, interatomic distances, calculation of cohesive & bounding energy; Introduction to band theory: distinction between metal, semiconductor and insulator.

 

Waves & Oscillations: Differential equation of a simple harmonic oscillator, total energy and average energy, combination of simple harmonic oscillations, Lissajous’ figures, spring-mass system, calculation of time period of torsional pendulum, damped oscillation, determination of damping co-efficient, 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, interference at wedge shaped films, Newton’s rings, interferometers; Diffraction of light: Fresnel and Fraunh offer diffraction, diffraction by single slit, diffraction from a circular aperture, resolving power of optical instruments, diffraction at double slit & N-slit-diffraction grating; Polarization: production and analysis of polarized light, Brewster’s law, Malus law, Polarization by double refraction, retardation plates, Nicol prism, optical activity, polarimeters, polaroid.

 

Credits: 3.00

 

Prerequisite: None

Electronic charge, Charge and matter, Electric field and field strength, Lines of force, Point charge and dipole in electric field. Flux of electric field.

 

Potential and field strength, electric potential energy, Magnetic field and field strength, Magnetic lines of induction, Two parallel conductors, Faraday’s law of induction, Inductance, Energy and magnetic field, Energy density, BH curves, Magnetic force and its utilization, Hystersis and eddy current losses.

 

Electrical units and standards, Electrical networks, Circuit solutions-series, Series-parallel networks, Star-delta and delta star conversion.

 

Basic principle of generation of Alternating and Direct Current, Introduction to phasor algebra as applied to A.C. Circuit analysis, Solution of A.C. circuits, Series, Parallel and Series-parallel circuit, R.L.C circuits, Series and parallel resonance, Applications of networks theorems to A.C. circuits, Basic principle of transformer, Basic principle of Motor and Generator.

 

Credits: 3.00

 

Prerequisite: None

Laboratory works based on EEE 101

 

Credits: 1.50

 

Prerequisite: None

Introduction to semiconductors, p-type and n-type semiconductors; p-n junction diode characteristics; Diode applications: half and full wave rectifiers, clipping and clamping Circuits, regulated power Supply using zener diode. Bipolar Junction Transistor (BJT), Frequency response of BJT amplifier. Field Effect Transistor (FET): Principle operation of JFET and MOSFET; Depletion and enhancement type NMOS and PMOS; biasing of FETs; switching circuits using FETs; Introduction to CMOS. Operational amplifiers (OPAMP).Introduction to feedback, Oscillators, Silicon Controlled Rectifiers (SCR), TRIAC, DIAC and UJT.

 

Credits: 3.00

 

Prerequisite: EEE 101

Laboratory works based on EEE 211

 

Credits: 1.50

 

Prerequisite: EEE 101

4/5 students will make a group and the faculty members will assign them a project. The project will mainly focus on structured programming language.

 

At the end of the semester there will be a formal defense board and the students will present their project at that defense board. They have to submit a soft copy of their projects and a report to their course teacher at the end of the project.

 

Credits: 0.75

 

Prerequisite: CSE 111

Introduction to digital computers; information representations in digital computers; number theory and number conversions; history of computing devices; computers; components of a computer; Hardware: processor, memory, I/O devices; software: Operating system, application software; Architecture of a computer; Information Technology; Computer Networks, Internet,

Introduction to programming languages, Generations of programming languages, algorithms, flowchart and concept of structured programming. Problem solving technique, basic concepts of programming: writing, debugging and running a program related to C programming language.

 

Credits: 3.00

Prerequisite: None

Laboratory works based on CSE 101.

 

Credits: 1.50

 

Prerequisite: None

Introduction to Logic and Proofs: Propositional Logic, Propositional Equivalences, Predicates and Quantifiers, Nested Quantifiers , Rules of Inference, Introduction to Proofs; Basic Structures: Sets, Functions, Sequences, Sums, and Matrices ; Number Theory and Cryptography: Divisibility and Modular Arithmetic, Integer Representations and Algorithms, Primes and Greatest Common Divisors, Solving Congruences; Induction and Recursion ; Counting: Basics of Counting, Pigeonhole Principle, Permutations and Combinations, Binomial Coefficients and Identities; Relations ; Graphs: Graph Models, Representing Graphs, Connectivity, Euler and Hamilton Paths, Planar Graphs , Graph Coloring; Trees: Applications of Trees, Tree Traversal, Spanning Trees, Minimum Spanning Trees; Boolean Algebra.

 

Credits: 3.00

 

Prerequisite: None

Structured programming language: data types, operators, expressions; control structures; functions and program structure: parameter passing conventions, scope rules and storage classes, recursion; header files; preprocessor; pointers and arrays; strings; multidimensional array; user defined data types: structures, unions, enumerations; input and output: standard input and output, formatted input and output, file access; variable length argument list; command line parameters; error handling; graphics; linking; library functions.

 

 

Credits: 3.00

 

Prerequisite: CSE 101

Laboratory works based on CSE 111 using C programming language.

 

Credits: 1.50

 

Prerequisite: CSE 101

Philosophy of object oriented programming (OOP); advantages of OOP over structured programming; encapsulation, classes and objects, access specifiers, static and non-static members; constructors, destructors and copy constructors, in-line functions; array of objects, object pointers and object references, new and delete, friend function; polymorphism: overloading, default arguments; operator overloading : overloading binary, relational, logical, unary operator; inheritance: single and multiple inheritance, abstract classes, virtual functions and overriding; exceptions; object oriented I/O; template functions and classes; multi-threaded programming; class libraries; I/O systems; string handling; exception handling; run-time type identification and the casting operators; namespaces, conversion functions; standard template library: container classes, vectors, lists, string class.

 

Credits: 3.00

 

Prerequisite: CSE 111

Laboratory works based on CSE 122 using C++ programming.

 

Credits: 1.50

 

Prerequisite: CSE 111

4/5 students will make a group and the faculty members will assign them a project. The project will mainly focus on object oriented programming language. (C# or C++ preferable)

 

At the end of the semester there will be a formal defense board and the students will present their project at that defense board. They have to submit a soft copy of their projects and a report to their course teacher at the end of the project.

 

Credits: 0.75

 

Prerequisite: CSE 100

Digital systems: Digital computers and digital systems; binary, octal and hexadecimal number systems; complements; signed binary numbers; decimal and binary codes; introduction to binary logic. Boolean algebra: basic definitions, theorems and properties of Boolean algebra; Boolean functions; standard forms of Boolean functions; logic operations. Simplification of Boolean functions: Karnaugh map method; don’t care condition; NAND and NOR implementation; exclusive-OR function. Combinational circuits: analysis and design procedures; adders, subtractors, multilevel NAND/NOR circuits and code conversion; transistor switches and practical design considerations; TTL, MOS, CMOS, IIL logic gates and their circuit’s. MSI and PLD devices: magnitude comparators, decoders, encoders, multiplexers, demultiplexers , read-only memory (ROM), Programmable Logic Array (PLA), and Programmable Array Logic (PAL). Analysis of synchronous sequential circuits: flip-flops; analysis of clocked sequential circuits; Mealy and Moore machines state reduction and assignment. Design of sequential circuits: flip-flop excitation tables, design procedures, counter designs. Registers, counters and memory devices: shift registers; ripple counters, synchronous counters, timing sequences, and Random Access Memory (RAM).

 

Credits: 3.00

 

Prerequisite: CSE 101

Laboratory works based on CSE 205.

 

 

Credits: 1.50

 

Prerequisite: None

Introduction to database Concepts: Three level architecture, DBMS, DDBMS, Database administration, models and languages; Relational Algebra;  SQL; Intermediate SQL;  Database Design: E-R Approach, Relational Model Design, Normalization; File organizations and data structures, Indexing and Hashing, query optimization; Transaction Management: Transaction, Concurrency control; Data Basic Mining and Analysis: Data Analysis and Mining, Information Retrival; System Architecture: Database System Architecture, Parallel and Distributed Databases.

 

Credits: 3.00

 

Prerequisite: CSE 111

Laboratory works based on CSE 207 using MS-SQL Server/Oracle. There must be a desktop/web project consisting of a back end with MYSQL/Oracle and front end with C#/Java/ any suitable web language.

 

Credits: 1.50

 

Prerequisite: CSE 111

Overview of Data Communications and Networking, Components of data communication, Direction of data flow, Computer networks: Physical structures, Categories of networks, Internet, Protocols and Standards, Network models: OSI reference model and TCP/IP model, TCP/IP protocol suite, Addressing, Data Signals: Bit Rate and Bit length, Transmission Impairment, Nyquist Bit Rate and Shanon Capacity, Digital Transmission: Line coding schemes (Unipolar, Polar, Bipolar, and Multilevel) NRZ, RZ, Manchester, Differential Manchester, AMI and Pseudo ternary, 2B/1Q, Block coding, Pulse Amplitude Modulation (PAM), Delta modulation, Transmission Modes, Analog Transmission: ASK, FSK, PSK, and QAM, AM, FM, and PM, Multiplexing-FDM, TDM, HDLC, Asynchronous and Synchronous communications, Transmission Media: Cable media: Twisted pair cable, coaxial cable, and fiber-optic cable, Wireless media: radio wave, microwave, and infrared, Error detection and correction: Types of errors, Error detections: parity check, cyclic redundancy check, Checksum, Error correction: retransmission, forward error correction, Hamming code, Multiple access protocol: Random access: CSMA, CSMA/CD , CSMA/CA, Controlled access: Polling, reservation, and token passing, Multiple access protocol continued, Ethernet: Traditional Ethernet, Fast Ethernet, Gigabit Ethernet, Connecting devices: Repeaters, Hubs, Bridges, Switches and Routers, Data Link control: Flow control and error control, Stop-and-Wait ARQ, Go-back-N ARQ, Selective repeated ARQ, Congestion control and QoS: Data traffic, Congestion Control QoS, Techniques to improve QoS.

 

Credits: 3.00

Prerequisite: None

Formal models of automata, Language and computability and their relationship; Regular Language:  Finite automata, Non-determinism, Regular Expressions,  Pumping lemma for regular language;   Context- free Languages: Context free grammar, ambiguity, Chomsky normal form, Push-down automata, pumping lemma for context free language; Computability theory: Church-Turing thesis,  Turning machines, Hilbert’s problem; Decidability: Decidable language,  Halting problem. Fundamentals of computational complexity theory, Cook’s theorem, Approximation algorithms, intractable problem, NP- completeness, Some NP complete problems.

 

Credits: 3.00

 

Prerequisite: CSE 103

Information representation; Measuring performance; Instructions and data access methods: operations and operands of computer hardware, representing instruction, addressing styles; Arithmetic Logic Unit (ALU) operations, floating point operations, designing ALU; Processor design: data paths : single cycle and multicycle implementations; Control Unit design - hardware and micro programmed; Hazards; Exceptions; Pipeline: pipelined data path and control, superscalar and dynamic pipelining; Memory organization: cache, virtual memory, channels; DMA and Interrupts; Buses; Multiprocessors: types of multiprocessors, performance, single bus multiprocessors, multiprocessors connected by network, clusters.

Credits: 3.00

Prerequisite: CSE 205

Introduction to Numerical Computing, Approximations and Errors: Accuracy and Precision, Error Definitions, Round-Off Errors, Truncation Errors; Roots of Equations: Graphical Methods, The Bisection Method, The False-Position Method, Simple One-Point Iteration, The Newton-Raphson Method, The Secant Method; Systems of linear algebraic equations: Gauss Elimination, Solving Small Numbers of Equations, Naive Gauss Elimination, Pitfalls of Elimination Methods, Matrix Inversion and Gauss –Seidel; Curve Fitting: Linear Regression, Polynomial Regression, Multiple Linear Regression, Newton’s Divided-Difference Interpolating Polynomials, Lagrange Interpolating Polynomials, Coefficients of an Interpolating Polynomials, Curve Fitting with sinusoidal Functions; Numerical Differentiation and Integration : The Trapezoidal Rule, Simpson’s Rules, Integration with Unequal Segments, Romberg Integration, Gauss Quadrature, High-Accuracy Differentiation Formulas, Richardson Extrapolation, Derivatives of Unequally Spaced Data. Finite-difference methods for ordinary differential equations: Solution of linear, homogeneous difference equations with constant coefficients, Methods for stiff equations: Backward Euler, Gear's methods. Methods for linear systems of ODEs in which the coefficient matrix has purely imaginary eigenvalues, Finite-difference methods as digital filters: Transfer-function analysis, Boundary-value problems for ODEs; Numerical Solutions of Ordinary Differential Equations: Euler’s Method, Modifications and Improvements of Euler’s Methods,Runge-Kutta Methods, Adaptive Runge-Kutta Methods.

Credits: 3.00

 

Prerequisite: CSE 103

Laboratory works based on CSE 223.

 

Credits: 0.75

 

Prerequisite: CSE 103

Internal data representation; Abstract data types; Elementary data structures: arrays: Linear Arrays, Processing in Linear Array, Linear Search, Binary Search, Multidimensional Arrays; lists: Linked List, Traversing and searching a Linked List, Garbage Collection, Link List operations, Types of Linked List , Array and Linked Representation of Linked List, stacks, Application of Stack, queues : Circular Queues, Priority Queues , trees: Binary Trees, Threaded Binary Trees, Binary Search Tree, Balanced Binary Trees, AVL Search Trees, Red Black Trees, graphs; Adjacency Matrix, Path Matrix, Operations on Graphs, DFS and BFS, Topological Sorting, Advanced data Structures: heaps, Fibonacci heaps, B-trees; Recursion, sorting: Heap Sort, hashing, storage management.

 

Credits: 3.00

 

Prerequisite: CSE 121

Laboratory works based on CSE 231 using C/C++ programming.

 

Credits: 1.50

 

Prerequisite: CSE 121

Techniques for analysis of algorithms; Methods for design of efficient algorithms; Asymptotic notation, Divide and Conquer: maximum-subarray problem, Strassen’s algorithm; Solving Recurrences: Substitution method, recursion tree method, master method; Dynamic programming: Rod cutting, Matrix Chain Multiplication, LCS; Greedy Algorithms: activity-selection problem, Huffman codes, task-scheduling problem; Graph Algorithms: BFS, DFS, Topological Sorting; Minimum Spanning Trees: Prim’s Algorithm, Kruskal’s Algorithm; Shortest Path: Bellman-Ford algorithm, Dijkstra’s algorithm, Floyd-Warshall algorithm, Johnson’s algorithm; Maximum Flow: The Ford-Fulkerson method; String manipulation algorithms; Data compression and Cryptography; NP-Completeness.

 

Credits: 3.00

 

Prerequisite: CSE 231

Laboratory works based on CSE 241 using C/C++ programming.

 

Credits: 1.50

 

Prerequisite: CSE 231

4/5 students will make a group and the faculty members will assign them a project. The project will mainly focus on Dynamic Web page development. (Php/ASP.net preferable). The web app should have a database of its own. At the end of the semester there will be a formal defense board and the students will present their project at that defense board. They have to submit a soft copy of their projects and a report to their course teacher at the end of the project.

 

Credits: 0.75

 

Prerequisite: CSE 200

Principles of operating systems; Operating-System Structures, Architecture, Operations, kernel data structures; Resource Allocation, Operating system design and construction techniques; Process Management: Process, Threads,  Process Synchronization, Concurrent programming, CPU Scheduling, Deadlock; Memory Management: Main Memory; Virtual Memory; Storage Management: Mass Storage Structure,  File-System Interface; Protection; Security. 

 

Credits: 3.00

 

Prerequisite: CSE 111

Laboratory works based on CSE 309 in Linux environment and using Linux scripts.

 

Credits: 1.50

 

Prerequisite: CSE 111

Recurrent problems; Manipulation of sums; Sums and Asymptotic; Number theory; Special numbers; Generating functions, Random variables; Stochastic process; Markov chains: discrete parameter, continuous parameter, birth-death process; Queuing models: birth-death model, Markovian model, open and closed queuing network; Application of queuing models, Introduction to Probability.

Credits: 3.00

Prerequisite: CSE 103

Introduction to Microprocessors and Microcomputers; Evolution of microprocessors; The microprocessor and its architecture; Addressing modes; Data movement instruction; Arithmetic and logic instruction; Program control instruction; An overview of Intel 80186, 80286, 80486 and Pentium(IV) microprocessors, Idea of RISC processors, Overview of Alpha processor; Recent microprocessor evolution; Arithmetic co-processor; Microcontrollers; integrating microprocessor with interfacing chips; Memory interface and decoding; Interrupts; DMA.

 

Memory Interface; Basic I/O interface; 8086 interrupts and interrupts applications; Digital interfacing; analog interfacing;8055; 8054, 8059; 8051; DMA controller; interrupt controller; Communication interface; Interfacing with floppy and hard-disk controller; Mass storage systems; Barcode reader; MIDI interface; BUS interfaces: ISA, PCI, AGP, PS/2 and USB interfaces; Interfacing with stepper motors, MOSFET, SCR and Triac; Application of Opto-coupler and relays; Microprocessor in Scientific Instruments and other applications – Display, Protective Relays, Measurements of Electrical quantities, Temperature monitoring system, water level indicator, motor speed controller, Traffic light controller, etc.; Microprocessor based interface design.

 

Credits: 3.00

 

Prerequisite: CSE 215

Laboratory works based on CSE 315.

 

Credits: 1.50

 

Prerequisite: CSE 215

Design concepts and principles, Different phases of software System Development, Different types of information, qualities of information. Project Management Concepts, Software process and project Metrics, Software Project Planning, Risk Analysis and management, Project Scheduling and Tracking. Analysis Concepts and principles: requirement analysis, Analysis modeling, data modeling Architectural design, User Interface design, Object Oriented software development and design: Iterative Development and the Unified Process. Inception. Use case model for requirement writing, Elaboration using System Sequence Diagram, Domain Model. Visualizing concept classes. UML diagrams, Interaction and Collaboration Diagram for designing Software. Designing Objects with responsibilities. GRASP patterns with General Principles in assigning responsibilities: Information expert, Creator, Low Coupling and High Cohesion, Creating design class diagrams and mapping design to codes. Advanced GRASP patterns: Polymorphism, Pure Fabrication, Indirection, Project Variation

 

Credits: 3.00

 

Prerequisite: CSE 207

Laboratory works based on CSE 317 and design of a real life full-phase customized system. Credits: 1.50

 

Prerequisite: CSE 207

Introduction to computer networks, Uses of computer networks, Network models, Network topology, Layered approach of networking protocols, Design issues of layers, and TCP/IP protocol suite.

 

Application Layer Protocols: DNS services, E-Mail services, SMTP, POP, POP3, IMAP, MIME, Comparison between SMTP and HTTP, FTP, Telnet, DHCP, SMB protocol, WWW and HTTP: Persistent and Non-persistent connection, Request and response message, Web caching, cookies,

 

Transport Layer Protocols:  User datagram protocol (UDP) – UDP operations and UDP package modules, Transmission control protocol (TCP) – TCP features, TCP Connection establishment and termination, TCP Flow control and error control, Congestion control

 

Network Layer Protocols: IP addressing, IP packet forwarding, Sub-netting, CIDR, Internet protocol, ICMP, ARP, RARP, DHCP, and IPv6 overview The distance vector routing (DVR) protocol, Link-state routing, RIP and its drawback, Border gateway protocol (BGP), OSPF, MAC Protocols: Chanel partitioning, random access, taking turns.

 

Data link layer: Design issues; error control, detection and correction; Logical link control sub-layer, Medium access sub-layer; Multiple access protocols, Medium access mechanisms – ALOHA, slotted ALOHA, CSMA, CSMA/CD, CSMA/CA, WDMA; Medium access protocols – IEEE 802.3: Ethernet, IEEE 802.4: Token bus, IEEE 802.5: Token ring, Introduction to WiFi; High speed LANs, FDDI, Fast Ethernet, and Gigabit Ethernet; LAN extension – Bridges, Switches, and VPN

 

Others: Network Security: Major security goals, Symmetric key cryptography, Public key cryptography (RSA), Message Integrity and Digital Signatures

 

Credits: 3.00

 

Prerequisite: CSE 209

Laboratory works based on CSE 319.

 

Credits: 3.00

 

Prerequisite: CSE 209

Introduction to Compilers, Language processing system, compiler structure, Symbol table management, Impacts on compiler in developing higher level programming language, Applications of compiler, A Simple Syntax-Directed Translator, Context free grammar, Parse tree, Ambiguous grammar, Predictive parsing, Developing a simple one pass compiler, Lexical analyzer, lexical error detection and recovery, Input buffering, Syntax Analysis , Parsing error detection and recovery, Top Down parsing, Recursive Descent Parser, Elimination of left recursion, FIRTST and FOLLOW, Construction of predictive Parsing table, Bottom up parsing, Shift reduce parsing, handle pruning, LR Parser, LL(0) Parser ,LL(1) Parser ,LR parser algorithm, Syntax directed definition, Annotated parse tree, Dependency graph, Construction of syntax trees, S-attributed and L-attributed definitions , Top down translation , Intermediate code generation ,DAG , Quadruple, Triple, Translation of Assignment, Boolean Expression and Control statements, Specification of a simple type checker, Principal sources of Optimization , Optimization of basic blocks ,Code generation.

 

Credits: 3.00

 

Prerequisite: CSE 213

Implement a lexical analyzer in “C++/Java”, Use LEX tool to implement a lexical analyzer, Implement a recursive descent parser using LEX and YACC, Implement a calculator that computes arithmetic operations and prints results using LEX and YACC, Use YACC and LEX to generate intermediate code for a C program.

 

Credits: 0.75

 

Prerequisite: CSE 213

Concepts of Software Engineering, Software Engineering paradigms GoF, Sequential waterfall life cycles, Design Patterns: Adapter, Factory, Singleton, Strategy, Composite and Observer. Software Testing: White Box and Black Box testing. Basis Path Testing. Testing for specialized environment. Software testing strategies: Unit Testing, Integration Testing, Validation Testing, System Testing, Art of debugging. Analysis of System Maintenance and upgrading: Software repair, downtime, error and faults, specification and correction, Maintenance cost models, documentation. Software Quality Assurance, Quality factors. Software quality measures. Cost impact of Software defects. Concepts of Software reliability, availability and safety. Function based metrics and bang metrics. Metrics for analysis and design model. Metrics for source code, testing and maintenance. Legal Aspects of Software Engineering, System Architecture and Design, Business Aspects of Software Engineering, Risk in Software Development, Project Delivery, software maintenance; software support tools.

 

Credits: 3.00

 

Prerequisite: CSE 317

Laboratory works based on requirement discovery and analysis, software design, report writing on software design and other features of CSE 327. By the end of the semester students either individually or in groups, should have developed a fully functional software system in any language.(Java preferable)

 

Credits: 3.00

 

Prerequisite: CSE 317

Fundamental of OOP; Introduction to java applications; Constant, variables, data types, operators and expressions, control statements of java; Arrays and Array Lists ; Classes, objects and methods; inheritance;  polymorphism; interface; java packages; Exception handling; multithreaded programming; Graphics programming ; Files, Streams and Object Serialization; Generic Collections; Multimedia:

 

Credits: 3.00

 

Prerequisite: CSE 121

Laboratory works based on CSE 341 using Java Programming Language. There At the end of the semester all students have to submit a term project which covers the basic GUI components (Swing, JavaFX) and other topics (multithreading, networking) of JAVA.

 

Credits: 1.50

 

Prerequisite: CSE 121

Introduction to graphical data processing and its application, Fundamentals of interactive graphics programming, Basic elements of pictures generated by computer graphics, Rendering of image model to display surface, Graphic devices, Vector tools for graphics, 2D & 3D Transformations, Projection, Implementation of graphics concepts of two-dimensional and three-dimensional viewing, Line clipping, Line drawing algorithms, Graphics pipeline, Curves and surfaces, Hidden surface removal. Credits: 3.00 Prerequisite: CSE 231

Introduction to OpenGL, Drawing 2D geometric object, simple 2D animation and modeling transformation, More about simple 2D animation and modeling transformation, Discussions on 2D project, 2D project submission, Drawing 3D geometric object and texturing, Discussions on 3D project, Coloring and lighting in 3D world, viewing transformation, 3D project update, 3D project submission.

 

Credits: 0.75

 

Prerequisite: CSE 231

Introduction to old and new AI techniques; Knowledge representation; Propositional and first order logic, inference in first order logic; Frame problem; Search techniques in AI; Game playing; Planning; Probabilistic reasoning; , uncertainty, Learning in symbolic and non-symbolic representation; Introduction to expert system, expert consultation, concept information and  natural language processing, recognition, understanding and translation, Introduction to genetics algorithms, robotics and case study on expert systems.

 

Credits: 3.00

 

Prerequisite: CSE 241

Laboratory works based on CSE 352. Students will be Python and small scale projects in python will be submitted by them at the end of the semester.

 

Credits: 1.50

 

Prerequisite: CSE 241

4/5 students may make a group and the faculty members will assign them a project. The project will mainly focus on mobile application in android or IOS or windows.

 

At the end of the semester there will be a formal defense board and the students will present their project at that defense board. They have to submit a soft copy of their projects and a report to their course teacher at the end of the project.

 

Credits: 0.75

 

Prerequisite: CSE 300

Information systems management: importance of information systems (IS) management; IS management's leadership role; strategic uses of IT; IS planning; managing essential technologies: distributed systems; managing telecommunications; managing information resources; and managing operations; managing system development: technologies for developing systems and management issues in system development; systems for supporting knowledge work: supporting decision making; collaboration, and knowledge works; acquisition of hardware, software, networks, and services: request for proposal, acquisition methods (buy, rent, or lease), software acquisition, and analysis of alternatives; people and technology: the challenges ahead.

 

Ethics: Introduction to Professional Ethics, Law and Ethics, Steps in Making Ethical Decisions, Client’s Right to Informed Consent, Confidentiality and its limits, Unintentional breaches of Confidentiality, Working with minors, Ethical Issues in Couple and Family Therapy, Managing Boundaries and Multiple Relationships, Values and the Helping Relationship , Spirituality and Religion in therapy  , Non?Discrimination , Suicide  , Euthanasia  , Professional Competence and Training, Self?Care of the Therapist, Record Keeping,  The use of digital media in counseling, Issues in Supervision.

 

Credits: 3.00

 

Prerequisite: None

Diode logic gates, transistor switches, transistor logic gates, MOS gates; logic families: TTL, ECL, IIL and CMOS logic with operation details; propagation delay, product and noise immunity; open collector and high impedance gates; electronic circuits for flip-flops, counters and register, memory systems, PLA’s. A/D and D/A converters with applications; S/H circuits, LED, LCD and optically coupled oscillators; non-linear applications of OP AMPs; analogue switches; linear wave shaping: diode wave shaping techniques, clipping and clamping circuits, comparator circuits, switching circuits; pulse transformers, pulse transmission; pulse generation; monostable, bistable and astable multivibrators; schmitttrigger; blocking oscillators and time-base circuit; timing circuits; simple voltage sweeps, linear current sweeps.

 

Credits: 3.00

 

Prerequisite: CSE 215

Laboratory works based on CSE 411.

 

Credits: 1.50

 

Prerequisite: CSE 215

Cyber Security:

Introduction to Security, Foundations of Cyber Security, Managing Cyber Security, Risk Assessment, Identification and Authentication, Access Control, Security models, Cyber Security, Key Management, Security Evaluation, Application: Operating Systems Security (UNIX and Windows), Database Security, Software Security, Communication Security, Network Security, Web Security, and Mobile Devices Security.

Digital Forensic:

Types of computer crime, Computer misuse, Data protection, Criminal damage, Software piracy, Forgery, Pornography, Unsuitable material, Cybercrime methodologies, Computer forensics investigative theory, Computer forensics processing techniques, File system forensics, Forensics network investigations, Linux for forensics analysis, Linux forensics tools, Forensics investigation on mobile devices.

Credits: 3.00

 

Prerequisite: CSE 319

Laboratory works based on CSE 413

 

Credits: 1.50

 

Prerequisite: CSE 319

Concepts of Distributed Database processing, Database system architecture, Distributed Design Issues and Integrity Constraints, Network types, Distributed data storage, Network transparency, Data query processing, Query Decomposition and Data Localization, Data

 

transaction model, Commit protocols, Coordinator selection, Concurrency control, Concurrency Control Algorithms, deadlock handle, Multi Database system, Design of distributed database, Distributed Database and Applications, Distributed DBMS Reliability and Replication Techniques, Multi database Systems, Cloud architectures and Data management systems for cloud computing.

 

Credits: 3.00

 

Prerequisite: CSE 207

Laboratory works based on CSE 417

 

Credits: 1.50

 

Prerequisite: CSE 207

Introduction to Embedded Systems and Microcontroller Based Circuit Design; Microcontroller Architecture—PIC18F Family; PIC18F Programming Model and Its Instruction Set; Assembly Language Programming and General Purpose Digital I/O ; CCS C Compiler and PIC18F Development System; PIC I/O Port Programming; PIC18 Hardware Connection and ROM loaders; PIC18 Timers Programming; PIC18 Serial Port Programming; Interrupt Programming;

LCD and Keypad Interface; External EEPROM and I2C; ADC and DAC; Sensor and other Applications; CCP and ECCP Programming; Real-Time Operating Systems ; Serial Communication Peripherals; Digital I/O Peripherals: T/C and PWM; C# RS232 Interface Programming; Simulation Design and Debugging; Digital Oscilloscope, spectral Analyzer, and multimeter; Embedded Design Life Cycle; Embedded Computing Platform; Models of Computation, State Charts; Real Time Embedded Systems; Embedded System Hardware; Embedded operating systems, middleware & Scheduling; Embedded Systems Programming; Mapping between languages and hardware; Embedded Systems Hardware/ Software Co-design.

 

Credits: 3.00

 

Prerequisite: CSE 315

Laboratory works based on CSE 425. Credits: 0.75 Prerequisite: CSE 315

Introduction to Embedded Systems and Microcontroller Based Circuit Design; Microcontroller Architecture—PIC18F Family; PIC18F Programming Model and Its Instruction Set; Assembly Language Programming and General Purpose Digital I/O ; CCS C Compiler and PIC18F Development System; PIC I/O Port Programming; PIC18 Hardware Connection and ROM loaders; PIC18 Timers Programming; PIC18 Serial Port Programming; Interrupt Programming;

LCD and Keypad Interface; External EEPROM and I2C; ADC and DAC; Sensor and other Applications; CCP and ECCP Programming; Real-Time Operating Systems ; Serial Communication Peripherals; Digital I/O Peripherals: T/C and PWM; C# RS232 Interface Programming; Simulation Design and Debugging; Digital Oscilloscope, spectral Analyzer, and multimeter; Embedded Design Life Cycle; Embedded Computing Platform; Models of Computation, State Charts; Real Time Embedded Systems; Embedded System Hardware; Embedded operating systems, middleware & Scheduling; Embedded Systems Programming; Mapping between languages and hardware; Embedded Systems Hardware/ Software Co-design.

 

Credits: 3.00

 

Prerequisite: CSE 315

Basics of fiber optic communication systems, How optical fibers conduct light, attenuation, intermodal and chromatic dispersion, bit rate and bandwidth, Maxwell's equations, Propagation of EM waves, Details of single mode and multimode fibers, fabrication, cabling and installation, fiber cable connectorization and testing, light source and transmitter, receiver.

 

Component of a fiber optic networks, transceivers for fiber optic networks, semiconductor optical networks, Erbium-doped fiber amplifiers. Passive components, switches and functional modules of fiber optic networks, couplers/splitters, WDM MUX/DEMUX, filters, isolators, circulators and attenuators, optical switches and functional modules, an introduction to fiber optic network.

 

Credits: 3.00

 

Prerequisite: CSE 209

Remote access technologies and vulnerabilities; accessibility; Fundamentals on security and cryptography; security standards: data encryption standard (DES), RSA, digital signature algorithm (DSA), SHA, SSL, secure sockets layer(SSL), CBC, IPSec, AES and SET; distributed denial of service (DDOS) attacks; security for communication protocols; security for operating systems and mobile programs; security for electronic commerce, passwords and offline attacks; network security applications: authentication, e-mail, IP and web; system security: intruders, malicious software and firewalls; PKI smart cards, secure multipurpose internet mail extensions; viruses and spy ware; security models; wireless security, sandboxing, router security strategies and network security assessment.

 

Credits: 3.00

 

Prerequisite: CSE 319

Discrete time description of signals and systems, Discrete Fourier transform, Z- transform. Digital filter structure, Infinite Impulse Response Filter design techniques, Finite Impulse Response Filter design techniques, Finite precision effects, Inverse filtering.

 

Credits: 3.00

 

Prerequisite: CSE 411

Laboratory works based on CSE 437

 

Credits: 1.50

 

Prerequisite: CSE 411

Introduction to wireless networks; wireless transmission; frequencies; regulations; antennas; wireless signal propagation; modulation; spread spectrum; cellular system; media access; different types of wireless communication networks; different generations; mobile communication systems: GSM, HSCSD, GPRS, and EDGE; wireless telecommunication systems; TETRA; CDMA2000; satellite communication system; broadcast systems; digital radio; localization systems; wireless LANs; Wi-Fi and WiMAX technologies; Bluetooth; network protocols; mobile IP; ad-hoc networking; wireless sensor networks; transport protocols; reliable transmission; flow control; support for mobility, wireless WWW; WAP and i-mode; wireless security; mobile programming using J2ME.

 

Credits: 3.00

 

Prerequisite: CSE 319

Laboratory works based on CSE 439

 

Credits: 1.50

 

Prerequisite: CSE 319

 

Introduction of network and network model; interconnection at different layers; relays; Ethernet; different types of repeaters, hubs, bridges and switches; broadcast and collision domains; campus network; connecting the switch blocks; VLANs; layer 2 switch and spanning tree protocol; using spanning tree with VLANs; inter-VLAN routing; multi-layer switching; multicast; traffic isolation; interior routing protocols: RIP, OSPF, IGRP and EIGRP; autonomous systems; exterior routing protocols: EGP, BGP and IDRP; layer 3 switching; MPLS; queuing techniques; over provisioning; traffic shaping; and congestion control.

 

Credits: 3.00

 

Prerequisite: CSE 319

Laboratory works based on CSE 441

 

Credits: 1.50

 

Prerequisite: CSE 319

Delay Tolerant Networking: History of Delay Tolerant Networking, A Delay Tolerant Network , Requirements on DTNs, The Architecture: Overlay Architecture, Store and Forward Message Switching, Routing and Forwarding, Fragmentation and Reassembly, Custody Transfer, The Bundle Protocol: Bundle Service, Bundle Format, Bundle Processing, Routing Schemes in DTNs: Routing Considerations , Classification of Routing Schemes, Replication-Based Routing, DTN Routing: Taxonomy and Design: Routing in Intermittently Connected Networks, Routing as Opportunistic Forwarding, Message Replication, Message Forwarding, Message Coding, DTN Routing as Resource Allocation, DTN Routing Utility Functions: Destination Dependent (DD) Utility, Destination Independent (DI) Utility, Additional Considerations, Examples of DTN Routing Protocols, A Taxonomy of DTNs: Connectivity, Mobility, Node Resources, Application Requirements, DTN Routing Design Guidelines, Energy-Aware Routing Protocol for Delay Tolerant Networks: Routing in Sparse Networks, The Epidemic Routing Protocol for Delay Tolerant Network, The Analytical Model of the Epidemic Routing Protocol, The Restricted Epidemic Routing (RER) Protocols, The Tradeoff Function of the Restricted Epidemic Routing, The Residual-Energy (RE) Scheme, Maximizing the Lifetime of the Delay Tolerant Networks, Message Dissemination in Vehicular Networks: Characteristics of VANET, Innovative Applications, Message Dissemination, Medium Access Control for VANET, Delay Tolerant Networking (DTN) Protocols for Space Communications: Space Communications and DTPs for Space/Interplanetary Internet, DTN, BP, AND Convergence Layer Protocols, Recent Research and Experimental Activities on DTN for Space Communications, DTN and Satellite Communications: Bundle Layer DTN Architecture Overview, Satellite Channel Impairments and Possible Solutions, Space Communications.

 

 

Credits: 3.00

 

Prerequisite: CSE 319

 

Laboratory works based on CSE 443

 

Credits: 1.50

 

Prerequisite: CSE 319

Security goals; Security attacks; security services and mechanism; Techniques; A model for network security; Classical encryption techniques: symmetric cipher model, substitution techniques, transposition techniques, rotor machines; Block cipher and the data encryption standard: block cipher principle, the data encryption standards, a DES example; block cipher design principle; Basic concepts in number theory and finite fields: Divisibility and division algorithm, The Euclidean algorithm, modular arithmetic, groups, rings, and fields, polynomial arithmetic; Advanced encryption standard: the origins AES, AES structure, AES round functions, AES key expansion, an AES example, AES implementation; Block cipher operation: Multiple encryption and triple, Electronic codebook mode, cipher block chaining mode, cipher feedback mode, output feedback mode, counter mode; Public key cryptography and RSA: principles of public-key cryptosystems, the RSA algorithm; Other public-key cryptosystems: Diffie-Hellman key exchange, El Gamal cryptosystem, Elliptic curve cryptography, pseudorandom number generation based on an asymmetric cipher; Primality testing; Factorization; Chinese remainder theorem; Cryptography hash functions; Digital signatures: El Gamal digital signature scheme, Schnorr digital signature scheme, digital signature standard;

 

Key management and distribution; User authentication protocols; Transport layer security; Wireless network security;

 

Credits: 3.00

 

Prerequisite: CSE 319

Laboratory works based on CSE 445

 

Credits: 1.50

 

Prerequisite: CSE 319

Network architectures: cellular networks, ad hoc networks; access protocols; radio and network resource management; quality of service; mobility and location management; routing; mobile-IP; current wireless technologies for personal, local and satellite networks, Overview of wireless communications, Cellular wireless networks, 2G, 2.5G, 3G and 4G cellular networks, Wireless local area networks (Wi-Fi), Wireless wire line interworking, Mobile IP, Mobile ad hoc networks (MANET), Wireless personal area networks (Bluetooth, UWB, ZigBee), Wireless sensor networks, Mobility management and radio resource management, Traffic models and mobility models, Multiple access techniques, Simulations of wireless networks (OPNET, NS2).

 

Credits: 3.00

 

Prerequisite: CSE 209

Credits: 1.50

 

Prerequisite: CSE 209

Networking overview; IP addressing basics; active directory; network planning; DHCP, DNS, FTP, HTTP etc.; implementing and managing WINS; securing network traffic; remote access; Internet authentication service; routing; naming; configuring file services; configuring and monitoring print services: maintaining and updating Windows; maintaining network health with network access protection and IPsec; securing data transmissions and authentication; maintaining file and print services; routine system maintenance; Internet connectivity, system optimization, troubleshooting, and scripting languages; Internet connectivity, system optimization, troubleshooting, and scripting languages.

 

Credits: 3.00

 

Prerequisite: CSE 319

 

 

Laboratory works based on CSE 449.

 

Credits: 1.50

 

Prerequisite: CSE 319

Foundations of software project management; organization structure and staffing; motivation, authority and influence; conflict management; proposal preparation; a large engineering software system management; client management; managing software project teams; project planning and scheduling; risk management; configuration management; pricing estimation and cost control; quality assurance and accreditation; factors affecting software quality; software quality assurance plans; business context and legal issues for software projects; software measurement: testing, upgrading and maintenance; network systems; and international project management.

 

Credits: 3.00

 

Prerequisite: CSE 327

Testing in the lifecycle; testing objectives; the fundamental test process; testing and risk; test policy, test strategy, test plans; entry and exit criteria; estimating techniques; test monitoring; incident management process; fundamentals of test analysis; test environment requirements; selection of techniques; coverage measures; test cases; levels of testing - unit testing, integration testing, system testing, acceptance testing, alpha testing and beta testing, static vs. dynamic testing, manual vs. automatic testing, testers workbench; different types of testing

 

  • installation testing, usability testing, regression testing, performance testing, load testing, stress testing, security testing; static and dynamic testing; black box and white box testing; structural testing; reliability assessment; reliability assessment; testing real time system; testing documentation; test reports; test estimation; test monitoring and control; test technique, test type and test coverage selection; test tool selection and implementation; foundations of software project management; organization structure and staffing; motivation, authority and influence; conflict management; proposal preparation; a large engineering software system management; client management; managing software project teams; project planning and scheduling; risk management; configuration management; pricing estimation and cost control; quality assurance and accreditation; factors affecting software quality; software quality assurance plans; business context and legal issues for software projects; software measurement: testing, upgrading and maintenance; network systems; and international project management.

 

Credits: 3.00

 

Prerequisite: CSE 327

Introduction to software security; software security risk management; attacking inputs; software exploitation attacks; misuse of privilege attacks; backdoor attacks; threat modeling; sessions and multi-stage applications; access control; authentication and identity; password schemes; information flow; attacking c code; robust c programming; information disclosure; data aggregation; aggregation and privacy in social networks; protocols and analysis; usability; encryption; digital rights management; network security; dos attacks; open source; software security auditing; buffer overflows and access control; access control and race conditions; trust; application security; introduction to secure java software; java security components ; security providers and keys ; messages and signatures; low-level software security for different high-level languages; a selection of low-level attacks on C and C++ software; software flaws and malware; operating systems and security; authentication and authorization; simple authentication protocols; authentication factors; user name/password authentication; mutual authentication.

 

Credits: 3.00

 

Prerequisite: CSE 327

Basic design and implementation of websites, Discussion of different navigation and organizational strategies, Client-side technologies including HTML5, CSS, JavaScript, JSON, and JQuery, Server-side technologies emphasizing implementations in PHP, Back-end data management, Interfacing Internet to a database. Querying a database using Cold Fusion, Security issues, Emerging technologies

Credits: 3.00

 

Prerequisite: CSE 207

Laboratory works based on CSE 457.

 

Credits: 1.50

 

Prerequisite: CSE 207

An overview of visual thinking, visual languages and visual programming, Visualization of software design, Visual coaching systems, Visual interface design systems, Visual database design, Advances in visual languages.

 

Credits: 3.00

 

Prerequisite: CSE 207

Laboratory works based on CSE 459.

 

Credits: 1.50

 

Prerequisite: CSE 207

Requirements Engineering in the engineering life cycle; eliciting requirements; modeling and analysis; communicating the requirements; agreeing requirements; evolving requirements; method engineering; problem frames; viewpoints-Oriented requirements engineering; procedure and processes; project and risk management; responsibilities and roles; identification of requirements; specification of requirements; requirements analysis; tracking of requirements; requirements documentation; documentation of requirements using natural language; model-based documentation of requirements; checking and reconciling requirements; requirements Management; requirements engineering in agile methods; fluctuating and conflicting requirements; communication and coordination breakdown; tools; introduction to design process; design process and concepts; inception phase; elaboration phase; construction phase; transition phase; software architecture: control hierarchy; structural partitioning; information hiding: Effective modular design - functional independence; cohesion, coupling; design specification outline; architectural design; real time systems; SCM; layered behavioral model of software development process; relations between RE and software design.

 

Credits: 3.00

 

Prerequisite: CSE 327

Laboratory works based on CSE 461.

 

Credits: 1.50

 

Prerequisite: CSE 327

Introduction to OO Software, Approaches to OO Design, GOF design pattern and their classification. Designing with CRC cards, CRC modeling examples, finding the classes from CRC cards,  introduction to C++; template and factory method design pattern structure, template and factory method in C++, Iterator design pattern: polymorphic iterator, structure, implementation; C++ standard library: string, IO, container such as vector, list, queue, stack, deque, priority queue, set, multiset, map, multi map. Class diagram in UML: Class, Class notation, attributes, operations, relationship such as association, generalization, dependency, realization, constraints. C++ pointer and references, C++ storage allocation, C++ operator, C++ function pointer, C++ header file definition rules, header file rules, Class declaration, const and inline methods, constructor, overloaded constructor and default arguments, copy constructor, assignment operator, destructor, operator overloading, new, delete. Inheritance, polymorphism, dynamic binding and virtual function, Abstract class and Interfaces, Design pattern: Decorator, Composite, Bridge, Observer structure and implementation. Iteration with composite. Structure and implementation of multiple inheritance, Adaptor, Abstract factory and Visitor Design pattern. Templates in C++, Design By Contract and Assertions. Template and traits. Structure and implementation of Singleton, Command, Interpreter, Mediator, State, Strategy, and Chain of Responsibility design pattern. Rest GOF design pattern such as Behavioral (Memento), Structural (Flyweight), Proxy, Builder, Prototype. Exceptions in C++, Structured Exception handling, Error handling, exception hierarchy, catching exception, Exception handling strategies etc. Issues for design of a Standard library, STL container design and problems, Standard library organization, generic algorithms, iterator traits template, allocators. UML to code. Name visibility and namespace in C++, Generic programming in C++, Object and threads, Synchronization Wrappers. Future research direction.    

 

Credits: 3.00

 

Prerequisite: CSE 327

Based on C++/JAVA student will be asked to develop a large project. To design such project student should first use CRC for determining the classes. After discussion and finalize student should develop UML class diagram for design. After finalize the design student will be asked to implement step by steps. Teacher have the flexibility to redesign the lab in other ways.

 

Credits: 1.50

 

Prerequisite: CSE 327

Introduction to machine learning, unsupervised learning algorithms; Attribute based and Relational supervised learning algorithms; neural network based learning algorithms; Genetic algorithm and genetic programming; Reinforcement learning algorithms; Computational learning theory.

 

Credits: 3.00

 

Prerequisite: CSE 351

Introduction to pattern recognition, sensing, preprocessing, segmentation and grouping, feature extraction, classification, and post processing, Bayesian decision theory: Bayesian Classifiers, Discriminant functions, Decision surfaces, Normal density and discriminant functions, discrete features, Parameter estimation methods: Maximum-Likelihood estimation, Gaussian mixture models, Expectation-maximization method, Bayesian estimation, Hidden Markov models for sequential pattern classification: Discrete hidden Markov models, Continuous density hidden Markov models, Viterbi algorithm, Baum-Welch algorithm, Dimension reduction methods: Principal component, Fisher discriminant analysis, Non-parametric techniques for density estimation: Parzen-window method, K-Nearest Neighbor method , Linear/non-linear discriminant function based classifiers: Multi-layer Perceptron’s, Support vector machines, Non-metric methods for pattern classification: Non-numeric data or nominal data, Decision trees, syntactic Pattern recognition, Unsupervised learning and clustering: Criterion functions for clustering, Algorithms for clustering: K-means, Hierarchical and other methods, Cluster validation.

 

Credits: 3.00

 

Prerequisite: CSE 351

Introduction to data mining; Data mining Vs Query tools; Knowledge Discovery Process; Data Preprocessing; Data Warehousing; Data Cube and OLAP technology;  Mining Frequent Patterns, Associations, and Correlations: Frequent Item set Mining Methods;  Classification:   Decision Tree Induction, Bayes Classification Methods, Rule-Based Classification, Bayesian Belief Networks, Support Vector Machines, Model Evaluation and Selection, Estimating Classifier Accuracy, Combining Multiple Models; Cluster Analysis: Partitioning Methods, Hierarchical Methods; Outlier Detection: Outlier Detection Methods;  Data Mining Tools and Applications, Mining Real Data.

 

Credits: 3.00

 

Prerequisite: CSE 351

Laboratory works based on CSE 463.

 

Credits: 1.50

 

Prerequisite: CSE 351

Overview of artificial neural networks, applications of neural network; Neuro-Models and neural network architecture, activation function, classification, Feed forward and Recurrent topologies; Multilayer Perceptron’s (MLP), Backpropagation Networks: Architecture of a Backpropagation Network, Backpropagation learning, Parameters in BPN, Adaptive Backpropagation, Genetic algorithm based backpropagation; Radial Basis Function networks: Topology, learning algorithm; Overview of set theory, fuzzy systems, Crisp sets to fuzzy sets; Operations on fuzzy sets, fuzzy arithmetic, fuzzy relations, applications of fuzzy system; Hybrid Systems: Integration of neural networks, fuzzy logic, and genetic algorithm.

 

Credits: 3.00

 

Prerequisite: CSE 351

Laboratory works based on CSE 477.

 

Credits: 1.50

 

Prerequisite: CSE 351

Introduction to basic VLSI design; VLSI design methodology; Introduction to CMOS, inverters and basic gates; Brief overview of CMOS fabrication process: layout and design rules; Basic CMOS circuit characteristics and performance estimation; Combinational Circuit Design, Sequential Circuit Design, Static Complementary Gate Design, Layout design, Buffer circuit design; Complex CMOS gates, CMOS building blocks: adder, multiplier; data path and memory structures; Introduction to Gas technology, Ultra-fast VLSI circuits and systems, Power and Delay characteristics, VLSI testing.

 

Hardware modeling: Introduction to HDL, hardware modeling languages, Structural Specification of Hardware, logic networks, state diagrams, data flow and sequencing graphs, behavioral optimization.

 

Architectural Synthesis: circuit specification, strategies for architectural optimization, data-path synthesis, control unit synthesis and synthesis of pipelined circuits; ASIC design using FPGA and PLDs; Testing techniques and algorithm; Various methodologies for testing; Utilities for High Level Descriptions, Dataflow Descriptions in HDL, HDL Systems, CPU Modeling and Design; Interface Modeling and Design.

 

Credits: 3.00

 

Prerequisite: CSE-307, 308–Interfacing & Peripheral and Lab

Laboratory works based on CSE 479.

 

Credits: 1.50

 

Prerequisite: CSE-307, 308 – Interfacing & Peripheral and Lab

Introduction to Decision Support System (DSS) and Business Intelligence, An overview on DSS Concepts, Methodologies, and Technologies; Theories of decision making, modeling and analysis, deterministic and probabilistic models, Use of decision tools for developing decision models; Collaboration, Communication, Group Support Systems, and Knowledge Management; DSS Applications, Decision Making in Intelligent Systems: Artificial Intelligence and Expert Systems, Advanced Intelligent Systems, Intelligent Systems over the Internet; Implementing Decision Support System.

Credits: 3.00

 

Prerequisite: None

Laboratory works based on CSE 481

 

Credits: 1.50

 

Prerequisite: None

General aspect of knowledge representation, Knowledge and Expert Systems, Production System (PS), Semantic network and frame illustrative system, Object-oriented Paradigm, Logic Programming, Incomplete Knowledge and Non-Monotonic Logic, Meta-reasoning and Meta-knowledge, Uncertain Reasoning, Case-based reasoning, Models of Rationality, Pragmatic Issues in Knowledge Acquisition, Machine learning for Knowledge discovering: Concept learning, decision tree learning, clustering and instance based leaning, Rule induction and inductive learning, Bayesian network and causality, Neural network, Genetic algorithm, Reinforcement learning, Analytic learning.

 

Credits: 3.00

 

Prerequisite: None

Laboratory works based on CSE 483.

 

Credits: 1.50

 

Prerequisite: None

Introduction to parallel processing; Parallel models; Performance of Parallel Algorithms; Open MP; Open MP & PRAM Model of Computation; Models of Parallel Computation; Complexity; Parallel Program Design; Shared Memory & Message Passing; MPI ; Algorithmic Techniques; work-time presentation framework, Basic techniques: Pointer jumping, Balanced trees, Divide and Conquer, Pipelining, Partitioning and symmetry breaking, List ranking, Euler-Tour technique, Tree contraction; Parallel searching, merging, sorting and selection; Connected components; Minimum spanning trees; Biconnected Components; Directed graphs; Lower Bounds Lock Free Synchronization; Load Stealing; Lock Free Synchronization.

 

Credits: 3.00

 

Prerequisite: CSE 319

Fundamental of Robotics: Introduction to Robot, Robot anatomy, Robot parts and their functions, Classification of robot and robotic systems, Laws of robotic, Co-ordinate systems, Drives and control systems, Power transmission systems, Planning for navigation, Different applications; Robot actuator effectors: Types of end effectors, Types of grippers, Interface, Sensors, Touch and Tactile sensors; Kinematics of Robot: Introduction to Kinematics, Open and closed kinematic mechanisms, Matrix representation, Homogeneous transformation, forward and inverse kinematics. Direct vs inverse kinematic task, Programming, Basics of Trajectory planning; Industrial applications: Quality control, Mapping and robot guidance, Motion estimation, Passive navigation and structure from motion, Autonomous systems.

 

Computer vision: Introduction to Computer Vision, The human eye and the camera, Vision as an information processing task, Homogeneous transformations, A geometrical framework for vision, 2D and 3D images interpretation, Industrial applications; Digital Image: Basics of image processing, Image acquisition, Segmentation, Binary and grey morphology operations, Thresholding, Filtering, Edge and corner detection, Features detection, Contours, Tracking edges and corners, Object detection and tracking, Image data compression, Real time Image Processing; Lighting in Machine Vision: Light used in machine vision, Basic rules and laws

 

of light distribution, Filters, Light sources, Light techniques, Choice of illumination; Camera and Optical System: Camera technology, Analog and digital camera, Camera model, CCD and CMOS Technology, Sensor size, Intrinsic and extrinsic camera parameters, Camera calibration, Systems of lenses, the thin lens, Beam converging and beam diverging lenses, General imaging equation, Practical aspects.

 

Credits: 3.00

 

Prerequisite: CSE 319

Introduction of Fault Tolerant Systems and architectures; Measures of fault-tolerance; Preliminary of Digital Logic Circuit; Hardware Fault Tolerance; Fault-Tolerant Software ; Automatic test pattern generator; Fault modeling; Automatic test equipment, faults in memory, memory test pattern and reliability; Performance monitoring, self-checking circuits, burst error correction and triple modular redundancy; Network fault tolerance; Error Recovery, Fault Treatment, Redundancy Management, Issues in distributed systems; Reliability evaluation techniques.

 

Credits: 3.00

 

Prerequisite: CSE 319

Memory Interface; Basic I/O interface; 8086 interrupts and interrupts applications; Digital interfacing; analog interfacing; DMA controller; interrupt controller; Communication interface; Interfacing with floppy and hard-disk controller; Mass storage systems; Barcode reader; MIDI interface; BUS interfaces: ISA, PCI, AGP, PS/2 and USB interfaces; Interfacing with stepper motors, MOSFET, SCR and Triac; Application of Opto-coupler and relays; Microprocessor in Scientific Instruments and other applications – Display, Protective Relays, Measurements of Electrical quantities, Temperature monitoring system, water level indicator, motor speed controller, Traffic light controller, etc.; Microprocessor based interface design.

 

Role of computer peripheral; Peripheral and computer connections; Display and printing devices; Interfacing I/O devices – floppy disk, hard disk, tape, CD-ROM & other optical memory, keyboard, mouse, monitor, plotter, scanner, etc.; Disk and Tape storage; Analogue signal input-output; Data communication.

 

Credits: 3.00

 

Prerequisite: CSE 217, 218–Microprocessor and Lab

Laboratory works based on CSE 491

 

Credits: 1.50

 

Prerequisite: CSE 217, 218–Microprocessor and Lab

Introduction to Digital System, Hardware description languages, Designing I/O system; I/O devices;  Designing  Microprocessor  based  system  with  interfacing  chips;  Programmable peripheral  interface  (interface  to  A/D  and  D/A  converter);  keyboard/display  interface; Programmable timer; Programmable interrupt controller, DMA controller; Design using MSI and LSI components; Design of memory subsystem using SRAM and DRAM; Design of various components of computer: ALU, memory and control unit hardwired  and micro programmer microprocessor based    designs.

Computer   BUS standards. Design  special purpose controllers. System modeling, synthesis, simulation and testing of digital circuits; design integration to achieve specific System on Chip (SOC) goals including architecture, planning and integration, and testing; Use of soft core and IP modules to meet specific architecture and design goals.

 

Credits: 3.00

 

Prerequisite: CSE 411

VHDL models of combinational and sequential circuits, synthesizing these models to programmable logic devices, simulating the design, test-benches, system design and modeling, integration of IP and high level SOC design methodologies.

 

Credits: 1.50

 

Prerequisite: CSE 411

Students have to complete a project/thesis work which will be assigned by the department based on their previous academic records. 2/3 students may work in a group that might be approved by the chairman of the department.

 

Students have to prepare a project proposal in consulting with the supervisor and that will be presented to the project committee. Finally students have to face the project predefence and project defence viva.

 

Credits: 4.00

 

Prerequisite: All core courses of first semester to nine semester (1** to 3**).

BUBT

Bangladesh University of Business and Technology

Rupnagar R/A, Mirpur-2, Dhaka-1216, Bangladesh
Phone: 01967169189, 01845734337, 01680050630,
01741129235, 01554882075
Email: info@bubt.edu.bd