# UNDERGRADUATE COURSE CALENDAR

B.Sc. (Hons) in Computer Science and Engineering Session: 2006-07

NATIONAL UNIVERSITY, GAZIPUR, BANGLADESH.

2

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

3

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.

1.5

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.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

4

Two examiners will evaluate the semester final examination scripts separately. …). The rest of the marks (80%) for each theoretical course will be allotted to the Semester Final Examination.00 3. which will be conducted centrally by the National
5
1.00 0. 1(b).50 3.25 3. A minimum number of earned credits also have to be acquired in order to qualify for the degree. The marks will be finalized by averaging of minimum variation of two examiners.25 2. 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.
1. If the variation of marks of two examiners is 20% or more. Each question carrying 20 marks should contain two or more parts (e.9
.(GPA) is essential for satisfactory progress.75 3.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). Distribution of Marks for Theoretical Courses Twenty percent (20%) of marks of all theoretical courses shall be allotted to two in-course examinations.1(c).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.g 1. the third examiner will be appointed to reexamine the scripts.50 2.(a). The answer scripts of in-course examinations are sent to the Controller of Examination of National University if required. 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 2.75 2. Semester final examination will be conducted by the National University on six months basis for each semester.

will conduct the project defense and also examine the project report.
6
. At least two members for the panel of examines must be present for project defense and evaluation. or more centers.11 Evaluation of Project Work
The evaluation of the project work. Practical Final Examination that is conducted centrally by the National University will be held on 60 marks for each course. There are internal and external examiners for each course in the Semester Final Examination of three hours duration. Project Defense 40% of marks 2. Project Report 60% of marks A panel of examines prepared by exam control appointed by NU. Marks distribution of each practical course is stated below. selected by authority of NU.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. The project evaluation can be conducted by one.University. for grading will be as follows 1. 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.

50
Ci*Gi
8....00 3. For example.000 5.00 4.250 72. .00 1. For example.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.000 5.00 3. C i
2.50 3.. if a student passes / completes n semesters having total credits of TC 1.50 3.00 3. Cn and his/her grade points in these courses are G 1.250 12. ...1.50
Grade
A+ A+ A B AA+ A A-
Grade Points. if a student passes / completes n courses in a semester having credits of C 1.. GPA2. Gn respectively then GPA =
∑C
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. .00 1.. Gi
4..125
7
.000 15.00 4..00 3.00 1. C2.13.625 9..75 3... GPAn respectively then CGPA =
∑ TC
i =1 n i =1
n
i
* GPA i
i
∑ TC
1.. TC2.000 12.000 5..13
Numerical Examples of Computing GPA and CGPA
1.50 19.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. G2.50 4..75 3.… TCn and his/her GPA in these semesters are GPA 1.

20.50 20.90
1.96 4. GPAi
3.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.70 3. The minimum GPA requirement for the Bachelor Degree Award in engineering is 2. TC1
19.000 317.150 80.50
GPA Earned.) will be decided National University.565 84.25 20. However.00
GPAi*TCi
72.50 = 3.5 credit hours for engineering must be earned to be eligible for the graduation.Sc.13.50 = 3.
8
. Engg.865
CGPA = 317.GPA = 72.125/19.50 21.7 1.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.93 3.150 81.865/81.25 81. at least 145.

which is given in this chapter according to semester –wise distribution of courses:
9
.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.

5 3 3 3 18
6
10
.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 3 3 3 16.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 1.

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 3 1.0
11
.5 3 3 1.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 1.5 3 22.5 3 3 3 18.

5 3 3 3 16.5
12
.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 3 3 1.5 3 1.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 19.

5
*Project work must be started in 7th semester. CSE-42X: Optional Courses (Any one ) CSE 424 Image Processing CSE 425 VLSI Design CSE 426 Simulation and Modeling CSE 427 E-Commerce
13
.5 3 3 6 16.5 3 3 3 1 3 17.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 12 15 Credit 3 1.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 5 3
Credit 3 1.

5 7.5 18 16.5 4.5 145
1 2 3 2 1 3 2 2 16
14
.5 19.5 17.5 28
Credit
16.5 2.5 3 4.5 3 1.5 16.Summary:
Number of Theory Courses 5 5 6 5 5 5 5 3 39 Number of Practical Courses
Year/ Semester 1 Year 1 Semester 1st Year 2nd Semester 2nd Year 1st Semester 2nd Year 2ndSemester 3rd Year 1st Semester 3rd Year 2nd Semester 4th Year 1st Semester 4th Year 2nd Semester Total
st st
Hours/Week Theory 15 15 18 15 15 15 15 9 117 Practical 3 6 9 6 3 9 5 15 56
Credit Theory 15 15 18 15 15 15 15 9 117 Practical 1.5 18 22.

Handling of character strings. Storage Techniques: Primary Storage device and techniques. Interpreters. International Network Standards. Structure and union. Algorithm build-up. Output Device Techniques: Monitor. types of computer network. Mark Sense Reader. Assemblers. Sinha 3. Pen Input Method. Flowcharts. Understanding Computer Science for Advance Level(4 th Edition). Reference Books: 1. Computers and Information Systems(5th Edition). E. Barcodes. User-defined functions. Secondary storage device and techniques. Mouse. Basic organization of computer. History. Balagurusamy. Hutchinsonb and Stacey C. Decision making and looping. System Utilities. Number systems: Binary. Graphics Tablet. OCR System . Lutfar Rahman and M. -Sarah E. Decision making and branching. Compilers. Joysticks.Scanner. Constants.00 Cr. Managing Input & Output Operators. Editors. classification of hardware. -Ray Bradley 2. Alamgir Hossain. Types of computer buses. Operator & Expression. Types of computer: Main frame. network topology . types of operating system : batch. High Level Language Features. Systems
software: Operating system. Arrays. -Pradeep K. Introduction: Data & Information. Hexadecimal and Octal numbers. multi tasking. multiprocessing . Input Device Techniques: Keyboard. Hardware & Software: Hardware.
CSE-112 Programming Language
3 hours in a week. Programming Concept: Problem analysis. Function and Procedure. Simplest & Expanded Computer System. Computer Fundamentals (4th Edition).Sawyer 4. Different types of micro computer. Modern Communication Systems: Computer Networks. Operating System: Basic concept.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 output devices. variables and data types. Application packages. Touch Screen. “Programming in ANSI C”
15
. Digital Camera. Computer Fundamental . Magnetic Ink character recognition. 3.00 Cr. Light pen. time sharing & real time operating system. Pointers. A Modern Overview of Computers. 3. Types of software. Some Modern Computing
Ideas.M. File management. Computer generations. Reference Books: 1. Speech Input. Printer. Overview of C. Mini and Micro computer.

A Text book of Electrical Technology
CSE-115 Differential Calculus and Co-Ordinate Geometry
3 hours in a week. Theraja. Electric field & field strength. Fleming’s right hand rule. Hysteresis and eddy current losses. Current. 4. Inductance in series and parallel. Electric vectors. Physics Part-II 2. Reference Books: 1. Magnetic force on current. Maxwell’s screw rule. Managing Input & Output Operators. Constants. Voltmeter. Measurements of Voltage. Moving coil galvanometer. Equipotential surfaces. Potential energy. variables and data types.
CSE-114 Physics (Electricity and magnetism)
3 hours in a week.5 Cr. Laboratory works based on CSE-112 Overview of C. “Turbo C”
CSE-113 Programming Language Practical
3 hours in a week. Magnetic Field & force on Current: Coulomb’s law.M. dipole in an electric field. “Pointer in C“ Herbert Schildt. Operator & Expression.00 Cr.
Yamath Kanathkar.2. Introductory Circuit Analysis 3. 3. Magnetic field for solenoid. Wattmeter & Energy meter. Handling of character strings. Magnetic field and field strength. B. L. David Halliday and Robert Resin. Para-magnetism and Ferro-magnetism. Fleming’s left hand rule.F.
Charge. Simple circuits and Electrical Measurements: Current and Ohm’s law. Rise of current and decay of current in inductive circuit. 3. Structure and union. Pointers. Simple RC and RL circuits. User-defined functions. The coefficient of magnetic coupling. Decision making and looping. “Let US C” Yamath Kanathkar. Arrays.
Electrostatic induction and charge density. Energy stored in an electric field Electric current. Magnetomotive force and field intensity. Magnetic properties of matter: Poles and dipoles. Coulomb’s law. Gauss’s law and some applications. Parallel plate capacitor with dielectric. Capacitance. and potential difference. Potential due to a point charge. Whetstone bridge. Resistance. Electric potential. Multimeter. Electric flux. Inductance. Point charge in an electric field. Energy in magnetic field. Dielectric & Gauss’s law. Magnetic field near long wire. Power and Energy. E. 1. The potentiometer. Ammeter. Potential gradient. Boylested. Decision making and branching. Capacitance and its calculation. 3.00 Cr. Electric field & Gauss’s Law: Simple phenomena in electrostatics. Dia-magnetism. Directions of current and field. File management. Coulomb’s law for magnets & Gauss’s theorem of magnetism.
16
. concept of self and mutual inductance.

(ii) paragraph.00 Cr. correction of sentences. Equation of conics and its reduction to standard forms. center of curvature Asymptotes. format. transformation of sentences.Differential calculus: Limits. completing sentences. d) Noun-adjective. Pair of straight lines. 2. (vi) dialogue -writing. grammatical items. Subtangent and subnormal in Cartesian and polar coordinates. radios of curvature.A textbook of Co-ordinate Geometry and Vector analysis Prof. Anwar Hossain. orthogonal circles. NOTIONS AND FUNCTIONS: 17
. Co-ordinate Geometry: Transformation of co-ordinates axes and it uses. radical axis. c) Headword. 1. Differential calculus. (iv) essay. and limiting points. intention/ attitude of the writer. Director circles and asymptotes. Evaluation indeterminate forms by L’Hospitals rule. system of circles. Partial differentiation. READING AND COMPREHENSION: thematic structures. ellipse and hyperbola in Cartesian and polar co-ordinates. 3. radical center.a) determiners. Maximum and minimum values of functions of single variable. Conjugate diameters and their properties. curvature. Tangent and Normal. The works should concentrated at the higher levels on technical and IT usage to include: Accuracy and conciseness in technical English structure. Chord in terms of its middle points. Expansion of functions. successive differentiation of various types of functions. Chord of contact. B. circles. Differential Calculus Integral Calculus. précis (i) comprehension. diameters. (iii) précis. N. cohesive and rhetorical devices. STRUCTURES: The sentence: A i) Normal group. continuity and differentiability. Rahman and Bhattacharja. pair of tangents. vocabulary. Abdul Matin. 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). Pole and polar parametric co-ordinates. C) adjective.C Das & B. 2. Homogeneous equations of second degree. Rolle’s Theorem. Md. Lagrange’s form of remainders. Tangents and normals. 4. (v) amplification.Business Mathematics
GED-116 English
3 hours in a week. Pair of lines joining the origin to the point of intersection of two given curves. b) Adverb. Coaxial circles. leibniz’s theorem. curve tracing. 3. Dr. properties of radical axes. Abu Yusuf. framing of which questions G. Points of inflexion. Euler’s Theorem. Mean value Theorem in finite and infinite forms. 5. 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. Differential Calculus. Mukherjee. Cauchys form of remainders. Equations of parabola. Reference books: 1. combination of sentences. Angle between a pair of straight lines.

Trees: Binary Trees. greeting. Sorting. Implementation of Recursive procedures. Linked representation of Graphs. Priority Queues. obligation. Mathematical Notation and function. (Bubble sort). traversing binary tree. farewell. Wren and Martin. Warshall’s Algorithm. Data Structures. Towers of Hanoi.i) Emotional attitudes e.00 Cr. designed to influence the behavior of other) iv) Intellectual attitudes. Heap tree. binary search trees. Representing Binary Trees in memory. Elementary Data Organization. Matrices. Queue Dequeue. Record Structures. 2nd Ed. String Processing: String Operations. TRANSLATION: English to Bangla and Bangla to English. Keith and Brown. Pointer Arrays. Quicksort. 5. Data Structure (International Edition) 2. Charies P. etc iii) Suasion (utterance. Ellis Horowitz & Sartaj Sahni. etc. Queues. Chowdhury & Hossain. Data Structure Operations. disagreement. A practical English Grammar. Graphs: Sequential Representation of Graph. TECHNICAL WRITING: Writing Projects. Robers L Kruse. Traversing a linked list. 3. Multidimensional Arrays. heap sort. Linked lists: Representation of Linked lists in memory.g. 2. Recursion: Array Representation of Stacks. word processing. Data Structure and Algorthm. Recursive definition. High School English Grammar & composition. Time-Space Tradeoff. Seymour Lipschutz ( Schaum’s outline series). Stacks. v) Socializing e. Searching a linked list. e. Traversing linear arrays. Data Structure & Programming Design. binary). Adjacency Matrix.g. Header and two-way lists. Boeckner. deletion. Reports and theses. 3. Records and Pointers: Linear Arrays. Polish Notation. Algorithms: Complexity. Arrays. Representation of linear array in memory. Reference Books: 1.
18
.
1ST YEAR 2ND SEMESTER CSE-121 Data Structure
3 hours in a week. etc.g. LETTERS: Application---request---Enquiries---Quotations---Complaints---Tender---to Newspapers--Formal and Informal---Advertisements. Oxford English for computing. 4. and Pattern Matching Algorithms. etc. Introduction: Basic Terminology. Advanced Learner Functional English. Path Matrix. agreement. 3. Header Nodes. permission. Thomson & Martin. Threads . regret. 3. insertion. Huffman’s Algorithm. Inserting and Deleting. liking ii) Moral attitudes: apology. 4. Control Structures. Searching (linear. Reference book: 1.

Power. counting. Usage of address arithmetic. Nodal analysis with current source Network theorem: Delta star conversion. display. Operation on one-way link list (Creation. Effect of Temperature on resistance Series Circuits: Introduction. Advanced sorting technique (Heap sort).m. Usage of call by reference variable.s value: Current. Kirchoff’s Voltage Law. Biot-Savart law. Voltage Divider rule. Laws: Ampere’s law.). Magnetic properties of matter. DC and AC powers.AText book of Electrical Technology 3. Binary tree implementation. Infix. 1. Thevenin’s theorem.00 Cr. Laboratory works based on CSE-121 Operation on array of character (Single character.Theraja. Pop) and queue (Dequeue). Power and Energy: Conductance and conductivity. Introductory Circuit and Analysis 2. instantaneous and r. 3. Calculation of paths and nodes as well as height of a graph and tree. append etc. insertion. Energy.H file. Usage of pointer variable and memory allocation. AC and DC networks.
CSE-123 Introduction to Electrical Engineering
3 hours in a week. Ohm’s law. post-order). Wattmeter. Circuit Breaker’s. Ohm’s Law. Maximum power transfer theorem. Voltage source in parallel. find. Searching algorithms (Linear. average power for various combinations of R. Sorting Algorithms (Bubble. B. Usage of built-in string function declared in STRING. Voltmeter Method of analysis: Source conversion. Efficiency. Open and short circuits. Recursive function (Towers Hanoi). Voltage regulation Parallel circuits: Introduction. prefix. Declaration and operation on stack (Push. deletion. Traversing techniques (In-order. merge. voltage and power. Resistances is Series.CSE-122 Data Structure Practical
3 hours in a week. Declaration and use of single/ multiple structure/ record type variables. deletion. preorder. Binary). Quick).5 Cr. Current divider rule. Laboratory works based on CSE-123
19
. insertion. Mesh Analysis with matrix form. etc). Nodal analysis with voltage source. Superposition theorem. Maxwell’s loop Current method. Physics Part-II
CSE-124 Introduction to Electrical Engineering Practical
3 hours in a week. Voltage Sources in Series. Norton’s theorem. substring insertion. GFCIS and Fuses. Induction and Inductance. kirchoff’s current law. Boylested. Reference Books: 1. L and C circuits. Usage of pointer in structure variables and implementation as link list. phasor representation. 1.L.5 Cr. postfix transformation using array. David Halliday and Robert Resin. Inductors and transformers.

Determination of length and area of plain curve. Measure of dispersion: Characteristics of an ideal measure: Absolute & Relative measures. Geometric mean.C Das & B. Interpretation as area. Coefficient of dispersion. Differential Equations. Standard deviation. To verify Thevenen’s theorem.
CSE-126 Statistics and Probability
3 hours in a week. Percentiles. Normal Distribution. Indefinite Integrals as Inverse of Derivatives: Techniques of integration. Dr. 3. Mean deviation. Sampling: Sampling Techniques & its role. To verify Superposition theorem. To study R-C circuit and to find out the time constant. discrete and continuous variables. Tests of Significance: Tests of means. Variance. Expectation of sum and products. Multiple correlation and regression. Abdul Matin.N Mukherjee. Quartiles. 3. Solutions of partial differential equations by the method of separation of variables. Mode. Abdul Matin. Solutions by the method of variation of parameters and indetermined coefficients. Elements of Probability: Meaning and definition of probability. Abu Yusuf. Deciles. Volume and surface area of revolution. Probability Distribution: Binomial Distribution. Correlation coefficient and regression coefficient. Basic terminology of probability. Dr. its uses and properties. Fundamental theorem of integral calculus (for continuous functions). Nonlinear and Inhomogeneous Differential Equations: Solutions of ordinary differential equations. Random variables. 3. Differential Equations. Simple correlation. 2. Reference Books:
20
. Differential Equations: Power series solutions about singular points. Regression and correlation: Relationship between variables. its uses and properties. Arithmetic mean. Coefficient of variation.00 Cr. Quartile deviation. Fitting of regression lines. Elements of Statistics: Nature and scope of statistics. A priori and a posteriori probability. Median. Harmonic mean.Verification of ohm’s law and measurement of Resistivity of a Metallic wire. Probability function. Skew ness and kurtosis. Method of data collection.
CSE-125 Integral Calculus and Differential Equation
3 hours in a week. 4. To verify Kirchhoff’s Current law and kirchhoff’s Voltage law. Introduction to linear.00 Cr. Integral Calculus . different types of sampling & its merits & Demerits. Integral Calculus. To study the R-L-C series Resonance circuit. its uses and properties. Definite integral as limit of a sum. Poisson Distribution. Measures of location: Characteristics of an ideal measure. B. Attributes and variables. Range. To verify Norton’s theorem. Nature & representation of statistical data. Reference Books: 1.

Introduction to java. J. Working with Files. Managing console I/O operations. Expressions and Control Structure. Ordered sets and lattices. Morphisms. quotient. Set Theory. E Balagurusamy “Object. Virtual Functions and Polymorphism.00 Cr. Reference Books : 1. Pointers. Principles of Object-Oriented Programming.1. homomorphism. Planer Graph and Trees. Graph Theory. Discrete Mathematics CBS. M. 3. Basic structure theory. group theory. O. 4th ED 2000 2. Prepositional and Predicate logic. Md Abdul Aziz. Relations. Methods of statistics. 3. Functions in C++. M. symmetry groups.
CSE-127 Discrete Mathematics
3 hours in a week. cyclic groups. Algebraic Systems. Template functions and classes. Classes and objects. Operator Overloading and Type conversions.G. Robert Lafore “Turbo C++” 3. Direct graphs and Binary Trees. Molluzzo and F. 3.oriented programming with C++” 2. 1989 3. McGraw Hill. Algebraic structures. Exception Handling. Business Statistics. reprinted 1997) ISBN 0-8833-9407
2ND YEAR 1ST SEMESTER
CSE-211 Object Oriented Programming
3 hours in a week.5 Cr. Graph and trees. Multi-threaded Programming. An introduction to Statistics. Boolean Algebra. Lattices. Discrete Mathematics and Its Applications.Buckley( Waveland Press. Inheritance: Extending classes. Mostafa. 2. Functions. Herbert Schildt “ Teach Yourself C++ “
CSE-212 Object Oriented Programming Language Practical
3 hours in a week. Mathematical reasoning and program techniques. Propositional Calculus. Nicodemi.H. Counting and countability. permutation groups. Constructors and Destructors. C. Laboratory works based on CSE-211
21
. Herbert Schildt “Turbo C++. Reference Books: 1. K. The complete Reference” 4. Theories with induction. 1. Beginning with C++. Rosen.00 Cr. Tokens. Nurul Islam. comparison between java and c++.

Virtual base class. Dynamic Loading. Paging. Linux Process Synchronization: Background Process Synchronization . Silberschatz. process scheduling models: ex-windows 2000. virtual machines. string). Different Page. Scheduling algorithms. Dynamic Linking and Shared Libraries. Logical vs Physical Address Space. Basic C++ input and output statements. Protected members). File Access Methods.
CSE-213 Operating System
3 hours in a week. Recovery from Dead lock Memory management: Background: Address binding. Page-Fault Frequency File Concept: File Attributes. Least-square curve fitting. Mainframe. Classes and Objects (Built-in and user-defined) (private. interprocesses communication. system calls. Methods for handling Deadlock. File processing(Create. File Sharing. system programs. multiprocessor Systems. Swapping. File Operations. Page Replacement. Communication in client-server system.…). Contiguous Memory Allocation. Directory Structure. dispatcher. Some problems on Numerical Analysis (Solution of Linear equation. OS services. desktop systems. Backup and Restore Log-Structure File System. Development of Integrated software using multiple C++ feature. computing environments OS Structures: System components. OS Synchronization . File Structure.Atomic transaction Deadlocks: System model.Review of C Programming. operation on processes. Recovery: Consistency Checking. Dead Lock characterization. CPU-I/O bust cycle. Allocation Methods. reference. Deadlock Avoidance. Directory Implementation. Iterative method of root finding. Polymorphism.critical section problem. etc. system structure. distributed systems. write and update files sequential access and random access file processing). Galvin.). system design and implementation Processes: Process concept. Process Creation. Overlays. scheduling criteria. Introduction: Definition OS. sixth Edition. Process control block. Peterson. Process scheduling.00 Cr. preemptive scheduling. Thrashing: Working Set Model. Overview. cooperating Processes. default arguments etc). Public. Operator overloading (Unary. file System Mounting. read. semaphore. Free-Space Management. File Protection File System Implementation: File System Structure. Dead Lock Detection. binary. classical problems of synchronization. multiple-processor scheduling. critical regions. CPU scheduler.
22
. clustered systems. threads. Dynamic binding. Segmentation. Segmentation with paging. Process state. Function Overloading Friend and virtual function. File System Implementation. Functions (Call by Reference. Static data members and member functions. Replacement Algorithms. Use of C++ Editors/ compilers. Different types of inheritance(with access specifiers).algorithm evaluation. Constructor and Destructor (With multiple constructor). Pointers (this. inline function. Operating system Concepts.
Reference Book: 1. File Types. 3. real-time systems. Virtual Memory: Background of Virtually Memory (VM) Demand Paging. Partitions and Mounting Virtual File Systems. CPU scheduling: Basic concepts. real-time scheduling . Arrays of objects and within class. Dynamic and copy constructor. handheld systems.

3. Linear transformation. Widmer. Verify the Operation of Multiplexer.OS. De Morgan’s theorems.B.
23
.OS Concepts. Linear equations. Introductory concept. Hausen. Design Asynchronous Counter. 1. encoder. operations and circuits.Tanenbaum. Digital Systems Principal and Application 2.00 Cr. Design Synchronous Counter. R P Jain. Madnick and J. equality of vectors. combinational logic circuits. OS. multiplexer.Donovon. Verify the Truth Table of S-R. and demultiplexer. triple products and multiple products. Flip flop and related devices. Design Johnson and Ring counter. Morris Mano.2. Vector Algebra: Scalars and vectors. Multiplication of vectors by scalars. Similarity transformations. Boolean algebra. Prentice Hall 4. number systems and codes. Asynchronous and synchronous counters and their applications.50 Cr. S. logic gates and their truth tables. karnaugh map method. race around problems.Prentice Hall 3.00 Cr. scalar and vector product of two vectors and their geometrical interpretations. Tocci & Neal S. Equivalence. Theory of Matrices: Types of matrices (Creditary. William I. hermitian.). 3. digital arithmetic. Prepare Different Type Shift Resister and Check Its Operation. Determinant of a square matrix. Laboratory works based on CSE-214 Minimize and Implementation of Boolean Functions Using Logic Gates. symmetric etc. P. Ronald J.A. A/D converter circuitry. An Engineering Approach to Digital Design 4. Verify the Truth Table of J-K. Adjoint and inverse of a square matrix. Design Ripple Counter. decoder.S. The characteristic roots and the characteristic equation of a matrix. MSI logic circuits. Design Half Subtractor and Full Subtractor. M. McGraw Hill
CSE-214 Digital Logic Design
3 hours in a week. D Flip-Flop. Verify the Operation of D/A and A/D Converter. liner dependence and independence of vectors. Verify the Operation of Encoder and Decoder. Design Half Adder and Full Adder. interfacing with analog world: D/A converter circuitry.
CSE-216 Mathematics for CSE
3 hours in a week. Addition and subtraction of vectors. Digital Logic and Computer Design
CSE-215 Digital Logic Design Practical
3 hours in a week. Reference Books: 1. Modern Digital Electronics 3. Fletcher. De-Multiplexer. T.

Transistors for monolithic circuits. Epitaxial Growth. 3. surface and volume integrals. sufficient conditions for existence of Laplace transforms. Vector analysis. Semiconductor Diode. Common Collector Configuration. Limits of Operation DC Biasing – BJTs: Operating Point. Periodic function. Wien – Bridge Oscillator. Ideal Diode. Fixed Biased Circuit. Photodetectors Integrated Circuits: Integrated-circuit technology. Entrinsic Materials-nType and p. Miscellaneous Bias Configuration. divergence and curl of point functions. Practical Op-amp Circuit. Transistor Amplifying Action. Stoke’s theorem.00 Cr. The unit step function. Enhancement Type MOSFET FET Biasing: Fixed – Biased Configuration. Op-amp Basics. Vasishtha. Op-amp Specifications-DC Offset Parameters. Common Emitter Configuration. Energy levels. Clampers. Full Wave Rectification. feedback Connection Type.R. Common-Base Configuration. Partial fraction. The Hybrid Equivalent Model. Instrumentations Circuit. Gauss’s theorem. Green’s theorem. Diode Application: Sinusoidal Inputs: Half Wave Rectification. Feedback Amplifier – Phase and Frequency Consideration. Gradient. Some special theorems on Laplace transforms. Semiconductor Diodes: Semiconductor Materials. Phase-Shift Oscillator. Transition and Diffusion Capacitance. Solutions of differential equations by Laplace transforms. Fourier transforms and their uses in solving boundary value problems of wave equations. various formulae. Diffusion of Impurities.Divider Bias. Practical Feedback Circuit. Op-amp Unit Specifications Op-amp Applications: Voltage Summing.Bias Configuration. Bias Stabilization Field Effect Transistor (FET): Construction And Characteristics of JEFT Transfer Characteristics. Md. Voltage . Inverse Laplace transforms. Laplace transforms of derivatives. Depletion Type MOSFET. Diode Equivalent Circuit. Tunnel diode. DC Bias with Voltage Feedback. 24
. LED Bipolar Junction Transistor (BJT):Transistor Construction. Integrated resistors. Active filters Feedback and Oscillator Circuits: Feedback Concepts. Transistor Operation. Op-amp Specifications-Frequency Parameters. Khosh Mohammad. Self . 2. Clippers. A. Voltage Buffer. Masking and Etching. Crystal Oscillator Other semi-conductor devices: Thermistors. Graphical Determination of h-parameters Operational Amplifiers: Differential and Common-Mode Operation. Monolithic diodes. integrated capacitors and inductors. Zener Diode. Definition of line. Matrices.Vector calculus: Differentiations and integration of vectors together with elementary applications. Evaluation of improper integrals. Laplace Transform: Definition. Reference Books: 1. Mathematical Methods. LED & GUNN diode. Fourier Integral. Fourier Analysis: Real and Complex form of Fourier series. Voltage – Divider Biasing BJT Transistor Modeling: Amplification in the Ac Domain. Laplace transforms of some elementary functions. Abdur Rahman.
CSE-217 Electronic Devices and Circuits
3 hours in a week. Finite transform. Oscillator Operation.Type. 3. Basic monolithic integrated circuits.

cash basis of Accounting. bank reconciliation statement. Owner’s equity statement . principles of Accounting information systems. the trial balance. The Recording Process : Business transactions. Accounting Information System : Basic concepts. the journal and the ledger. the account. Sixth Edition 2. Cash flow statement. Rectification of errors before preparation of trial balance. various images of Accounting. the rules of debit and credit. Types of Errors. Laboratory works based on CSE-217 I-V Characteristics of diode. Rectification of Errors : Meaning. its role and functions.00 Cr. after preparation of financial statements and errors detected in the next accounting year. 3. preparation of classified income statement and the balance sheet. Albert Paul Malvino. Abraham Bell. revenues (income) and expenses. subsidiary ledgers and special journals. ethical issues. 1. relationship of Accounting with other disciplines. petty cash funds.50 Cr. the accounting profession. the bank checking account. users of Accounting information. Introduction : Definition of Accounting. preparing the adjusted trial balance. recording of merchandising purchases and sales under perpetual and periodic inventory systems. Control of Cash : Internal control. objects. generally accepted accounting principles. I-V characteristic of Zener diode. Common-Emitter Configuration (CE). merchandising transactions. preparing and posting of closing entries. Worksheet : Meaning. Input and Output Characteristics of BJT: Common-Base Configuration(CB). distinction between Bookkeeping and Accounting. The Adjustment Process : Accounting period. Classified balance sheet. controlling cash. the accounting equation. types of adjusting entries. Accounting for Merchandising Operations : Merchandising operations. mechanized accounting systems. rules for the preparation of worksheet and preparation of worksheet – 8-column and 10-column. Electronic Devices And Circuit
CSE-218 Electronic Devices and Circuits Practical
3 hours in a week. developing an Accounting system. Common-Collector Configuration (CC). history of Accounting.Reference Books: 1. Robert Boylestad and Louis Nashelsky. after preparation of trial balance. nature. accrual vs. Electronic Device And Circuit Theory. Reference Books :
25
.
CSE-219 Basic Accounting
3 hours in a week. steps in the recording process. Electronic And Circuits 3. Preparation of Financial Statements : Single and multiple-step income statements.

Techniques for Graphs Backtracking: General method. 1. Quick sort and Heap sort. Optimal Binary search Tree.
CSE-223 Database Management System
26
. the traveling salesperson problem. Single Source Shortest path. The Greedy method: General method. Greedy Method: Knapsack problem. 2. Graph coloring problem. Fundamentals of Computer Algorithm. Binary Search. 0/1 kanpsack problem. Sartaj Sahni 2. Hafiz Uddin. Selection. summations. finding the maximum and minimum. 3. Robert L. recurrences. How to Solve it by Computer. Latest edition. Divide and Conquer: General method. Finding the Maximum and Minimum.5 Cr. Graph Coloring Branch and Bound: The method.00 Cr. Basic Accounting (English version). Multistage Graphs. Harman. Minimum cost spanning trees. Data Structure & Programming Design. mathematical foundation of algorithm. Dynamic Programming: All pair shortest path. Traveling salesperson. Quick Sort. Knapsack problem. 3. 0/1 Knapsack problem. Single Source Shortest path. Sum of subsets. R.Dromey. Laboratory works based on CSE-221 Divide and conquer: Binary Search. All pair’s shortest paths. Minimum cost spanning tree. The Angel Publications. Dynamic programming: General method. Accounting A business perspective.Kruse. Latest edition. Md. Knapsack problem. design of algorithm. sets etc.
CSE-222 Algorithm Design Practical
3 hours in a week. Performance measurement using time Function : quick sort and marge sort. asymptotic notations.1. Traveling salesperson
Reference books:
1.G. The 8-Queens problem. marge sort and Bubble sort.
2ND YEAR 2ND SEMESTER
CSE-221 Algorithm Design
3 hours in a week. Single source shortest path. Basic Traversal & Search technique: Techniques for Binary trees. Introduction to algorithm: Analysis of algorithm. Prim’s algorithm. Backtracking: the 8 Queens Problem. Edwards and Maher.

00 Cr. Bus Interconnection. Bit-slice processor Interconnection structures Reference Books: 1. CISC characteristics.00 Cr.
CSE-225 Computer Organization and Architecture
3 hours in a week. Reference Book: 1. Computer System: System Buses. Report design. Centralized systems. Addressing modes. DML. Micro-operation. Primary index. Cache memory. Addition and Subtraction. Existence Dependencies. Relational model and its language (Relational algebra and SQL). Indexing: Basic concept.Korth
CSE-224 Database Management System Practical
3 hours in a week. Data models: Relational model. Transaction management. Database model: Entity-Relationship model. Different PL/SQL problems. Division Algorithms. Computer Arithmetic: Different types of data representation. Auxiliary memory. Ordered index. Parallel Databases. 1. Central Processing Unit(CPU): ALU. Laboratory works based on CSE-223
Design and Create database. Conventional file processing. Database design: Decomposition. Computer Organisation and Architecture
27
. Input-Output Organization: Input-Output Interfaces.5 Cr.3 hours in a week. Storage management. Network model. Attributes. Associative memory. Dense index and Sparse index. Components. Functional Dependencies. Multiplication Algorithms. Secondary index.formats. Database languages: DDL. Memory Organization: Main memory. Database Administrator. Mapping Cardinalities. Introduction: Database system concept. CPU structure and Functions Control Unit: Control Unit operation. Pipelining. cycle. Data transfer. Weak entity set & Strong entity set. Interrupts. RISC characteristics. Integrity Constraints: Domain constraints. Referential constraints. Hierarchical model. Design MASTER FORM with menus. Instruction sets. Array processor. Insert/Delete records in each table. Types of Instruction. Hardwired Implementation.Sudarshan Henry F. 3. Multiprocessors. Direct Memory Access (DMA). William Stallings. Vector processing. 3. Object-oriented Databases. Fundamentals of parallel processing: Parallel processing. Input-Output channel. Database users. Data Fragmentation. Control of processor. Memory management requirements and hardware. Normalization. Distributed Databases. View of data: Data abstraction. Functions. Purpose of Database system. Overall system structure. Multilevel index. timing etc. Database System Concepts (4th Edition) -Abraham Silberschatz S. Introduction: Organisation and Architecture. Do the different queries. Virtual memory.

CRC Method. V.4 interface standard. concepts and measurements of various elasticitis of demand and supply. 2. coaxial cable. variable factors of production. Transmission impairments. Data Communication and Networking. electromagnetic spectrum. Datagram. Data Encoding: Digital data and digital signaling. Transmission media. infra red.Vranesic and S. total average and marginal product. Rafiquzzaman. Virtual Circuit. market equilibrium and shifts of market equilibrium. cellular and satellite. law of diminishing marginal utility. twisted pair. NRZL. Behrouz A. fiber optics. Theory of production: Production function. Circuit switching network.
GED-227 Economics
3 hours in a week. The basic problems of economic organization. Reference Books: 1. Data and Computer Communication. normative economics.
CSE-226 Data Communications
3 hours in a week. cardinal & ordinal utility. microwave.P.00 Cr. RS232( or EIA 232D). W Stallings. Supply and demand: Concepts of supply and demand and their determinants. Bipolar AMI. V2. NRZI. Data Transmission : Analog and digital data. PSK & QPSK and their performance. wireless transmission. HDLC. Positive Vs. Data Link Control: Flow control. PCM Data Communication Techniques: Asynchronous and Synchronous transmission. M. Hamcher. Dr. Z.Zaky. Manchester and differential Manchester encoding. 3. Channel capacity. The theory of consumer behaviour: Utility-total and marginal utility. Introduction: Definition. Digital data and analog signaling. Fundamentals of Computer System Architecture. Introduction: Data Communication networks standards. Statistical Time Division Multiplexing. Error Control(Stop and wait. radio. Spectrum and Bandwidth. Packet switching principles. communication architecture and protocol. Selective Reject ARQ). ASK. FSK.2. Go back N ARQ. Other data link control protocols. Circuit switching concepts.parity and CRC. short run and long run. Synchronous Time Division Multiplexing. Multiplexing: Frequency Division Multiplexing. Forouzan. 3. Computer Architecture and Organisation 4. fixed Vs. Switching network. technological change. Circuit Switching & Packet Switching: Space Division and Time Division switching.
28
. Error detection. Hayes. micro economics and macro economics. the law of diminishing returns. returns to scale. Computer Organisation 3. Analog data and digital signaling.00 Cr. J. Production possibility frontier.

Present value Theorem. aggregate demand and aggregate supply. Finite automata. Swenburg & Mc Dougall: Macro-economics. envelope curves. implicit and opportunity cost. short & long run equilibrium of firm and industry. Reference Books: 1.
3RD YEAR 1ST SEMESTER
CSE-311 Theory of Computation
3 hours in a week. 4. personal income. Investment Function: Determinants of investment. total average and marginal costs. resource allocation and economic efficiency. Adamek. Market: Perfect competition and monopoly.00 Cr. W. 2. Turing Machines: basic machines. equivalence and conversion of deterministic and nondeterministic finite automata. different concepts of national income.
CSE-312 Microprocessor and Assembly Language
3 hours in a week. profit maximizing conditions. Consumption and saving function: concepts of MPC. : Economics. configuration. MPS. GDP. combining Turing machines. 29
. NNP. Net economic welfare (NEW). 6. APS.Theory of cost and revenues: Short and long run cost functions. 3. Macro economic overview: Fundamental concepts of macroeconomic. theory of multiplier and accelerator. 3. MEI. Samuelson & Nordhaus. 5. APC. Context free grammars. National income accounting: circular flow of income. Bilsa: microeconomic theory. Eugene Diulio: Macro-economics. 8. Dornburg & Mc Dougall: Macro-economics.GNP. concepts of MEC. The CPI & the GDP Deflator. deterministic finite automata nondeterministic finite automata. real and nominal GDP. shut down condition. Languages and Computations. Automata and Algebras. Leftwitch: the price System & Resurce Allocation. Reference Books: 1.00 Cr. The Classical and Keynesian theory: Determination of income and employment. 3. NI at factor price. Introduction to Automata theory. fixed and variable costs. 7. market price and constant price. Language theory. Context free languages. profit maximization. disposable income. computing with Turing Machines. 2. Koutsoyiannis: Moderm Micro-economics. pushdown automata. Inflationary and deflationary gaps and measures to bridge the gap. the methods and problems of computing national income. marginal product and the least cost rule. Domwnick Salvatory: Micro-economics.Short run and long run view-Kuznet’s puzzle. Undecidability. Hopcroft and Ullman.

Assembly Language Programming. Convert a lowercase letter to an uppercase letter and vice versa. Alpha processor. M.Liu and G. otherwise terminate. compare them and display the smaller one and vice versa. read/write cycle. Display it. string instruction. Advanced microprocessors: Internal architecture. theory of power series method. If a character is “y” or “Y”. reentrant and recursive procedure. register base and accumulator based microprocessor. 1987 2. Complex plane. Legendre’s equation. Ginson.Rafiquzzaman. Microprocessors and Interfacing. macro. Assembly Language Programming. Assembly Language Programming. D. interrupt controller. Detmer 3. an overview of Intel 80186. Marut 2.5 Cr. Microprocessors and Microprocessor based system design 3.Programming with 8086 instruction. Assembly Language: . Pentium microprocessors.00 Cr. Analytic function.V Hall. 3. Orthogonal function.Riemann
30
. RISC processor.A. Techniques for the IBM PC. 80386. internal architecture of microprocessor: 8085. maximum/ minimum mode. programmable logic devices. Input two numbers. Display all alphabetic characters. conditional and unconditional jump. Polar form of complex numbers. Coprocessor. Derivative. Series Solutions of Differential Equation: P ower series method.Microprocessors: Evolution of microprocessors. Miller
CSE-314 Engineering Mathematics
3 hours in a week. memory bank. Complex Numbers and function: Complex numbers. main memory array design. pin configuration and function. powers and roots. simple arithmetic operation. DMA. Richard C. instruction set. memory management. Calculate following operation: if x>y then (M/N) +P else (M-N)*P . 80486. perform bubble sort.(IF-ELSE Statement). stacks operation. 1. Cauchy. Strum – Liouville Problems. Find the largest element from an array and vice versa. Calculate the following expression=M+N-P+1(Using Subroutine). protection. Orthogonal Eigenfunction Expansions. Legendre’s polynomials. Convert hexadecimal number to binary equivalent. Accept a string from keyboard and display the string in reverse order. 8086. Calculate sum and average of few numbers. Book References: 1. Vanugopal 4. procedure. Bessel’s equation and Bessel’s functions. input/ Out techniques. interrupt and interrupt handling. addressing mode. 80286. Microcomputer system:8086/8088 family
CSE-313 Assembly Language Practical
3 hours in a week. instruction format. Y. Laboratory works based on CSE-312 Display message (n) times in different line. McGrow-Hill. Alan R. display first ten numbers by Fibonacci Series. memory management concepts. Book References:
1.

deviance. socialism. Trigonometric functions. 3. Singularities and Zeros.
GED-316 Technical Writing & Communications
3 hours in a week. population and resources. Young. nature. Cauchy’s integral theorem. Power series. function given by power series. Society and population: human migration. factors in social change.00 Cr. Industrial revolution: The growth of capitalism. Cauchy’s integral formula. 2. Technology and society: effects of technological factors on social life. Social change: change evolution-progress-development. Taylor series: Sequence. Ogburn and Nimkoff. culture content (material and non-material). marriage. state and education. Linear fractional transformational Complex Integration: Line integral in the complex plane. group. Exponential function. 5. A Hand book of sociology. Social stratification: main types of social stratification. Laurent Series. Hyperbolic functions. Optional.
31
.Dictionary of sociology and related sciences. taboo-low. Evaluation of real integrals. youth unrest. Social evaluation: stages in the evolution of human civilization. derivatives of analytic functions. features and social consequences. juvenile delinquency. cultural lag. Henry Pratt. community. stages of social research. Social organization: family. Giddings F. functions of family in modern industrial society. association. Taylor series and maclaurin series. power series. Residue Integration: Laurent Series. Advanced Engineering Mathematics
GED-315 Sociology
3 hours in a week. Geometry of analytical functions: Conformal mapping. Series. Book References: 1. Erwin Kreyszig.equations. Convergence tests. Primary concepts of sociology: society.H Elements of sociology. Infinity. institution. Sociology and scientific approaches: methods of social research. 3.00 Cr. Sociological perspective: definition. characteristics. Metta Spencer and Alex Inkeles.
Book References:
1. social stratification and social mobility Social control: religion and morality. Residue Integration method. Culture: definition. 4.slavery-caste and social class and status. scope and importance of sociology. Fairchild Little Field. forms and functions of family. culture and civilization. functions of marriage. Foundation of modern sociology.V Scientific social survey and research. custom and public opinion. 3. forms of marriage. uniform convergence. Some current social problems: crime. P.

Writing for effect: Business etiquette and the need for effect conversational style.
3RD YEAR 2ND SEMESTER CSE-321 Software Engineering
3 hours in a week. strategy. Writing the application letter. youviewpoint. Data structure. Requirements Analysis Fundamentals: Analysis principle. Data structureoriented design: Logical construction of programs and systems. Coding style: Code documentation. 3. Modern devices in communication/ electronic communication/ Technology in modern communication: meaning.00 Cr. Constructing the electronic resume. Data Flow-oriented analysis methods. abstraction. Design fundamentals: S/W architecture. role. Lesiker. coherence. Long. the prefatory parts. The classical life cycle. Generic view of software engineering. Refused request. Scope. Routine Inquiries. Preparing the application documents. collaborative report writing. steps. suggestion for selecting words. teleconferencing. media. Software Prototyping Specification. Transaction analysis. Software reliability. interpreting the findings. Modularity. feedback. Boehm's spiral model. Flatley. 3. Pettit. the role of emphasis. Design process considerations. Data structured systems development. Methods. multimedia. Business communication system and application. Organizing the repot information. Handling the interview. suggestion for selecting words. Raymond V. Formal reports: Organizing and content of the longer report. Structured and object oriented analysis. Indirectness in Bad-News Message: Situations report indirectness. The product and the process model. suggestion for nondiscriminatory writing. e-mail. Data flow-oriented Design. disadvantage. Input/output. The processes of human communication: Definition. the report proper. 32
. Data declaration. and objective. statement construction. Internet. 2. Adaptation and the selection of words: the basics need for adaptation. advantage. Strategies in the job search process: the job search. gathering the information needed. structural coherence helper. writing the report. Construction the traditional resume. Procedural design. Design concepts. Software Engineering Paradigms: Definition of S/W Eng. function. Bain computer.Communication in the workplace: Definition. Lesiker. Prototyping fourth generation technique. Object-oriented design. Directness in Good news: the process of writing. Business Communication. Reference Books: 1. suggestion for nondiscriminatory writing. S/W procedure. Software Design Fundamentals: Design process. Basics of Report writing: Defining reports. Effective modular design. Measurement and Matrices. Top-down and bottom-up design. Program structure. Construction of clear sentences and paragraph: The basic need for adaptation. Requirement Analysis Methodologies. Betty & Key. determining the factors. determining the report purpose. Transform analysis. Real-time Design. Adjustment refusal. Feasibility Study. accent on positive language courtesy. principles. other indirect messages..

5 Cr.
33
. Detailed error analysis of several techniques. The COCOMO model. Software Management and Maintenance Technique: Maintenance process. Black Box testing. techniques for special classes of matrices. Validation testing. Software reuse. Direct methods for systems of linear equations: Gaussian Elimination interpreted as matrix factorization. Software Engineering by Martin L. The art of debugging. Software Engineering by Roger S. 1. pivoting strategies. Loop testing. Maintenance cost. Computer Aided Software Engineering (CASE) tool
Reference Books: 1. Testing fundamentals & strategies. McCall’s quality factor. Shooman
CSE-322 Software Engineering Practical
3 hours in a week. Adams-Bashforth method. System testing. It is further mentioned that a student can propose any other system. predictor-corrector scheme. 1. Verification and validation. Root finding for non linear equations. System documentation. Change management. Laboratory works based on CSE-321 A student has to perform one of the following computer based systems: Student information system. their analysis via matrix and vector norms. Software re-engineering. stiffness. least-squares curve flitting techniques. Numerical methods for initial value problems for ordinary differential equations. Defect testing. Multi-step methods. Software cost estimation technique. Numerical solution of ordinary differential equation: Euler method. Numerical solution of simultaneous linear equation: matrix operations. interpolation polynomials.Software Testing Techniques and Strategies: Software Testing method. Iterative techniques for systems of linear equations: Jacobi and Gauss. Algorithmic cost modeling. Runge-Kutta methods. Library management system. Basis path testing. Employee information system. White box testing. Admission processing system. the spectral radius of a matrix Eigenvalue problems for matrices illustrative programming projects and use of computer to implement the projects. Adams-Moulton. Numerical solution of polynomials: general algebraic equation. Software quality assurance & activities. Error estimation and step size control. Result processing system. Pressman 3. which is relevant with this subject/ field. Configuration management & planning.5 Cr. Software Engineering by Lan Sommerville 2. integration.Seidel iteration. Organization for software testing. person & release management.
CSE-323 Numerical Analysis
3 hours in a week. Integration testing. Payroll management system.

Two-dimensional and three-dimensional Graphics Transformation: Geometric Transformations. 4. Engineering and Mathematics. Mathematics of Projection: Perspective projection. Output and Communications: Graphics input.00 Cr. Video: TV screen. CDDA. Introduction to Multimedia Systems: Interactive and non-interactive multimedia. storage. Text conversion. Composite Transformations. Raster Scan CRT. Ellis Horwood. Scan line algorithm. Interface Design and Development Process. MIDI. Co-ordinate Transformations. Encoding. Analog video signal formats. Z-Buffer algorithm. 3. Mathews. Vectorization. Numerical Methods for Computer Science. Coding of real-time video. Side Effects of Scan Conversion. Types and applications. Image Capture. I. Numerical Analysis: A practical approach. Numerical methods in Engineering and applies Science. 1987. CD-I. 19878. 2.G. Geometric representations: Wire frame model.H.Video capturing technique. video standards. Macmillan. Hypermedia. JPEG.Reference Books: 1. Line. Shrive. Storage for multimedia: Choice of storage. Prentice-Hall. storage. Graphics Input. Multimedia team Reference Books: 1. Common Display devices. Rectangle. Animation Classification and techniques. Jacques and C. Multimedia Project: Project Design concept. Sampling Rate.
34
. Standards for encoding images.
CSE-324 Computer Graphics and Multimedia
3 hours in a week. MPEG-2. Compact Disk specification. J. Region filling. Image compression. Marron. Parallel projection. Two-dimensional and three-dimensional Viewing and Clipping: Viewing Transformations. Judd.J. MPEG-1. Circle. Audio: Audio capture. and Instance Transformation. Storage types. Clipping Algorithms. M. Scan Conversion: Scan converting a Point. Image: Image. B. Digital audio. Numerical Analysis. Communication Devices. Irons and N. temporal media and Non-Temporal media. 1987. Broadcast TV standards. Hidden Surfaces: Depth comparisons. Monitor. Foley. Sampling Size. Computer graphics. 1987. Vandam. Hypertext. Interpolation and Approximation. 3. MPC Level 1. Schaum’s Outline series 2. Quick Time. MPC Level 2. Computer graphics principal and practice. Chapman and Hall. Compression methods. Ellipse. The Painter’s algorithm. Media content Design and Development. Arcs. CD-ROM. Curve Design. Video compression.

2 Programming Guide. Analysis of the source Program. Tom David. N. Filling Ellipse Arcs. Reference Books: 35
. optimization of basic block. ambiguity. peephole optimization.5 Cr. Jakie Neider. Computer graphics: a programming approach. 4. back patching. plan of error detection. Multimedia Computers and Communications. Multimedia Magic. Error detection: reporting errors. Storage organization. target machine. symbol table.Gokul. Open GL(r) 1. 6. input buffering. basic block. Construction of Syntax tree L – Attributed definition. 8. Clipping Polygons 2D Transformation. Predictive parsing. Clipping Lines. specification tokens. Dave shriner. 1. Pattern Filling. of the compiler. Code generation: issues in the design of a code generator. Environments and framework. syntactic error. Sessagiri and Aram Akopov. loop optimization. conversion of regular expression to DFA. Filling Polygons. Multimedia Programming Objects. operator precedence parsing. Laboratory works based on CSE-324 Scan Convention Lines.S. operator precedence grammar. finite automaton. A simple one pass compiler: syntax definition. three address code. Clipping Circles and Ellipses. Lexical analysis: the role of the lexical analyzer. Mason woo. the window to View port Transformation Computer Graphics Programming: Open GL. LALR). LR parser (SLR. DAG. Code optimization: Function preserving optimization. code generator algorithm. flow graph. compiler construction tools. Simon J. Boolean expression. Steven and Harrington. Intermediate code generation: Intermediate languages. parse tree. LL1 grammar. Runtime Environment: Activation tree. Scan Converting Circles. CFG. Multimedia in Practice. Thompson’s construction. associativity of operators.
CSE-325 Computer Graphics and Multimedia Practical
3 hours in a week. Filling Rectangles.3. 5. lexical analysis. parameter passing. Top down parsing. Sources of error. Syntax Directed Translation: Syntax Directed Definition. 7. Judith Jeffcoate. Basic parsing technique: Parser Bottom-up parsing. 3. Introduction to compiler: Compiler. dynamic error.
CSE-326 Compiler Design
3 hours in a week. Gibbs.00 Cr. the phases of compiler. Scan Converting Ellipses. Storage allocation strategies. semantic error.

installation-Direct. the process of maintaining information systems. design of physical files and database. data flow diagramming. am. process descriptions. reusable code CASE tools. Jeffery D.have. Analysis: Fundamental principles of systems analysis.go. Lex specification to recognize the identifier. Succeeding as a systems analyst.1. Ullman. Principles of Compiler Design.does. maintenance information system. The systems Development Environment: Introduction. are. 3. Designing distributed systems.00 Cr. Lex specification to recognize float. Alfred V. Lex program to eat up comments. Lex specification to recognize digit. Ravi Sethi. 2. design principles and output design. Techniques and tools.very. be. Compilers. Lex specification to recognize different punctuation symbol. 1. input design. modern methods for determining systems requirements. 3.to. acquiring the techniques of the systems analyst. System development and implementation: program and process design.gently. Visual and emerging development tools.can. 36
.will.simply. decision trees. Lex specification to recognize the following words as different parts of speech: is. methods of errors checking and testing. parallel single location. phased and planning. traditional methods for determining requirements. Lex specification to recognize for the positive and negative integer and float number. Decision tables. Jeffery D.could. Data dictionary.were. evolution and future of development tools. was. visual development tools. Compiler Design in C. managing maintenance.from.been.would. Aho. Lex specification to recognize integer.if. designing databases.go. being. am. Lex program to recognize different types of operator. Parsing any string using a CFG
CSE-328 System Analysis and Design
3 hours in a week.then. your role and other organizational responsibilities in systems development types of information systems and systems development. Verification and validation.quickly.were. Ullman.did. Converting Regular Grammar into Regular expression.has. designing the internals. Aho. are . The design phase: the logical representation of data. structuring system requirements. Alfred V. automated tools for systems development prototyping.object oriented development tools. Lex specification to recognize different keyword. documentation the system-user document.
CSE-327 Compiler Design Practical
3 hours in a week. Checking the validity of an arithmetic expression using CFG. types of maintenance. conceptual data modeling.behind. Laboratory works based on CSE-326 Lex specification to recognize the following verb: is. the preliminary investigation phase.J Holub.program and process. the process of maintaining information systems.should. feasibility study. programmer document and operational document. designing forms and reports.A modern approach to systems analysis and design.between. Lex specification to recognize real numbers. Lex program to find out user name. determining systems requirements. System maintenance: documentation.had. A.5 Cr.do. Developing information systems and the systems development life cycle.Process modeling. logic modeling with structured English.

W. West Publishing Company. role of frame relay. Transport Layer: The transport service. Application Adoptions Layer(AAL). CSMA/CD Protocol. Information System: A Management Perspective. Jefrey A.Mobile telephony and Satellite Networks.ATM layers. 3. Collision-Free protocols.
4th YEAR 1st SEMESTER
CSE-411 Computer Network
3 hours in a week. Optical Fiber Network: SONET and SDH. Behrouz & Forouzen.virtual connection. Data Communication & Networking. .Computer Networks. 2001. Shin Yen Wu. mixed network traffic. advantages and disadvantages. Wavelength division multiple access protocols.Reference Books: 1. DNS-Domain Name system.Wireless LANs. Information Systems: Theory and Practice. 2. connection establishment and release. Application Layer: Network security.CDMA Limited contention protocol. Introduction: Basic computer network concept. Medium Access sub-layer: Multiple Access Protocols: ALOHA.00 Cr. Congestion control Algorithms. Electronic Mail. Example networks. cell. frame relay operations. Inter networking. Network structure. Physical layer. physical layer . ATM WANs.25 Networks. Systems Analysis and Design. ATM Network: Packet networks. 1989). 37
. 3. 4. Wireless LAN protocols.
CSE-412 Computer Network Practical
3 hours in a week. Tannenbaum . ATM LANs. Multimedia. asynchronous TDM. data link layer. Hoffer etc all. 5th Edition.frame relay layers. SNMP: Simple Network Management protocol. Network layer in the internet. The internet transport protocols. The World Wide Web. High-speed LANs. OSI Model. Network Layer: Network layer design issues. Network software. Stallings.5 Cr. Bridges. J Burch and G Grundnitski (John Wiley and Sons. 1. 2. virtual circuits. 3rd edition. 3. identifiers. Elements of transport protocols. Frame Relay: Introduction to frame relay. IEEE standard 802 for LANs and MANs. Reference model. Pearson education Asia. DLCIs inside the network. TCP/IP Model. Modern systems analysis & design. Reference Books: 1. IPv4 and introduction to IPv6. 2nd Edition Steven A Benjamin/ Cummings 1996. 1994. X. Routing algorithms. cell networks. Data & Computer Communication. The ATM AAL layer protocols.

CSE-414 Parallel and Distributed Processing
3 hours in a week. Reference Books: 1. 2. apache core active and apache module. FOPL. Back Propagation. Handbook of Artificial Intelligence Vol. Introduction to electronic mail system. Katalopoulos. name based virtual web hosting. Simulated annealing search.
38
. impact of distributed processing on organizations. Shortest Paths Spanning Trees Distributed processing : Overview. Understanding Neural Networks and Fuzzy Logic. Problem Solving by Searching: Blind search. Genetic Algorithm. PL. Caching only DNS server configuration. Barr and Feigenbaum. Hill climbing search. Workefficient. Architecture for parallels processing. hierarchical distributed systems. Learning. DNS server configuration. Neural Network: ANN. Stamations V. use of DNS testing utility. Informed search.Connected Components. Graph Problems. squid proxy server configuration. Introduction to DNS. Parallel Algorithm – Pointer Jumping. WFFs. William Kaufmann Iven Bratko. bi-directional. Programming for Artificial Intelligence. Parallel Processing: Overview. Introduction: What is AI. understanding of different squid tag FTP configuration. architecture.00 Cr. hardware and software issues. Sorting Networks. Configure TCP/IP. IP based virtual web hosting. WINS configuration.Laboratory works based on CSE-411 Overall Concept about network. Depth first. horizontal distributed system. web based mail configuration using open web mail. canonical name implementation. virtual hosting. IMP and POP setup. Stuart Russel & Peter Norvig. testing and debugging.00 Cr. Forms of distributed processing. First-order logic. use of DNS testing utility. email account splitting. apache core active and apache module. Canonical name implementation. Unsupervised. Different protocol and net card. Knowledge: Knowledge representation. apache web server configuration.Function distribution. POP. 4. introduction to electronic mail system. heuristics search. best first. Issues in parallel processing.
CSE-413 Artificial Intelligence and Neural Network
3 hours in a week. depth limited. configuration. 3. web based mail configuration. comparative study of different architectures. configure SMTP. Perceptron. pitfalls in distributed processing. Reinforcement learning. Supervised.Definition. Fuzzy Logic. 3. 3. A * search. testing and debugging and log file analysis. Caching only DNS server configuration. DHCP server/client configuration. Intelligent agents. breadth first. configure to ISP online mail. iterative deepening. I . Artificial Intelligence: A Modern Approach.Importance.classifications.

Serial and line printing. 2. Voting Protocol. Sinha Distributed Operating System. Storage devices: Floppy disk. Display-Alphanumeric and multiplexed LED (Interfacing with IC 7447). database management. conflict analysis. Timing and frequencies.K. Plotters. RS-232 C serial data standard.Tanenbaum Algorithm. Optical mark reader (OMR).0 Cr. The GPIB.Strategy. USART(IC 8251A) word format. Incremental Encoder. Laser printing.P. cost an benefit analysis. Printers: Impact printers. Passive and active matrix. Advanced Computer Architecture. Electroluminescent display. 4. IEEE 488 Bus. centralization Vs decentralization. Timing considerations. control of complicity. Color printing. Application of PPI. multiple copies data. Communication system. Null Modem configuration. Data Communication and Network: Introduction to asynchronous serial data communication. CRT controller ICs. problem of incompatibility. X-lat. Optical motor shaft encoder. Reference Books: 1. Microprocessor and Interfacing by Andrew Hall 2. Noise considerations. PIC.Distributed data. 1.Hwang Kai Distributed Operating System. Optical Character Reader (OCR). Stepper motor. Design of distributed data. 3. 3. PCI etc. Bar code reader. LCD technologies.Coreman
CSE-415 Peripheral and Interfacing
3 hours in a week. Relay. Computer Peripherals (Part B) by Barry Wilkinson
CSE-416 Peripheral and Interfacing Practical
2 hours in a week. System overhead (DMA and Programmed data transfer). magnetic tape storage. LCD reliability. location of data. DMAC. HPIB. Fault Tolerance – Forward and Backward Error Recovery.strategies for distributed data processing. Digitizer: Reading technique. Laboratory works based on CSE-415
39
. distributed database and applications. Floppy disk controller (IC 8272) . Interfacing a Microprocessor to keyboards. Basic CRT operations. Capacitive Electrostatic scanning digitizer. Operation based and State Based Approach.Distributed data. Display devices: CRT. Compact disk. Reference Books: 1. Redundancy Approaches. Tape Reader. Interfacing techniques: Interfacing for Memory. Magnetic hard disk and controller. Ink-Jet printing. Digital Interfacing: Programmable parallel ports and handshake input/output (IC 8255). Commit Protocols.00 Cr. Modern data-entry devices: Scanners overview. Parallel and Serial Interfacing devices. I/O ports and Control.

Digital Signal Processing. Conversion of Transfer Functions from Continuous to Discrete Time. Power Series Expansion. Finite Precision Effects. Communicate between two Computers using serial ports.
CSE-417 Digital Signal Processing
3 hours in a week. Discrete Time Systems. Inverse discrete Fourier transformation.Understand SDK 86 board. Discrete Fourier transform: Fourier series. Ifeachor. write and execute a program in an SDK 86. Digital Signal Processing. Choosing between FIR and IIR Filters: Digital Filter Design Steps. Implementation of Discrete-Time Systems: Introduction. Understand the basic characteristics of IC 8255. Drive a single 7 segment LED display with 7447. Keys of DSP operations: Convolution. Properties of z-transform. one dimensional Fourier transforms. basic wiener filter theory. Ambiguity in Digital signals. John R. Complex Convolution Theorem and Parseval's Relation. Proakis. Types of Digital Filters: FIR and IIR. Emmanuel C. Connections and Cabling. Transposed Forms. Algorithms. Dimitris G. the basic LMS adaptive algorithm. The Z-Transform :Introduction to z-Transform. Barrie W. Matrix Representation of Digital Networks. Understand RS-232 standard. Application areas for DSP. recursive least square algorithm. Adaptive digital filters: concepts of adaptive filtering. Fast Fourier Transform (FFT) and its algorithm. John G. Communicate between two Computers using parallel ports (Printer Port). Basic Structures of FIR Systems.00 Cr. Modulation. General Results of z-transform. Observe and manipulate Null modem Configuration. Design of FIR Filters: Design of FIR Filters by Windowing. Inverse zTransform: Partial Fraction Expansion. Discrete Time Signals. 3. Cascade forms. discrete Fourier Transform (DFT) and its properties. Schafer. Sampling and Analog-to-Digital Conversion. Basic Structures of IIR Systems: Direct Form. System Design: Methodology & Implementation Methodology. Reference books: 1. Buck. Correlation. 3. Comparison of inverse z-transform method. Parallel Form. Dicrete-Time signal Processing. Discrete Transformation. and applications. Alan V. Introduction to Digital Signal Processing (DSP): Introduction. Frequency Transformations of Low pass Filters. Manolakis. jervis. Design of Optimum Equiripple Linear-Phase FIR Filters. Contour Integration. 2. Ronald W.
40
. Digital Filtering. Digital Signal Processing – Principles. Oppenheim. Design of Digital Filters: Introduction to Digital Filters. Design of IIR Filters: Classical Continuous-Time Low-Pass Filter Approximations. Block Diagram and Signal Flow Graph Representation of Digital Networks.

creating custom text styles using CSS. Using Simple scripts on different mouse events. HTML and introduction to HTML.Ganesh Prasad. basic HTML tags. Integrating PHP and MySQL. different web problems like Hoaxes. submit/reset Button. time. structure of a website. Basic concepts of DHTML.Using Different HTML tags to format Body contents.5 Cr. 2. 3. Brief history of Mark-up languages.
41
. Java Scripts and CSS components. using/calling CSS functions in forms . Laboratory works based on CSE-421 1. links and Image array. form and form components. WWW.date etc.<Body> <Head/Title>. Basic Concepts of Java applet . Client Server architecture. Contact/Feed back Forms (Text box. Wankyu Choi. Web application development.Using java Scripts to design multi-state image links. common problems and trouble shooting. Viruses and Pop-ups etc. Designing a simple HTML Document to show text (Introduction to <HTML>. 1. pull. CSS/Java Script. Reference Book: 1.Allan Kent. back ground sounds. basic concepts of CSS. Web Design in a Nutshell (O’RELLY) Jennifer Niederst
CSE-422 Web Engineering Practical
3 hours in a week. embedding dynamic elements with Java Scripts. Creating Web Pages with HTML Simplified Sherry Willard Kinkoph 5.00 Cr. popular websites and their speciality. Surid Sharkar. Web browser and Web servers. How it uses HTML. 3. Powell 4. basic programming concepts and its dynamism. Web Design Complete Reference by Thomas A. Introduction to Java scripts. Texts. Text fields. Session. Introduction to Web application technology. CSS handlers. Beginning Php 4 (Programmer to Programmer).4TH YEAR 2ND SEMESTER
CSE-421 Web Engineering
3 hours in a week. Animations. Changing page Title. advanced custom tags. CSS. Supported platforms. redirection between Web pages.changing links.down menus. PHP. Spyware. Data Validation. security. Simple PHP scripts to write/read inputs in forms and using in Dynamic forms. building simple applets with images. basic concepts static and dynamic web sectors.Chris Ullman. basic concepts. <Meta Content>. supported platform and browsers. inserting images. Using Basic Java Scripts functions like writeline. text and links. Using PHP Forms to manipulate data in the database. Chris Lea. adding links to different pages. GIF. pull-down menu.

4. Hand book of Applied Cryptography. certificate authotity and public key infrastructure. digital immune system and UNIX password scheme.00 Cr. cryptanalysis. 11. 3. inserting Images and back ground sounds and using Images as Link. DiffieHellman key exchange. Cryptography and cryptographic algorithms: Traditional cryptographic algorithms: traditional cryptography. This is an elective course the student should choose one of the elective course in consultation with head of the department.
CSE-423 Computer and Network Security
3 hours in a week. secure socket layer and transport layer security. Digital signatures and digital signature standard. 12.
42
. message authentication codes. forms. checkbox. Email security. Cryptography and Network Security. PGP and S/MIME. do-while). management. 5. Key management. Switch-case.509 authentication service.math. 6. for. PHP and My-SQL having forms and also a flexible navigation menu which has links to all available section on the site. Vanstone. Cryptography and network security: Data-origin authentication and data integrity.Using page frames and mousover links and implementing them in a HTML document. by A. cryptography hash functions. PHP 4/5 and integrating into windows platform. Security associations. 1996 ( www. Project: Design and develop a Complete Dynamic website with HTML. creating PHP documents with simple tags. secure hash algorithm.Using CSS to apply formatting text.Text alignment in table.2. Introduction to Form elements(textbox. 3.Using text Links to navigate between different pages.uwaterloo. key management. Key distribution.Inserting data into My-SQL database using PHP forms. Menezes.van Oorschot. Private-key (symmetric-key) and public-key (asymmetric-key) cryptographic algorithms. while.00 Cr. CRC press. IP Security. William Stallings. 3. installing My-SQL and connection between PHP and My-SQL. Kerberos and X. combo box etc) and designing simple Feedback/Contact forms.Installing Apache. tables and link styles. authentication header and ESP. secure electronic transactions (SET). P. 10. and S. RSA and other public key cryptosystems. DES and block cipher modes. Elliptic curve cryptography. eb security considerations.cacr. Cryptography for antivirus software and password management: generic decryption.Using different control statements in Java Scripts to execute simple mathematical expressions(if-else.ca/hac)
CSE-42X Elective Course
3 hours in a week. Reference Book: 1.Using Java Scripts to to create web pages containing custom Welcome message(Date-time). 2. advanced encryption standard.

CSE.)
12 hours in a week. Relationship to human visual system.00 Cr. Coding redundancy. the RGB color model The CMY. 2. Woods. Digital Image Fundamentals: Image formation in the eye. Some basic relationships between pixels Neighbors of a pixel. Basics of spatial filtering. connectivity. Reliability aspects of VLSI design. Basics of full-color transformation. Fundamentals of Digital Image Processing. Color models.
CSE-424 Image Processing
3 hours in a week. Multiple Valued VLSI circuit. VLSI Design: Design and analysis techniques for VLSI circuits. Design and operation of large fan out and fan in circuits. M A Sid-Ahmed. parallel processing.00 Cr. Graph based VLSI Design. Color Image processing: Color fundamentals. Digital Image Processing. Image compression models. Image sensing and acquisition. Jain. The channel encoder and decoder. Adjacency. Region based segmentation. Boundary Detection. Noise models. Thresholding. clocking methodologies. Image quantization. Richard E. log transformation. Special purpose architectures in VLSI layout partitioning and placement routing and wiring in VLSI. region. Image Segmentation: Edge detection. Smoothing spatial filters. A basic image processing system. Image Restoration: A model of the image degradation/ Restoration process. 3. Image sampling. Distance measures Image enhancement: Some basic gray level transformations. Image negatives. Color transformations. point detection. CMYK color Model. Gonzalez.
CSE-425 VLSI Design
3 hours in a week. line detection. Homomorphic filtering. Example of fields that use digital image processing. Design of reliable VLSI circuits. 6. 3. Power law transformation. 3. Histogram equalization. Introduction to image processing: Representation of image. Reference book: 1. Multilevel VLSI circuit. HIS color Model. Image processing theory. Histogram matching. formulation.499 Project Work (Continued from 7th Sem. Histogram processing.00 Cr. Boundaries. Techniques for data path and data control design. Anil K. Correspondence between the spatial and frequency domain filtering. Image Compression: Image compression fundamentals. Simulation techniques. Reference Books:
43
. Restoration in the presence of noise only spatial filtering. Inter pixel redundancy Psychovisual redundancy. Light and electromagnetic spectrum. The source encoder and decoder. Algorithms and architectures. Noise consideration. Rafael C.

4. Douglas A. representation of time. generalization of growth models. 2. Hall International Inc. Study if system model. System Simulation with digital computer. Consumer and Business Markets: Consumer markets and one to one marketing. Generating discrete distributions. Pucknell. types of ecommerce. System modeling: Types of models. Prentice Hall. Reference Books: 1. techniques of simulation. activity simulation. resources. Introduction: An overview. 3.00 Cr. Exponential growth models and decay models.types and tools for electyronics payment. Narsing deo. system design. Continuous system simulation. Concept of system: System components. overview of literate security systems.1. Discrete simulation languages: General Purpose simulation. Online communities and new marketing opportunies. continuous and discrete models. Comparasion of encryption method. 3. Pentic. physical and mathematical models. static and dynamic models. Principles used in system modeling. types of simulation.00 Cr.value chains and the market place. representation of time delay. System dynamics diagrams. queues. Multi-sigment models. Modern VLSI Design by Wayne Wolf. Probability concepts in simulation. Differential equation model. continuous and discrete systems. System language (GPSS) and SIMSCRIPT. Stochastic variable. Digital signatures and certificates.. Prentice Hall.traditional and electronic business trasanctions.System Simulation by Geoffery Grodon. benefits of e-commerce. Basic VLSI Design system and Circuits. Second Edition. Handling money on the net: Transactions on the internet.Discrete-event System Simulation by Banks J and Carson JS. Non-uniform continuously distributed random numbers. Comparison of simulated and analytical methods. Measures of queues and mathematical solution of queuing problems. Rejection method. KAMRAN Eshraghiam. system model analysis and postulation. System Dynamics: Need for simulation. websities
44
. entities. 3.requirements for payment systems. Prentice Hall 2. Security and e-commerce: Review of private key and public key enery operations.Simulation Modeling with Pascal. electronic data interchange and components of EDI system. discrete and and continuous probability functions.
CSE-426 Simulation and Modeling
3 hours in a week. generation of arrival patterns. Discrete System Simulation: Discrete event simulation. Generations of random numbers.
CSE-427 E-Commerce
3 hours in a week.

models and methodologies. 4. security software modules. Loshin. to online catalogs.and ordering online. entrusting access to intermediary. Reference Books: 1. EDI interchange agreements legal issues for internet commerce. authentication of electronic documents. Legal Issues: Risk associated with proper documents and electronic documents. tying database. P.Electronic Commerce . Kalakota.KK Bajaj and D. P. R. Murphy.E-Commerce.tracking online problems. D.E-Commerce. Online catalogs . management of changes. virtual coordination and implementation. 3. Electronic consumer support. Virtual: Virtual factory.Kosiur. Nag. laws for e-commerce.Frontiers of Electronic Commerce. 2.access to shared data and applications. Business Process Engineering: Approaches.
45
.