UNDERGRADUATE COURSE CALENDARB.Sc. (Hons) in Computer Science and Engineering Session: 2006-07 NATIONAL UNIVERSITY, GAZIPUR, BANGLADESH. CHAPTER 1 GENERAL INFORMATION, RULES AND REGULATIONS FOR UNDERGRADUATE PROGRAMME 1.1 Introduction National University pursues a policy of continuous updating and improving the new four-year course curricula having 8(eight) semesters carrying total credits 145 for bachelor’s degree in Computer Science and Engineering (B.Sc.Engg.). This is to take into account the modern developments in different disciplines of study, especially in the field of Computer Science and Engineering, where things move too fast. Detailed syllabuses for all the courses have been framed keeping in view the objectives of National University in this regard. Computer Science and Engineering being a major discipline has to be considered in a special way, as it has got a professional backing and a large employer group needing the services of its graduates. Admission Students will be admitted in the first semester, first year of Computer Science and Engineering (CSE) in affiliated colleges / institutes as per rules of the National University. Students passing HSC in the current year or one year ago with minimum GPA 2.0 in SSC and HSC (Science/Diploma in Engineering/Equivalent) examination having at least “C” grade in Physics and Mathematics can apply. Students passing General Certificate Examination (GCE) in at least 3 subjects in “O” level and 2 in “A” level having at least “C” grade in Physics and Mathematics can apply. One year break of study is acceptable. Duration of Each Semester The duration of each semester will be 18 weeks whose breakdown is as follows: Classes Recess before Semester Final Examination Semester Final Examination (approximately) 14 Weeks 2 Weeks 2 Weeks 1.2 1.3 Total 18 weeks 2 1.4 Course Designation System Each course is designated by a three letter code identifying the department offering it, followed by a three-digit number having the following interpretation: • The first digit indicates Year. • The second digit indicates Semester. • The last digit indicates courses number. Assignment of Credits The assignment of credits to a theoretical course follows a different rule from that of a practical course. • Theoretical Courses: One lecture of 1-Hour duration per week per semester is equivalent to 1.0 credit. • Practical Courses: One lab session of 3-Hour duration per week per semester is equivalent to 1.5 credit. 1 credit is equivalent to two hours of lab work per semester per week. • The project must be initiated in 7th semester. 1.5 1.6 Types of Courses In CSE, there are two types of courses, namely i) core courses, which form the nucleus of the bachelor's degree program and General Education (GED) courses, the study of which will be useful for the students to grow as a good citizen with social values and norms. A student has to complete the entire designated courses for the 0award of degree. The Grading System The total performance of a student in a given course is based on a scheme of continuous assessment. For theory courses this continuous assessment is made through a set of quizzes, class evaluation, class participation, homework assignment and a semester final examination. The assessment in laboratory / practical courses is made through observation of the student at work during the class, viva-voce during laboratory hours and quizzes. Each course has a certain number of credits, which describes its corresponding weights. A letter grade with a specified number of grade points is awarded to each course for which a student is registered. A student's performance is measured both by the number of credits completed satisfactorily and by the weighted average of the grade point earned. A minimum grade point average 1.7 3 (GPA) is essential for satisfactory progress. A minimum number of earned credits also have to be acquired in order to qualify for the degree. Letter grades and corresponding grade points will be awarded in accordance with the provisions shown below: Letter Grade A+ A A− B+ B B− C+ C D F* Grade Point 4.00 3.75 3.50 3.25 3.00 2.75 2.50 2.25 2.00 0.00 Numerical Grade 80% and above 75% to less than 80% 70% to less than 75% 65% to less than 70% 60% to less than 65% 55% to less than 60% 50% to less than 55% 45% to less than 50% 40% to less than 45% less than 40% * Subject in which the student gets F grades shall not be counted towards credit hours requirements and for the calculation of Grade Point Average (GPA). 1.8 Examination Rules There will be at least two in-course examinations to be conducted by the college/institutes for each course and marks along with the grade be submitted to the Examination Controller of NU. Semester final examination will be conducted by the National University on six months basis for each semester. Semester final examination of each theoretical course will be held for 3 hours and there will have 6 questions in which 4 questions must be answered. Each question carrying 20 marks should contain two or more parts (e.g 1.(a), 1(b),1(c), …).Two examiners will evaluate the semester final examination scripts separately. If the variation of marks of two examiners is 20% or more, the third examiner will be appointed to reexamine the scripts. The marks will be finalized by averaging of minimum variation of two examiners. Distribution of Marks for Theoretical Courses Twenty percent (20%) of marks of all theoretical courses shall be allotted to two in-course examinations. The answer scripts of in-course examinations are sent to the Controller of Examination of National University if required. The rest of the marks (80%) for each theoretical course will be allotted to the Semester Final Examination, which will be conducted centrally by the National University. There are internal and external examiners for each course in the 4 1.9 Semester Final Examination of three hours duration. The project evaluation can be conducted by one.10 10%+10% = 20% 80% 100% Distribution of Marks for Practical Courses The practical semester final examinations have to be conducted by internal and external examiners. Distribution of marks for a given theoretical course is as follows: In-course examinations Semester Final Examination (3-Hour Duration) Total Marks 1. or more centers.11 Evaluation of Project Work The evaluation of the project work. for grading will be as follows 1. Practical Final Examination that is conducted centrally by the National University will be held on 60 marks for each course. At least two members for the panel of examines must be present for project defense and evaluation. Project Report 60% of marks A panel of examines prepared by exam control appointed by NU. In-course examination (Practical) Semester Final Examination (3 hours) Total 40% 60% 100% Distribution of 60% Practical Marks: Electronics/ Hardware/ Communication/ Equivalent others lab Design Circuit Implementation Result Experiment Related Viva Total (60%) 15% 20% 15% 10% Programming/ Software/ Equivalent others lab Algorithm Coding Result Experiment Related Viva Total (60%) 15% 20% 15% 10% 1. Project Defense 40% of marks 2. will conduct the project defense and also examine the project report. selected by authority of NU. Marks distribution of each practical course is stated below. 5 . Cn and his/her grade points in these courses are G1.625 9. TC2.75 3. Ci 2..00 4. C2.. . if a student passes / completes n courses in a semester having credits of C1.00 3.. .125/19.00 1. .125 GPA = 72.00 3...50 4.13. G2.13 Numerical Examples of Computing GPA and CGPA 1. if a student passes / completes n semesters having total credits of TC1. Gi 4.50 Ci*Gi 8. GPA2.50 3.75 3.00 4..1 Example for Computing GPA Suppose a student has completed eight courses in a term and obtained the following grades: Course CSE 101 CSE 102 CSE 103 CSE 104 CSE 105 CSE 106 CSE 107 CSE 108 Total Credits.000 5.50 3. For example..7 6 .00 1..12 Calculation of GPA Grade Point Average (GPA) is the weighted average of the grade points obtained in all the courses passed / completed by a student.00 1.00 3.1..000 5.50 19...50 = 3. For example..00 3.000 12.250 72.50 Grade A+ A+ A B AA+ A A- Grade Points.. GPAn respectively then ∑ TC CGPA = i =1 n i =1 n i * GPA i i ∑ TC 1.. Gn respectively then ∑C GPA = i =1 n i =1 n i * Gi i ∑C The Cumulative Grade Point Average (CGPA) is the weighted average of the GPA obtained in all the semesters passed / completed by a student..250 12..000 5.… TCn and his/her GPA in these semesters are GPA1.000 15. 000 317.150 80.50 21.90 1. However.Sc. Engg.865 CGPA = 317.13.25 20.50 20.865/81.) will be decided National University.96 4.00 GPAi*TCi 72.25 81.50 GPA Earned.5 credit hours for engineering must be earned to be eligible for the graduation. The minimum GPA requirement for the Bachelor Degree Award in engineering is 2. GPAi 3. TC1 19.150 81.70 3. at least 145.14 Minimum Earned Credit and GPA Requirement for the Degree Award Minimum credit hour requirement for the award of the bachelor's degree in engineering (B. 7 .20.93 3.1.2 Example for Computing CGPA Suppose a student has completed four semesters and obtained the following GPA : PART 1 1 2 2 Total Semester I II III IV Credit Hours Earned.565 84.50 = 3. CHAPTER 2 COURSE REQUIRMENTS FOR UNDERGRADUATE COMPUTER SCIENCE AND ENFINEERING STUDENTS Undergraduate students of Department of Computer Science and Engineering have to follow a particular course schedule. which is given in this chapter according to semester –wise distribution of courses: 8 . 5 3 3 3 16.5 3 1.5 3 3 3 18 6 9 .1ST YEAR 1ST SEMESTER (1st SEMESTER) Course name CSE-111 CSE-112 CSE-113 CSE-114 CSE-115 GED-116 Course title Introduction to Computer System Programming Language Programming Language Practical Physics (Electricity and Magnetism) Differential Calculus and Coordinate Geometry English Total Hours/Week Theory Practical 3 3 3 3 3 15 3 3 Credit 3 3 1.5 1ST YEAR 2nd SEMESTER (2nd SEMESTER) Course name CSE-121 CSE-122 CSE-123 CSE-124 CSE-125 CSE-126 CSE-127 Course title Data Structure Data Structure Practical Introduction to Electrical Engineering Introduction to Electrical Engineering Practical Integral Calculus and Differential Equation Statistics and Probability Discrete Mathematics Total Hours/Week Theory Practical 3 3 3 3 3 3 3 15 - Credit 3 1. 5 3 3 1.5 3 22.2nd YEAR 1ST SEMESTER (3rd SEMESTER) Course Name CSE-211 CSE-212 CSE-213 CSE-214 CSE-215 CSE-216 CSE-217 CSE-218 GED-219 Course title Object Oriented Programming OO Programming Language Practical Operating System Digital Logic Design Digital Logic Design Practical Mathematics for CSE Electronic Devices and Circuits Electronic Devices and Circuits Practical Basic Accounting Total Hours/Week Theory Practical 3 3 3 3 3 3 3 18 9 3 3 Credit 3 1.5 3 1.5 3 3 3 18.5 2nd YEAR 2nd SEMESTER (4th SEMESTER) Course name CSE-221 CSE-222 CSE-223 CSE-224 CSE-225 CSE-226 GED-227 Course title Algorithm Design Algorithm Design Practical Database Management System Database Management System Practical Computer Organization and Architecture Data Communications Economics Total Hours/Week Theory Practical 3 3 3 3 3 3 15 3 6 Credit 3 1.5 3 3 1.0 10 . 3rd YEAR 1ST SEMESTER (5th SEMESTER) Course name CSE-311 CSE-312 CSE-313 CSE-314 GED-315 GED-316 Course title Theory of Computation Microprocessor and Assembly Language Assembly Language Practical Engineering Mathematics Sociology Technical Writing & Communications Total Hours/Week Theory Practical 3 3 3 3 3 15 3 3 Credit 3 3 1.5 11 .5 3rd YEAR 2nd SEMESTER (6th SEMESTER) Course name CSE-321 CSE-322 CSE-323 CSE-324 CSE-325 CSE-326 CSE-327 CSE-328 Hours/Week Theory Practical 3 3 3 3 3 3 15 3 3 9 Course title Software Engineering Software Engineering Practical Numerical Analysis Computer Graphics & Multimedia Computer Graphics and Multimedia Practical Compiler Design Compiler Design Practical System Analysis and Design Total Credit 3 1.5 3 3 3 16.5 3 1.5 3 3 1.5 3 19. 4th YEAR 1ST SEMESTER (7th SEMESTER) Course name CSE-411 CSE-412 CSE-413 CSE-414 CSE-415 CSE-416 CSE-417 Course title Computer Networking Computer Networking Practical Artificial Intelligence and Neural Network Parallel and Distributed Processing Peripheral and Interfacing Peripheral and Interfacing Practical Digital Signal Processing Total Hours/Week Theory Practical 3 3 3 3 2 3 15 3 Credit 3 1.5 5 4th YEAR 2nd SEMESTER (8th SEMESTER) Course name CSE-421 CSE-422 CSE-423 CSE-42X CSE-499 Course title Web Engineering Web Engineering Practical Computer and Network Security Elective Course *Project Total Hours/Week Theory Practical 3 3 3 3 9 Credit 3 1. CSE-42X: Optional Courses (Any one ) CSE 424 Image Processing CSE 425 VLSI Design CSE 426 Simulation and Modeling CSE 427 E-Commerce 12 .5 3 3 6 16.5 3 3 3 1 3 17.5 12 15 *Project work must be started in 7th semester. 5 145 5 5 6 5 5 5 5 3 39 1 2 3 2 1 3 2 2 16 13 .5 2.5 4.5 19.5 17.5 3 4.5 3 1.5 18 22.5 18 16.5 28 Credit 1 Year 1 Semester 1st Year 2nd Semester 2nd Year 1st Semester 2nd Year nd 2 Semester 3rd Year 1st Semester rd 3 Year 2nd Semester 4th Year 1st Semester th 4 Year 2nd Semester Total 15 15 18 15 15 15 15 9 117 16.5 16.5 7.Summary: Number of Theory Courses Number of Practical Courses Year/ Semester st st Hours/Week Theory Practical 3 6 9 6 3 9 5 15 56 Credit Theory 15 15 18 15 15 15 15 9 117 Practical 1. “Let US C” 3. Operator & Expression. types of computer network. Compilers. Flowcharts. Arrays. Basic organization of computer. Balagurusamy. Speech Input.00 Cr. Structure and union. Yamath Kanathkar. Pointers. Mark Sense Reader. Application packages. Decision making and looping. High Level Language Features. types of operating system : batch. multi tasking. “Pointer in C“ 14 . Systems software: Operating system. Operating System: Basic concept. Editors. -Sarah E. Hutchinsonb and Stacey C. Printer. Pen Input Method. 3. Modern Communication Systems: Computer Networks. variables and data types. 3. A Modern Overview of Computers. International Network Standards. Graphics output devices. Algorithm build-up. Digital Camera. Barcodes.Sawyer 4. -Ray Bradley 2. Light pen. Handling of character strings. Assemblers. Computers and Information Systems(5th Edition). File management. network topology . Secondary storage device and techniques. Overview of C. Sinha 3. E. Hardware & Software: Hardware. Output Device Techniques: Monitor. System Utilities. “Programming in ANSI C” 2. Yamath Kanathkar. multiprocessing . Constants. Touch Screen. Simplest & Expanded Computer System. Reference Books: 1. Computer Fundamentals (4th Edition).00 Cr. Mini and Micro computer. Lutfar Rahman and M. Programming Concept: Problem analysis. Understanding Computer Science for Advance Level(4th Edition). Decision making and branching. Function and Procedure. Introduction: Data & Information. Types of software. Different types of micro computer. Types of computer: Main frame. Hexadecimal and Octal numbers. Mouse. Computer generations. Input Device Techniques: Keyboard. Magnetic Ink character recognition. CSE-112 Programming Language 3 hours in a week. Storage Techniques: Primary Storage device and techniques.M. Alamgir Hossain. Types of computer buses. History. Some Modern Computing Ideas. classification of hardware. Computer Fundamental . Joysticks. Number systems: Binary.CHAPTER-3 DETAIL OUTLINE OF UNDERGRADUATE COURSES OFFERED BY THE DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING 1ST YEAR 1ST SEMESTER CSE-111 Introduction to Computer System 3 hours in a week. Graphics Tablet. User-defined functions. Managing Input & Output Operators.Scanner. Reference Books: 1. -Pradeep K. OCR System . Interpreters. time sharing & real time operating system. Rolle’s Theorem. Handling of character strings. 3. Measurements of Voltage. David Halliday and Robert Resin. leibniz’s theorem. Reference Books: 1. Structure and union. and potential difference. variables and data types. Introductory Circuit Analysis 3. Simple circuits and Electrical Measurements: Current and Ohm’s law. successive differentiation of various types of functions. Electric potential.5 Cr.4. Potential due to a point charge. Operator & Expression. Inductance. Point charge in an electric field. Electric field & Gauss’s Law: Simple phenomena in electrostatics. Moving coil galvanometer. Voltmeter. Energy stored in an electric field Electric current. Boylested. Ammeter. Equipotential surfaces. Electric vectors. A Text book of Electrical Technology CSE-115 Differential Calculus and Co-Ordinate Geometry 3 hours in a week. Pointers. Whetstone bridge. 3. Energy in magnetic field. Magnetic field for solenoid. Coulomb’s law. Mean value Theorem in finite and infinite forms. Gauss’s law and some applications. continuity and differentiability. Magnetic force on current.F. Electrostatic induction and charge density. Para-magnetism and Ferro-magnetism. Electric flux. Electric field & field strength. L. Managing Input & Output Operators. Potential gradient. Capacitance and its calculation. Arrays. Decision making and branching. CSE-114 Physics (Electricity and magnetism) 3 hours in a week. concept of self and mutual inductance. Cauchys form of remainders. Fleming’s left hand rule. File management. 1. Rise of current and decay of current in inductive circuit. dipole in an electric field. B. Hysteresis and eddy current losses. The potentiometer. Lagrange’s form of remainders. Theraja. Wattmeter & Energy meter. Coulomb’s law for magnets & Gauss’s theorem of magnetism. Resistance. Physics Part-II 2. Laboratory works based on CSE-112 Overview of C. Multimeter. Power and Energy. Magnetic field and field strength. Maxwell’s screw rule. Capacitance. Magnetic Field & force on Current: Coulomb’s law. Differential calculus: Limits.00 Cr. Herbert Schildt. Directions of current and field. Dia-magnetism. Simple RC and RL circuits.00 Cr. E. The coefficient of magnetic coupling. Inductance in series and parallel. Constants.M. Parallel plate capacitor with dielectric. Current. Magnetomotive force and field intensity. “Turbo C” CSE-113 Programming Language Practical 3 hours in a week. Magnetic properties of matter: Poles and dipoles. Expansion 15 . Magnetic field near long wire. Charge. Dielectric & Gauss’s law. Decision making and looping. Potential energy. Fleming’s right hand rule. User-defined functions. center of curvature Asymptotes. vocabulary. permission. Partial differentiation. Reference books: 1. C) adjective. Equation of conics and its reduction to standard forms. framing of which questions G. curve tracing. correction of sentences. Abu Yusuf. Md. Differential Calculus. Tangent and Normal. STRUCTURES: The sentence: A i) Normal group. Euler’s Theorem. grammatical items. READING AND COMPREHENSION: thematic structures. Differential Calculus Integral Calculus. (iii) précis. etc. circles. 4. 3. radical center. 5. e. 1. Director circles and asymptotes. Mukherjee. Points of inflexion. Anwar Hossain. 2.00 Cr. b) Adverb. Homogeneous equations of second degree. orthogonal circles. diameters. properties of radical axes. Chord in terms of its middle points. Angle between a pair of straight lines. (vi) dialogue -writing. liking ii) Moral attitudes: apology. (v) amplification. Chord of contact. etc for technical reports and theses comparing and contrasting other aspects of short reports (such as for assignments) and long dissertations (such as for projects). f) Prepositional phrase g) infinitive phrase h) participle phrase i) appositive ii) Verbal Group: a) the tenses b) the modal auxiliaries c) phrasal verbs iii) Verb Modifiers: a) Adverbials of time b) Adverbials of place c) Adverbials of manner d) adverbials of duration. cohesive and rhetorical devices.g. ellipse and hyperbola in Cartesian and polar co-ordinates.A textbook of Co-ordinate Geometry and Vector analysis Prof. Coaxial circles. précis (i) comprehension. 16 . Pole and polar parametric co-ordinates. d) Noun-adjective. Abdul Matin. N. The works should concentrated at the higher levels on technical and IT usage to include: Accuracy and conciseness in technical English structure. NOTIONS AND FUNCTIONS: i) Emotional attitudes e. 3. intention/ attitude of the writer.of functions. 2.g. (ii) paragraph. Conjugate diameters and their properties. completing sentences. agreement. (iv) essay. Evaluation indeterminate forms by L’Hospitals rule.a) determiners. radios of curvature. Subtangent and subnormal in Cartesian and polar coordinates. and limiting points. transformation of sentences. pair of tangents. Maximum and minimum values of functions of single variable. Rahman and Bhattacharja. Tangents and normals.Business Mathematics GED-116 English 3 hours in a week. system of circles. combination of sentences. regret. Equations of parabola. Dr. radical axis. designed to influence the behavior of other) iv) Intellectual attitudes. obligation. etc iii) Suasion (utterance.C Das & B. Pair of lines joining the origin to the point of intersection of two given curves. curvature. c) Headword. Differential calculus. format. disagreement. Pair of straight lines. B. Co-ordinate Geometry: Transformation of co-ordinates axes and it uses. Polish Notation. Traversing linear arrays. Searching a linked list. and Pattern Matching Algorithms. Queue Dequeue. Searching (linear. Header Nodes. 2nd Ed. LETTERS: Application---request---Enquiries---Quotations---Complaints---Tender---to Formal and Informal---Advertisements. Header and two-way lists. Heap tree. Adjacency Matrix. Linked representation of Graphs. Warshall’s Algorithm. binary). Charies P. Graphs: Sequential Representation of Graph. Introduction: Basic Terminology. Sorting. Pointer Arrays. 3. deletion. 5.g. Towers of Hanoi. Recursive definition. Reports and theses. TECHNICAL WRITING: Writing Projects. Data Structure & Programming Design. Stacks. Robers L Kruse. Priority Queues. 4. Data Structures. Path Matrix. farewell. 3. Data Structure Operations. Records and Pointers: Linear Arrays. traversing binary tree. Data Structure and Algorthm. 3. Threads . 4. etc. Record Structures. Time-Space Tradeoff. Reference book: 1. Advanced Learner Functional English. Representing Binary Trees in memory. binary search trees. 1ST YEAR 2ND SEMESTER CSE-121 Data Structure 3 hours in a week. A practical English Grammar. 17 . Traversing a linked list. Data Structure (International Edition) 2. Linked lists: Representation of Linked lists in memory. Inserting and Deleting. Control Structures. Multidimensional Arrays. (Bubble sort). Implementation of Recursive procedures. Huffman’s Algorithm. Recursion: Array Representation of Stacks. TRANSLATION: English to Bangla and Bangla to English. Algorithms: Complexity. Reference Books: Newspapers--- 1.00 Cr. Ellis Horowitz & Sartaj Sahni. String Processing: String Operations. Trees: Binary Trees. Boeckner. Mathematical Notation and function. heap sort. greeting. insertion. etc. Arrays. Chowdhury & Hossain. Queues. Quicksort. Seymour Lipschutz ( Schaum’s outline series). Oxford English for computing. Keith and Brown. 2. High School English Grammar & composition. 3. Matrices. Representation of linear array in memory.v) Socializing e. Elementary Data Organization. Thomson & Martin. Wren and Martin. word processing. Introductory Circuit and Analysis 2.H file. Binary tree implementation. merge. David Halliday and Robert Resin.L. Laboratory works based on CSE-123 Verification of ohm’s law and measurement of Resistivity of a Metallic wire. Reference Books: 1. voltage and power.m. postfix transformation using array. Wattmeter. instantaneous and r. Kirchoff’s Voltage Law. Boylested. To verify Thevenen’s theorem.00 Cr.Theraja. Voltage Divider rule.CSE-122 Data Structure Practical 3 hours in a week.s value: Current. Laboratory works based on CSE-121 Operation on array of character (Single character. Quick). insertion. preorder. post-order). insertion. Magnetic properties of matter. To study the R-L-C series Resonance circuit. Energy. Biot-Savart law. average power for various combinations of R. Physics Part-II CSE-124 Introduction to Electrical Engineering Practical 3 hours in a week. Resistances is Series. Voltage Sources in Series. Norton’s theorem. display. Ohm’s law. Voltage source in parallel. Usage of built-in string function declared in STRING. Current divider rule. Usage of call by reference variable. etc). DC and AC powers. 1. kirchoff’s current law. Power. GFCIS and Fuses.).5 Cr. Nodal analysis with current source Network theorem: Delta star conversion. Traversing techniques (In-order. L and C circuits. prefix. Infix. Binary). Operation on one-way link list (Creation. deletion. Usage of pointer variable and memory allocation. Usage of pointer in structure variables and implementation as link list. Effect of Temperature on resistance Series Circuits: Introduction. To verify Kirchhoff’s Current law and kirchhoff’s Voltage law. Circuit Breaker’s. 1. Efficiency. Sorting Algorithms (Bubble. Nodal analysis with voltage source. CSE-123 Introduction to Electrical Engineering 3 hours in a week. B. find. deletion. 3. Declaration and use of single/ multiple structure/ record type variables. Voltage regulation Parallel circuits: Introduction. Searching algorithms (Linear. Usage of address arithmetic.AText book of Electrical Technology 3. Thevenin’s theorem. Declaration and operation on stack (Push. Mesh Analysis with matrix form. Calculation of paths and nodes as well as height of a graph and tree. Voltmeter Method of analysis: Source conversion. phasor representation. Inductors and transformers. Superposition theorem. Induction and Inductance. Laws: Ampere’s law. Open and short circuits. AC and DC networks. append etc. counting. To verify Superposition theorem. 18 . Power and Energy: Conductance and conductivity. Maxwell’s loop Current method.5 Cr. substring insertion. Advanced sorting technique (Heap sort). To verify Norton’s theorem. Ohm’s Law. To study R-C circuit and to find out the time constant. Maximum power transfer theorem. Recursive function (Towers Hanoi). Pop) and queue (Dequeue). Quartiles. M. Coefficient of variation. Deciles. Dr. Basic terminology of probability.G. Probability Distribution: Binomial Distribution. Method of data collection. Indefinite Integrals as Inverse of Derivatives: Techniques of integration. 4. Elements of Statistics: Nature and scope of statistics.C Das & B. 3. Methods of statistics. Multiple correlation and regression. CSE-126 Statistics and Probability 3 hours in a week. Simple correlation.00 Cr. Arithmetic mean. Md Abdul Aziz. Mode. Nature & representation of statistical data. Mostafa. Sampling: Sampling Techniques & its role. 3. Probability function. Differential Equations: Power series solutions about singular points. Nonlinear and Inhomogeneous Differential Equations: Solutions of ordinary differential equations. Integral Calculus. Geometric mean. Solutions of partial differential equations by the method of separation of variables. Nurul Islam. An introduction to Statistics. 19 . Quartile deviation. Elements of Probability: Meaning and definition of probability. 2. Random variables. Attributes and variables. Abu Yusuf. its uses and properties. Solutions by the method of variation of parameters and indetermined coefficients. Determination of length and area of plain curve. its uses and properties. Poisson Distribution. Median. Fundamental theorem of integral calculus (for continuous functions).N Mukherjee. Correlation coefficient and regression coefficient. different types of sampling & its merits & Demerits. Business Statistics. Percentiles. Expectation of sum and products. Mean deviation. Regression and correlation: Relationship between variables. discrete and continuous variables. its uses and properties. B. Integral Calculus . Reference Books: 1. Variance. Normal Distribution. Definite integral as limit of a sum. Differential Equations. 3. Tests of Significance: Tests of means. Skew ness and kurtosis. Standard deviation. Coefficient of dispersion. Dr. Abdul Matin. Reference Books: 1. Interpretation as area. 2. Measure of dispersion: Characteristics of an ideal measure: Absolute & Relative measures. Introduction to linear.CSE-125 Integral Calculus and Differential Equation 3 hours in a week. Fitting of regression lines. Abdul Matin. M. 3. Range. Measures of location: Characteristics of an ideal measure. Harmonic mean.00 Cr. Volume and surface area of revolution. A priori and a posteriori probability. Differential Equations. Constructor and Destructor (With multiple constructor). Robert Lafore “Turbo C++” 3. Classes and objects. Exception Handling. Virtual Functions and Polymorphism. 3. permutation groups. Tokens. symmetry groups. Ordered sets and lattices. Introduction to java. Planer Graph and Trees. Nicodemi.Buckley( Waveland Press. Basic C++ input and output statements. Working with Files. Set Theory. Basic structure theory. quotient. Pointers. comparison between java and c++. Use of C++ Editors/ compilers. Relations. Operator Overloading and Type conversions. Discrete Mathematics and Its Applications. binary. Algebraic structures. Laboratory works based on CSE-211 Review of C Programming. 4th ED 2000 2. Molluzzo and F. Morphisms. O. Theories with induction. Operator overloading (Unary. Dynamic and copy constructor. Constructors and Destructors. Mathematical reasoning and program techniques. Herbert Schildt “Turbo C++.CSE-127 Discrete Mathematics 3 hours in a week. Discrete Mathematics CBS. Graph Theory.00 Cr.5 Cr. McGraw Hill.00 Cr. Functions. Algebraic Systems. Expressions and Control Structure. 1. inline function. C. Arrays of objects and within class. Public. Different types 20 . Template functions and classes. homomorphism. reprinted 1997) ISBN 0-8833-9407 2ND YEAR 1ST SEMESTER CSE-211 Object Oriented Programming 3 hours in a week. Static data members and member functions. Functions in C++. Propositional Calculus. 3. Protected members). Function Overloading Friend and virtual function. Reference Books: 1. Direct graphs and Binary Trees. Beginning with C++. Rosen. string). Classes and Objects (Built-in and user-defined) (private. E Balagurusamy “Object. K. group theory. The complete Reference” 4. cyclic groups. Boolean Algebra. J.oriented programming with C++” 2. Multi-threaded Programming. Functions (Call by Reference. Inheritance: Extending classes. Graph and trees. Herbert Schildt “ Teach Yourself C++ “ CSE-212 Object Oriented Programming Language Practical 3 hours in a week. Reference Books : 1.H. Lattices. Principles of Object-Oriented Programming. default arguments etc). Prepositional and Predicate logic. Counting and countability. 1989 3. Managing console I/O operations. cooperating Processes. Hausen. 2.Prentice Hall 3.A. File Structure. file System Mounting. Reference Book: 1. Contiguous Memory Allocation.…). Overview. real-time systems. Allocation Methods. Some problems on Numerical Analysis (Solution of Linear equation. threads. Logical vs Physical Address Space. Replacement Algorithms. desktop systems. Least-square curve fitting. Page Replacement. Silberschatz. Overlays. Partitions and Mounting Virtual File Systems. McGraw Hill 21 . File Types. clustered systems. semaphore. Mainframe. classical problems of synchronization. File processing(Create. system calls.OS Concepts.OS. File System Implementation. reference. Recovery: Consistency Checking. File Protection File System Implementation: File System Structure. Iterative method of root finding. critical regions. Directory Structure.of inheritance(with access specifiers).Donovon.). system design and implementation Processes: Process concept. Polymorphism. computing environments OS Structures: System components. Dynamic Linking and Shared Libraries. Page-Fault Frequency File Concept: File Attributes. handheld systems. multiple-processor scheduling. Dead Lock characterization. Linux Process Synchronization: Background Process Synchronization . Deadlock Avoidance. Paging. process scheduling models: ex-windows 2000. Virtual Memory: Background of Virtually Memory (VM) Demand Paging. Communication in client-server system. Segmentation with paging.Tanenbaum. virtual machines. Prentice Hall 4. Operating system Concepts. system programs. Peterson. Directory Implementation. S. scheduling criteria.critical section problem.00 Cr.algorithm evaluation. Pointers (this. OS Synchronization . Process scheduling.S. CPU-I/O bust cycle. Virtual base class. Process state. Swapping.B.Atomic transaction Deadlocks: System model. Recovery from Dead lock Memory management: Background: Address binding. Scheduling algorithms. system structure. interprocesses communication. Free-Space Management. OS services. CSE-213 Operating System 3 hours in a week. OS. P. File Access Methods. Galvin. Segmentation. Backup and Restore Log-Structure File System. Methods for handling Deadlock. Process control block. distributed systems. real-time scheduling . multiprocessor Systems. Madnick and J. preemptive scheduling. File Sharing. File Operations. Introduction: Definition OS. sixth Edition. Dynamic binding. Thrashing: Working Set Model. write and update files sequential access and random access file processing). Different Page. Development of Integrated software using multiple C++ feature. Dead Lock Detection. read. dispatcher. CPU scheduling: Basic concepts. etc. operation on processes. 3. Dynamic Loading. Process Creation. CPU scheduler. Verify the Operation of Encoder and Decoder.00 Cr. Green’s theorem. D Flip-Flop. Prepare Different Type Shift Resister and Check Its Operation. Verify the Truth Table of J-K. De Morgan’s theorems. multiplexer. 1. karnaugh map method. symmetric etc. and demultiplexer. Gauss’s theorem.). scalar and vector product of two vectors and their geometrical interpretations. 22 . Finite transform. A/D converter circuitry. Addition and subtraction of vectors. R P Jain. Laboratory works based on CSE-214 Minimize and Implementation of Boolean Functions Using Logic Gates. Theory of Matrices: Types of matrices (Creditary. triple products and multiple products. Digital Systems Principal and Application 2. Design Half Adder and Full Adder. Asynchronous and synchronous counters and their applications. De-Multiplexer. various formulae. Similarity transformations. An Engineering Approach to Digital Design 4. Determinant of a square matrix. Inverse Laplace transforms. operations and circuits. William I. T.00 Cr. surface and volume integrals. The characteristic roots and the characteristic equation of a matrix. Ronald J. 3. decoder. hermitian. Vector calculus: Differentiations and integration of vectors together with elementary applications. Verify the Operation of Multiplexer. 3. Linear equations. Verify the Truth Table of S-R. Introductory concept. race around problems. Vector Algebra: Scalars and vectors. Widmer. Stoke’s theorem. Verify the Operation of D/A and A/D Converter. Gradient. Fletcher. Tocci & Neal S. number systems and codes. encoder. Design Synchronous Counter. Digital Logic and Computer Design CSE-215 Digital Logic Design Practical 3 hours in a week. combinational logic circuits. Adjoint and inverse of a square matrix. Multiplication of vectors by scalars. interfacing with analog world: D/A converter circuitry. divergence and curl of point functions. Morris Mano. sufficient conditions for existence of Laplace transforms. Design Half Subtractor and Full Subtractor. logic gates and their truth tables. Boolean algebra. Design Ripple Counter. Fourier Analysis: Real and Complex form of Fourier series. equality of vectors. Reference Books: 1. Laplace transforms of some elementary functions. Design Johnson and Ring counter. Laplace Transform: Definition. Fourier transforms and their uses in solving boundary value problems of wave equations. Modern Digital Electronics 3. Fourier Integral. Flip flop and related devices. M. Design Asynchronous Counter. MSI logic circuits. Equivalence.CSE-214 Digital Logic Design 3 hours in a week. liner dependence and independence of vectors. CSE-216 Mathematics for CSE 3 hours in a week.50 Cr. digital arithmetic. Linear transformation. Definition of line. Practical Feedback Circuit. Khosh Mohammad. Voltage . Partial fraction. Wien – Bridge Oscillator.Laplace transforms of derivatives. 2. Electronic Device And Circuit Theory. Solutions of differential equations by Laplace transforms. Clampers. Clippers. Photodetectors Integrated Circuits: Integrated-circuit technology. Limits of Operation DC Biasing – BJTs: Operating Point. Oscillator Operation. feedback Connection Type.R. Diffusion of Impurities. Evaluation of improper integrals. Fixed Biased Circuit. Op-amp Specifications-Frequency Parameters. Diode Application: Sinusoidal Inputs: Half Wave Rectification. A. Transition and Diffusion Capacitance. Active filters Feedback and Oscillator Circuits: Feedback Concepts. Common Collector Configuration. Robert Boylestad and Louis Nashelsky. Reference Books: 1.00 Cr. Electronic Devices And Circuit 23 . DC Bias with Voltage Feedback. Full Wave Rectification. Voltage – Divider Biasing BJT Transistor Modeling: Amplification in the Ac Domain. Albert Paul Malvino. Integrated resistors. Common Emitter Configuration. Vasishtha. Entrinsic Materials-nType and p. Sixth Edition 2. 3.Type. 3. Feedback Amplifier – Phase and Frequency Consideration. The unit step function. CSE-217 Electronic Devices and Circuits 3 hours in a week. Semiconductor Diode. Basic monolithic integrated circuits. Phase-Shift Oscillator. Graphical Determination of h-parameters Operational Amplifiers: Differential and Common-Mode Operation. Abraham Bell. Common-Base Configuration. LED & GUNN diode. Diode Equivalent Circuit. Semiconductor Diodes: Semiconductor Materials. Zener Diode. Ideal Diode. Transistors for monolithic circuits. Masking and Etching. Crystal Oscillator Other semi-conductor devices: Thermistors. LED Bipolar Junction Transistor (BJT):Transistor Construction.Bias Configuration. Tunnel diode. Energy levels. Epitaxial Growth. Transistor Amplifying Action. Periodic function. Depletion Type MOSFET. Monolithic diodes. Practical Op-amp Circuit. Self .Divider Bias. Vector analysis. Bias Stabilization Field Effect Transistor (FET): Construction And Characteristics of JEFT Transfer Characteristics. Electronic And Circuits 3. Op-amp Unit Specifications Op-amp Applications: Voltage Summing. The Hybrid Equivalent Model. Transistor Operation. Enhancement Type MOSFET FET Biasing: Fixed – Biased Configuration. Md. Reference Books: 1. Op-amp Specifications-DC Offset Parameters. Some special theorems on Laplace transforms. Mathematical Methods. Miscellaneous Bias Configuration. integrated capacitors and inductors. Op-amp Basics. Matrices. Voltage Buffer. Instrumentations Circuit. Abdur Rahman. 3. after preparation of financial statements and errors detected in the next accounting year. Cash flow statement. Worksheet : Meaning. developing an Accounting system. Accounting Information System : Basic concepts. Common-Emitter Configuration (CE). users of Accounting information. steps in the recording process. The Angel Publications. rules for the preparation of worksheet and preparation of worksheet – 8-column and 10-column. the accounting equation. Control of Cash : Internal control. Latest edition. Accounting for Merchandising Operations : Merchandising operations. Classified balance sheet. Harman. I-V characteristic of Zener diode. the bank checking account. preparing the adjusted trial balance. controlling cash. cash basis of Accounting. recording of merchandising purchases and sales under perpetual and periodic inventory systems.CSE-218 Electronic Devices and Circuits Practical 3 hours in a week.00 Cr. accrual vs. principles of Accounting information systems. Latest edition. the trial balance. after preparation of trial balance. Reference Books : 1. 24 . Edwards and Maher. subsidiary ledgers and special journals. the rules of debit and credit. mechanized accounting systems. Accounting A business perspective. 2. Owner’s equity statement . bank reconciliation statement. Types of Errors. The Adjustment Process : Accounting period. distinction between Bookkeeping and Accounting. Laboratory works based on CSE-217 I-V Characteristics of diode. Introduction : Definition of Accounting. its role and functions. generally accepted accounting principles. ethical issues. Rectification of Errors : Meaning. objects. Preparation of Financial Statements : Single and multiple-step income statements. types of adjusting entries. 1.50 Cr. preparing and posting of closing entries. history of Accounting. nature. preparation of classified income statement and the balance sheet. the account. relationship of Accounting with other disciplines. petty cash funds. merchandising transactions. Basic Accounting (English version). Common-Collector Configuration (CC). Md. the journal and the ledger. Input and Output Characteristics of BJT: Common-Base Configuration(CB). CSE-219 Basic Accounting 3 hours in a week. Hafiz Uddin. various images of Accounting. Rectification of errors before preparation of trial balance. revenues (income) and expenses. the accounting profession. The Recording Process : Business transactions. Selection. CSE-222 Algorithm Design Practical 3 hours in a week. Dynamic Programming: All pair shortest path. asymptotic notations. 1.Kruse. 3.2ND YEAR 2ND SEMESTER CSE-221 Algorithm Design 3 hours in a week. 3. Conventional file processing. Network model. The Greedy method: General method. Database users. CSE-223 Database Management System 3 hours in a week. All pair’s shortest paths. Minimum cost spanning trees. Single Source Shortest path. Single Source Shortest path. The 8-Queens problem. Hierarchical model. marge sort and Bubble sort. View of data: Data abstraction. design of algorithm. Laboratory works based on CSE-221 Divide and conquer: Binary Search. Knapsack problem.00 Cr. Dynamic programming: General method. summations.Dromey. Database model: Entity-Relationship model. DML.5 Cr. Knapsack problem. Storage management. Attributes. Overall system structure. Quick sort and Heap sort. Basic Traversal & Search technique: Techniques for Binary trees. Binary Search. Mapping Cardinalities. Data models: Relational model. R. Greedy Method: Knapsack problem. recurrences. Database languages: DDL. How to Solve it by Computer. Traveling salesperson Reference books: 1. Prim’s algorithm. Introduction to algorithm: Analysis of algorithm. Data Structure & Programming Design. Techniques for Graphs Backtracking: General method. Fundamentals of Computer Algorithm. Backtracking: the 8 Queens Problem. 0/1 kanpsack problem. Divide and Conquer: General method. Sum of subsets. 0/1 Knapsack problem. Graph coloring problem. Weak entity set & Strong entity set. Optimal Binary search Tree. Traveling salesperson. Graph Coloring Branch and Bound: The method. Performance measurement using time Function: quick sort and marge sort. Transaction management. finding the maximum and minimum. Robert L. Finding the Maximum and Minimum. Sartaj Sahni 2. Single source shortest path. Minimum cost spanning tree. Purpose of Database system. Relational model and its language (Relational algebra and SQL). Existence Dependencies.G. sets etc. Quick Sort. the traveling salesperson problem. 25 .00 Cr. Database Administrator. Introduction: Database system concept. mathematical foundation of algorithm. Multistage Graphs. 3. Memory management requirements and hardware. 3. Different PL/SQL problems. Database System Concepts (4th Edition) -Abraham Silberschatz S. Ordered index. Dr. Computer Arithmetic: Different types of data representation. Functional Dependencies.P. Hayes. Referential constraints. Introduction: Organisation and Architecture. Primary index. Centralized systems. Parallel Databases. Array processor. Direct Memory Access (DMA). Functions. RISC characteristics.00 Cr. Addressing modes. Computer System: System Buses. Cache memory. Secondary index. Bit-slice processor Interconnection structures Reference Books: 1. 26 . Computer Organisation 3. Normalization. Report design. Multilevel index. cycle. J. Dense index and Sparse index. Hamcher. Fundamentals of parallel processing: Parallel processing. Laboratory works based on CSE-223 Design and Create database. Memory Organization: Main memory. Hardwired Implementation. Bus Interconnection. Object-oriented Databases. Multiprocessors. Virtual memory. M. Insert/Delete records in each table. Control of processor. Do the different queries. Indexing: Basic concept. William Stallings. Vector processing.formats.Vranesic and S. Input-Output Organization: Input-Output Interfaces. Division Algorithms. Rafiquzzaman. Associative memory. Distributed Databases. CSE-225 Computer Organization and Architecture 3 hours in a week. Integrity Constraints: Domain constraints. Pipelining. Computer Architecture and Organisation 4. Instruction sets. Design MASTER FORM with menus.Korth CSE-224 Database Management System Practical 3 hours in a week. Components. Types of Instruction.5 Cr. Multiplication Algorithms. Z. CISC characteristics. Fundamentals of Computer System Architecture. V. Data transfer. Input-Output channel. Reference Book: 1.Database design: Decomposition. Computer Organisation and Architecture 2. Micro-operation. Central Processing Unit(CPU): ALU. Data Fragmentation.Sudarshan Henry F. Addition and Subtraction. Interrupts. Auxiliary memory. 1. timing etc.Zaky. CPU structure and Functions Control Unit: Control Unit operation. microwave. The basic problems of economic organization. Analog data and digital signaling. Supply and demand: Concepts of supply and demand and their determinants. infra red. Data Link Control: Flow control. Manchester and differential Manchester encoding. PSK & QPSK and their performance. RS232( or EIA 232D). 2. National income accounting: circular flow of income. ASK. radio. implicit and opportunity cost. total average and marginal costs. PCM Data Communication Techniques: Asynchronous and Synchronous transmission. Introduction: Definition. Spectrum and Bandwidth. Packet switching principles. W Stallings. fixed Vs. law of diminishing marginal utility. wireless transmission. the law of diminishing returns. Other data link control protocols. concepts and measurements of various elasticitis of demand and supply. technological change. normative economics. Theory of production: Production function.00 Cr. different concepts of national income. Data Encoding: Digital data and digital signaling. Macro economic overview: Fundamental concepts of macroeconomic. Data Transmission : Analog and digital data. Selective Reject ARQ). total average and marginal product. Transmission media. Circuit switching concepts. envelope curves. aggregate demand and aggregate supply.parity and CRC. Datagram. Introduction: Data Communication networks standards. communication architecture and protocol. Circuit switching network. V2. Channel capacity. resource allocation and economic efficiency. 3. variable factors of production. Theory of cost and revenues: Short and long run cost functions.4 interface standard. NNP. NRZI. shut down condition. short & long run equilibrium of firm and industry. CRC Method. cellular and satellite. fixed and variable costs. Digital data and analog signaling. micro economics and macro economics. The theory of consumer behaviour: Utility-total and marginal utility. Error detection. Virtual Circuit. marginal product and the least cost rule. GED-227 Economics 3 hours in a week. 3. Transmission impairments. HDLC. Go back N ARQ. Circuit Switching & Packet Switching: Space Division and Time Division switching. Reference Books: 1. cardinal & ordinal utility. Positive Vs. Multiplexing: Frequency Division Multiplexing. Forouzan. FSK. fiber optics. Switching network. Production possibility frontier.00 Cr. profit maximization. Statistical Time Division Multiplexing.CSE-226 Data Communications 3 hours in a week. Bipolar AMI. NI at factor price. twisted pair. Market: Perfect competition and monopoly. profit maximizing conditions.GNP. Data and Computer Communication. market price and constant price. Error Control(Stop and wait. Behrouz A. Synchronous Time Division Multiplexing. short run and long run. personal 27 . market equilibrium and shifts of market equilibrium. NRZL. electromagnetic spectrum. GDP. coaxial cable. returns to scale. Data Communication and Networking. Reference Books: 1. 80386. protection. Alpha processor. an overview of Intel 80186. Inflationary and deflationary gaps and measures to bridge the gap. programmable logic devices. 28 . memory bank. addressing mode. Undecidability. Coprocessor. read/write cycle. 8086. real and nominal GDP. W. procedure. The CPI & the GDP Deflator. Samuelson & Nordhaus. 7. Turing Machines: basic machines. concepts of MEC. instruction format. 4. Microprocessors: Evolution of microprocessors. Introduction to Automata theory. deterministic finite automata nondeterministic finite automata. 2.Short run and long run view-Kuznet’s puzzle. Context free languages. equivalence and conversion of deterministic and nondeterministic finite automata. The Classical and Keynesian theory: Determination of income and employment. Pentium microprocessors. maximum/ minimum mode. interrupt and interrupt handling. disposable income. Investment Function: Determinants of investment. main memory array design. register base and accumulator based microprocessor. internal architecture of microprocessor: 8085. Hopcroft and Ullman. Leftwitch: the price System & Resurce Allocation.income. Swenburg & Mc Dougall: Macro-economics. conditional and unconditional jump. Bilsa: microeconomic theory. 6. Language theory. Reference Books: 1. 8. interrupt controller. Net economic welfare (NEW). Advanced microprocessors: Internal architecture. reentrant and recursive procedure. instruction set. Domwnick Salvatory: Micro-economics. CSE-312 Microprocessor and Assembly Language 3 hours in a week. Assembly Language: . combining Turing machines. Eugene Diulio: Macro-economics. macro. input/ Out techniques. : Economics. APS. MEI. pushdown automata. 3RD YEAR 1ST SEMESTER CSE-311 Theory of Computation 3 hours in a week. stacks operation. Adamek.Programming with 8086 instruction. memory management concepts. Languages and Computations. 3. 5. 3. RISC processor. 2. Koutsoyiannis: Moderm Micro-economics. DMA. 80486. computing with Turing Machines. pin configuration and function. string instruction. Present value Theorem. the methods and problems of computing national income. configuration. Automata and Algebras. MPS.00 Cr. Context free grammars. 80286. Finite automata. memory management.00 Cr. Consumption and saving function: concepts of MPC. theory of multiplier and accelerator. Dornburg & Mc Dougall: Macro-economics. APC. 3. Assembly Language Programming. Bessel’s equation and Bessel’s functions. Legendre’s polynomials.00 Cr. derivatives of analytic functions. Microprocessors and Interfacing. Optional. 1987 2. Series. Exponential function. function given by power series. Derivative. Calculate sum and average of few numbers. Trigonometric functions. Convert hexadecimal number to binary equivalent. Assembly Language Programming. Calculate the following expression=M+N-P+1(Using Subroutine). Marut 2. Y. Series Solutions of Differential Equation: Power series method. Richard C. Convert a lowercase letter to an uppercase letter and vice versa. Complex plane. Erwin Kreyszig. Ginson. Polar form of complex numbers. Detmer 3. If a character is “y” or “Y”. Geometry of analytical functions: Conformal mapping. Alan R. Taylor series: Sequence. uniform convergence. Input two numbers. Laboratory works based on CSE-312 Display message (n) times in different line. Display all alphabetic characters. Orthogonal function.A.Book References: 1. M. Cauchy’s integral theorem. Evaluation of real integrals. Power series. Advanced Engineering Mathematics 29 . Cauchy. Calculate following operation: if x>y then (M/N) +P else (M-N)*P . Techniques for the IBM PC. Legendre’s equation.Liu and G. powers and roots. Hyperbolic functions. Assembly Language Programming. Display it.(IF-ELSE Statement). display first ten numbers by Fibonacci Series. Residue Integration method. Cauchy’s integral formula. power series. Infinity. Singularities and Zeros. Book References: 1. Complex Numbers and function: Complex numbers. Microcomputer system:8086/8088 family CSE-313 Assembly Language Practical 3 hours in a week. theory of power series method. McGrow-Hill. Residue Integration: Laurent Series. Vanugopal 4. Strum – Liouville Problems. perform bubble sort. Convergence tests. compare them and display the smaller one and vice versa.Riemann equations. Laurent Series. Taylor series and maclaurin series. 3.V Hall. Accept a string from keyboard and display the string in reverse order. otherwise terminate. Book References: 1. simple arithmetic operation. Analytic function. Orthogonal Eigenfunction Expansions. Microprocessors and Microprocessor based system design 3. Miller CSE-314 Engineering Mathematics 3 hours in a week.Rafiquzzaman.5 Cr. Find the largest element from an array and vice versa. Linear fractional transformational Complex Integration: Line integral in the complex plane. D. 1. GED-315 Sociology 3 hours in a week.Dictionary of sociology and related sciences. 3. Society and population: human migration. social stratification and social mobility Social control: religion and morality. Sociological perspective: definition. coherence. Sociology and scientific approaches: methods of social research. Ogburn and Nimkoff. other indirect messages. and objective. suggestion for selecting words. Writing for effect: Business etiquette and the need for effect conversational style. 30 . forms of marriage. institution. association. Foundation of modern sociology.V Scientific social survey and research. cultural lag. steps. youviewpoint. suggestion for nondiscriminatory writing. Refused request. state and education. juvenile delinquency. Fairchild Little Field. 5.00 Cr. Some current social problems: crime. 2. Indirectness in Bad-News Message: Situations report indirectness. taboo-low. P. principles. deviance. functions of family in modern industrial society. suggestion for nondiscriminatory writing. Technology and society: effects of technological factors on social life. Scope. Book References: 1. Metta Spencer and Alex Inkeles. culture and civilization. forms and functions of family.H Elements of sociology. Henry Pratt. 3. features and social consequences. functions of marriage. Primary concepts of sociology: society. 3. role. A Hand book of sociology. Giddings F. feedback. nature. Social evaluation: stages in the evolution of human civilization. community. characteristics. Young. stages of social research. scope and importance of sociology. socialism.slavery-caste and social class and status. youth unrest. GED-316 Technical Writing & Communications 3 hours in a week. Routine Inquiries. suggestion for selecting words. Social stratification: main types of social stratification. Communication in the workplace: Definition. Construction of clear sentences and paragraph: The basic need for adaptation. function. culture content (material and non-material). Directness in Good news: the process of writing.00 Cr. accent on positive language courtesy. Social organization: family. Adjustment refusal. Industrial revolution: The growth of capitalism. Adaptation and the selection of words: the basics need for adaptation. population and resources. group. The processes of human communication: Definition. factors in social change. 4. Culture: definition. Social change: change evolution-progress-development. marriage. the role of emphasis. custom and public opinion. Requirements Analysis Fundamentals: Analysis principle. Organization for software testing. the report proper. media. Requirement Analysis Methodologies. Configuration management & planning. Design fundamentals: S/W architecture. Modern devices in communication/ electronic communication/ Technology in modern communication: meaning. Methods. Design process considerations. Algorithmic cost modeling. Black Box testing. person & release management. Verification and validation. determining the factors. Business communication system and application. Basis path testing. Data declaration. Boehm's spiral model. Formal reports: Organizing and content of the longer report. Bain computer. Betty & Key. 3. Reference Books: 1. Transform analysis. The classical life cycle. Preparing the application documents. teleconferencing. Software quality assurance & activities. 2. S/W procedure. Transaction analysis. the prefatory parts. Data structure. interpreting the findings. Construction the traditional resume. Software Prototyping Specification. The COCOMO model. Data structureoriented design: Logical construction of programs and systems.00 Cr. Long. Loop testing. Pettit. Structured and object oriented analysis.. 3. Design concepts. Software reliability. The art of debugging. multimedia. abstraction. Change management. Constructing the electronic resume. Flatley. 3RD YEAR 2ND SEMESTER CSE-321 Software Engineering 3 hours in a week. The product and the process model. Top-down and bottom-up design. Object-oriented design. Software Engineering Paradigms: Definition of S/W Eng. Generic view of software engineering. Lesiker.Strategies in the job search process: the job search. Software Design Fundamentals: Design process. Coding style: Code documentation. Prototyping fourth generation technique. determining the report purpose. Writing the application letter. Effective modular design. McCall’s quality factor. Testing fundamentals & strategies. Data structured systems development. Validation testing. System documentation. structural coherence helper. Basics of Report writing: Defining reports. Computer Aided Software Engineering (CASE) tool 31 . Organizing the repot information. collaborative report writing. Procedural design. Business Communication. System testing. Software cost estimation technique. Modularity. advantage. Handling the interview. Raymond V. Software Management and Maintenance Technique: Maintenance process. Feasibility Study. Input/output. statement construction. Defect testing. Software Testing Techniques and Strategies: Software Testing method. Real-time Design. disadvantage. Integration testing. strategy. Maintenance cost. Data flow-oriented Design. Program structure. e-mail. Software reuse. White box testing. gathering the information needed. Data Flow-oriented analysis methods. Internet. Software re-engineering. Measurement and Matrices. Lesiker. writing the report. It is further mentioned that a student can propose any other system.5 Cr. 2. integration. Prentice-Hall. Direct methods for systems of linear equations: Gaussian Elimination interpreted as matrix factorization. J. B. Runge-Kutta methods. Mathews. 1987.G. Numerical methods for initial value problems for ordinary differential equations. Shrive. Iterative techniques for systems of linear equations: Jacobi and Gauss. Marron. Ellis Horwood. Numerical methods in Engineering and applies Science. Engineering and Mathematics. their analysis via matrix and vector norms. Software Engineering by Lan Sommerville 2. Software Engineering by Roger S. Numerical solution of ordinary differential equation: Euler method. least-squares curve flitting techniques. Root finding for non linear equations. 1. which is relevant with this subject/ field. Macmillan.5 Cr. Laboratory works based on CSE-321 A student has to perform one of the following computer based systems: Student information system. the spectral radius of a matrix Eigenvalue problems for matrices illustrative programming projects and use of computer to implement the projects. Adams-Bashforth method. Jacques and C. Result processing system. CSE-323 Numerical Analysis 3 hours in a week.Seidel iteration. Error estimation and step size control. M. Numerical Methods for Computer Science. Detailed error analysis of several techniques. Numerical Analysis: A practical approach. interpolation polynomials. predictor-corrector scheme. Admission processing system.H. Reference Books: 1. Software Engineering by Martin L. Library management system. Numerical Analysis. Payroll management system. stiffness. pivoting strategies. Pressman 3. 1. Employee information system. 1987. Chapman and Hall. Irons and N. 3. 19878. I.Reference Books: 1. Judd. Numerical solution of polynomials: general algebraic equation. Multi-step methods. techniques for special classes of matrices. Numerical solution of simultaneous linear equation: matrix operations. 32 .J. Shooman CSE-322 Software Engineering Practical 3 hours in a week. Adams-Moulton. 1987. 4. Computer graphics: a programming approach. CD-I. Multimedia Project: Project Design concept. Simon J. Computer graphics. MPC Level 2. storage. N. Environments and framework. Compact Disk specification. Multimedia Programming Objects. Multimedia Computers and Communications. Monitor. MPEG-1. Image Capture.2 Programming Guide.Gokul. Tom David. Dave shriner. Communication Devices. Audio: Audio capture. Hidden Surfaces: Depth comparisons. Arcs. Curve Design. 33 . Output and Communications: Graphics input. Two-dimensional and three-dimensional Graphics Transformation: Geometric Transformations.S. and Instance Transformation. Hypertext. Interpolation and Approximation. JPEG. Sessagiri and Aram Akopov. Vandam. Image: Image. Sampling Rate. Multimedia in Practice. 3. Sampling Size. MPEG-2. 5. 4. Multimedia team Reference Books: 1.00 Cr. Circle. storage. 8. The Painter’s algorithm. Gibbs. Geometric representations: Wire frame model. Rectangle. Line. 6. Common Display devices. Foley. Ellipse.CSE-324 Computer Graphics and Multimedia 3 hours in a week. CD-ROM. Digital audio. Animation Classification and techniques. 3. Composite Transformations. Introduction to Multimedia Systems: Interactive and non-interactive multimedia. Computer graphics principal and practice.Video capturing technique. Video: TV screen. temporal media and Non-Temporal media. Clipping Algorithms. Encoding. Two-dimensional and three-dimensional Viewing and Clipping: Viewing Transformations. Text conversion. Compression methods. Storage for multimedia: Choice of storage. MPC Level 1. Standards for encoding images. video standards. Analog video signal formats. Image compression. Coding of real-time video. Hypermedia. Jakie Neider. Types and applications. MIDI. Media content Design and Development. Vectorization. Schaum’s Outline series 2. Judith Jeffcoate. Video compression. Quick Time. Mason woo. Multimedia Magic. Region filling. Interface Design and Development Process. Side Effects of Scan Conversion. Scan line algorithm. Co-ordinate Transformations. 7. Parallel projection. CDDA. Broadcast TV standards. Storage types. Z-Buffer algorithm. Open GL(r) 1. Graphics Input. Mathematics of Projection: Perspective projection. Raster Scan CRT. Steven and Harrington. Scan Conversion: Scan converting a Point. have. CSE-326 Compiler Design 3 hours in a week. Intermediate code generation: Intermediate languages. LALR).should.J Holub.had. Storage organization. Alfred V. the window to View port Transformation Computer Graphics Programming: Open GL. CFG. Clipping Lines. flow graph. 3. Laboratory works based on CSE-324 Scan Convention Lines. parameter passing. 2. 3. Jeffery D.has. Analysis of the source Program.CSE-325 Computer Graphics and Multimedia Practical 3 hours in a week. be. Top down parsing. three address code. back patching. operator precedence parsing. Lex specification to 34 . Construction of Syntax tree L – Attributed definition. Principles of Compiler Design. Lexical analysis: the role of the lexical analyzer. dynamic error. input buffering. Pattern Filling. Alfred V. Thompson’s construction. plan of error detection. LR parser (SLR. Laboratory works based on CSE-326 Lex specification to recognize the following verb: is. Ravi Sethi. Error detection: reporting errors.could. ambiguity.5 Cr. Filling Rectangles.can. Compilers. LL1 grammar. compiler construction tools. peephole optimization.00 Cr. basic block. CSE-327 Compiler Design Practical 3 hours in a week. conversion of regular expression to DFA. Ullman. code generator algorithm. Storage allocation strategies.will.go. of the compiler. loop optimization. Jeffery D. Aho. being. Compiler Design in C. Techniques and tools. target machine. Syntax Directed Translation: Syntax Directed Definition. Ullman. Boolean expression. Scan Converting Ellipses. semantic error.would. Clipping Circles and Ellipses. finite automaton. A. Scan Converting Circles.been. Reference Books: 1.does. Runtime Environment: Activation tree.5 Cr. Aho. the phases of compiler. are . optimization of basic block. Filling Polygons. specification tokens.did. Basic parsing technique: Parser Bottom-up parsing. syntactic error. associativity of operators. 1.were. lexical analysis. 1. operator precedence grammar. am. DAG. Code optimization: Function preserving optimization. Predictive parsing. Clipping Polygons 2D Transformation. A simple one pass compiler: syntax definition. Introduction to compiler: Compiler. was. Sources of error.do. Filling Ellipse Arcs. parse tree. symbol table. Code generation: issues in the design of a code generator. maintenance information system. Lex specification to recognize the identifier. parallel single location. evolution and future of development tools. The systems Development Environment: Introduction. Lex specification to recognize float. Reference Books: 1. Lex specification to recognize different punctuation symbol. the process of maintaining information systems.go. the preliminary investigation phase. Data dictionary. visual development tools. documentation the system-user document. are.if.program and process. Visual and emerging development tools. Lex program to recognize different types of operator. 1989).gently. types of maintenance. modern methods for determining systems requirements. 3rd edition.were. design of physical files and database.between. Pearson education Asia. Jefrey A.Process modeling. Checking the validity of an arithmetic expression using CFG. Succeeding as a systems analyst. conceptual data modeling. Lex specification to recognize for the positive and negative integer and float number. System maintenance: documentation. methods of errors checking and testing.object oriented development tools. designing forms and reports. 35 . structuring system requirements. 3. Lex program to eat up comments. acquiring the techniques of the systems analyst.recognize the following words as different parts of speech: is. Lex program to find out user name.then. managing maintenance. Designing distributed systems. 4. Converting Regular Grammar into Regular expression. Parsing any string using a CFG CSE-328 System Analysis and Design 3 hours in a week. Lex specification to recognize digit.quickly. input design. am.A modern approach to systems analysis and design. automated tools for systems development prototyping.00 Cr. Information Systems: Theory and Practice. West Publishing Company. determining systems requirements. phased and planning. design principles and output design. J Burch and G Grundnitski (John Wiley and Sons. installation-Direct. 2nd Edition Steven A Benjamin/ Cummings 1996. reusable code CASE tools.simply. Lex specification to recognize real numbers. Lex specification to recognize different keyword.to. 3. System development and implementation: program and process design. traditional methods for determining requirements. programmer document and operational document. designing databases. feasibility study. Verification and validation. Information System: A Management Perspective. Systems Analysis and Design. Hoffer etc all. the process of maintaining information systems. logic modeling with structured English. 1994. Lex specification to recognize integer. 5th Edition. Shin Yen Wu.behind. 2001. designing the internals. Analysis: Fundamental principles of systems analysis. The design phase: the logical representation of data. Decision tables. data flow diagramming. your role and other organizational responsibilities in systems development types of information systems and systems development.from. decision trees. Developing information systems and the systems development life cycle. process descriptions.very. 2. Modern systems analysis & design. IEEE standard 802 for LANs and MANs. Behrouz & Forouzen. Routing algorithms. High-speed LANs. Caching only DNS server configuration. role of frame relay. testing and debugging. Different protocol and net card. The internet transport protocols. CSMA/CD Protocol. Bridges.Computer Networks. 2. Medium Access sub-layer: Multiple Access Protocols: ALOHA. canonical name implementation. Electronic Mail. Multimedia. 36 . physical layer . Introduction to DNS. IMP and POP setup. Transport Layer: The transport service. Network structure. Wireless LAN protocols. . virtual hosting. IPv4 and introduction to IPv6. Frame Relay: Introduction to frame relay. data link layer. X. DHCP server/client configuration. squid proxy server configuration. 1. cell. Application Adoptions Layer(AAL). The World Wide Web. email account splitting. name based virtual web hosting. Data & Computer Communication. Elements of transport protocols. testing and debugging and log file analysis. ATM Network: Packet networks. configuration. mixed network traffic. Example networks.00 Cr. cell networks.25 Networks. Tannenbaum . DLCIs inside the network. Stallings. 3. Congestion control Algorithms. 3. identifiers. CSE-412 Computer Network Practical 3 hours in a week. introduction to electronic mail system. Wavelength division multiple access protocols. virtual circuits. ATM LANs. WINS configuration. Application Layer: Network security. apache core active and apache module. OSI Model. connection establishment and release. use of DNS testing utility. configure SMTP. frame relay operations. Inter networking. Collision-Free protocols. Reference model.5 Cr. TCP/IP Model. use of DNS testing utility. Physical layer. ATM WANs. web based mail configuration using open web mail. understanding of different squid tag FTP configuration.Mobile telephony and Satellite Networks. SNMP: Simple Network Management protocol. Caching only DNS server configuration.4th YEAR 1st SEMESTER CSE-411 Computer Network 3 hours in a week.ATM layers. Configure TCP/IP. apache core active and apache module. IP based virtual web hosting.CDMA Limited contention protocol. Optical Fiber Network: SONET and SDH. Canonical name implementation. Reference Books: 1. DNS-Domain Name system. apache web server configuration. W. web based mail configuration. Network software.frame relay layers.Wireless LANs. Network Layer: Network layer design issues. The ATM AAL layer protocols. Network layer in the internet. Introduction to electronic mail system. asynchronous TDM.virtual connection. advantages and disadvantages. Data Communication & Networking. POP. Introduction: Basic computer network concept. configure to ISP online mail. DNS server configuration. Laboratory works based on CSE-411 Overall Concept about network. 2.K. Reference Books: 1. cost an benefit analysis. architecture.classifications. Shortest Paths Spanning Trees Distributed processing : Overview. 3. Workefficient. Voting Protocol.Importance. pitfalls in distributed processing.Distributed data.00 Cr. Back Propagation. Fault Tolerance – Forward and Backward Error Recovery. Depth first. Parallel Processing: Overview. Learning.Hwang Kai Distributed Operating System. Genetic Algorithm. Katalopoulos. Strategy. A* search. multiple copies data. Programming for Artificial Intelligence. hardware and software issues. I . Supervised. centralization Vs decentralization. Perceptron. Informed search. Handbook of Artificial Intelligence Vol. Neural Network: ANN.00 Cr. Knowledge: Knowledge representation. Simulated annealing search. hierarchical distributed systems. database management. CSE-414 Parallel and Distributed Processing 3 hours in a week.Connected Components. Redundancy Approaches.strategies for distributed data processing. Commit Protocols. Sinha Distributed Operating System.Distributed data. best first. horizontal distributed system. Issues in parallel processing. 3. distributed database and applications.Function distribution. 4. Parallel Algorithm – Pointer Jumping.P. William Kaufmann Iven Bratko. Graph Problems. 3. 3. control of complicity. Barr and Feigenbaum. depth limited. problem of incompatibility. Artificial Intelligence: A Modern Approach. Design of distributed data. heuristics search. impact of distributed processing on organizations. PL. Problem Solving by Searching: Blind search. Forms of distributed processing. Understanding Neural Networks and Fuzzy Logic.CSE-413 Artificial Intelligence and Neural Network 3 hours in a week.Definition. FOPL. First-order logic. Intelligent agents. 4. Unsupervised. Advanced Computer Architecture. Sorting Networks. bi-directional. Introduction: What is AI. Fuzzy Logic. Architecture for parallels processing. WFFs.Tanenbaum Algorithm. Reference Books: 1. location of data. 2.Coreman 37 . comparative study of different architectures. Hill climbing search. conflict analysis. Reinforcement learning. breadth first. Operation based and State Based Approach. iterative deepening. Stamations V. Stuart Russel & Peter Norvig. Reference Books: 1. Observe and manipulate Null modem Configuration. Discrete Time Systems. Magnetic hard disk and controller. Timing and frequencies. Connections and Cabling. Modern data-entry devices: Scanners overview.00 Cr. Understand the basic characteristics of IC 8255.00 Cr. DMAC. magnetic tape storage. Relay. Bar code reader. Digital Interfacing: Programmable parallel ports and handshake input/output (IC 8255). Optical mark reader (OMR). Communication system. Timing considerations. Display-Alphanumeric and multiplexed LED (Interfacing with IC 7447). Discrete Time Signals. Digitizer: Reading technique. Basic CRT operations. Sampling and Analog-to-Digital Conversion. 1. IEEE 488 Bus. Application areas for DSP. Tape Reader. Introduction to Digital Signal Processing (DSP): Introduction. X-lat. The GPIB. Electroluminescent display. Drive a single 7 segment LED display with 7447. LCD reliability. Optical Character Reader (OCR). Floppy disk controller (IC 8272) . Laser printing. LCD technologies. Parallel and Serial Interfacing devices. Incremental Encoder. Passive and active matrix. Understand RS-232 standard.0 Cr. Compact disk. Interfacing a Microprocessor to keyboards. Serial and line printing. Printers: Impact printers. Microprocessor and Interfacing by Andrew Hall 2. PIC. Ink-Jet printing. Stepper motor. Laboratory works based on CSE-415 Understand SDK 86 board. Noise considerations. Null Modem configuration. Capacitive Electrostatic scanning digitizer. Color printing. Computer Peripherals (Part B) by Barry Wilkinson CSE-416 Peripheral and Interfacing Practical 2 hours in a week. RS-232 C serial data standard. 3. Plotters. System overhead (DMA and Programmed data transfer). Digital Signal Processing. Application of PPI. CSE-417 Digital Signal Processing 3 hours in a week. Display devices: CRT. 3. Data Communication and Network: Introduction to asynchronous serial data communication. write and execute a program in an SDK 86. USART(IC 8251A) word format. Communicate between two Computers using parallel ports (Printer Port). Ambiguity in Digital signals.CSE-415 Peripheral and Interfacing 3 hours in a week. Storage devices: Floppy disk. CRT controller ICs. PCI etc. HPIB. Optical motor shaft encoder. Keys of DSP operations: 38 . Communicate between two Computers using serial ports. I/O ports and Control. Interfacing techniques: Interfacing for Memory. Barrie W. basic concepts static and dynamic web sectors. recursive least square algorithm. Block Diagram and Signal Flow Graph Representation of Digital Networks. GIF. John G. Algorithms. Comparison of inverse z-transform method. Design of FIR Filters: Design of FIR Filters by Windowing. different web problems like Hoaxes. Design of Digital Filters: Introduction to Digital Filters. Contour Integration. Discrete Fourier transform: Fourier series. Brief history of Mark-up languages. Choosing between FIR and IIR Filters: Digital Filter Design Steps. jervis. Animations. Inverse discrete Fourier transformation. Types of Digital Filters: FIR and IIR. discrete Fourier Transform (DFT) and its properties. Alan V. HTML and introduction to HTML. Client Server architecture. 3. Matrix Representation of Digital Networks. basic concepts. Emmanuel C. the basic LMS adaptive algorithm. form 39 . Dimitris G. Cascade forms. The Z-Transform :Introduction to z-Transform. basic wiener filter theory. Schafer. basic HTML tags. Design of Optimum Equiripple Linear-Phase FIR Filters. popular websites and their speciality. Digital Signal Processing – Principles. 4TH YEAR 2ND SEMESTER CSE-421 Web Engineering 3 hours in a week. inserting images. structure of a website. Complex Convolution Theorem and Parseval's Relation. WWW. Reference books: 1. Oppenheim. Web browser and Web servers. Proakis. Power Series Expansion. Basic Structures of IIR Systems: Direct Form. adding links to different pages. Dicrete-Time signal Processing.Convolution. Viruses and Pop-ups etc. 3. Buck. Parallel Form. Finite Precision Effects. Ronald W.00 Cr. back ground sounds. one dimensional Fourier transforms. Correlation. and applications. Introduction to Web application technology. Design of IIR Filters: Classical Continuous-Time Low-Pass Filter Approximations. Spyware. Digital Filtering. Adaptive digital filters: concepts of adaptive filtering. Ifeachor. Digital Signal Processing. Transposed Forms. Implementation of Discrete-Time Systems: Introduction. Inverse zTransform: Partial Fraction Expansion. Modulation. Discrete Transformation. Manolakis. General Results of z-transform. Fast Fourier Transform (FFT) and its algorithm. John R. Properties of z-transform. System Design: Methodology & Implementation Methodology. 2. Conversion of Transfer Functions from Continuous to Discrete Time. Frequency Transformations of Low pass Filters. Basic Structures of FIR Systems. 10. Contact/Feed back Forms (Text box. 11.Installing Apache. tables and link styles. time. using/calling CSS functions in forms . text and links. Designing a simple HTML Document to show text (Introduction to <HTML>. Simple PHP scripts to write/read inputs in forms and using in Dynamic forms. Data Validation. Using PHP Forms to manipulate data in the database. do-while). inserting Images and back ground sounds and using Images as Link. Beginning Php 4 (Programmer to Programmer). common problems and trouble shooting. for. CSS. while.and form components. redirection between Web pages. Basic Concepts of Java applet . checkbox. Web application development.Using CSS to apply formatting text.<Body> <Head/Title>. <Meta Content>. Changing page Title. Introduction to Java scripts. PHP. Wankyu Choi. 2. Web Design in a Nutshell (O’RELLY) Jennifer Niederst CSE-422 Web Engineering Practical 3 hours in a week. 4.changing links. Surid Sharkar.Using different control statements in Java Scripts to execute simple mathematical expressions(if-else. PHP and My-SQL having forms and also a flexible navigation menu which has links to all available section on the site. creating PHP documents with simple tags. advanced custom tags.Ganesh Prasad. security. Using Simple scripts on different mouse events. 40 . Web Design Complete Reference by Thomas A. 3. forms. 12. Powell 4.down menus. Session.Using page frames and mousover links and implementing them in a HTML document. How it uses HTML.date etc. Integrating PHP and MySQL. pull-down menu. Creating Web Pages with HTML Simplified Sherry Willard Kinkoph 5.Text alignment in table.5 Cr.Using text Links to navigate between different pages. Texts.Chris Ullman. 1. 5. basic concepts of CSS. pull. links and Image array. Laboratory works based on CSE-421 1. Text fields.Using Java Scripts to to create web pages containing custom Welcome message(Date-time). Reference Book: 1. creating custom text styles using CSS. Chris Lea. basic programming concepts and its dynamism. submit/reset Button. Basic concepts of DHTML.Using Different HTML tags to format Body contents. Java Scripts and CSS components. CSS handlers. installing My-SQL and connection between PHP and My-SQL. PHP 4/5 and integrating into windows platform. 3. 6. Switch-case. combo box etc) and designing simple Feedback/Contact forms. building simple applets with images.Inserting data into My-SQL database using PHP forms. embedding dynamic elements with Java Scripts. Supported platforms. supported platform and browsers. 2.Allan Kent. Using Basic Java Scripts functions like writeline. CSS/Java Script. Introduction to Form elements(textbox. Project: Design and develop a Complete Dynamic website with HTML.Using java Scripts to design multi-state image links. DiffieHellman key exchange. Email security. Introduction to image processing: Representation of image. eb security considerations. Menezes. Histogram matching. This is an elective course the student should choose one of the elective course in consultation with head of the department. William Stallings. Kerberos and X. Private-key (symmetric-key) and public-key (asymmetric-key) cryptographic algorithms. certificate authotity and public key infrastructure. Hand book of Applied Cryptography. management. Example of fields that use digital image processing. Key distribution. IP Security. Adjacency. P. 3.van Oorschot.00 Cr.) 12 hours in a week. key management. cryptanalysis. Key management. DES and block cipher modes. Relationship to human visual system. authentication header and ESP.uwaterloo. CRC press. 2.499 Project Work (Continued from 7th Sem.00 Cr. by A. Cryptography and Network Security. connectivity. Light and electromagnetic spectrum. Elliptic curve cryptography. Image sampling.509 authentication service. 6. Histogram processing. Some basic relationships between pixels Neighbors of a pixel. digital immune system and UNIX password scheme. PGP and S/MIME. Digital Image Fundamentals: Image formation in the eye. cryptography hash functions. Image negatives. region. Power 41 . CSE-424 Image Processing 3 hours in a week. Cryptography for antivirus software and password management: generic decryption. secure socket layer and transport layer security. 3. secure hash algorithm. log transformation.00 Cr. CSE. message authentication codes.CSE-423 Computer and Network Security 3 hours in a week.math. Image quantization. Digital signatures and digital signature standard. Image sensing and acquisition. 1996 ( www. Security associations. Vanstone. Boundaries. Histogram equalization. Cryptography and cryptographic algorithms: Traditional cryptographic algorithms: traditional cryptography. A basic image processing system.cacr. secure electronic transactions (SET).00 Cr. Distance measures Image enhancement: Some basic gray level transformations. RSA and other public key cryptosystems. advanced encryption standard. Cryptography and network security: Data-origin authentication and data integrity. Reference Book: 1. 3. and S.ca/hac) CSE-42X Elective Course 3 hours in a week. point detection. Pentic. Comparison of simulated and analytical methods. Hall International Inc. 3. Richard E. Reliability aspects of VLSI design.law transformation.00 Cr. continuous and discrete systems. Basic VLSI Design system and Circuits. Concept of system: System components. the RGB color model The CMY. types of simulation. 2. continuous and discrete models. CSE-426 Simulation and Modeling 3 hours in a week. Color Image processing: Color fundamentals. Noise consideration. Multiple Valued VLSI circuit. M A Sid-Ahmed. Image Compression: Image compression fundamentals. Gonzalez. Restoration in the presence of noise only spatial filtering. Continuous system simulation. System modeling: Types of models. line detection. Special purpose architectures in VLSI layout partitioning and placement routing and wiring in VLSI.00 Cr. Image Restoration: A model of the image degradation/ Restoration process. Simulation techniques. Image compression models. clocking methodologies. Multilevel VLSI circuit. Graph based VLSI Design. Design and operation of large fan out and fan in circuits. Pucknell. CMYK color Model. 42 . Color models. VLSI Design: Design and analysis techniques for VLSI circuits. Basics of full-color transformation. 3. Douglas A. Image Segmentation: Edge detection. Thresholding. Jain. CSE-425 VLSI Design 3 hours in a week. Coding redundancy. system model analysis and postulation. Anil K. 2. Color transformations. HIS color Model. 3. formulation. Second Edition. The channel encoder and decoder. physical and mathematical models. Woods. KAMRAN Eshraghiam. Techniques for data path and data control design. Study if system model. Fundamentals of Digital Image Processing. Boundary Detection. Principles used in system modeling. Correspondence between the spatial and frequency domain filtering. Inter pixel redundancy Psychovisual redundancy. The source encoder and decoder. Differential equation model. Reference book: 1. Algorithms and architectures. Homomorphic filtering. Noise models. Image processing theory. static and dynamic models. Rafael C. Digital Image Processing. Reference Books: 1. techniques of simulation. Smoothing spatial filters. Region based segmentation. Modern VLSI Design by Wayne Wolf. parallel processing. Design of reliable VLSI circuits. Basics of spatial filtering. System Dynamics: Need for simulation. system design. overview of literate security systems. Legal Issues: Risk associated with proper documents and electronic documents. queues. Stochastic variable. Online communities and new marketing opportunies.KK Bajaj and D. Probability concepts in simulation. Introduction: An overview. 2.Simulation Modeling with Pascal.E-Commerce. Generating discrete distributions. Kalakota. types of ecommerce. 3. authentication of electronic documents. Murphy. Multi-sigment models. discrete and and continuous probability functions.Exponential growth models and decay models. benefits of e-commerce. Generations of random numbers. Discrete System Simulation: Discrete event simulation.Frontiers of Electronic Commerce.Discrete-event System Simulation by Banks J and Carson JS. electronic data interchange and components of EDI system. D. System dynamics diagrams. virtual coordination and implementation. 3. 43 .E-Commerce. models and methodologies.Kosiur.value chains and the market place. websities and ordering online. management of changes.. Loshin. Electronic consumer support. to online catalogs. R.types and tools for electyronics payment. Consumer and Business Markets: Consumer markets and one to one marketing. 4. Digital signatures and certificates. P. laws for e-commerce. entrusting access to intermediary.access to shared data and applications. System language (GPSS) and SIMSCRIPT. Security and e-commerce: Review of private key and public key enery operations. 4. Business Process Engineering: Approaches.traditional and electronic business trasanctions. Handling money on the net: Transactions on the internet. security software modules. Comparasion of encryption method. Non-uniform continuously distributed random numbers. generation of arrival patterns. System Simulation with digital computer.requirements for payment systems. resources. activity simulation. entities. Virtual: Virtual factory. tying database.System Simulation by Geoffery Grodon. Rejection method. Reference Books: 1. Online catalogs . Measures of queues and mathematical solution of queuing problems.tracking online problems. Prentice Hall 2. P. Discrete simulation languages: General Purpose simulation. generalization of growth models. representation of time delay. Prentice Hall. Reference Books: 1. EDI interchange agreements legal issues for internet commerce. Narsing deo. Nag. 3. representation of time. Prentice Hall.00 Cr. CSE-427 E-Commerce 3 hours in a week.Electronic Commerce .