School of Engineering & Sciences - Bhagat Phool Singh ...

School of Engineering & Sciences

B P S Mahila Vishwavidyalaya, Khanpur Kalan (Sonepat)

(State University Established Under the Legislative Act No 31/2006)

Course Curriculum & Scheme of Examination

For

B.Tech. Computer Science & Engineering

(w.e.f. session 2012-13) The Bachelor of Technology in Computer Science & Engineering is a four year full time programme. The course structure of the programme is given under:-

Semester – 1

Hrs/Week Marks S. No

Code Course Title L T P

Total Credit Internal

Marks External Marks

Total Marks

Theory 1. EEL-100 Fundamentals of Electrical

Engineering 3 1 - 3.5 50 50 100

2. MAL-101 Mathematics-I 3 1 - 3.5 50 50 100 3. CHL-100 Engineering Chemistry 3 1 - 3.5 50 50 100 4. CSL-110 Information Science &

Society 3 - - 3 50 50 100

5. MEL-100 Manufacturing Process 3 1 - 3.5 50 50 100 6. FFA/FRA/

FGA-100 Foreign Language (Non-Credit)

3 - - - 50 50 100

Lab 7. MEP-110 Engineering Graphic and

Drawing 1 - 4 3 50 50 100

8. CSP-100 Information Processing and Internet Lab

- - 2 1 25 25 50

9. EEP-100 Electrical Engineering Lab - - 2 1 25 25 50 10 CHP-100 Chemistry Lab - - 2 1 25 25 50 Total 19 4 10 23 375 375 750

Total contact Hours =33 Total Credits=23 Students will be allowed to use the scientific calculator only, however sharing of calculator not

allowed.

Note: Minimum passing marks for each paper is 40%

School of Engineering & Science

BPS Mahila Vishwavidyalaya Khanpur Kalan, Sonepat

(State University Established Under the Legislative Act No. 31/2006)


(w.e.f. 2012-13)

Semester – 2

Hrs/Week Marks S.

No




Total Marks

Theory 1. ECL-100 Basics Electronics

Engineering 3 1 - 3.5 50 50 100

2. MAL-102 Mathematics-II 3 1 - 3.5 50 50 100 3. EVL-100 Environmental Studies* 3 - - - 50 50 100 4. CSL-100 Introduction to Computer

& Programming 3 1 - 3.5 50 50 100

5. HUL-100 Communication Skill in English

3 - - 3 50 50 100

6. PHL-100 Engineering Physics 3 1 - 3.5 50 50 100 Lab 7. ECP-100 Basic Electronics Lab - - 2 1 25 25 50 8. CSP-100 Computer Programming

Lab - - 2 1 25 25 50

9 MEP-100 Mechanical Workshop - - 2 1 25 25 50 10 PHP-100 Physics Lab - - 2 1 25 25 50 11 HUP-100 English Language Lab - - 2 1 25 25 50 Total 18 4 10 22 375 375 750

*Qualifying Exam and Marks will not be considered in degree awards.

Total contact Hours =32 Total Credits=22 Note: 1. Students will be allowed to use the scientific calculator only, however sharing of calculator not allowed. 2. Minimum passing marks for each paper is 40%




B.Tech. Computer Science & Engineering (w.e.f. 2012-13)

Semester-3

Hrs/Week Marks S.

No




Total Marks

Theory 1 CSL-201 Computer Organization &

Architecture 3 1 - 3.5 50 50 100

2 CSL-203 Discrete Structure 3 1 - 3.5 50 50 100 3 CSL-205 Data Structures&

Algorithms 3 1 - 3.5 50 50 100

4 ECL-205 Digital Circuits & System 3 - - 3 50 50 100 5 CSL-207 Computer Hardware

Technologies 3 1 - 3.5 50 50 100

6 HUL-207 Fundamentals of Management

3 - - 3 50 50 100

Lab 7 CSP-221 Data Structures &

Algorithms Lab - - 2 1 25 25 50

8 ECP-221 Digital Electronics Lab - - 2 1 25 25 50 9 CSP-223 Computer Hardware Lab - - 2 1 25 25 50 10 MEP-200 Computer Aided Design

LAB - - 2 1 25 25 50

Total 18 04 08 24 400 400 800 Total Contact Hours =30 Total Credit= 24 Note: Minimum passing marks for each paper is 40%





Semester-4





Total Marks

Theory 1 CSL-202 Principles of Operating

Systems 3 1 - 3.5 50 50 100

2 CSL-204 Object Oriented Programming using C++

3 1 - 3.5 50 50 100

3 ECL-208 Communication System 3 1 - 3.5 50 50 100 4 CSL-208 Data Base Management

Systems 3 1 - 3.5 50 50 100

5 CSL-210 Automata Theory 3 1 - 3.5 50 50 100 6 CSL-212 Principles of Programming

Languages 3 1 - 3.5 50 50 100

Lab 7 CSP-220 Operating System Lab - - 2 1 25 25 50 8 CSP-222 C++ Programming Lab - - 2 1 25 25 50 9 CSP-224 DBMS Lab - - 2 1 25 25 50 10 MEP-223 Programming with

MAT LAB - - 2 1 25 25 50

Total 18 06 08 25 400 400 800

Total Contact Hours =32 Total Credit= 25 NOTE: 4-6 weeks training will be held after fourth semester. However, Viva-Voce will be conducted in the fifth semester Note: Minimum passing marks for each paper is 40%





Semester-5





Total Marks

Theory 1 CSL-301 Principles of Software

Engineering 3 1 - 3.5 50 50 100

2 CSL-303 Computer Networks 3 1 - 3.5 50 50 100 3 CSL-305 Security of Information

System 3 1 - 3.5 50 50 100

4 CSL-307 Computer Graphics 3 1 - 3.5 50 50 100 5 ECL-305 Microprocessor &

Interfacing 3 - - 3 50 50 100

6 HUL-209 Economics 3 - - 3 50 50 100 Lab 7 CSP-321 Computer Graphics Lab - - 2 1 25 25 50 8 CSP-323 Software Engineering Lab - - 2 1 25 25 50 8 ECP-325 Microprocessor &

Interfacing Lab - - 2 1 25 25 50

9 IPT-325 Industrial Practical Training-I

- - - 3 - 100 100

Total 18 04 06 26 375 475 850

Total Contact Hours =28 Total Credit= 26

Note: 1. Industrial Practical Training-I was conducted after fourth semester. However, Viva-Voce for evaluation of Practical Training will be conducted in this semester. 2. Minimum passing marks for each paper is 40%





(w.e.f. 2012-13)

Semester-6





Total Marks

Theory 1 CSL-302 Distributed Operating

System 3 1 - 3.5 50 50 100

2 CSL-304 Intelligent Systems 3 1 - 3.5 50 50 100 3 ECL-308 Digital System Design 3 1 - 3.5 50 50 100 4 CSL-306 Analysis and Design of

Algorithms 3 1 - 3.5 50 50 100

5 CSL-308 Multimedia Technologies 3 1 - 3.5 50 50 100 6 CSL-310 Visual Programming 3 1 - 3.5 50 50 100 Lab 7 CSP-320 Intelligent Systems Lab - - 2 1 25 25 50 8 ECP-326 Digital System Design Lab - - 2 1 25 25 50 9 CSP-322 Visual Programming Lab - - 2 1 25 25 50 10 CSP-324 Multimedia Lab - - 2 1 25 25 50 9 GPF-326 General Proficiency - - - 3 - 100 100 Total 18 06 08 28 400 500 900

Total Contact Hours =32 Total Credit= 28

NOTE: 1. 4-6 weeks industrial practical training –II training will be held after sixth semester. However, Viva- Voce will be conducted in the seventh semester. 2. Minimum passing marks for each paper is 40%.

School of Engineering & Science BPS Mahila Vishwavidyalaya Khanpur Kalan, Sonepat

(State University Established Under the Legislative Act No. 31/2006) B.Tech. Computer Science & Engineering

(w.e.f. 2012-13)

Semester-7





Total Marks

Theory 1 CSL-401 Advanced Computer

Architecture 3 - - 3 50 50 100

2 CSL-403 Neural Networks 3 1 - 3.5 50 50 100 3 CSL-405 Compiler Design 3 1 - 3.5 50 50 100 4 Open Elective-1 3 - - 3 50 50 100 5 Departmental Elective-1 3 - - 3 50 50 100 Lab 6 CSP-421 Minor Project - - 3 3 50 50 100 7 CSP-423 Network Programming &

Administration Lab - - 2 1 25 25 50

8 CSP-425 Compiler Design Lab - - 2 1 25 25 50 9 IPT-427 Industrial Practical

Training –II - - - 3 - 100 100

10 CSP-429 Seminar - - 3 3 100 - 100 Total 15 02 10 27 450 450 900

Total Contact Hours =27 Total Credit= 27 Note: Project load will be treated as 2 hours for project co-ordinator and 1 hour for each participating teacher. Each batch of (max of 3) students shall design, develop and realize minor project. Student has to submit a project report at the stipulated time. The evaluation system consists of one internal & one external examiner. Open Elective-1

1. CSL-409 Mobile Computing 2. CSL-411 System Simulation 3. CSL-413 Multiservice Networks 4. CSL-407 Network Programming & Administration

Departmental Elective-1 1. CSL-415 E-Commerce & ERP 2. ECL-320 VLSI Design 3. CSL-419 Advanced Database Management Systems 4. CSL-417 Software Project Management Note: 1. Practical training was conducted after sixth semester. However, Viva-Voce for evaluation of Practical Training will be conducted in this semester. 2. Minimum passing marks for each paper is 40%


BPS Mahila Vishwavidyalaya Khanpur Kalan, Sonepat (State University Established Under the Legislative Act No. 31/2006)


Semester-8





Total Marks

Theory 1 CSL-402 Advanced Computer

Networks 3 1 - 3.5 50 50 100

2 CSL-404 Java Programming and Website Design

3 1 - 3.5 50 50 100

3 Open Elective-2 3 - - 3 50 50 100 4 Departmental Elective-2 3 - - 3 50 50 100 Lab 5 CSP -420 Major Project - - 4 4 50 50 100 6 CSP- 422 Seminar - - 3 3 100 - 50 7 CSP -424 Java Programming Lab - - 2 1 25 25 50 8 CSP-426 Advanced Computer

Networks Lab - - 2 1 25 25 50

9 GPF-426 General Proficiency - - - 3 - 100 100 Total 12 02 11 25 350 400 750

Total Contact Hours =25 Total Credit= 25 Note: Project load will be treated as 2 hours for the project co-coordinator and 1 hour for each participating teacher. Attendance is compulsory for each student. Every student have to go for literature survey and present one seminar on literature survey, one on progress and final on complete work. Respective guide have to sit in every presentation.

Non University Examination to be conducted by the department by a committee constituted by Dean and chairperson of the department.

Minimum passing marks for each paper is 40% Open Elective-2

1. ECL-414 Digital Image Processing 2. CSL-412 Management Information System 3. CSL-414 System Programming & System Administration 4. EVL-424 Pollution and Control

Departmental Elective-2 1. CSL-416 Data Warehouse & Data mining 2. CSL-418 Software Testing 3. CSL-420 Object Oriented System Design 4. CSL-408 Fuzzy Logic 5. CSL-406 Network Technology

Note:

(1) Each subject/course in Computer Science and Engineering of 3/3.5/4 Credit is of 100 marks having 50 internal and 50 external marks.

(2) Each lab in scheme of Computer Science and Engineering of 2 Credit is of 50 marks having 25 internal and 25 external marks.

(3) Seminar, Industrial Practical Training, Minor project, General Proficiency, Major Project each is of 100 Marks.

Grand Total of Credits for the B.Tech Computer Science & Engineering, BPSMV Khanpur Kalan

S.No

Semester Credits/Marks

1. I 23/750 2. II 22/750 3. III 24/800 4. IV 25/800 5. V 26/850 6. VI 28/800 7. VII 27/900 8. VIII 25/750

Total 200/6500 All end examinations (Theory & Practical) are of three hours duration

Semester-1 EEL-100 Fundamentals of Electrical Engineering

L T P Total Credits: 3.5 3 1 - Unit 1 Electric Circuits: Review of KCL, KVL and DC circuit analysis using nodal and mesh current or loop current method, Signal & wave forms, phasor representation of sinusoidal voltages and currents, power, power factor, analysis of series and parallel circuits, resonance in series and parallel circuits, Balanced three phase system, star and delta connections, relation between line and phase quantities (Voltages and currents) in the two types of connection, analysis of three-phase circuits, power in three-phase circuits, measurement of power by two-watt meter method. Unit 2 Magnetic Circuits &Transformers: Magnetic Circuits: Ampere-turns, magnetomotive force, permeability, reluctance, composite magnetic circuits, comparison between magnetic and electric circuits. Single-Phase Transformers: Principle of working, constructional details, equivalent circuit, open-circuit and short-circuit test, losses and efficiency. Autotransformer. Unit 3: Dc Machines & Induction Motors: Dc Machines: Generators and motors, production of voltage and torque, characteristics of dc generators and motors, speed control of dc shunt motors, application of dc generators and motors. Induction Motors: Principle of working, starting, torque-slip curve and applications of three-phase induction motors. Introduction to single-phase induction motors. Unit 4 Electrical Instruments: Principle of working and constructional features of permanent magnet moving- coil; and moving iron am-meters and voltmeters, electrodynamic wattmeter, induction type single- phase energy meter. Earthing and its importance. Reference Books:

1. Basic Electrical Engg (2nd edition): Kothari & Nagarath, TMH Pub. 2. Electrical Technology (Vol-I): B.L. Thereja & A K Thereja, S.Chand Pub. 3. Electrical Engineering Fundamentls: Deltoro, PHI Pub. 4. Network Analysis: Valkenburg, PHI Pub.

NOTE: Eight questions will be set in all by the examiners taking two questions from each unit. Students will be required to attempt five questions in all selecting at least one question from each unit.

MAL-101 Mathematics – I L T P Total Credits: 3.5 3 1 - UNIT 1 Infinite Series: Convergence and divergence, Comparison, D’ Alembert’s ratio, Intrgral, Raabe’s, Logrithmic and Cauchy root test, Alternating series, Absolute and conditional convergence. Applications of Differentiation: Taylor’s and Maclaurin’s series, Asymptotes, Curvature. UNIT 2 Partial Differentiation & its Applications: Functions of two or more variables; partial derivatives, Total differential and differentiability, Derivatives of composite and implicit functions, Jacobians, Higher order partial derivatives. Homogeneous functions, Euler’s theorem, Taylor’s series for functions of two variables (without proof), maxima-minima of function of two variables, Lagrange’s method of undetermined multipliers and differentiation under integral sign. UNIT 3 Applications of Single & Multiple Integration: Applications of single integration to find volume of solids and surface area of solids of revolution. Double integral, change of order of integration, Double Integral in polar coordinates, Application of double integral to find area enclosed by plane curves and volume of solids of revolution. Triple integral, volume of solids, change of variable, Beta and gamma functions and relationship between them. UNIT 4 Vector Calculus: Differentiation of vectors, scalar and vector point functions gradient of a scalar field and directional derivative, divergence and curl of a vector field and their physical interpretations. Integration of vectors, line integral, surface integral, volume integral, Green, Stoke’s and Guass theorems (without proof) and their simple applications. Books Suggested: 1. Advanced Engineering Mathematics: E. Kreyszig, Wiley Eastern. 2. Higher Engineering Mathematics: B.S. Grewal, Khanna Publishers. 3. Engineering Mathematics Part-I: S S Shastri, Prentice Hall. 4. Differential and Integral Calculus: Piskunov. 5. Advanced Engineering mathematics: R K Jain and SRK Iyengar. 6. Advanced Engg. Mathematics: Michal D Greenberg. 7. Advance Engg. Mathematics: Vol-I by H C Taneja. NOTE: Eight questions will be set in all by the examiners taking two questions from each unit. Students will be required to attempt five questions in all selecting at least one question from each unit.

CHL-100 Engineering Chemistry L T P Total Credits: 3.5 3 1 - UNIT 1:Water and its treatment: Types of impurities in Water, Hard and soft water, Degree of Hardness of Water and its determination, Methods of softening water, Chemical calculations in softening of water, Methods of Treatment of Water for Domestic Purposes-Sedimentation, Coagulation, Filtration, Disinfection-Sterilization, Chlorination, Break point chlorination, Ozonization, Water for Industrial purpose, Boiler feed waters- defects of using Hard water in boilers and the treatments given-Internal and External conditioning of water- Desalination of water. Environmental pollution: Pollution of water-Domestic sewage and Industrial wastes- Air pollution-Causes and control. UNIT 2: Corrosion Definition, Examples, Types of Corrosion: Theories of Corrosion and Mechanism-Dry Corrosion, (Direct Chemical attack), Wet Corrosion, (Electro Chemical Theory) Principles of Corrosion, Galvanic Series, Galvanic Corrosion, Concentration Cell Corrosion, Mechanism of Wet Corrosion-Hydrogen evolution type, Oxygen absorption type; Factors Influencing Corrosion, Control of Corrosion-Proper Design, Use of pure metal and metal alloys, Passivity, Cathodic Protection-Sacrificial anode and Impressed Current. Modifying the Environment, use of Inhibitors. UNIT 3 Polymer Science and Technology: Polymerization Reactions-Basic concepts. Types of Polymerization-Addition and Condensation Polymerizations. Plastics-Thermosetting and Thermoplastics-Differences. Compounding and Moulding of Plastics-Compression, Injection, Transfer, and Extrusion molding methods. Preparation, Properties and Engineering Uses of the Following: Polyethylene, PVC, Teflon, Bakelite, Nylon, Polyester, Polyurethane and Silicone Resins. Rubber-Processing of Natural Rubber, Vulcanization and Compounding. Elastomers-Buna S, Buna N, Thiokol, Polyurethane Rubber. UNIT 4 Lubricants: Principles and function of lubricants-Types of Lubrication and Mechanism- Thick Film or Hydrodynamic Lubrication, Thin Film or Boundary Lubrication, Extreme Pressure Lubrication. Classification and properties of lubricants-Viscosity, flash and fire point, cloud and pour point, aniline point, Neutralization Number and mechanical strength. Inorganic Cementing Materials: Cement: Important Parameters for Manufacturing Cement Clinkers. Chemical Constituents and Composition of Cement. Methods of Manufacture of Cement-Wet and Dry Processes. Additives for Cement. Properties of Cement-Setting and Hardening. Types of Portland Cement. TEXT BOOKS

1. A text book of Engineering Chemistry, Jain & Jain, Dhanpat Rai Publishing (2006).

2. Chemistry of Engineering Materials, C.P. Murthy, C.V. Agarwal, A. Naidu, BS Pub.

3. A text book of Engineering Chemistry by S.S. Dara, S.Chand & Co, New Delhi (2004).

4. Engineering Chemistry by J C Kuriacose and J. Rajaram, Tata McGraw-Hill Co. NOTE: Eight questions will be set in all by the examiners taking two questions from each unit. Students will be required to attempt five questions in all selecting at least one question from each unit.

CSL-110 Information Science & Society L T P Total Credits: 3 3 - - Unit 1. Data Base and Warehouse: An Overview: Data base feature, Advantages, file structure, file types, logical and relational database, levels of abstraction, data model, Architecture of database management system, Data Ware Housing, Advantages, Possible problems and complexity and ERP system. Unit 2 Information Processing & Communication: Information editing, formatting and presentation by using MS office tools, Basic communication system, analog and digital signal, modulation, Data transmission, Methods of transmission, Modes of transmission, Transmission impairment and Transmission media. Unit 3 Internets: An Introduction: Network, Client & server, Host and terminal, Categories of networks, Network communication Devices, WWW, TCP/IP, FTP, HTTP, URL, ISP, Internet, Dail-Up access, Dedicated connections, IP address, Domain name system, E- Mail , Internet mail protocols, Search engines, digital signature, firewalls, HTML fundamentals, Internal and external linking between web pages, HTML table, list, forms and working with the images.. Unit 4 Impact of Information Science on Society: Electronic Commerce, Advantages, Applications, Geographic information system (GIS), Computers in home, administration & management, communication, business & industry, education & training, entertainment, science, medicine & engineering. Reference Books:

1. Alexis Leon & Mathew Leon: Fundamentals of information technology, Vikas Publishing House Pvt. Ltd. New Delhi.

2. Deepak Bharihoke: Fundamentals of Information technology, Excel books New Delhi.

3. R.C Joshi, S.C. Gupta and P.K.Singh: Information Technology, V.K. (India) Enterprises, New Delhi.

4. D.S Yadav: Foundations of Information Technology 2nd Edition , New Age International Publishers

5. Chanchal Mittal: Foundations of Information Technology, Pragati Prakashan Meerut. 6. Internet: An Introduction, CIStems Tata McGraw-Hill series.


MEL-100 Manufacturing Process L T P Total Credits: 3.5 3 1 - Unit 1 Introduction: Introduction to manufacturing processes and their classification, industrial safety, plant layout, types, objectives and advantages. Casting: Patterns, Materials, Type of allowances; Sand casting; types & properties of moulding sand; various moulding methods; core and its types. Permanent mould castings Casting: Co2 casting, centrifugal casting, die castings; shell molding. Plaster moulding, investment castings, casting defects, remedies. Unit 2 Primary Metal Working Processes: Hot and cold forging, hot cold rolling, wire drawing and extrusion processes. Metal Shearing and Forming: Introduction to shearing, notching, lancing, bending drawing, stretching, embossing and coining operations; Process and their types. Die and punch operations. Unit 3 Metal Machining Processes: Lathe-parts and accessories, specifications, turning tools, various operations on lathe (turning, taper turning, thread cutting, drilling, boring). Plastics Processing: Plastics, their types and manufacturing properties, Compression moulding and Injection moulding. Unit 4 Welding and Allied Processes: Classification, gas welding, Resistance welding and its types, thermit welding, Electric arc welding–metal arc welding carbon arc welding, submerged arc welding, TIG, MIG; Welding defects and remedies, Soldering and brazing. Special Welding Processes: Electro slag welding, Atomic hydrogen welding, Plasma arc welding, Ultrasonic welding, and laser welding. Text Books:

1. Workshop Technology, Vol I and II, Hazara & Chaudhary, Asian Book Comp, New Delhi.

2. Process and Materials of Manufacturing, Lindberg, RA Prentice Hall of India, New Delhi.

3. Principles of Manufacturing Materials & Processes, Campbell J.S, Mcgraw Hill. Reference Books:

1. Manufacturing Science- A Ghosh & Ashok Kumar Malik, East West Press. 2. Manufacturing Engineering and Technology–Kalpakijan and Schmid. 3. Workshop Technology, Vol 1, 2 & 3; Chapman, Waj, Edward Arnold.


MEP-110 Engineering Graphics and Drawing L T P Total Credits: 3 1 - 4 Unit 1 Orthographic Projections: Theory of orthographic projections, planes of projection, four quadrants, first angle projection, third angle projection, B.I.S. Code of practice. View analysis, orientation of the object, laying out three views drawings, hidden lines and curved surfaces, conventional lines, dimensioning and lettering, conversion of pictorial view into orthographics views development of missing views. Unit 2 Projections of Points, Straight Lines and Planes Point in different quadrants projections of lines-parallel to one both planes, contained by one or both planes, perpendicular to a plain, inclined to one plane and parallel to the other, inclined to both planes, contained by a plane perpendicular to both planes. True length of a line and its inclinations with the reference plane, traces of a line. Types of planes, perpendicular planes, oblique planes, traces of planes. Projections of planes-parallel to one plane, perpendicular to both planes, and perpendicular to one inclined to the other. Unit 3 Projections & Sections of Solids: Projections of Solids: Types of solids-polyhedral, solids of revolution. Projections of solids-axis perpendicular to a plane, axis parallel to planes, axis parallel to one plane and inclined to other, axis inclined to both the planes. Section of Solids: Section planes, sections, true shape of sections, sections of prisms, pyramids, cylinders, cones placed in simple position. Unit 4 Graphic Statics: Basic concepts, Bow’s notation, space-diagram, force and polar diagram, funicular polygon, support & support reactions, compressive and tensile stress, analysis of trusses, stresses in plane framed structures. Reference Books: 1. Engineering Drawing by P.S. Gill (S.K.Kataria & Sons, Ludhiana) 2. A text Book of graphic Statics By. P.S. Gill (S.K. Kataria & Sons, Ludhiana) 3. Elementary Engineering Drawing by N.D. Bhatt (Charotar Publishing House, Anand). Note: There will be an internal exam of Engineering Graphics and Drawing.

CSP-110 Information Processing & Internet Lab

L T P Total Credit=1 - - 2 Exercises involving:

- Sending and receiving mails - Chatting on the net - Using FTP - Using HTML Different Tags (Paragraph, Line break, Marquee, Text formatting etc) - Design of HTML Forms - Design of HTML Tables - Design of HTML Lists - Using HTML Hyperlink - Using HTML images - Making a Web page of your college using HTML tags Note: At least 5 to 10 more exercises to be given by the teacher concerned.

EEP-100 Electrical Engineering Lab L T P Total Credit: 1 - - 2 LIST OF EXPERIMENTS:

1. To verify KCL and KVL 2. To verify Thevenin’s and Norton’s Theorem. 3. To verify Maximum Power Transfer theorems in DC circuits and AC circuits. 4. To verify Reciprocity & Superposition theorems 5. To study frequency response of a series RLC circuit and determine resonant frequency & Q-

factor for various values of R, L, C. 6. To study frequency response of a parallel R-L-C Circuit and determine resonant frequency &

Q-factor for various values of R, L,C. 7. To perform load test of a transformer and plot load current Vs (a) terminal voltage (b)

efficiency. 8. To perform direct load test of a DC shunt generator and plot load voltage Vs load current

curve. 9. To plot V-curve of a synchronous motor. 10. To perform O.C. and S.C. tests of a three phase inductor motor. 11. To study various type of meters. 12. Measurement of power by 3 Voltmeter/3 ammeter methods. 13. To measure power in a 3 phase system by two watt meter method. 14. To calibrate single phase energy meter at unity power factor at (1) Full load (2) Half load (3)

Quarter load. 15. To measure iron loss in a single phase transformer and to find the equivalent circuit

parameters by performing open circuit and short circuit.

NOTE: At least 10 experiments are to be performed by students in the semester. At least 7 experiments should be performed from the below list, remaining three experiments may either be performed from the below list or designed and set by the concerned institution as per the scope of the syllabus of EEL-102.

CHP-100 Chemistry Lab L T P Total Credit: 1 - - 2 LIST OF EXPERIMENTS:

1. Volumetric analysis- Permanganometric titrations. 2. Acid-Base titrations, 3. Iodometric titrations, 4. Complexometric titrations and Dichrometric titrations. 5. Determination of alkalinity of irrigation water. 6. Determination of total hardness of water by EDTA titration. 7. Determination of temporary and permanent hardness of water by EDTA titration. 8. Estimation of calacuim and magnesium hardness of water separately by EDTA

titration. 9. Determination of D.O. in a given sample of water. 10. Determination of C.O.D. of a waste water. 11. Estimation of calacuim as CAO volumetrically in cement. 12. Preparation of Standard Potassium Dichromate and Estimation of Ferrous Iron. 13. Preparation of Standard Potassium Dichromate and Estimation of Ferric Iron. 14. Preparation of Standard Potassium Dichromate and Estimation of Copper, by

Iodometry. 15. Preparation of Standard EDTA and Estimation of Copper. 16. Preparation of Standard solution of Zinc and Estimation of Ferrocyanide. 17. Determination of acid value of oil. 18. Determination of iodine value of an oil 19. Determination of saponification value of an oil 20. Determination of viscosity of lubricants by redwood viscometers. 21. Percentage Purity of Pyrolusite. 22. Percentage Purity of Lime Stone. 23. Manganese in Steel. 24. Iron in Cement

NOTE: At least 12 experiments are to be performed by students in the semester. At least 10 experiments should be performed from the below list, remaining three experiments may either be performed from the below list or designed and set by the concerned institution as per the scope of the syllabus of CHP-102.

ECP -110 MAT Lab L T P Total Credits: 1 - - 2 Unit 1 MAT Lab Fundamentals: Introduction, platforms and versions, launching MATLAB, window, help features, types of file, creating directory and saving files, notation, syntax and operations, constants, variables and expression, some built in function, commands, problems. Unit 2 Vectors & Matrics: Addition, subtraction, multiplication, vector products and transpose, commands, problems. Unit 3 MAT Lab Programming: Input-Output Statements: data input, interactive input, output command. Programming in M files, script and function files, variables, data types, operators, control structures Unit 4 Graphics Using MAT Lab: Creating plots, 2-D, 3-D, multiple plots, editing plots, visualizing function of two variables, image Printing graphics, handle graphics, GUI, problems. Unit 5 Introduction to Toolboxes: The symbolic math toolbox, control system toolbox, signal processing toolbox, communication toolbox, MATLAB applications, animation, problems. Unit 6 Simulink Basics: Introduction, simulink model editor, simulink library, blocksets, running a simulation, building simple model, problems with models. Reference Books:

1. MATLAB and its Applications in Engineering, Raj Kumar Bansal, Ashok Kumar Goel, Manoj Kumar, Pearson Education.

2. Partha S Mallick, Matlab and Simulink: Introduction to Applications, 2nd edi, SCITECH.

3. K K Mishra, Numerical Technique Lab Matlab Based Experiments, I K international publishing house.

NOTE: At least 10 experiments are to be performed by students in the semester as per the

scope of the syllabus.

Semester-2 ECL-100 Basic Electronics Engineering L T P Total Credits: 3.5 3 1 - Unit 1 Electronic Components, Signals, Networks: Passive Components: Resistance, Capacitors and Inductors of various types, Component Specifications, Application, response to dc and sinusoidal/current excitation, star delta connection. Signals: DC/AC, voltage/current, periodic/non-periodic signals, average, rms, peak values, different types of signal waveforms, Ideal/non-ideal, voltage/current sources, independent/dependent voltage current sources, step, ramp, impulse, Analysis of special waveforms. Networks: KCL, KVL, Superposition, Thevenin, Norton, Maximum power transfer theorems for AC and DC circuit, Loop and node analysis of simple networks, selectivity, duals and analog. Unit 2 Junction Diode Characteristics: Review of semi conductor physics, energy band model, n and p–type, Mass action law, Continuity equation, Hall effect, Abrupt and linearly graded junctions, PN junction biasing, Energy band diagram of p-n diode, Volt-ampere characteristics, Temperature dependence of V-I characteristic, Drift & Diffusion current, excess carriers in semiconductors-generation and recombination. Diffusion & Transition capacitances, Switching mode operation of p-n junction, Breakdown Mechanisms in Semi Conductor Diodes. Unit 3 Diode Circuits: Diode as Rectifier, Half wave, Full wave and Bridge, Output Waveforms, Definition & Derivations of Idc Vdc, Vrms, Irms, efficiency, ripple factor, Peak inverse voltage, Inductor filter, Capacitor filter, L-section filter, pi-section filter, Multiple L-section and Multiple pi section filter, and comparison of various filter circuits in terms of ripple factors; Multipliers; Clipper; Clamper, Peak detector. Unit 4 Basic Digital Electronics: Binary Logic, Positive, Negative, Logic gates: symbol, equation & truth table, Tristate Inverter, TTL Circuits-Digital Integrated Circuits- 7400 Devices-TTL Characteristics-TTL Overview - AND -OR- NOT Gates - Open-Collector Gates – CMOS gates Boolean Algebra, DeMorgan’s Theorems, Implementation of Boolean Equation using Basic gate and Universal gate, Review of Number systems, Binary, Octal, Decimal, Hexadecimal, conversion from one to another, complement arithmetic, Binary codes: BCD, Excess-3, Gray, EBCDIC, ASCII, Implementation using K map, Gates-Functional Block Approach. Reference Books: 1. Electronic Devices and Circuits, S. Salivahanan, N. Suresh Kumar, A Vallavraj, TMH. 2. Network Analysis, Van Valkenburg, PHI. 3. Malvino & Leach, Digital Electronics, Tata McGraw Hill.

MAL-102 Mathematics -II L T P Total Credits: 3.5 3 1 - Unit 1: Matrices & Their Applications: Rank of a matrix, elementary transformations, elementary matrices, inverse using elementary transformations, normal form of a matrix, linear dependence and independence of vectors, consistency of linear system of equations, linear and orthogonal transformations, eigen values and eigen vectors, properties of eigen values, Cayley–Hamilton theorem and its applications. Unit 2: Ordinary Differential Equations & their Applications: Exact differential equations, Equations reducible to exact differential equations, Applications of differential equations of first order & first degree to simple electric circuits, Newton’s law of cooling, heat flow and orthogonal trajectories. Linear differential equations of second and higher order, Complete solution, complementary function and particular integral, method of variation of parameters to find particular integral, Cauchy’s and Legender’s linear equations, simultaneous linear equations with constant co-efficient; Applications of linear differential equations to simple pendulum, oscillatory electric circuits. Unit 3: Laplace Transforms and their Applications: Laplace transforms of elementary functions, properties of Laplace transforms, existence conditions, transforms of derivatives, transforms of integrals, multiplication by n, division by t. Evaluation of integrals by Laplace transforms. Laplace transforms of Unit step function, unit impulse function and periodic function. Inverse transforms, convolution theorem, application to linear differential equations and simultaneous linear differential with content coefficients. Unit 4 Partial Differential Equations and their Applications: Formation of partial differential equations, Lagrange’s linear partial differential equation, First order non-linear partial differential equation, Charpit’s method. Method of separation of variables and its applications to wave equation and one dimensional heat equation, two dimensional heat flow, steady state solutions only. Text Books: 1. Advanced Engg. Mathematics: F Kreyszig. 2. Higher Engg. Mathematics: B. S. Grewal. 3. Differential Equations– H.T.H. Piaggio. 4. Elements of Partial Differential Equations – I.N. Sneddon. 5. Advanced Engineering mathematics– R K Jain, S R K Iyengar. 6. Advance Engg. Mathematics– Michael D Greenberg. 7 Advance Engg Mathematics vol -II by H C Taneja. NOTE: Eight questions will be set in all by the examiners taking two questions from each unit. Students will be required to attempt five questions in all selecting at least one question from each unit.

EVL-100 Environmental Studies L T P Total Credits: 3 3 - - Unit 1 Introduction: Environment & its segments, impact of humans upon environment, Biodiversity and sustainable development, importance. Field Work: Visit to a local area to document environmental assets- river/forest/grassland/hill/mountain; Visit to a local polluted site-urban/rural /industrial/ agricultural; Study of common plants, insects and birds; Study of ecosystems-pond, river, hill slope etc. Unit 2 Ecology: Meaning, scope and subdivision of ecology ecosystems and its types, Energy flow (Radiation& Heat Budget) food chains, trophic level, ecological pyramid biogeochemical cycles-nitrogen, sulphur and phosphorous cycles, Ecological balance in nature, consortium and ranks of consortium, Sources and effects of radio actives fall-outs disposal of radioactive waste, chemical and biological agents and effects of chemical and biological warfare, population Explosion-its affects & India's scenario. Unit 3 Energy & Environment: Energy, uses of energy, historical background, economics of energy, conventional and non-conventional sources of energy, renewable energy sources (such as solar, wind, tidal, wave, geothermal, hydro and bio mass energy), and their environmental impacts with special references on Indian scenario. Unit 4 Environmental Pollution & Waste: Definition, causes, effects and control measures- water pollution, air pollution, land pollution, marine pollution, noise pollution and nuclear hazards. Solid wastes: Definition, types and composition, sources of solid wastes, method of disposal, land filling, incineration, pulverization, Composting, Solid waste management. RECOMMENDED BOOKS: 1. Environmental Engineering by H.S.Peavy and D.R.Rowe, McGraw Hill Book co. ltd. 2. Air Pollution by E. P. Odum Oxford & IBN publication. New Delhi. 3. Environmental Noise pollution by P.F. Cuniff, John Wiley & sons. 4. Aggrwal K C 2001, Environmental Biology, Nidi Pub. 5. J P Yadav, A text book of environment education, G V S Publishers. NOTE: Eight questions will be set in all by the examiners taking two questions from each unit. Students will be required to attempt five questions in all selecting at least one question from each unit.

CSL-110 Introduction to Computers & Programming in C L T P Total Credits: 3.5 3 1 - Unit 1 Introduction: Overview of a computer system, Block diagram and major parts of computer, history of computer development, introduction to binary, octal & hexadecimal numbers, ASCI code, Levels of programming languages–machine language, assembly language, high level language; need of operating system, tree structure of storage, Introduction to algorithms and flow charts, introduction to assembler, compiler and interpreter. Unit 2 Basics of C Language: C character set, Identifiers and keywords, data types, constants, variables and arrays, declarations, expression statements, symbolic constants, compound statements, arithmetic operators, unary operators, relational and logical operators, assignment operators, conditional operators, bit operators. Control flow structures, If statement, if….else statement, while statement, do……while statement, for statement, switch statement, nested control statement, break operator, continue operator, comma operator, go to statement. Unit 3 Functions and Arrays: Function declaration, definition & scope, recursion, call by value, call by reference. Storage classes; automatic, external (global), static & registers, Arrays, pointers, array & pointer relationship, pointer arithmetic, dynamic memory allocation, pointer to arrays, array of pointers, pointers to functions, array of pointer to functions, pre-processor directives: #include, #define, macro’s with arguments, the operator # and ##, conditional compilations, multiple file programming. Unit 4 Structures and Library Functions: Structures, unions, structures passing to functions, bit fields, file handling [text(ASCII), binary], standard library functions from stdio.h, stdlib.h, conio.h, ctype.h, math.h, string.h, process.h. Text Books: 1. A.S. Tanenbaum: Structured Computer Organization, PHI. 2. V. Rajaraman: Fundamentals of Computers, 3rd edition, PHI. 3. Yashwant Kanetkar, Let us C, BPB Publications, 2002. Reference Books: 1. E. BalaGuruswamy, Programming in ANSI C, TMH, 1999. 2. AI Kelly and Ira Pohl, A Book on C, (4th Ed.), Addison Wesley, 1999. 3. Byron S. Gottfried: Theory and Problems of programming with C Language, Schaum Series, TMH, 1998. 4. Kernighan and Richie: The C programming Language, 2nd edn, PHI. NOTE: Eight questions will be set in all by the examiners taking two questions from each unit. Students will be required to attempt five questions in all selecting at least one question from each unit.

HUL-100 Communication Skill in English L T P Total Credits: 3 3 - - UNIT –1 Oral Communication: Basic concepts, scope and significance, discussion on topic of contemporary relevance, interviews, GD; Body Language: Gestures, postures, facial expression, tone, pitch, rhythm. Word Study & Writing: Word formation, Illustrative use of words, Paragraph, letter, precise and technical writing. UNIT –II Sentence Structure & Grammar: Common Errors, Punctuation, Parts of speech, Subject verb concord, Introduction to tenses, Articles.

UNIT –III COMPOSITION: Re-arranging jumbled sentences to form a coherent paragraph, .Officials Letter (representations/complaints etc), Summary. VOCABULARY: One word substitutes, words often confused, list of adjective, list of adverbs, prefixes and suffixes, verbal phrases. UNIT –IV Spoken English

1. Essentials of good speaking; dialogues, public speaking and formal presentation.

2. Vowels, Consonants, Phonetics Syllables, Transcription of ‘received pronunciation’ of common English words, including those with ‘-ed’ and ‘-s’ endings, into IPA

3. Primary stress placement on words 4. IPA transcription of weak forms 5. Use of falling, rising and falling-rising tones in ordinary

Statements, question, orders and requests. 6. Situational speaking (pair work) 7. Listening for specific purposes. 8. Vocabulary Reference Books:

(1) English for Engineers and Technologist- Ana Univ, Orient Blackswan (2) Enrich your English communication skills Book–1 by CIEFL, OUP, 2005 (3) Modern English Grammar: a book of grammar, usage and composition by

N.Krishnaswamy, CIEFL, Hyd. (4) Alexander, L G Longman English grammar London: Longman, 1988. (5) Balasubramanin T, A text book of English phonetics for Indian students, New Delhi,

macmillion, 1981. (6) Bansal R K and J B Harrison, spoken English for India, orient London.


PHL-100 Engineering Physics L T P Total Credits: 3.5 3 1 - UNIT 1 Overview of vibration with emphasis on damped and forced oscillations, resonance, coupled oscillations, normal modes. Wave Mechanics: Failure of classical physics, qualitative review of relevant experiments, de Brogile waves, uncertainty principle, wave function and Schrodinger equation, probability interpretation, potential barrier and quantum tunneling, potential well, qualitative summary of simple harmonic oscillator and Hydrogen atom UNIT-2 Dielectric and Magnetic Properties of Materials: Dielectric constant and polarization of dielectric materials, types of polarization (Polarizability), Claussius Mussoti–Equation, frequency dependence of dielectric constant, dielectric losses, dielectric material, Langevin’s theory for dia and paramagnetic material, Phenomena of hysteresis and its applications. Crystal structure of solids, Energy band theory, classification into metals, semiconductor, insulators, Fermi energy and its variation with temperature, Hall effect and its applications, semiconductor statistics, equilibrium properties of semiconductors. UNIT –3 Superconductivity: Temperature dependence of resistivity in superconducting materials, Meissner effect, Type–I and Type-II superconductors, Temperature dependence of critical field, BCS theory (qualitative), High temperature superconductors, Characteristics of superconductors in superconducting state, London equations, Applications of Superconductors. Nanomaterials- Basic principle of nanoscience and technology, creation and use of bucky balls, structure, properties and uses of Carbon nanotubes, Applications of nanotechnology. UNIT – 4 Fiber optics: General ideas of optical fiber, types of fibers, acceptance angle and cone, Numerical aperture, Propagation mechanism and communication in optical fiber, Attenuation, Signal Loss in optical fiber and dispersion. Lasers: Spontaneous emission, Stimulated emission, Population inversion, CW and pulsed lasers, Helium-Neon, Nd- YAG, Semiconductor lasers, applications of lasers (include holography) Reference Books:

1. Modern Physics for Engineer, S P Taneja, R Chand Pub. 2. Antenna and wave Propagation, K D Prasad. 3. Modern Engineering Physics, A S Vasudev, S Chand. 4. Quantum Mechanics, Satya Prakash, Pragati Publication.


ECP-100 Basic Electronics Lab L T P Total Credits: 1 - - 2 LIST OF EXPERIMENTS:

1. Identification, Specifications, Testing of passive R, L, C Components (Colour Codes), Potentiometers, Switches (SPDT, DPDT, and DIP), Coils, Gang Condensers, Relays, Bread Boards.

2. Identification, Specifications and Testing of Active Devices, Diodes, BJTs. 3. Soldering practice–Simple Circuits using active and passive components. 4. Single layer and Multi layer PCBs (Identification and Utility). 5. Study and operation of:

(a) Multimeters (Analog and Digital) (b) Function Generator (c) Regulated Power Supplies

6. C.R.O for Measurement of electrical quantities: (a) Voltage measurement. (b) Frequency measurement (c) Phase measurement (d) Component Testing

7. Familiarization of PC hardware: function of different part of PC. 8. Study of different type of storage media: CDROM, CDRW, floppy disk, Zip drive,

Hard Disks etc, 9. To study V-I characteristic of diode. 10. To study half wave and full wave rectifier. 11. To verify truth table of different logic gates. 12. To study operation of PA systems. NOTE: Ten experiments are to be performed, out of which at least seven experiments should be performed from above list. Remaining three experiments may either be performed from the above list or designed & set by the concerned institution as per the scope of the syllabus.

CSP-100 Computer Programming Lab L T P Total Credit: 1 - - 2 LIST OF EXPERIMENTS:

1. Understand the concept of operating system and learn related commands write C programs for following:

2. Addition, subtraction, multiplications, division of 2 numbers. 3. Find max and min of three numbers. 4. Using while loop, find

S= 1 + 3 + 5 + …. Upto N S= x + x2/2 + x3/3 ….N terms.

5. Repeat these exercise using do-while loop. 6. Using for loop, calculate

S= x - x3/3! + x5/5! …. N terms. 7. Using loops, print following design (a) 1 (b) * 12 *** 123 ***** …N lines … N lines.

8. Read 2 numbers. Read the choice of operation. Add them if + is pressed. Subtract if – is pressed. Similarly for multiplication (*) and division (/). 9. Repeat exercise 7 such that program gets repeated again and again until user wants to exit. 10. Using function, compute nCm. 11. Using 1-d array read n numbers and find average. Also find the largest of these numbers. Use functions to implement these operations. 12. Implement following operations on matrices

(a) Addition of two matrices (b) Transpose of a matrix (c) Multiplication of two matrices. NOTE: At least ten experiments have to be performed in the semester; out of which at least seven experiments should be performed from above list. Remaining three experiments may either be performed from the above list or designed & set by the concerned institution.

MEP-100 Computer Aided Designing Lab L T P Total Credit: 1 - - 2 1. Introduction to CAD: Software AUTOCAD 2. Introduction To Modeling: Terminology, the 3 Modes of Display, 3D Models, Turning the 2D sketch into a 3D Model, Viewing your 3D Models. Introduction to modeling tools 2D Drawings: Selection of plane, Sketch Planes & Work Planes the Work Axis, Work Points, lines, curves, and planes, Units, 3D Drawings, Solid and Surface Modeling. 3. Introduction To Tools: Placement Tools: Place Line, Place Block, Place Shape, Place Circle, And Place Arc. Modification Tools: Un-do, Re-do, Delete Element, Drop Line, Shape Status 4. Introduction To Different Commands In Creating A Part: Revolving Steps, Extrude Steps, Mirror steps, Sweeping Steps and Shell Command. 5. Adding Features To Parts: Adding New Features to Your Part, Editing Model Creating Detailed Drawing "Blueprints" Moving, Section Views, Detail Views, Auxiliary. 6. Creating Assemblies in CAD software. . REFERENCE BOOKS:

1. AutoCAD for Dummies - By Mark Middlebrook-Wiley Publication. 2. AutoCAD tutorials. 3. Mastering AutoCAD - George Omura - John Wiley & Sons.

NOTE: At least ten experiments have to be performed in the semester from the above mentioned syllabus.

PHP-100 Physics Lab L T P Total Credit: 1 - - 2 LIST OF EXPERIMENTS: 1. To determine the wavelength of sodium light by Newton’s rings experiment. 2. To find the Specific rotation of sugar solution by using Polarimeter. 3. To find the refractive of a material of a given prism using spectrometer. 4. To find the wavelength of sodium light using Fresnel Biprism 5. To find the capacity of an unknown capacitor by flashing and quenching potential of

argon/neon. 6. To measure the band gap of a semiconductors. 7. To determine the Hall coefficient using Hall Effect. 8. To determine the resistivity of a semiconductor by four probe method. 9. To find the wavelength of various colours of white light with the help of a plane

transmission diffracting grating 10. To convert given galvanometer into an ammeter of given range. 11. To find high resistance by leakage method. 12. To calibrate a voltmeter and an ammeter by using potentiometer. 13 Verification of laws of stretched string- Sonometer. 14. To find the Frequency of A.C. mains-Sonometer. 15. Study of Characteristics of LED and LASER sources. 16. Study of Characteristics of p-i-n and avalanche photo diode detectors. 17. To study the shunting effect of a voltmeter on voltage measurement. 18. Evaluation of Numerical Aperture of a given fiber. 19. Magnetic field along the axis of a current carrying coil-Stewart and Gee's method. 20. To study characteristic of a thermistor 21. To study I-V characteristic and rectification properties of a semiconductor. NOTE: At least 12 experiments are to be performed by students in the semester. At least 10

experiments should be performed from the below list, remaining three experiments may either be performed from the below list or designed and set by the concerned institution as per the scope of the syllabus of PHY-102.

HUP-100 English Language Communication Lab L T P Total Credit: 1 - - 2 LIST OF EXPERIMENTS:

1. Impart communicative skills. 2. Train students to perform in simple day-to-day situations. 3. Overcome common errors in listening/speaking through learning resource centre. 4. Use English language effectively. 5. Help learners to chisel their basic skill of reception/production.

S.No TOPIC AIM PROCEDURE AIDS (LRC) 1. Learn to introduce

yourself To offer greeting and enable learners to introduce themselves effectively

Limitation, Pair work, Group work

Listening/speaking activities, use of Visuals.

2. Learning Pronunciation To train how to speak correct English sounds

Imitation, Miming, Demonstration

Listening/Speaking Activities

3. Basic Communication Patterns

Basic structures: My name is ___ I am ____ My father is ___

Pattern practice, limitation

Handouts, Cassettes, CDs

4. Listening telephonic conversation

To teach syllabic stress of numbers and alphabets

Miming, Pair work, other activities

Cassettes, CDs

5. Listening for information To train for sentence stress and rhythm

Tasks, activities Handouts, cassettes, CDs

6 Learning vocabulary To teach vocabulary in an interesting way to enhance the word-bank of the learner

Games, Pair work, activities

Handouts, songs, listening/speaking tasks

NOTE: Each student have to prepare and maintain a CD record covering all the aspect of lab work.

Semester-3 CSL-201 Computer Organization & Architecture L T P Total Credit=3.5 3 1 -

UNIT – I Introduction and overview: Review of digital components, Evolution of computers. Register Transfer and Micro operation: Register transfer language, register transfer,, arithmetic micro operations, logic micro operations, shift micro operations. Basic Computer Organization and Design: Instruction codes, computer registers, computer instructions, timing & control and instruction cycle. UNIT – II Microprogrammed Control Unit: Control memory, address sequencing. Central Processing Unit: Introduction, general register organization, stack organization, instruction formats, addressing modes. Pipeline and vector processing Parallel Processing, pipelining, arithmetic pipeline, RISC Pipeline, Vector Processing, and Array Processors. UNIT – III Input-Output Organization: Peripheral devices, interrupts, input-output interface, asynchronous data transfer, modes of data transfer, priority interrupt, direct memory access, input-output processor and IO programmed.

UNIT – IV Memory organization: Memory hierarchy, main memory, auxiliary memory, associative memory, cache memory, cache mapping, virtual memory, memory management hardware. Text Books: 1. M Mano, “Computer System and Architecture”, PHI, 1993. References Books: 1. Malvino, “Digital Computer Electronics: An Introduction to Microcomputers”, McGraw

Hill, 1993. 2. J. P. Hayes, “Computer Architecture and Organization”, McGraw Hill, 1998. 3. W. Stallings, “Computer Organization & Architecture”, PHI, 2001.

4. Dandamudi, “Fundamental of Computer Organization & Design”, Wiley Dreamtech, 2005.


CSL-203 Discrete Structures L T P Total Credit=3.5 3 1 - Duration of Exam: 3 Hrs.

Unit-1 Set Theory: Introduction to set theory, Set operations, Algebra of sets, Duality, Finite and Infinite sets, Classes of sets, Power Sets, Multi sets, Cartesian Product, Representation of relations, Types of relation, Equivalence relations and partitions, Partial ordering relations and lattices Function and its types, Composition of function and relations, Cardinality and inverse relations Unit-2 Propositional Calculus: Basic operations: AND(^), OR(v), NOT(~), Truth value of a compound statement, propositions, tautologies, contradictions. Recursion and Recurrence Relation :Polynomials and their evaluation, Sequences, Introduction to AP, GP and AG series, partial fractions, linear recurrence relation with constant coefficients, Homogeneous solutions, Particular solutions, Total solution of a recurrence relation using generating functions.

Unit-3

Algebric Structures: Definition and examples of a monoid, Semigroup, group, Homomorphism, Isomorphism and Automorphism, Normal Subgroup, Cyclic subgroup, Integral domain and fields, Cosets, Lagrange’s theorem(With Proof). Unit-4 Graphs And Trees: Introduction to graphs, Directed and Undirected graphs, Homomorphic and Isomorphic graphs, Subgraphs, Cut points and Bridges, Multigraph and Weighted graph, Paths and circuits, Shortest path in weighted graphs, Eulerian path and circuits, Hamilton paths and circuits, Planar graphs, Euler’s formula, Trees, Spanning trees, Binary trees and its traversals Text Books: 1. Elements of Discrete Mathematics, C.L Liu, 1985, McGraw Hill 2. Discrete Mathematical Structures, B. Kolman and R.C. Busby, 1996, PHI 3. Discrete Mathematical Structures with Applications to Computers by Tembley &

Manohar, 1995, Mc Graw Hill. Reference Books: 1. Discrete Mathematics by Johnson Bough R., 5th Edition, PEA, 2001.. 2. Concrete Mathematics: A Foundation for Computer Science, Ronald Graham, Donald

Knuth and Oren Patashik, 1989, Addison-Wesley.

3. Mathematical Structures for Computer Science, Judith L. Gersting, 1993, Computer Science Press.

4. Applied Discrete Structures for Computer Science, Doerr and Levasseur, (Chicago: 1985,SRA

5. Discrete Mathematics by A. Chtewynd and P. Diggle (Modular Mathematics series), 1995, Edward Arnold, London,

6. Schaums Outline series: Theory and problems of Probability by S. Lipshutz, 1982, McGraw-Hill Singapore.


CSL-205 Data Structures & Algorithms L T P Total Credit=3.5 3 1 -

UNIT – I Fundamentals of algorithm analysis: Big ‘O’ notations, Time and space complexity of algorithms, Elementary data structures and their applications Arrays: ordered lists, representation of arrays, sparse matrices, linked lists: singly and doubly linked lists, stacks, queues, multiples stacks and queues, Applications: polynomial arithmetic, infix, postfix and prefix arithmetic expression conversion and evaluations. UNIT – II Trees: Binary trees: Definition, traversal, threaded binary tree, Counting Binary Tree. Graphs: Representation, traversal, connected components, shortest path and transitive closure, topological sort, activity network, critical path, path enumeration. Dijkstra’s Algorithm, Floyd Warshall’s Algorithm, Minimum Spanning Tree Definitions.

UNIT – III Searching & Sorting: Binary Search Tree, Insertion & Deletion, AVL Trees, Hash function, Hash table, Internal sort: Radixsort, Insertion sort, Exchange sort, Selection sort, Quicksort, Shellsort, Mergesort, Heaport, External sort: K-way mergesort, balanced mergesort, polyphase mergesort UNIT – IV Files: Files, Queries and sequential organization; Cylinder surface indexing, Hashed Indexed, Tree Indexing, B-Trees, Trie Indexing, Sequential file organizational, random file organization, Hashed file organization, Inverted files, cellular partitions. Text Books: 1. E. Horowitz and S. Sahani, “Fundamentals of Data Structures”, Galgotia Booksource Pvt.

Ltd, 1999. 2. R. L. Kruse, B. P. Leung, C. L. Tondo, “Data Structures and program design in C”, PHI,

2000. References Books: 1. Schaum’s outline series, “Data Structure”, TMH, 2002 2. Y. Langsam et. al., “Data Structures using C and C++”, PHI, 1999. 3. Yashwant Kanetkar, “Data Structure through C”, BPB, 2005. NOTE: Eight questions will be set in all by the examiners taking two questions from each unit. Students will be required to attempt five questions in all selecting at least one question from each unit.

ECL-205 Digital Circuits & Systems L T P Total Credit=3.5 3 1 -

UNIT 1 Combinational Circuit Designs: Fundamentals of Digital Techniques, Sum of products and product of sums, Minterms and Maxterms, Design using gates, Karnaugh map and Quine Mcluskey methods of simplification, MEV method, Problem formulation and design of combinational circuits, Adder/Subtractor, Encoder/decoder, Mux/Demux, Code-converters, BCD arithmetic circuits, Comparators, Drivers for display devices, tristate buffer. UNIT 2 Sequential Circuits: Flip Flops: S-R, J-K, T, D, master-slave, edge triggered, shift registers, sequence generators, Counters, Asynchronous and Synchronous Ring counters and Johnson Counter, Timing signal, Analysis of clocked sequential circuits- their design, Fundamental Mode Sequential Circuits: Design of Synchronous and Asynchronous sequential circuits, State equivalence, minimization, state assignment, Circuit implementation, Registers-Shift registers. Stable, Unstable states, Output specifications, Cycles and Races, Race free Assignments, Hazards. UNIT 3 Digital Logic Families: RTL, DTL, DCTL, HTL, TTL, ECL, MOS, and CMOS, BiCMOS logic families, Calculation of noise margin and fan-out, Tristate logic, interfacing of CMOS and TTL families, tristate logic. UNIT 4 A/D and D/A Converters: Sample and hold circuit, weighted resistor and R -2 R ladder D/A Converters, specifications for D/A converters, A/D converters: Quantization, parallel, successive approximation, counting type, dual-slope ADC, specifications of ADCs. Programmable Logic Devices and Semiconductor Memories: ROM, PLA, PAL, FPGA and CPLDs, RAM, Memory decoding, Semiconductor memories. TEXT BOOK: 1. Modern Digital Electronics (Edition III): R. P. Jain; TMH. REFERENCE BOOKS: 1. Digital Integrated Electronics: Taub & Schilling; MGH. 2. Digital Principles and Applications: Malvino & Leach; McGraw Hill. 3. Morris Mano: Digital Design. Third Edition; Prentice Hall, 2002. 4. Digital concepts using standard ICs–Sandige. 5. R J Tocci, Digital Systems: Principles and Applications, Fourth Edition; PHI, 1988. NOTE: Eight questions will be set in all by the examiners taking two questions from each unit. Students will be required to attempt five questions in all selecting at least one question from each unit.

ECL-208 Communication Systems L T P Total Credit=3.5 3 1 - Duration of Exam: 3 Hrs. UNIT1. INTRODUCTION: The essentials of a communication system, modes and media’s, base band and pass band signals, modulation process-need, band width requirements, Analogue vs Digital communication, External noise, Internal noise, S/N ratio, noise figure. Random Signal Theory: Random signals, concept of probability, continuous random variables, probability distribution function, probability density function, joint probability density functions, Statistical average and moments, Ergodic processes, correlation function, power spectral density, central limit theorem, response of linear system to random signals, Error function, regularity, covariance relation among the spectral densities of the two input-output random processes, Cross spectral densities, optimum filters. UNIT 2. AMPLITUDE MODULATION: Definition, time domain and frequency domain description, single tone modulation, power relations in AM waves, generation of AM waves, generation of DSBSC waves, square law modulator, Switching modulator, Detection of AM waves; square law detector, envelope detector, coherent detection of DSBSC waves, single side band modulation, generation of SSB waves, demodulation of SSB waves, VSB Noise in analog communication system, Noise in DSB & SSB system,. UNIT 3 ANGLE MODULATION: Frequency Modulation: single tone FM, spectrum analysis of sinusoidal FM wave, narrow band FM, wide band FM, Transmission bandwidth of FM Wave, Generation of FM Waves, Direct FM, Detection of FM Waves: Balanced Frequency discriminator, Zero crossing detector, Phase locked loop, Comparison of FM & AM, Noise in AM, FM, Threshold effect, Pre-emphasis & de-emphasis. UNIT 4 TRANSMITTER AND RECEIVER: Radio Transmitter-Classification, AM Transmitter, Effect of feedback on performance of AM Transmitter, FM Transmitter–Variable reactance type and phase modulated FM Transmitter, frequency stability in FM Transmitter, Receiver types-TRF, Superhetrodyne RF section and characteristics- Frequency changing and tracking, IF, AGC, FM Receiver, sensitivity, selectivity, fidelity, Comparison with AM Receiver, Amplitude limiting. TEXT BOOKS: 1. Communication systems (4th edn.): Simon Haykins; John wiley & sons. 2. Communication systems: Singh & Sapre; TMH. 3. Communication system: Taub & Schilling; TMH. 4. Analog Communication: Manoj Dhuan, IKI.

REFERENCE BOOKS: 1. Electronic Communication Systems: Kennedy; TMH. 2. Communication Electronics: Frenzel; TMH. 3. Communication systems: Bruce Carlson

HUL-207 Fundamentals of Management L T P Total Credit=3.5 3 1 -

UNIT-1 Meaning of management, Definitions of Management, Characteristics of management, Management Vs Administration. Management –Art, Science and Professional importance of Management. Principles of Management. The Management functions, inter-relationship of Managerial functions. UNIT-2 Nature and Significance of staffing, Personnel Management, Functions of personnel management, Manpower planning, Process of manpower planning, Recruitment, Selection, Promotion – Seniority Vs Merit. Training – Objectives and types of training. UNIT-3 Production Management: Definition, Objectives, Functions and Scope, Production Planning and Control; its significance, stages in production planning and control. Brief introduction to the concepts of material management, inventory control; its importance and various methods. UNIT-4 Marketing Management – Definition of marketing, Marketing concept, objectives and functions of marketing. Marketing Research – Meaning; Definition: objectives; Importance; Limitations; Process, Advertising – meaning of advertising, objectives, functions, criticism. Introduction of Financial Management, Objectives of Financial Management, Functions and Importance of Financial Management. Brief Introduction to the concept of capital structure and various source of finance. Text Books: 1. Principles and Practice Management , RS Gupta, BD Sharma, NS Bhalla Organisation and Management, RD Agarwal. Reference Books: 1. Principles & Practices of Management, IM Prasad NOTE: Eight questions will be set in all by the examiners taking two questions from each unit. Students will be required to attempt five questions in all selecting at least one question from each unit.

CSP-221 Data Structures & Algorithms Lab L T P Total Credit=1 - - 2 LIST OF EXPERIMENTS 1. Write a program to search an element in a two-dimensional array using linear search. 2. Using iteration & recursion concepts write programs for finding the element in the

array using Binary Search Method

3. Write a program to perform following operations on tables using functions only a) Addition b) Subtraction c) Multiplication d) Transpose 4. Using iteration & recursion concepts write the programs for Quick Sort 5. Write a program to implement various operations on string such as length of string concatenation, reverse of a string & copy of a string to another. 6. Write a program for swapping of two numbers using ‘call by value’ and ‘call by

reference strategies. 7. Write a program to implement binary search tree and also Insertion and Deletion in

Binary search Tree 8. Write a program to create a linked list & perform operations such as insert, delete, update, reverse in the linked list. 9 . Write the program for implementation of a file and performing operations such as

insert, delete, update a record in the file. 10. Create a linked list and perform the following operations on it a) add a node b) Delete a node 11. Write a program to simulate the various searching & sorting algorithms and compare

their timings for a list of 1000 elements. 12. Write a program to simulate various graph traversal algorithms. 13. Write a program that simulates various tree traversal algorithms. Note: At least 5 to 10 more exercises to be given by the teacher concerned.

ECP-221 Digital Electronics Lab L T P Total Credit=1 - - 2 LIST OF EXPERIMENTS

1. Study of TTL gates – AND, OR, NOT, NAND, NOR, EX-OR, EX-NOR. 2. Design & realize a given function using K-maps and verify its performance. 3. Design of half adder and full adder using NAND gates. 4. To verify the operation of multiplexer & Demultiplexer. 5. To verify the operation of comparator. 6. To verify the truth tables of S-R, J-K, T & D type flip flops. 7. Set up R-S & JK flip flops using NAND Gates. 8. To verify the operation of bi-directional shift register. 9. To design & verify the operation of 3-bit synchronous counter. 10. To design and verify the operation of synchronous UP/DOWN decade counter using J

K flip-flops & drive a seven-segment display using the same. 11. To design and verify the operation of asynchronous UP/DOWN decade counter using

J K flip-flops & drive a seven-segment display using the same. 12. Study of IC counters 7490, 7492, 7493 and 74192. 10. Astable and monostable multi-

vibrators circuit using 555. 13. To design & realize a sequence generator for a given sequence using J-K flip-flops. 14. Study of CMOS NAND & NOR gates and interfacing between TTL and CMOS gates. 15. Design a 4-bit shift-register and verify its operation. Verify the operation of a ring

counter and a Johnson counter. 16. Code converters - Binary to Gray and gray to Binary using mode control. 17. Study of MUX & DeMUX Circuits and ICs

NOTE: At least ten experiments are to be performed; atleast seven experiments should be performed from above list. Remaining three experiments may either be performed from the above list or designed & set by the concerned institution as per the scope of the syllabus.

CSP-223 Computer Hardware Lab L T P Total Credit=1 - - 2

PC Software: Application of basics of MS Word 2000, MS Excel 2000, MS Power Point

2000, MS Access 2000.

To prepare your Bio Data using MS Word To prepare the list of marks obtained by students in different subjects and show with the help

of chart/graph the average, min and max marks in each subject.

Prepare a presentation explaining the facilities/infrastructure available in your college/institute. Create a database of books in the library on a mini scale w.r.t. Computers and manipulate the

database using different forms and reports.

PC Hardware : To check and measure various supply voltages of PC. To make comparative study of motherboards. To observe and study various cables, connections and parts used in computer communication. To study various cards used in a system viz. display card, LAN card etc. To remove, study and replace floppy disk drive. To remove, study and replace hard disk. To remove, study and replace CD ROM drive. To study monitor, its circuitry and various parts present and some elementary fault detection. To study printer assembly and elementary fault detection of DMP and laser printers. To observe various cables and connectors used in networking. To study parts of keyboard and mouse. Note: At least 5 to 10 more exercises to be given by the teacher concerned. Reference Books: 1. Complete PC upgrade & maintenance guide, Mark Mines, BPB publ. 2. PC Hardware: The complete reference, Craig Zacker & John Rouske, TMH 3. Upgrading and Repairing PCs, Scott Mueller, 1999, PHI,

Semester-4 CSL-202 Principles of Operating Systems L T P Total Credit=3.5 3 1 - Duration of Exam: 3 Hrs. UNIT – I Introduction, Simple Batch Systems, Multiprogrammed Batches systems, Time-Sharing Systems, Personal-computer systems, Parallel systems, Distributed Systems, Real-Time Systems Memory Management: Background, Logical versus Physical Address space, swapping, Contiguous allocation, Paging, Segmentation, Segmentation with Paging Virtual Memory: Demand Paging, Page Replacement, Page-replacement Algorithms, Performance of Demand Paging, Allocation of Frames, Thrashing, Demand Segmentation UNIT – II Processes: Process Concept, Process Scheduling, Operation on Processes, Cooperating Processes, Interprocess Communication CPU Scheduling: Basic Concepts, Scheduling Criteria, Scheduling Algorithms, Process Synchronization: Background, The Critical-Section Problem, Synchronization Hardware, Semaphores, Classical Problems of Synchronization, Critical Regions, Monitors, Atomic Transactions UNIT – III Deadlocks: System Model, Deadlock Characterization, Methods for Handling Deadlocks, Deadlock Prevention, Deadlock Avoidance, Deadlock Detection, Recovery from Deadlock, Device Management: Techniques for Device Management, Secondary-Storage Structure: Disk Structure, Disk Scheduling, Disk Management, Swap-Space Management, Disk Reliability, Stable-Storage Implementation UNIT – IV Information Management: Introduction, A Simple File System, Basic File System, Access Control Verification, Logical File System, Physical File System File-System Interface: File Concept, Access Methods, Directory Structure, Protection, Consistency Semantics File-system. Text Books: 1. Silbersachatz and Galvin, “Operating System Concepts”, Pearson, 5th Ed., 2001 2. Dr. R. C. Joshi, “Operating Systems”, Wiley Dreamtech, 2005. References Books:

1. Tannenbaum, “Operating Systems”, PHI, 4th Edition, 2000

2. E. Madnick, J. Donovan, “Operating Systems”, Tata McGraw Hill, 2001.


CSL-204 Object Oriented Programming Using C++ L T P Total Credit=3.5 3 1 - Duration of Exam: 3 Hrs.

UNIT – 1

Introduction: Introducing Object-Oriented Approach related to other paradigms (functional, data decomposition), Characteristics of Object-Oriented Languages. Basic terms and ideas: Abstraction, Encapsulation, Information hiding, Inheritance, Polymorphism, Review of C, Difference between C and C++, cin, cout, new, delete operators.

UNIT – 2

Classes and Objects: Abstract data types, Object & classes, attributes, methods, C++ class declaration, State identity and behavior of an object, Constructors and destructors, instantiation of objects, Default parameter value, Copy Constructor, Static Class Data, Constant and Classes, C++ garbage collection, dynamic memory allocation.

UNIT – 3

Inheritance and Polymorphism: Inheritance, Types of Inheritance, Class hierarchy, derivation – public, private & protected, Aggregation, composition vs classification hierarchies, Polymorphism, Type of Polymorphism – Compile time and runtime, Method polymorphism, Polymorphism by parameter, Operator overloading, Parametric polymorphism, Generic function – template function, function name overloading, Overriding inheritance methods.

UNIT – 4

Files and Exception Handling: Persistant objects, Streams and files, Namespaces, Exception handling, Generic Classes Standard Template Library: Standard Template Library, Overview of Standard Template Library, Containers, Algorithms, Iterators, Other STL Elements, The Container Classes, General Theory of Operation and Vectors. Text Books: 1. A.R.Venugopal, Rajkumar, T. Ravishanker “Mastering C++”, TMH, 1997. 2. R. Lafore, “Object Oriented Programming using C++”, BPB Publications, 2004. 3. Schildt Herbert, “C++: The Complete Reference”, Wiley DreamTech, 2005. Reference Books: 1. D . Parasons, “Object Oriented Programming with C++”, BPB Publication, 1999. 2.Steven C. Lawlor, “The Art of Programming Computer Science with C++”, Vikas

Publication, 2002. 3. Yashwant Kanethkar, “Object Oriented Programming using C++”, BPB, 2004.

CSL-206 Computer Hardware Technologies L T P Total Credit=3.5 3 1 - Duration of Exam: 3 Hrs.

Unit-1 Memory Memory, memory chips & modules, memory types, advanced memory technologies, troubleshooting memory. Unit-2 Motherboard PC family tree, motherboard controllers and system resources, input-output ports, IRQ, I/O bus system: ISA, MCA, EISA, VESA local bus, PCI, AGP, PCIX; on board I/O devices, ROMBIOS, ROM POST, CMOS setup. Power Supply Power supply function and operation, power supply quality and specification, power protection and back-up, backup power system; UPS; troubleshooting power supply. Unit-3 Interfaces and I/O Ports Floppy disk interface, IDE interface: ATA standards, master-slave configuration, data transfer mode; SCSI interface: SCSI bus, SCSI standards; which is better SCSI or IDE; serial ports, parallel ports, USB, Video adapters, troubleshooting Video adapters. Unit -4 Device drives and peripherals Floppy disk drive, hard disk drive, CD ROM drive, DVD ROM drive, record able drives, keyboards, mice, printers and monitor, trouble shooting drives and peripherals. Text Books 1. Craig Zacker & John Rourtre: PC Hardware- The complete reference, TMH. 2. Mark Minosi: The complete PC Upgrade & Maintenance Guide 4/e, BPB publications. 3. S.K. Chauhan: PC Upgrading, maintenance and troubleshooting guide. . NOTE: Eight questions will be set in all by the examiners taking two questions from each unit. Students will be required to attempt five questions in all selecting at least one question from each unit.

CSL-208 Data Base Management Systems L T P Total Credit=3.5 3 1 - Duration of Exam: 3 Hrs. UNIT – I Basic Concepts and Conceptual Database Design: Database administrator & Database Users, Characteristics of the Database, Database Systems, Concepts and Architecture, Data Models, Schemes & Instances, DBMS Architecture & Data Independence, Database Languages & Interfaces, Overview of Hierarchical, Network & Relational Data Base Management Systems, Data Modelling Using The Entity-Relationship Model – Entities, Attributes and Relationships, Cardinality of Relationships, Strong and Weak Entity Sets, Generalization, Specialization, and Aggregation, Translating your ER Model into Relational Model.

UNIT – II Relational Model, Languages & Systems: Relational Data Model & Relational Algebra, Relational Model Concepts, Relational Model Constraints, Relational Algebra, SQL – A Relational Database Language, Data Definition in SQL, View and Queries in SQL, Specifying Constraints and Indexes in SQL, Practicing SQL commands using ORACLE. UNIT – III

Relational Data Base Design and Oracle Architecture: Functional Dependencies & Normalization for Relational Databases, Functional Dependencies, Normal Forms Based on Primary Keys, (1NF, 2NF, 3NF & BCNF), Lossless Join and Dependency Preserving Decomposition, Oracle 8 Architecture, Database Storage, Oracle Software Structures, Shared Database Access Mechanism, Database Protection. UNIT – IV

Transaction Management: Transaction Concept and State, Implementation of Atomicity and Durability, Concurrent Executions, Serializability, Recoverability, Implementation of Isolation, Concurrency Control Techniques, Lock-Based Protocols, Timestamp-based Protocols, Deadlock Handling, Recovery System, Failure Classification, Storage Structure, Recovery and Atomicity, Log-based Recovery, Shadow Paging, Recovery with Concurrent Transactions, Buffer Management, Indexing, Hashing and Query Processing: Query Processing, Overview, Measures of Query Cost, Selection Operation, Sorting, Join Operation, Other Operations, Evaluation of Expressions, Concepts of Object Oriented Database Management Systems, Distributed Data Base Management Systems.

Text Books: 1. Korth, Silberschatz, “Database System Concepts”, 4th Ed., TMH, 2003. 2. Steve Bobrowski, “Oracle 8 Architecture”, TMH, 2000 References Books:

1. C. J. Date, “An Introduction to Database Systems”, 7th Ed., Narosa Publishing, 2004 2. Elmsari and Navathe, “Fundamentals of Database Systmes”, 4th Ed., A. Wesley, 2004 3. J. D. Ullman, “Principles of Database Systems”, 2nd Ed., Galgotia Publications, 1999.


CSL-210 Automata Theory L T P Total Credit=3.5 3 1 - Duration of Exam: 3 Hrs.

Unit-1

Finite Automata and Regular Expressions: Finite State Systems, Basic Definitions Non-Deterministic finite automata (NDFA), Deterministic finite automata (DFA), Equivalence of DFA and NDFA Finite automata with e-moves, Regular Expressions, Equivalence of finite automata and Regular Expressions, Regular expression conversion and vice versa.

Unit-2

Introduction to Machines: Concept of basic Machine, Properties and limitations of FSM. Moore and mealy Machines, Equivalence of Moore and Mealy machines, Conversion of NFA to DFA by Arden’s Method.

Properties of Regular Sets: The Pumping Lemma for Regular Sets, Applications of the pumping lemma, Closure properties of regular sets, Myhill-Nerode Theorem and minimization of finite Automata, Minimization Algorithm.

Unit-3

Grammars: Definition, Context free and Context sensitive grammar, Ambiguity regular grammar, Reduced forms, Removal of useless Symbols and unit production, Chomsky Normal Form (CNF), Griebach Normal Form (GNF).

Pushdown Automata: Introduction to Pushdown Machines, Application of Pushdown Machines Unit-4

Turing Machines: Deterministic and Non-Deterministic Turing Machines, Design of T.M, Halting problem of T.M., PCP Problem.

Chomsky Hierarchies: Chomsky hierarchies of grammars, Unrestricted grammars, Context sensitive languages, Relation between languages of classes. Computability: Basic concepts, Primitive Recursive Functions. Text Books: 1. Introduction to automata theory, language & computations- Hopcroaft & O.D.Ullman, R

Mothwani, 2001, AW Reference Books: 1. Theory of Computer Sc.(Automata, Languages and computation):K.L.P.Mishra &

N.Chandrasekaran, 2000, PHI.

2. Introduction to formal Languages & Automata-Peter Linz, 2001, Narosa Publ.. 3. Fundamentals of the Theory of Computation- Principles and Practice by RamondGreenlaw

and H. James Hoover, 1998, Harcourt India Pvt. Ltd.. 4. Elements of theory of Computation by H.R. Lewis & C.H. Papaditriou, 1998, PHI. 5. Introduction to languages and the Theory of Computation by John C. Martin 2003,

T.M.H.


CSL-212 Principles of Programming Languages L T P Total Credit=3.5 3 1 - Duration of Exam: 3 Hrs.

Unit-1

Introduction: Syntactic and semantic rules of a Programming language, Characteristics of a good programming language, Programming language translators compiler & interpreters , Elementary data types – data objects, variable & constants, data types, Specification & implementation of elementary data types, Declarations ,type checking & type conversions , Assignment & initialization, Numeric data types, enumerations, Booleans & characters.

Unit-2

Structured data objects : Structured data objects & data types , specification & implementation of structured data types, Declaration & type checking of data structure, vector & arrays, records Character strings, variable size data structures , Union, pointer & programmer defined data objects, sets, files.

Subprograms and Programmer Defined Data Types: Evolution of data type concept , abstraction, encapsulation & information hiding , Subprograms ,type definitions, abstract data types. Unit–3

Sequence Control: Implicit & explicit sequence control, sequence control within expressions, sequence control within statement, Subprogram sequence control: simple call return, recursive subprograms, Exception & exception handlers, co routines, sequence control .

Data Control: Names & referencing environment, static & dynamic scope, block structure, Local data & local referencing environment, Shared data: dynamic & static scope. Parameter & parameter transmission schemes. Unit-4

Storage Management: Major run time elements requiring storage ,programmer and system controlled storage management & phases , Static storage management , Stack based storage management, Heap storage management ,variable & fixed size elements.

Programming Languages: Introduction to procedural, non-procedural, structured, functional and object oriented programming language, Comparison of C & C++ programming languages. Text Book: 1. Programming languages Design & implementation by T.W. .Pratt, 1996, Prentice Hall

Pub. 2. Programming Languages – Principles and Paradigms by Allen Tucker & Robert Noonan,

2002, TMH,

Reference Books: 1. Fundamentals of Programming languages by Ellis Horowitz, 1984, Galgotia publications

(Springer Verlag), 2. Programming languages concepts by C. Ghezzi, 1989, Wiley Publications., 3. Programming Languages – Principles and Pradigms Allen Tucker , Robert Noonan 2002,

T.M.H. NOTE: Eight questions will be set in all by the examiners taking two questions from each unit. Students will be required to attempt five questions in all selecting at least one question from each unit.

CSP-220 Operating System Lab L T P Total Credit=1 - - 2 LIST OF EXPRIMENTS

1. Study of WINDOWS 2000 Operating System 2. Administration of WINDOWS 2000 (including DNS, LDAP, Directory Services) 3. Study of LINUX Operating System (Linux, Kernel, Shell, Basic Commands,

Pipe & Filter commands) 4. Administration of LINUX Operating System 5. Writing of Shell Scripts (Shell programming) 6. AWK programming

Note: At least 5 to 10 more exercises to be given by the teacher concerned.

CSP-222 C ++ Programming Lab L T P Total Credit=1 - - 2 LIST OF EXPRIMENTS 1. Raising a number n to a power p is the same as multiplying n by itself p times. Write a

function called power ( ) that takes a double value for n and an int value for p, and returns the

result as double value. Use a default argument of 2 for p, so that if this argument is omitted,

the number will be squared. Write a main ( ) function that gets values from the user to test

this function.

2. A point on the two dimensional plane can be represented by two numbers: an X

coordinate and a Y coordinate. For example, (4,5) represents a point 4 units to the right of

the origin along the X axis and 5 units up the Y axis. The sum of two points can be defined

as a new point whose X coordinate is the sum of the X coordinates of the points and whose Y

coordinate is the sum of their Y coordinates.

Write a program that uses a structure called point to model a point. Define three points, and have the user input values to two of them. Than set the third point equal to the sum of the other two, and display the value of the new point. Interaction with the program might look like this: Enter coordinates for P1: 3 4 Enter coordinates for P2: 5 7 Coordinates of P1 + P2 are : 8, 11 3. Create the equivalent of a four-function calculator. The program should request the user to enter a number, an operator, and another number. It should then carry out the specified arithmetical operation: adding, subtracting, multiplying, or dividing the two numbers. (It should use a switch statement to select the operation). Finally it should display the result. When it finishes the calculation, the program should ask if the user wants to do another calculation. The response can be ‘Y’ or ‘N’. Some sample interaction with the program might look like this. Enter first number, operator, second number: 10/ 3 Answer = 3.333333 Do another (Y/ N)? Y Enter first number, operator, second number 12 + 100 Answer = 112

Do another (Y/ N) ? N 4. A phone number, such as (212) 767-8900, can be thought of as having three parts: the area code (212), the exchange (767) and the number (8900). Write a program that uses a structure to store these three parts of a phone number separately. Call the structure phone. Create two structure variables of type phone. Initialize one, and have the user input a number for the other one. Then display both numbers. The interchange might look like this:

Enter your area code, exchange, and number: 415 555 1212 My number is (212) 767-8900 Your number is (415) 555-1212 5. Create two classes DM and DB which store the value of distances. DM stores distances in metres and centimeters and DB in feet and inches. Write a program that can read values for the class objects and add one object of DM with another object of DB. Use a friend function to carry out the addition operation. The object that stores the results maybe a DM object or DB object, depending on the units in which the results are required. The display should be in the format of feet and inches or metres and cenitmetres depending on the object on display.

6. Create a class rational which represents a numerical value by two double values- NUMERATOR & DENOMINATOR. Include the following public member Functions:

constructor with no arguments (default). constructor with two arguments. void reduce( ) that reduces the rational number by eliminating the highest common factor between the numerator and denominator. Overload + operator to add two rational number. Overload >> operator to enable input through cin. Overload << operator to enable output through cout. Write a main ( ) to test all the functions in the class. 7. Consider the following class definition class father { protected : int age; public; father (int x) {age = x;} virtual void iam ( ) { cout < < “I AM THE FATHER, my age is : ”<< age<< end1:} }; Derive the two classes son and daughter from the above class and for each, define iam ( ) to write our similar but appropriate messages. You should also define suitable constructors for these classes.Now, write a main ( ) that creates objects of the three classes and then calls iam ( ) for them.

Declare pointer to father. Successively, assign addresses of objects of the two derived classes to this pointer and in each case, call iam ( ) through the pointer to demonstrate polymorphism in action.

8. Write a program that creates a binary file by reading the data for the students from the terminal. The data of each student consist of roll no., name ( a string of 30 or lesser no. of characters) and marks. 9. A hospital wants to create a database regarding its indoor patients. The information to store include Name of the patient Date of admission Disease Date of discharge Create a structure to store the date (year, month and date as its members). Create a base class to store the above information. The member function should include functions to enter information and display a list of all the patients in the database. Create a derived class to store the age of the patients. List the information about all the to store the age of the patients. List the information about all the pediatric patients (less than twelve years in age).

10. Make a class Employee with a name and salary. Make a class Manager inherit from Employee. Add an instance variable, named department, of type string. Supply a method to toString that prints the manager’s name, department and salary. Make a class Executive inherit from Manager. Supply a method to String that prints the string “Executive” followed by the information stored in the Manager superclass object. Supply a test program that tests these classes and methods.

11. Imagine a tollbooth with a class called toll Booth. The two data items are a type unsigned int to hold the total number of cars, and a type double to hold the total amount of money collected. A constructor initializes both these to 0. A member function called payingCar ( ) increments the car total and adds 0.50 to the cash total. Another function, called nopayCar ( ), increments the car total but adds nothing to the cash total. Finally, a member function called displays the two totals.

Include a program to test this class. This program should allow the user to push one key to count a paying car, and another to count a nonpaying car. Pushing the ESC kay should cause the program to print out the total cars and total cash and then exit.

12. Write a function called reversit ( ) that reverses a string (an array of char). Use a for loop that swaps the first and last characters, then the second and next to last characters and so on. The string should be passed to reversit ( ) as an argument.

Write a program to exercise reversit ( ). The program should get a string from the user, call reversit ( ), and print out the result. Use an input method that allows embedded blanks. Test the program with Napoleon’s famous phrase, “Able was I ere I saw Elba)”. 13. Create some objects of the string class, and put them in a Deque-some at the head of the Deque and some at the tail. Display the contents of the Deque using the forEach ( ) function and a user written display function. Then search the Deque for a particular string, using the first That ( ) function and display any strings that match. Finally remove all the items from the Deque using the getLeft ( ) function and display each item. Notice the order in which the items are displayed: Using getLeft ( ), those inserted on the left (head) of the

Deque are removed in “last in first out” order while those put on the right side are removed in “first in first out” order. The opposite would be true if getRight ( ) were used.

14. Create a base class called shape. Use this class to store two double type values that could be used to compute the area of figures. Derive two specific classes called triangle and rectangle from the base shape. Add to the base class, a member function get data ( ) to initialize base class data members and another member function display area ( ) to compute and display the area of figures. Make display area ( ) as a virtual function and redefine this function in the derived classes to suit their requirements.

Using these three classes, design a program that will accept dimensions of a triangle or a rectangle interactively and display the area. Remember the two values given as input will be treated as lengths of two sides in the case of rectangles and as base and height in the case of triangles and used as follows: Area of rectangle = x * y Area of triangle = ½ * x * y

CSP-224 Data Base Management Systems Lab L T P Total Credit=1 - - 2 LIST OF EXPRIMENTS I. Create a database and write the programs to carry out the following operation: Add a record in the database Delete a record in the database Modify the record in the database Generate queries Generate the report List all the records of database in ascending order. II Develop a menu driven project for management of database system: 1. Library information system

(a) Engineering (b) MCA

2. Inventory control system

(c) Computer Lab (d) College Store

3. Student information system

(e) Academic (f) Finance

4. Time table development system

(g) CSE, IT & MCA Departments (h) Electrical & Mechanical Departments

Usage of S/w: 1. VB, ORACLE and/or DB2 2. VB, MSACCESS 3. VB, MS SQL SERVER 2000 Note: At least 5 to 10 more exercises to be given by the teacher concerned.

Semester-5

CSL-301 Principles of Software Engineering L T P Total Credit=3.5 3 1 - Duration of Exam: 3 Hrs. UNIT – I Introduction:Defination of software and software Engineering, Software Crisis, Software Processes & Characteristics, Software life cycle models: Waterfall, Prototype, Evolutionary and Spiral Models Software Requirements analysis & specifications: Requirement engineering, requirement elicitation techniques like FAST, QFD & Use case approach, requirements analysis using DFD, Data dictionaries & ER Diagrams, Requirements documentation, Nature of SRS, Characteristics & organization of SRS. UNIT – II Software Project Planning: Size Estimation like lines of Code & Function Count, Cost Estimation Models, COCOMO, COCOMO-II, Putnam resource allocation model, Risk Management. Software Design: Cohesion & Coupling, Classification of Cohesiveness & Coupling, Function Oriented Design, Object Oriented Design UNIT - III Software Metrics: Software measurements: What & Why, Token Count, Halstead Software Science Measures, Design Metrics, Data Structure Metrics, Information Flow Metrics Software Reliability: Importance, Hardware Reliability & Software Reliability, Failure and Faults, Reliability Models, Basic Model, Logarithmic Poisson Model, Software Quality Models, CMM & ISO 9001. UNIT - IV Software Testing: Testing process, Design of test cases, functional testing: Boundary value analysis, Equivalence class testing, Decision table testing, Cause effect graphing, Structural testing, Path Testing, Data flow and mutation testing, Unit Testing, Integration and System Testing, Debugging, Alpha & Beta Testing, Testing Tools & Standards. Software Maintenance: Management of Maintenance, Maintenance Process, Maintenance Models, Regression Testing, Reverse Engineering, Software Re-engineering, Configuration Management, Documentation. Text Books: 1. K. K. Aggarwal & Yogesh Singh, “Software Engineering”, 2nd Ed., New Age

International, 2005.

2. R. S. Pressman, “Software Engineering – A practitioner’s approach”, 5th Ed., McGraw Hill Int. Ed., 2001.

Reference Books: 1. Stephen R. Schach, “Classical & Object Oriented Software Engineering”, IRWIN,

TMH, 1996. 2. James Peter, W. Pedrycz, “Software Engineering: An Engineering Approach”, John

Wiley & Sons, 2004. 3. I. Sommerville, “Software Engineering”, Addison Wesley, 2004

4. K. Chandrasehakhar, “Software Engineering & Quality Assurance”, BPB, 2005.


CSL-303 Computer Networks L T P Total Credit=3.5 3 1 - Duration of Exam: 3 Hrs.

Unit – I

Uses of Computer Networks, Network Architecture, Reference Model (ISO-OSI, TCP/IP-Overview, IP Address Classes, Subneting), Domain Name Registration & Registrars The Physical Layer: Theoretical basis for data communication, transmission media-Magnetic Media, Twisted Pair, Baseband Coaxial Cable, Broadband Coaxial Cable, Fibre Cable, Structured Cabling, Cable Mounting, Cable Testing, Wireless transmission, , narrowband ISDN, broadband ISDN and ATM.

Unit – II

The Data Link Layer: Data link layer design issues, error detection and correction, data link protocols, sliding window protocols, Examples of Data Link Protocols. The Medium Access Sublayer: The channel allocation problem, multiple access protocols, IEEE standard 802 for LANS and MANS, high-speed LANs, satellite networks, Network devices-repeaters, hubs, switches and bridges. Unit – III The Network Layer: Network layer design issues, routing algorithms, congestion control algorithm, internetworking, the network layer in the internet, the network layer in ATM networks. IP version 4 and 6, SONET/SDH, FDDI and transport Layer. Unit – IV The session layer, presentation and application layers, ISO protocols Text Books: 1. A. S. Tananbaum, “Computer Networks”, 3rd Ed, PHI, 1999. 2. D. E. Comer and D. L. Stevens . Internetworking with TCP-IP: Design, Implementation and Internals, Prentice Hall, 1990. Reference Books: 1. U. Black, “Computer Networks-Protocols, Standards and Interfaces”, PHI, 1996. 2. W. Stallings, “Computer Communication Networks”, PHI, 1999. 3. Laura Chappell (ed), “Introduction to Cisco Router Configuration”, Techmedia, 1999. 4. Michael A. Miller, “Data & Network Communications”, Vikas Publication, 1998. 5. William A. Shay, “Understanding Data Communications & Networks”, Vikas

Publication, 1999.

CSL-305 Security of Information System L T P Total Credit=3.5 3 1 -

Duration of Exam: 3 Hrs

Unit-1

Basic Encryption and Decryption

Terminology and Background: Encryption, Decryption and Cryptosystems, Plain Text and Cipher Text, Encryption Algorithms, Cryptanalysis. Introduction to Ciphers: Monoalphabetic Substitutions such as the Caesar Cipher, Cryptanalysis of Monoalphabetic Ciphers, Polyalphabetic Ciphers such as Vigenere Tableaux, Cryptanalysis of Polyalphabetic Ciphers, Perfect Substitution Cipher such as the Vernam Cipher, Stream and Block Ciphers, Characteristics of ‘Good’ Ciphers: Shannon Characteristics, Confusion and Diffusion, Information Theoretic Tests, Unicity Distance. Unit-2 Properties of Arithmetic Operations: Inverses, Primes, Greatest Common Divisor, Euclidean Algorithm, Modular Arithmetic, Properties of Modular Arithmetic, Computing the inverse, Fermat's Theorem, Algorithm for Computing Inverses, Random number generation. Hash Algorithms: Hash Concept and Description of Hash Algorithms. Secure Secret Key (Symmetric ) Systems: The Data Encryption Standard (DES),Analyzing and Strengthening of DES, Key Escrow and Clipper, Introduction to Advance Encryption Standard (AES) Unit–3 Public Key (Asymmetric key) Encryption Systems: Concept and Characteristics of Public key Encryption System, Introduction to Merkle-Hellman Knapsacks, Rivest-Shamir-Adelman (RSA) Encryption in Detail, Introduction to Digital Signature Algorithms , The Digital Signature Standard (DSA). Applied Cryptography, Protocols and Practice Key Management Protocols:Solving Key Distribution Problem, Diffie-Hellman Algorithm, Key Exchange with Public Key Cryptography. Public Key Infrastructure (PKI): Concept of Digital Certificate, Certificate Authorities and it's roles, X509 Structure of Digital Certificate, Types of Public Key Infrastructures. Legal Issues: Copyrights, Patents, Trade Secrets, Computer Crime, Cryptography and the Law. Unit-4 Network Security Network Security Issues such as Impersonation, Message Confidentiality, Message Integrity, Code Integrity, Denial of Service, Secure Communication Mechanisms such as IPSec, PKI based Authentication and Kerberos Authentication, Biometrics Authentication Mechanisms, Access Control Mechanisms, Firewalls

Web Security: Solving Privacy Problems, Solving Authentication Problems, Secure Socket Layer (SSL) Protocol, Secure Electronic Transaction (SET) Protocol , Safe Guarding Web Servers.

Reading List Title Author 1. Security in Computing Charls P Pfleeger 2. Applied Cryptography Protocols, Bruce Schneier

3. Algorithms and Source Code in C 4. Security Technologies for the World Rolf Oppliger

Wide Web 5.Digital Certificates Applied Internet Jalal Feghhi, Peter Williams

6. The World Wide Web Security FAQ Lincoln D Stein 7. Cryptographic message syntax standards RSA Laboratories


CSL-307 Computer Graphics L T P Total Credit=3.5 3 1 - Duration of Exam: 3 Hrs.

UNIT – 1

Transformation, Projections, and Clipping Algorithms: Bresenham’s Line Drawing Algorithm, Homogeneous Coordinate System for 2D and 3D, Various 2D, 3D Transformation matrices (Translation, Scaling, Rotation, Shear), Rotation about an arbitrary point (2D), Rotation about an arbitrary axis (3D), Computing location of V.P, Clipping Algorithms, Sutherland-Cohen Clipping Algorithm.

UNIT – 2

Curves and Surfaces: Bresenham’s Circle Drawing Algorithm, Bezier Curves, 4 point and 5 point Bezier curves using Bernstein Polynomials, Conditions for smoothly joining curve segments, Bezier bi-cubic surface patch, B-Spline Curves, Cubic B-Spline curves using uniform knot vectors, Testing for first and second order continuities

UNIT – 3

Projection and Solid Modelling: Parallel Projection, Oblique Projection on xy plane, Isometric Projection, Perspective Projection, One Vanishing Point (V.P.) projection from a point on z axis, Generation of 2 V.P. Projection, Isometric Projection, Perspective, Projection, one vanishing Pint (VP), projection from 0 point on z axis, Generation of 2 VP Projector & Projections, Solid Modelling.

UNIT – 4

Shading and Hidden Surface Removal: Shading, Illumination Model for diffused Reflection, Effect of ambient lighting, distances, Specular Reflection Model, Computing Reflection Vector, Curved Surfaces, Polygonal Approximations, Gourard Shading, Phong Model, Hidden Surface Removal, Back Face Detection, Depth Buffer (Z-Buffer, A-Buffer) Method, Scan Line Method, Depth Sorting Method, Area Subdivision Method.

Text Books: 1. Foley et. al., “Computer Graphics Principles & practice”, Addison Wesley, 1999. 2. David F. Rogers, “Procedural Elements for Computer Graphics”, McGraw Hill Book

Company, 1985. References Books: 1. D. Rogers and J. Adams, “Mathematical Elements for Computer Graphics”,

MacGraw-Hill International Edition, 1989. 2. D. Hearn and P. Baker, “Computer Graphics”, Prentice Hall, 1986. 3. R. Plastock and G. Kalley, “Theory and Problems of Computer Graphics”, Schaum’s

Series, McGraw Hill, 1986.

ECL-305 Microprocessor & Interfacing L T P Total Credit=3.5 3 1 - Duration of Exam: 3 Hrs. UNIT 1 The 8085 Processor: Introduction to microprocessor, 8085 microprocessor: Architecture, instruction set, interrupt structure, and assembly language programming. The 8086 Microprocessor Architecture: Architecture, block diagram of 8086, details of sub-blocks such as EU, BIU; Special functions of General purpose registers. 8086 flag register and function of 8086 Flags, memory segmentation and physical address computations, program relocation, addressing modes, instruction formats, pin diagram and description of various signals. UNIT 2 Instruction Set of 8086: Instruction execution timing, assembler instruction format, data transfer instructions, arithmetic instructions, branch instructions, looping instructions, NOP and HLT instructions, flag manipulation instructions, logical instructions, shift and rotate instructions, directives and operators, programming examples. UNIT3 Interfacing Device: The 8255 PPI chip: Architecture, control words, modes and examples, Interfacing Keyboard, Displays, Stepper Motor and actuators, D/A and A/D converter interfacing. DMA : Introduction to DMA process, Need for DMA, 8237 DMA controller, DMA data transfer Method, Interfacing with 8257. UNIT 4 Interrupt and Timer: 8259 Programmable interrupt controller, Programmable interval timer chips. Serial Data Transfer Schemes Serial data transfer schemes. Asynchronous and Synchronous data transfer schemes. 8251 USART architecture and interfacing. TTL to RS 232C and RS232C to TTL conversion. Sample program of serial data transfer. Introduction to High-speed serial communications standards, USB. Text Books: 1. Microprocessor Architecture, Programming & Applications with 8085: Ramesh S

Gaonkar; Wiley Eastern Ltd. 2. The Intel Microprocessors 8086- Pentium processor: Brey; PHI 3. Microprocessors and interfacing - Douglas V. Hall, TMH, 2nd Edition, 1999.

Reference Books: 1. The 8088 & 8086 Microprocessors-Programming, interfacing, Hardware & Applications:

Triebel & Singh; PHI 2. Advanced Microprocessors and Interfacing: Badri Ram; TMH. 3. Advanced microprocessor and Peripherals - A.K.Ray and K.M.Bhurchandi, TMH, 2000. 4. Design with PIC Micro Controllers – John B. Peatman, 2005. 5. 8051 Micro Controllers and Embedded Systems – Dr. Rajiv Kapadia, Jaico Publishers. 6. 8051 Microcontroller - Kenneth J. Ayala, Penram International/ Thomson, 3rd Edition,

2005. NOTE: Eight questions will be set in all by the examiners taking two questions from each unit. Students will be required to attempt five questions in all selecting at least one question from each unit.

HUL-209 Economics L T P Total Credit=3.5 3 1 - Duration of Exam: 3 Hrs. Course Objective: The purpose of this course is to acquaint the student in the basic economic concepts and their operational significance and stimulate her to think systematically and objectively about contemporary economic problems.

Unit-I

Definition of Economics-various definitions, circular flow of economic activity, Production possibility curve Economic laws and their nature. Relation between Science, Engineering, Technology and Economics. Concepts and measurement of utility, Law of Diminishing Marginal Utility, Law of equi-marginal utility - its practical application and importance, the concept of equilibrium

Unit-II

Meaning of Demand, Individual and Market demand schedule, Law of demand, shape of demand curve, Elasticity of demand, measurement of elasticity of demand, factors effecting elasticity of demand, practical importance & applications of the concept of elasticity of demand, the indifference curve theory, consumers surplus

Unit-III

Objective of business firm, Meaning of production and factors of production; Law of variable proportions, Returns to scale, Internal and External economics and diseconomies of scale. Various concepts of cost - Fixed cost, variable cost, average cost, marginal cost, money cost, real cost opportunity cost. Shape of average cost, marginal cost, total cost etc. in short run and long run. Unit-IV

Meaning of Market, Types of Market - Perfect Competition, Monopoly, Oligoply, Monoplistic Competition (Main features of these markets) Supply and Law of Supply, Role of Demand & Supply in Price Determination and effect of changes in demand and supply on prices.

Nature and characteristics of Indian economy (brief and elementary introduction),

national income concept, Privatization - meaning, merits and demerits, Balance of

payment, Globalisation of Indian economy - merits and demerits. Elementary Concepts

of VAT, WTO, GATT & TRIPS agreement, IMF, World Bank.

Text Books: 1. Principles of Economics: P.N. Chopra (Kalyani Publishers). 2. Modern Economic Theory – K.K. Dewett (S.Chand) Reference Books: 1. A Text Book of Economic Theory Stonier and Hague (Longman’s Landon) 2. Micro Economic Theory – M.L. Jhingan (S.Chand) 3. Micro Economic Theory - H.L. Ahuja (S.Chand) 4. Modern Micro Economics: S.K. Mishra (Pragati Publications) 5. Economic Theory - A.B.N. Kulkarni & A.B. Kalkundrikar (R.Chand & Co.) 6. Indian Economy: Rudar Dutt & K.P.M. Sundhram 7. Indian Economy-Mishra &Puri


CSP-321 Computer Graphics Lab L T P Total Credit=1 - - 2

List of programs 1. Write a program for 2D line drawing as Raster Graphics Display. 2. Write a program for circle drawing as Raster Graphics Display. 3. Write a program for polygon filling as Raster Graphics Display 4. Write a program for line clipping. 5. Write a program for polygon clipping. 6. Write a program for displaying 3D objects as 2D display using perspective

transformation. 7. Write a program for rotation of a 3D object about arbitrary axis. 8. Write a program for Hidden surface removal from a 3D object. Note: At least 5 to 10 more exercises to be given by the teacher concerned.

CSP-321 Software Engineering Lab L T P Total Credit=1 - - 2

At least ten experiments are to be performed set by the concerned teacher as per the scope of the syllabus and availability of software engineering tools.

ECP-325 Microprocessor and Interfacing Lab L T P Total Credit=1 - - 2 LIST OF EXPERIMENTS

1. Study of 8085 Microprocessor kit. 2. Write a program using 8085 and verify for :

a. Addition of two 8-bit numbers. b. Addition of two 8-bit numbers (with carry).

3. Write a program using 8085 and verify for : a. 8-bit subtraction (display borrow) b. 16-bit subtraction (display borrow)

4. Write a program using 8085 for multiplication of two 8- bit numbers by repeated addition method. Check for minimum number of additions and test for typical data.

5. Write a program using 8085 for multiplication of two 8- bit numbers by bit rotation method and verify.

6. Write a program using 8085 for division of two 8- bit numbers by repeated subtraction method and test for typical data.

7. Write a program using 8085 for dividing two 8- bit numbers by bit rotation method and test for typical data.

8. Study of 8086 microprocessor kit. 9. Introduction to MASM/TASM 10. Write a program using 8086 for division of a defined double word (stored in a data

segment) by another double word division and verify. 11. Write a program using 8086 for finding the square root of a given number and verify. 12. Write a program using 8086 for copying 12 bytes of data from source to destination

and verify. 13. Write a program using 8086 and verify for:

a. Finding the largest number from an array. b. Finding the smallest number from an array.

14. Write a program using 8086 for arranging an array of numbers in descending order and verify.

15. Write a program using 8086 for arranging an array of numbers in ascending order and verify.

16. Write a program for finding square of a number using look-up table and verify. 17. Write a program to interface a two digit number using seven-segment LEDs. Use

8085/8086 microprocessor and 8255 PPI. 18. Write a program to control the operation of stepper motor using 8085/8086

microprocessor and 8255 PPI. 19. 8259 – Interrupt Controller: Generate an interrupt using 8259 timer. 20. 8279 – Keyboard Display: Write a small program to display a string of characters. 21. 8255 – PPI: Write ALP to generate sinusoidal wave using PPI. 8251 – USART:


IPT-325 Practical Training L T P Total Credit=2 - - - Duration of Exam: 3 Hrs.

Practical training conducted after fourth semester will be evaluated in the fifth Semester based on Viva-Voce.

Semester-6 CSL-302 Distributed Operating System L T P Total Credit=3.5 3 1 -


Unit-1 Introduction: Introduction to Distributed System, Goals of Distributed system, Hardware and Software concepts, Design issues. Communication in distributed system: Layered protocols, ATM networks, Client – Server model ,Remote Procedure Calls and Group Communication. Middleware and Distributed Operating Systems. Unit-2 Synchronization in Distributed System: Clock synchronization, Mutual Exclusion, Election algorithm, the Bully algorithm, a Ring algorithm, Atomic Transactions, Deadlock in Distributed Systems, Distributed Deadlock Prevention, Distributed Deadlock Detection . Unit-3 Processes and Processors in distributed systems: Threads, System models, Processors Allocation, Scheduling in Distributed System, Real Time Distributed Systems. Unit-4 Distributed file systems: Distributed file system Design, Distributed file system Implementation, Trends in Distributed file systems. Distributed Shared Memory: What is shared memory, Consistency models, Page based distributed shared memory, shared variables distributed shared memory. Case study MACH: Introduction to MACH, process management in MACH, communication in MACH, UNIX emulation in MACH.

Text Book:

Distributed Operating System – Andrew S. Tanenbaum, PHI. Distributed Operating System –P. K. Sinaha, Wesley Publisher


CSL-304 Intelligent Systems L T P Total Credit=3.5 3 1 -


Unit-1: Foundational issues in intelligent systems: Foundation and history of AI, AI problems and techniques – AI programming languages, introduction to LISP and PROLOG- problem spaces and searches, blind search strategies, Breadth first- Depth first- heuristic search techniques Hill climbing: best first- A * algorithm AO* algorithm- game tree, Min max algorithms, game playing- alpha beta pruning.

Unit-2: Knowledge representation issues, predicate logic- logic programming, semantic nets- frames and inheritance, constraint propagation, representing knowledge using rules, rules based deduction systems. Reasoning under uncertainty, review of probability, Baye’s probabilistic inferences and Dempster shafer theory, Heuristic methods, symbolic reasoning under uncertainty, Statistical reasoning, Fuzzy reasoning, Temporal reasoning, Non monotonic reasoning. Unit-3: Planning, planning in situational calculus, representation for planning, partial order planning algorithm, learning from examples, discovery as learning, learning by analogy, explanation based learning, neural nets, genetic algorithms. Unit-4: Principles of Natural language processing, rule based systems architecture, Expert systems, knowledge acquisition concepts, AI application to robotics, and current trends in intelligent systems. Text Book:

1. Artificial Intelligence: A Modern Approach,. Russell & Norvig. 1995, Prentice Hall. Reference Books: 1. Artificial Intelligence, Elain Rich and Kevin Knight, 1991, TMH. 2. Artificial Intelligence-A modern approach, Staurt Russel and peter norvig, 1998, PHI. 3. Artificial intelligence, Patrick Henry Winston:, 1992, Addition Wesley 3rd Ed.,


ECL-308 Digital System Design L T P Total Credit=3.5 3 1 - Duration of Exam: 3 Hrs

Unit-1 Introduction: Introduction to Computer-aided design tools for digital systems. Hardware description languages; introduction to VHDL, data objects, classes and data types, Operators, Overloading, logical operators.Types of delays Entity and Architecture declaration. Introduction to behavioural, dataflow and structural models. Unit-2 VHDL Statements : Assignment statements, sequential statements and process, conditional statements, case statement Array and loops, resolution functions, Packages and Libraries, concurrent statements. Subprograms: Application of Functions and Procedures, Structural Modelling, component declaration, structural layout and generics. Unit-3 Combinational Circuit Design: VHDL Models and Simulation of combinational circuits such as Multiplexers, Demultiplexers, encoders, decoders, code converters, comparators, implementation of Boolean functions etc. Sequential Circuits Design : VHDL Models and Simulation of Sequential Circuits Shift Registers, Counters etc. Unit -4 Design of Microcomputer : Basic components of a computer, specifications, architecture of a simple microcomputer system, implementation of a simple microcomputer system using VHDL Design with CPLDs and FPGAs : Programmable logic devices : ROM, PLAs, PALs, GAL, PEEL, CPLDs and FPGA. Design implementation using CPLDs and FPGAs Text Book:

“Digital System Design using VHDL” : Charles. H.Roth ; PWS (1998). "VHDL-Analysis & Modelling of Digital Systems” : Navabi Z; McGraw Hill.

Reference Books:

IEEE Standard VHDL Language Reference Manual (1993). Digital Design and Modelling with VHDL and Synthesis : KC Chang; IEEE

Computer Society Press. "A VHDL Primmer” : Bhasker; Prentice Hall 1995. VHDL-IV Edition :Perry; TMH (2002) ”Introduction to Digital Systems” : Ercegovac. Lang & Moreno; John Wiley (1999).

Fundamentals of Digital Logic with VHDL Design : Brown and Vranesic; TMH (2000) Modern Digital Electronics- III Edition: R.P Jain; TMH (2003).


CSL-306 Analysis and Design of Algorithms L T P Total Credit=3.5 3 1 -


UNIT – I Preliminaries: Review of growth of functions, Recurrences: The substitution method, The iteration method, The master method, Data Structures for Disjoint Sets. Divide and Conquer Approach: Merge Sort, Quick sort, Medians and Order statistics, Strassen’s algorithm for Matrix Multiplications. UNIT – II Dynamic Programming: Elements of Dynamic Programming, Matrix Chain Multiplication, Longest common subsequence and optimal binary search trees problems. Greedy Algorithms: Elements of Greedy strategy, An activity selection problem, Huffman Codes, A task scheduling problem. UNIT – III Graph Algorithms: Representation of Graphs, Breadth First Search, Depth First Search, Topological Sort, Strongly Connected Components, Algorithm for Kruskal’s and Prim’s for finding Minimum cost Spanning Trees, Dijkstra’s and Bellman Fort Algorithm for finding Single source shortest paths. All pair shortest paths and matrix multiplication, Floyd – Warshall algorithm for all pair shortest paths. UNIT – IV String matching: The naïve String Matching algorithm, The Rabin-Karp Algorithm, String Matching with finite automata, The Knuth-Morris Pratt algorithm. NP-Complete Problem: Polynomial-time verification, NP-Completeness and Reducibility, NP-Completeness Proof, NP-Complete problems. Text Books: 1. T. H. Cormen, C. E. Leiserson, R. L. Rivest, Clifford Stein, “Introduction to

Algorithms”, 2nd Ed., PHI, 2004. References Books: 1. A. V. Aho, J. E. Hopcroft, J. D. Ullman, “The Design and Analysis of Computer

Algorithms”, Addition Wesley, 1998. 2. Ellis Horowitz and Sartaz Sahani, “Computer Algorithms”, Galgotia Publications,

1999. 3. D. E. Knuth, “The Art of Computer Programming”, 2nd Ed., Addison Wesley, 1998.


CSL-308 Multimedia Technologies L T P Total Credit=3.5 3 1 -


UNIT -1: Introduction to Multimedia System: Architecture and components, Multimedia

distributed processing model, Synchronization, Orchestration and Quality of Service (QOS)

architecture. Audio and Speech: Data acquisition, Sampling and Quantization, Human

Speech production mechanism, Digital model of speech production, Analysis and synthesis,

Psycho-acoustics, low bit rate speech compression, MPEG audio compression.

UNIT -2: Images and Video: Image acquisition and representation, Composite video signal

NTSC, PAL and SECAM video standards, Bilevel Image Compression standards: ITU

(formerly CCITT) Group III and IV standards, JPEC image compression standards, MPEG

video compression standards.

UNIT -3: Multimedia Communication: Fundamentals of data communication and

networking, Bandwidth requirements of different media, Real time constraints: Audio

latency, Video data rate, multimedia over LAN and WAN, Multimedia conferencing.

Hypermedia presentation: Authoring and Publishing, Linear and mon-liner presentation,

Structuring Information, Different approaches of authoring hypermedia documents,

Hypermedia data models and standards.

UNIT -4: Multimedia Information Systems: Operating system support for continuous

media applications: limitations is usual OS, New OS support, Media stream protocol, file

system support for continuous media, data models for multimedia and hypermedia

information, content based retrieval of unstructured data.

Text Books: 1. Steve Heath, “Multimedia & Communication Systems”, Focal Press, UK, 1999. 2. Tay Vaughan, “Multimedia: Making it work”, TMH, 1999. 3. K. Andleigh and K. Thakkar, “Multimedia System Design”, PHI, PTR, 2000.

References Books: 1. Keyes, “Multimedia Handbook”, TMH, 2000. 2. Ralf Steinmetz and Klara Naharstedt, “Multimedia: Computing, Communications &

Applications”, Pearson, 2001. 3. Steve Rimmer, “Advanced Multimedia Programming”, MHI, 2000. NOTE: Eight questions will be set in all by the examiners taking two questions from each unit. Students will be required to attempt five questions in all selecting at least one question from each unit.

CSL-310 Visual Programming

L T P Credits 3.5 3 1 - Duration of Exam: 3 Hrs

Unit-I.

Introduction to Visual Basic: Writing Window Applications with Visual Basic, The

Windows Graphical User Interface, Programming Languages – Procedural, Event Driven,

and Object Oriented, The Object Model, Writing Visual Basic Projects: The Three-Step

Process, Visual Basic Application Files,

The Visual Studio Environment: The IDE Start Page, The New Project Dialog, The IDE

Main Window, The Toolbars, The Document Window, The Form Designer, The Solution

Explorer Window, The Properties Window, The Toolbox, Design Time, Run Time, and

Break Time.

Unit-2

More Controls:

Text Boxes, Group Boxes, Check Boxes, Radio Buttons, Picture Boxes, Setting a Border and

Style, Drawing a Line

Working with Multiple Controls: Selecting Multiple Controls, Deselecting a Group of

Controls, Moving Controls as a Group, Setting Properties for Multiple Controls, Aligning

Controls, Designing the User Interface, Defining Keyboard Access Keys, Setting the

Default and Cancel Properties of Buttons, Setting the Tab Order for Controls, Setting the

From’s Location on the Screen, Creating Tooltips

Variables, Constants and Calculations:

Data: Variables and Constants, Data Types, Naming Rules, Naming Conventions,

Constant: Named and Intrinsic, Declaring Variables, Scope and Lifetime of Variables.

Handling Exceptions, Try/Catch Blocks,

Displaying Messages in Message Boxes: The TextMessage String, The Title Bar Text,

MessageBox Buttons, MessageBox Icons, Using Overloaded Methods

Unit-3

Decisions and Conditions:

If Statements, LISTS, LOOPS: List Boxes and Combo Boxes, The Items Collection,

Filling a List, The SelectedIndex Property, The Items Count Property, Referencing the Items

Collection, Removing an Item from a List, Clearing a List, List Box and Combo Box Events,

Do/Loops, For/Next Loops

Unit-4.

Menus, Sub Procedures, and Functions: Menus, Creating Context Menus, Writing

General Procedures, GRAPHICS, ANIMATION, Toolbars and Status Bars, Image

Lists, Toolbars, Status Bars, The Calendar Controls

Text Books

Microsoft Visual Basic By Steven Holzner (Pub: BPB) Visual Basic Programming, 2nd edition by Steven Holzner(Pub: PHI) Using Visual Basic for Applications By Paul Sanna(Pub: PHI) MSDN Help


CSP-320 Intelligent Systems Lab

L T P Total Credit=1 - - 2 LIST OF EXPRIMENTS 1. Study of PROLOG.

Write the following programs using PROLOG. 2. Write a program to solve 8 queens problem. 3. Solve any problem using depth first search. 4. Solve any problem using best first search. 5. Solve 8-puzzle problem using best first search 6. Solve Robot (traversal) problem using means End Analysis. 7. Solve traveling salesman problem. Note: At least 5 to 10 more exercises to be given by the teacher concerned.

ECP-326 Digital Systems Design Lab

L T P Total Credit=1 - - 2 LIST OF EXPERIMENTS 1. Design all gates using VHDL. 2. Write VHDL programs for the following circuits, check the wave forms and the

hardware generated a. half adder b. full adder 3. Write VHDL programs for the following circuits, check the wave forms and the

hardware generated a. multiplexer b. demultiplexer 4. Write VHDL programs for the following circuits, check the wave forms and the

hardware generated a. decoder b. encoder 5. Write a VHDL program for a comparator and check the wave forms and the hardware

generated 6 Write a VHDL program for a code converter and check the wave forms and the

hardware generated 7. Write a VHDL program for a FLIP-FLOP and check the wave forms and the

hardware generated 8. Write a VHDL program for a counter and check the wave forms and the hardware

generated 9. Write VHDL programs for the following circuits, check the wave forms and the

hardware generated a. register b. shift register 10. Implement any three (given above) on FPGA/CPLD kit Note : Ten experiments are to be performed out of which at least seven experiments should be performed from above list. Remaining three experiments may either be performed from the above list or designed & set by the concerned institution as per the scope of the syllabus.

CSP-322 Visual Programming Lab

L T P Total Credit=1 - - 2 LIST OF EXPRIMENTS

1. Study window’s API’s. Find out their relationship with MFC classes. Appreciate how they are helpful in finding complexities of window’s programming.

2. Get familiar with the essential classes in a typical (document view

architecture) VC program and their relationships with each other. 3. Write a program to handle the mouse event right click on client area and

display a message box as “Right Button Click”. 4. Create a simple model dialog box to read the information about a student i.e.

name, roll no. Class using appropriate fields. 5. Write a simple console application to create archive class object from file class

that reads and stores a simple structure (record). 6. Create a simple database in MS access and connect it to Visual Basic using

ADO or DAO. 7. Write a program that reads a text and changes its font, font size as selected by

the user from different fonts contained in a list box. 8. With the help of Visual Basic, created an object of excel application and

implement any function of it. 9. Write a simple program that displays an appropriate message when an illegal

operation is performed, using error handling technique in VB. 10. Make an active X control of your own using Visual Basic.

You may use : Visual Basic 6.0 NET / OR IBM Websphere Studio Application Server Note: At least 3 to 5 more exercises to be given by the teacher concerned.

Semester-7 CSL-401 Advanced Computer Architecture L T P Total Credit=3.5 3 1 -


UNIT – 1 Parallel computer models: The state of computing , Multiprocessors and multicomputers, Multivector and SIMD computers, Architectural development tracks Program and network properties :Conditions of parallelism, Data and resource dependences,Hardware and software parallelism,Program partitioning and scheduling, Grain size and latency, Program flow mechanisms,Control flow versus data flow,Data flow architecture,Demand driven mechanisms,Comparisons of flow mechanisms. UNIT - 2 System Interconnect Architectures : Network properties and routing, Static interconnection networks, Dynamic interconnection Networks, Multiprocessor system interconnects, Hierarchical bus systems, Crossbar switch and multiport memory,Multistage and combining network. Processors and Memory Hierarchy : Advanced processor technology, Instruction-set Architectures,CISC Scalar Processors, RISC Scalar Processors, Superscalar Processors,VLIW Architectures, Vector and Symbolic processors Memory Technology :Hierarchical memory technology, Inclusion, Coherence and Locality, Memory capacity planning, Virtual Memory Technology. UNIT - 3 Backplane Bus System: Backplane bus specification, Addressing and timing protocols, Arbitration transaction and interrupt, Cache addressing models, Direct mapping and associative caches. Pipelining :Linear pipeline processor, Nonlinear pipeline processor, Instruction pipeline design, Mechanisms for instruction pipelining, Dynamic instruction scheduling, Branch handling techniques, Arithmetic Pipeline Design, Computer arithmetic principles, Static arithmetic pipeline, Multifunctional arithmetic pipelines UNIT - 4 Vector Processing Principles : Vector instruction types, Vector-access memory schemes.

Synchronous Parallel Processing : SIMD Architecture and Programming Principles, SIMD Parallel Algorithms, SIMD Computers and Performance Enhancement

Text Books:

1. Kai Hwang, “Advanced computer architecture”; TMH, 2000.

References Books: 1. J.P.Hayes, “computer Architecture and organization”, MGH, 1998. 2. M.J Flynn, “Computer Architecture, Pipelined and Parallel Processor Design”, Narosa

Publishing, 1998. 3. D.A.Patterson, J.L.Hennessy, “Computer Architecture :A quantitative approach”,

Morgan Kauffmann, 2002. 4. Hwang and Briggs, “ Computer Architecture and Parallel Processing”; MGH, 2000.


CSL-403 Software Project Management L T P Total Credit=3.5 3 1 -


Unit-1 Introduction to Software Project Management (SPM): Definition of a Software Project (SP), SP Vs. other types of projects activities covered by SPM, categorizing SPs, project as a system, management control, requirement specification, information and control in organization. Stepwise Project planning: Introduction, selecting a project, identifying project scope and objectives, identifying project infrastructure, analyzing project characteristics, identifying project products and activities, estimate efforts each activity, identifying activity risk, allocate resources, review/ publicize plan. Unit-2 Project Evaluation & Estimation: Cost benefit analysis, cash flow forecasting, cost benefit evaluation techniques, risk evaluation. Selection of an appropriate project report; Choosing technologies, choice of process model, structured methods, rapid application development, water fall-, V-process-, spiral- models. Prototyping, delivery. Albrecht function point analysis. Activity planning & Risk Management: Objectives of activity planning, project schedule, projects and activities, sequencing and scheduling activities, network planning model, representation of lagged activities, adding the time dimension, backward and forward pass, identifying critical path, activity throat, shortening project , precedence networks. Risk Management: Introduction, the nature of risk, managing risk, risk identification, risk analysis, reducing the risks, evaluating risks to the schedule, calculating the z values. Unit-3 Resource allocation &Monitoring the control: Introduction, the nature of resources, identifying resource requirements, scheduling resources creating critical paths, counting the cost, being specific, publishing the resource schedule, cost schedules, the scheduling sequence. Monitoring the control: Introduction, creating the frame work, collecting the data, visualizing progress, cost monitoring, earned value, prioritizing monitoring, getting the project back to target, change control. Managing contracts and people: Introduction, types of contract, stages in contract, placement, typical terms of a contract, contract management, acceptance, Managing people and organizing terms: Introduction, understanding behavior, organizational behavior: a back ground, selecting the right person for the job, instruction in the best methods, motivation,

working in Students' Societies, becoming a team, decision making, leadership, organizational structures, conclusion, further exercises.. Unit-4 Software quality: Introduction, the place of software quality in project planning, the importance of software quality, defining software quality, ISO 9126, Practical software quality measures, product versus process quality management, external standards, techniques to help enhance software quality. Study of Any Software Project Management software: viz Project 2000 or equivalent Text Book:

Software Project Management (2nd Edition), by Bob Hughes and Mike Cotterell, 1999, TMH

Reference Books:

Software Engineering – A Practitioner’s approach, Roger S. Pressman (5th edi), 2001, MGH

Software Project Management, Walker Royce, 1998, Addison Wesley. Project Management 2/c. Maylor Managing Global software Projects, Ramesh, 2001, TMH.


CSL-405 Network Programming & Administration L T P Total Credit=3.5 3 1 -


Unit-1: Introduction to networking, TC/IP Protocol architecture, Classful internet addresses, subnets, super netting, address resolution Protocol (RAP) and RARP, IP datagram format, UDP and TCP/data grams , ICMP its purpose , FINGER, NET STAT details & IP config, Ping, TRACERT, ROUTE. Socket introduction, elementary TCP sockets, TCP client sever, I/O functions, select& poll functions, socket options elementary UDP sockets, elementary node and address conversions, echo service (TCP and UDP). Unit-2: Algorithm and issues in server software design: iterative connectionless servers, (UDP), Iterative, connection oriented servers (TCP), single process, concurrent servers multiprotocol servers (TCP,UDP), multi service servers (TCP,UDP). Unit-3: Remote procedure call concept (RPC) :RPC models, analogy between RPC of client and server, remote programs and procedures, their multiple versions and mutual exclusion communication semantics, RPC retransmits, dynamic port mapping ,authentication. Unit-4: Network file system, concept of data link access, debugging techniques, Routing sockets, broadcasting to mobile network. Text Books:

Unix Network programming Vol -2nd edition, W.Richard Stevens Internet working with TCP/IP Vol-1, Dougbles Commer. Internetworking TCP/IP Vol III Dougbles E comer, David L.Stevens

Reference Book:

Internetworking with TCP/IP, Vol II


CSL-407 Compiler Design L T P Total Credit=3.5 3 1 -

UNIT – 1 Introduction To Compilers: Compilers and translators, need of translators, structure of compiler :its different phases, Compiler construction tools. UNIT – 2 Lexical Analysis: Role of lexical analyzer, design of lexical analyzer, regular expressions Specification and recognition of tokens, input buffering, A language specifying lexical analyzer. Finite automata, conversion from regular expression to finite automata, and vice versa, minimizing number of states of DFA, Implementation of lexical analyzer. Syntax Analysis: Role of parsers, context free grammars, definition of parse trees. UNIT – 3 Parsing Technique: Shift- reduce parsing, operator precedence parsing, top down parsing, predictive parsing. LR parsers, SLR, LALR and Canonical LR parsers. Syntax Directed Translations: Syntax directed definition, construction of syntax trees, syntax directed translation scheme, and implementation of syntax directed translation, three address code, quadruples and triples. UNIT – 4 Symbol Table & Error Detection And Recovery: Symbol tables, its contents and data structure for symbol tables; trees, arrays, linked lists, hash tables. Errors, lexical phase error, syntactic phase error, semantic error. Code Optimization & Code Generation: Principle sources of optimization, loop optimization, Code generation, forms of objects code, machine dependent code, optimization, register allocation for temporary and user defined variables.

Text Books: 1. Compilers Principle, Techniques & Tools ,Alfread V. AHO, Ravi Sethi & J.D. Ullman; 2. Principles of compiler Design , Narosa Publication Reference Books 1. Theory and practice of compiler writing ,Mc. Graw Hill. 2. System Software, Dhamdhere ,Prentice Halt Ullman, NOTE: Eight questions will be set in all by the examiners taking two questions from each unit. Students will be required to attempt five questions in all selecting at least one question from each unit.

CSL-409 Mobile Computing L T P Total Credit=3 3 - -


UNIT – I Introduction to Personal Communications Services (PCS): PCS Architecture, Mobility management, Networks signalling. Global System for Mobile Communication (GSM) system overview: GSM Architecture, Mobility management, Network signalling. General Packet Radio Services (GPRS): GPRS Architecture, GPRS Network Nodes. UNIT – II Mobile Data Communication: WLANs (Wireless LANs) IEEE 802.11 standard, Mobile IP. Wireless Application Protocol (WAP): The Mobile Internet standard, WAP Gateway and Protocols, wireless mark up Languages (WML). UNIT – III Third Generation (3G) Mobile Services: Introduction to International Mobile Telecommunications 2000 (IMT 2000) vision, Wideband Code Division Multiple Access (W-CDMA), and CDMA 2000, Quality of services in 3G. Wireless Local Loop(WLL): Introduction to WLL Architecture, wireless Local Loop Technologies. UNIT – IV Global Mobile Satellite Systems; case studies of the IRIDIUM and GLOBALSTAR systems. Wireless Enterprise Networks: Introduction to Virtual Networks, Blue tooth technology, Blue tooth Protocols.

Text Books: 1. Yi-Bing Lin & Imrich Chlamtac, “Wireless and Mobile Networks Architectures”,

John Wiley & Sons, 2001. 2. Raj Pandya, “Mobile and Personal Communication systems and services”, Prentice

Hall of India, 2001. 3. Hansmann, “Principles of Mobile Computing”, Wiley Dreamtech, 2004.

Reference Books: 1. Mark Ciampa, “Guide to Designing and Implementing wireless LANs”, Thomson

learning, Vikas Publishing House, 2001. 2. Ray Rischpater, “Wireless Web Development”, Springer Publishing, 2000. 3. Sandeep Singhal, “The Wireless Application Protocol”, Pearson Education Asia,

2000.

4. P.Stavronlakis, “Third Generation Mobile Telecommunication systems”, Springer Publishers, 2001.


CSL-411 System Simulation L T P Total Credit=3 3 - -

Unit-1

System models and role of simulation. Entities, Attributes, States and Activities. Types of systems - Deterministic, Stochastic, Continuous and Discrete systems. Steps in simulation studies.

Unit-2

Statistical tools and techniques- generation of pseudorandom numbers, random variate generation for uniform, Poisson and normal distributions, sampling and estimation, maximum likelihood estimation, confidence intervals and hypothesis testing, stochastic processes and Markov models.

Unit-3

Discrete event simulation languages. Simulation of inventory and queuing systems - single and multiserver queues, network of queues. Modelling and performance evaluation of computers and computer communication networks. Workload characterization. Continuous system simulation languages, growth and decay models, system dynamics diagrams.

Unit-4

Biological and Sociological system simulation. Verification and validation of simulation models - input/output validation, sensitivity analysis, performance measures and their estimation. Case studies.

References : 1. Bernard P. Zeigler, Theory of Modelling and Simulation, Krieger Publishing Co., Inc., Melbourne, FL, 1984 2. Narsingh Deo, System Simulation with Digital Computer, Prentice Hall PTR, Upper Saddle River, NJ, 1983 3. Graham M. Birtwistle, DEMOS: a system for discrete event modelling on Simula, Springer-Verlag New York, Inc., New York, NY, 1987


http://portal.acm.org/citation.cfm?id=537562&dl=GUIDE&coll=GUIDE&CFID=11999722&CFTOKEN=60898435






CSL-413 Multiservice Networks L T P Total Credit=3 3 - -

Unit-1

Introduction to Teletraffic & Networks :Principles of telecoms networks, Call routeing, Teletraffic dimensioning, The various telecoms networks Network Strategy & Planning: Network Vision; Architecture; Technology strategy, Network strategy. The planning process, The multi-layered network model, Network planning and programmes, Simple example of planning & dimensioning

Unit-2

Forecasting: Need for forecasting; Forecasting techniques, Strengths & weaknesses of different techniques Access Network Planning: BT’s 21st Century Network proposal and its access network limitations, Access network requirements - service and physical BT copper access network structure - including differences for Kingston Communications, Copper access network planning, TPON – A former BT vision and lessons from its failure ADSL and unbundling Core Transport Planning: Transport network technologies, SDH, DWDM, IP onto WDM, Transport networks architectures, Transport network resilience (MS-SPRings, Transport network planning, Process, Node locations, Fibre connectivity, Design trade-offs, Network planning tools

Unit-3

Network & Market Trends : Transport technology trends, Next generation optical networks, Lambda bandwidth management, Collapse of the protocol stack, Transport network architectures, Optical bandwidth management, Transport Market trends, Capex spending, Emerging transport network opportunities, Rise of Ethernet, �Strategic challenges for key players Infonetworking & e-business Service & Network Intelligence Planning : Network control & intelligence, SS N0 7,IN, APIs & Parlay, NGN control, SIP, IMS,Service management: Etom, Service creation, Common capabilities

Unit-4

Next Generation Networks (NGN) :Necessary characteristics of NGN, VOIP, New network structure, Multi-service platforms, Principles of NGN, NGN control, Planning issues NGN

Network Performance Planning: Introduction to performance planning, Apportionment of impairments (loudness, stability, echo, delay, error, noise, availability), Network interconnect aspects, Packet network performance, Network integrity, Network resilience References

1. Deploying-IP-and-MPLS-QoS-for-Multiservice-Networks by John William Evans the morgan koufman series

2. BARNES & NOBLE - Find Analysis and Design of Advanced Multiservice Networks Supporting Mobility, Multimedia, and Internetworking by Jose Brazio.

3. Telecommunication Essentials by Lillian Goleniewski


CSL-415 E-Commerce & ERP L T P Total Credit=3 3 - -


UNIT – 1 Introduction and Concepts: Networks and commercial transactions – Internet and other novelties; networks and electronic transactions today, Model for commercial transactions; Internet environment – internet advantage, worlds wide web and other internet sales venues; Online commerce solutions. Security Technologies: Insecurity Internet; A brief introduction to Cryptography; Public key solution; Key distribution and certification; prominent cryptographic applications. Electronic Payment Methods: Updating traditional transactions; secure onine transaction models; Online commercial environments; digital currencies and payment systems; Offline secure processing; private data networks. UNIT – 2 Protocols for Public Transport of Private Information: Security protocols; secure protocols; Secure hypertext transfer protocols; Secure sockets layers; Integrating security protocols into the web; Non technical provide. Electronic Commerce Providers: On-line Commerce options: Company profiles. Electronic Payment Systems: Digital payment systems; First virtual internet payment system; cyber cash model. On-line Commerce Environments: Servers and commercial environments; Netscape product line; Netscape commerce server; Microsoft internet explorer and servers; open market. Digital Currencies: Optional process of Digicash, Ecash Trail; Using Ecash; Smart cards, Electronic Data Interchange; Its basics; EDI versus Internet and EDI over Internet. Strategies, Techniques and Tools: Internet Strategies: Internet Techniques, Shopping techniques and online selling techniques; Internet tools. Electronic Commerce Online Resources and Guide to the CD-ROM UNIT – 3 ERP – An Enterprise Perspective; Production Finance, Personnel disciplines and their relationship, Transiting environment, MIS Integration for disciplines, Case Study, Information / Workflow, Network Structure, Client Server Integrator System, Virtual Enterprise. ERP – Resource Management Perspective; Functional and Process of Resource. Management, Basic Modules of ERP System-HRD, Personnel Management, Training and Development, Skill Inventory, Material Planning and Control, Inventory, Forecasting, Manufacturing, Production Planning, Production Scheduling, Production Control, Sales and Distribution, Finance, Resource Management in global scenario, dynamic data management in complex global scenario. UNIT – 4 ERP – Information System Perspective: Evolution of Application Software Technology Management, EDP, MIS, DBMS, DSS OLAP (Online Analysis and Processing), TP, OAS,

KBS, MRP, BPR, SCM, REP, CRM, Information Communication Technology, E-Business, E-Commerce, EDI ERP-Key Managerial Issues: Concept Selling, IT Infrastructure, Implication, of ERP Systems on Business Organization, Critical success factors in ERP System, ERP Culture Implementation Issues, Resistance to change, Public Service and Organizations (PSO) Project, ERP Selection issues, Return on Investment, Pre and Post Implementation Issues. TEXT BOOKS: 1. Pete Loshin and P.A.Murphy, “ Electronic Commerce ” Jaico Publishing House,

1999.

2. Gary Schneider and James T. Perry, “Electronic Commerce” by Thomson learning, 2001.

3. S. Sadagopan, “Enterprise Resource Planning”, Tata McGraw Hill, 1999. 4. Alexis Leon, “Enterprise Resource Planning”, Tata McGraw Hill, 2000.

REFERENCE BOOKS:

1. Kalakota, “Frontiers of E-Commerce ” Addition Wesley long man Publishers, 1999. 2. Kamlesh Bajaj & Debjani Nag, “E-Commerce: The cutting edge of Business” Tata

Mcgraw Hill, 2000. 3. Trepper, “E-Commerce strategies”, Prentice Hall of India, 2001.


CSL-417 VLSI Design L T P Total Credit=3 3 - -


UNIT – 1

MOS Transistor Theory: nMOS Enhancement Transistor, pMOS Enhancement transistor, Threshold voltage, Fabrication of MOSFET: Silicon Semiconductor technology, Wafter processing, Oxidation, Epitaxy, Deposition, Ion-implanation and diffusion, The silicon gate Process, CMOS Technology, basic n-well cmos process, p-well process, twin tub process CMOS process enhancement: metal interconnect, Polysilicon / Refractory metal interconnect, Circuit element: Resistor, Capacitor.

UNIT – 2

Operation of MOS transistor as a switch, Design and analysis of nMOS, pMOS and CMOS circuits, CMOS Logic, The Inverter, NAND gate, NOR Gate, Compound Gate.

UNIT – 3

Modeling of MOS transistors using SPICE, MOS Inverters: Static Characteristics, MOS Inverters: Switching Characteristics and Interconnect Effects, Combinational MOS Logic Circuits: MUX, DMUX, Transmission gate, Differential Inverter, Tristate Inverter.

UNIT – 4

Sequential MOS Logic Circuits, Dynamic Logic Circuits, Semiconductor Memories.

Text Book:

1. Sung-Mo Kang and Yusuf Leblebici, “CMOS – Digital Integrated Circuits Analysis and Design”, TMH, 2004.

Reference Books:

1. Douglas A. Pucknell, “Basic VLSI Design, 3rd Edition, 2004.

2. Neil H. E. Weste & K. Eshranghian, “Principles of CMOS VLSI design”, 2nd Edition, Addison Wesley, 2003.

3. S. M. Sze, “VLSI Technology, Wiley, 2000.

4. Demassa & Ciccone, “Digital Integrated Circuits”, Wiley Publications, 2003.

5. Jacob Millman and Arvin Grabel, “Microelectronics”, TMH, 2004.

CSL-419 Advanced Database Management Systems L T P Total Credits=3 3 - -


UNIT-1

Data Models: EER model and relationship to the OO model, Object Oriented data model and ODMG standard, Other data models - NIAM, GOOD, ORM. Query Optimisation: Query Execution Algorithms, Heuristics in Query Execution, Cost Estimation in Query Execution, Semantic Query Optimisation,

UNIT-2

Database Transactions and Recovery Procedures: Transaction Processing Concepts, Transaction and System Concepts, Desirable Properties of a Transaction, Schedules and Recoverability, Serializability of Schedules, Transaction Support in SQL, Recovery Techniques, Database Backup, Concurrency control, Locking techniques for Concurrency Control, Concurrency Control Techniques, Granularity of Data Items. UNIT-3 Client Server Computing: Client Server Concepts, 2-Tier and 3-Tier Client Server Systems, Client/Server Architecture and the Internet, Client /Database Server Models, Technology Components of Client Server Systems, Application Development in Client Server Systems. Distributed Databases: Reliability and Commit protocols, Fragmentation and Distribution, View Integration, Distributed database design, Distributed algorithms for data management, Heterogeneous and Federated Database Systems. UNIT-4 Deductive Databases: Recursive Queries, Prolog/Datalog Notation, Basic inference Mechanism for Logic Programs, Deductive Database Systems, Deductive Object Oriented Database Systems.

Commercial and Research Prototypes: Parallel database, Multimedia database, Mobile database, Digital libraries, Temporal database.

Reading List

Title Author Fundamentals of Database Systems Elmasri R. , Navathe S.B

Database System Concepts A. Silbershatz, H.F. Korth S. Sudarshan,


CSP-421 Minor Project

L T P Total Credit=1 - - 2 Duration of Exam: 3 Hrs Students may choose a project based on any subject of Computer Science. The student will submit a synopsis at the beginning of the semester for approval from the departmental committee in a specified format. The student will have to present the progress of the work through seminars and progress reports.

CSP-423 Network Programming & Administration Lab L T P Total Credit=1 - - 2 LIST OF EXPRIMENTS The socket programming can be done on Unix/Linux operating or/and Windows. Socket programming, and the language can be C/VC++ and/or Java

1. Write a program to Create Sockets for Sending and Receiving Data.

2. Write a program to obtain the Local & Remote Socket Address.

3. Write a program to Create Sockets For Handling Multiple Connection

4. Write a program to Obtain The Information About The (A) Host (B) Network (C)

Protocols (D) Domains

5. Write a program to Manipulate The IP Address.

6. Write a program to Write A Telnet Client.

7. Write a program to Make An FTP Client


CSP-425 Compiler Design Lab L T P Total Credit=1 - - 2 LIST OF EXPRIMENTS Practice of LEX/YACC of compiler writing 2. Write a program to check whether a string belong to the grammar or not. 3. Write a program to generate a parse tree. 4. Write a program to find leading terminals 5. Write a program to find trailing terminals. 6. Write a program to compute FIRST of non-terminal. 7. Write a program to compute FOLLOW of non-terminal. 8. Write a program to check whether a grammar has left Recursion and remove it. 9. Write a program to remove left factoring. 10. Write a program to check whether a grammar is operator precedence. 11. To show all the operations of stack 12. To show various operations, i.e. read, write and modify in a text file. Note: At least 10 programs are required to be developed in the semester.

ITP-427 Practical Training L T P Total Credit=2 - - - Practical training conducted after sixth semester will be evaluated in the Seventh Semester based on Viva-Voce.

Semester-8

CSL-402 Advanced Computer Networks L T P Total Credits=3.5 3 1 -


UNIT – 1 Review of Physical & Data link layer, ISDN, Frame Relay, ATM UNIT – 2 Network Layer: ARP and RARP, Routing algorithms and protocols, Congestion control algorithm, Router Operation, Router configuration, Internetworking, IP Protocol, IPv6 (an overview). UNIT – 3 Transport Layer: UDP, TCP (Flow Control, Error Control, Connection Establishment) UNIT – 4 Application layer: DNS, SNMP, RMON, Electronic Mail, WWW. Network Security: Firewalls (Application and packet filtering), Cryptography, Virtual Print, Text Books: 1. B. A. Forouzan, “TCP/IP Protocol Suite”, TMH, 2nd Ed., 2004. Reference Books: 1. U. Black, “Computer Networks-Protocols, Standards and Interfaces”, PHI, 1996. 2. W. Stallings, “Computer Communication Networks”, PHI, 1999. 3 W. Stallings, “SNMP, SNMPv2, SNMPv3, RMON 1&2”, 3rd Ed., Addison Wesley,

1999. 4. Michael A. Miller, “Data & Network Communications”, Vikas Publication, 1996. 5. William A. Shay, “Understanding Data Communications & Networks”, Vikas

Publication, 1999.

6. A. S. Tananbaum, “Computer Networks”, 3rd Ed, PHI, 1999. 7. Laura Chappell (ed), “Introduction to Cisco Router Configuration”, Techmedia, 1999. NOTE: Eight questions will be set in all by the examiners taking two questions from each unit. Students will be required to attempt five questions in all selecting at least one question from each unit.

CSL-404 Digital Image Processing L T P Total Credit=3.5 3 1 -


UNIT -I Introduction And Digital Image Fundamentals: The origins of Digital Image Processing, Examples of Fields that Use Digital Image Processing, Fundamentals Steps in Image Processing, Elements of Digital Image Processing Systems, Image Sampling and Quantization, Some basic relationships like Neighbours, Connectivity, Distance Measures between pixels, Linear and Non Linear Operations. Image Enhancement in the Spatial Domain: Some basic Gray Level Transformations, Histogram Processing, Enhancement Using Arithmetic and Logic operations, Basics of Spatial Filters, Smoothening and Sharpening Spatial Filters, Combining Spatial Enhancement Methods. UNIT - II Image Enhancement in the Frequency Domain: Introduction to Fourier Transform and the frequency Domain, Smoothing and Sharpening Frequency Domain Filters, Homomorphic Filtering. Image Restoration: A model of The Image Degradation / Restoration Process, Noise Models, Restoration in the presence of Noise Only Spatial Filtering, Pereodic Noise Reduction by Frequency Domain Filtering, Linear Position-Invarient Dedradations, Estimation of Degradation Function, Inverse filtering, Wiener filtering, Constrained Least Square Filtering, Geometric Mean Filter, Geometric Transformations. UNIT - III Image Compression: Coding, Interpixel and Psychovisual Redundancy, Image Compression models, Elements of Information Theory, Error free comparison, Lossy compression, Image compression standards. Image Segmentation: Detection of Discontinuities, Edge linking and boundary detection, Thresholding, Region Oriented Segmentation, Motion based segmentation. UNIT - IV Representation and Description: Representation, Boundary Descriptors, Regional Descriptors, Use of Principal Components for Description, Introduction to Morphology, Some basic Morphological Algorithms. Object Recoginition: Patterns and Pattern Classes, Decision-Theoretic Methods, Structural Methods. Text Books: 1. Rafael C. Conzalez & Richard E. Woods, “Digital Image Processing”, 2nd edition,

Pearson Education, 2002. 2. A.K. Jain, “Fundamental of Digital Image Processing”, PHI, 1989.

References: 1. Bernd Jahne, “Digital Image Processing”, 5th Ed., Springer, 2002. 2. William K Pratt, “Digital Image Processing: Piks Inside”, John Wiley & Sons, 2001.


CSL-406 Java Programming and Website Design L T P Total Credit=3.5 3 1 -


UNIT – 1 Introduction to Java: Importance and features of Java, Keywords, constants, variables and Data Types, Operators and Expressions, Decision Making, Branching and Looping: if..else, switch,?: operator, while, do, for statements, labeled loops, jump statements: break, cotnue return. Introducing classes, objects and methods: defining a class, adding variables and methods, creating objects, constructors, class inheritance. Arrays and String: Creating an array, one and two dimensional arrays, string array and methods, Classes: String and String Buffer classes, Wrapper classes: Basics types, using super, Multilevel hierarchy abstract and final classes, Object class, Packages and interfaces, Access protection, Extending Interfaces, packages. UNIT – 2 Exception Handling: Fundamentals exception types, uncaught exceptions, throw, throw, final, built in exception, creating your own exceptions, Multithreaded Programming: Fundamentals, Java thread model: priorities, synchronization, messaging, thread classes, Run able interface, inter thread Communication, suspending, resuming and stopping threads. Input/Output Programming: Basics, Streams, Byte and Character Stream, predefined streams, Reading and writing from console and files. Using Standard Java Packages (lang, util, io, net). Networking: Basics, networking classes and interfaces, using java.net package, doing TCP/IP and Data-gram Programming UNIT – 3 Event Handling: Different Mechanism, the Delegation Event Model, Event Classes, Event Listener Interfaces, Adapter and Inner Classes, Working with windows, Graphics and Text, using AWT controls, Layout managers and menus, handling Image, animation, sound and video, Java Applet. Beans: Introduction to Java Beans and Swings, Servlets. UNIT – 4 Website Designing: Overview of Internet and Intranet Services, Sending and Receiving Mails, HTML Tags, Creating Tables, Check Boxes, Text Books, Frames, Graphical and animation techniques, Static & Dynamic Web Pages, Guidelines for a good website design, DHTML, ASP, Javascript Text Books: 1. Patrick Naughton and Herbertz Schildt, “Java-2 The Complete Reference”, 1999, TMH 2. Rick Dranell, “HTML 4 unleashed”, Techmedia Publication, 2004. 3. Shelley Powers, “Dynamic Web Publishing”, 2nd Ed., Techmedia, 1998. References Books: 1. E. Balaguruswamy, “Programming with Java: A Primer”, TMH, 1998. 2. Horstmann, “Computing Concepts with Java 2 Essentials”, John Wiley, 2004.

3. Decker & Hirshfield, “Programming Java: A introduction to programming using JAVA”, Vikas Publication, 2000.

4. Tmy Gaddies, “Starting out with Java”, Wiley Dreamtech, 2005.

5. Holzner, “HTML Blackbook”, Wiley Dreamtech, 2005.


CSL-408 Embedded System Design L T P Total Credit=3.5 3 1 -


UNIT – I Introduction to an embedded systems design & RTOS: Introduction to Embedded system, Processor in the System, Microcontroller, Memory Devices, Embedded System Project Management, ESD and Co-design issues in System development Process, Design cycle in the development phase for an embedded system, Use of target system or its emulator and In-circuit emulator, Use of software tools for development of an ES. Inter-process Communication and Synchronization of Processes, Tasks and Threads, Problem of Sharing Data by Multiple Tasks, Real Time Operating Systems: OS Services, I/O Subsystems, Interrupt Routines in RTOS Environment, RTOS Task Scheduling model, Interrupt Latency and Response times of the tasks.

UNIT – II Overview of Microcontroller: Microcontroller and Embedded Processors, Overview of 8051 Microcontroller family: Architecture, basic assembly language programming concepts, The program Counter and ROM Spaces in the 8051, Data types, 8051 Flag Bits ad PSW Register, 8051 Register Banks and Stack Instruction set, Loop and Jump Instructions, Call Instructions, Time delay generations and calculations, I/O port programming Addressing Modes, accessing memory using various addressing modes, Arithmetic instructions and programs, Logical instructions, BCD and ASCII application programs, Single-bit instruction programming, Reading input pins vs. port Latch, Programming of 8051 Timers, Counter Programming UNIT – III

Communication with 8051: Basics of Communication, Overview of RS-232, I2C Bus, UART, USB, 8051 connections to RS-232, 8051 serial communication programming, 8051 interrupts, Programming of timer interrupts, Programming of External hardware interrupts, Programming of the serial communication interrupts, Interrupt priority in the 8051.

UNIT - IV

Interfacing with 8051: Interfacing an LCD to the 8051, 8051 interfacing to ADC, Sensors, Interfacing a Stepper Motor, 8051 interfacing to the keyboard, Interfacing a DAC to the 8051, 8255 Interfacing with 8031/51, 8051/31 interfacing to external memory.

TEXT BOOKS: 1. Raj Kamal, “Embedded Systems”, TMH, 2004. 2. M.A. Mazidi and J. G. Mazidi, “The 8051 Microcontroller and Embedded Systems”,

PHI, 2004. References Books: 1. David E. Simon, “An Embedded Software Primer”, Pearson Education, 1999. 2. K.J. Ayala, “The 8051 Microcontroller”, Penram International, 1991. 3. Dr. Rajiv Kapadia, “8051 Microcontroller & Embedded Systems”, Jaico Press

4. Dr. Prasad, “Embedded Real Time System”, Wiley Dreamtech, 2004.


CSL-410 Neural Networks L T P Total Credits=3 3 - -


Unit-1 Overview of biological neurons: Structure of biological neurons relevant to ANNs. Fundamental concepts of Artificial Neural Networks: Models of ANNs; Feedforward & feedback networks; learning rules; Hebbian learning rule, perception learning rule, delta learning rule, Widrow-Hoff learning rule, correction learning rule, Winner –lake all elarning rule, etc. Unit-2 Single layer Perception Classifier: Classification model, Features & Decision regions; training & classification using discrete perceptron, algorithm, single layer continuous perceptron networks for linearlyseperable classifications. Unit-3 Multi-layer Feed forward Networks: linearly non-seperable pattern classification, Delta learning rule for multi-perceptron layer, Generalized delta learning rule, Error back-propagation training, learning factors, Examples. Single layer feed back Networks: Basic Concepts, Hopfield networks, Training & Examples. Unit-4 Associative memories: Linear Association, Basic Concepts of recurrent Auto associative memory: rentrieval algorithm, storage algorithm; By directional associative memory, Architecture, Association encoding & decoding, Stability. Self organizing networks: UN supervised learning of clusters, winner-take-all learning, recall mode, Initialisation of weights, seperability limitations Text Books:

Introduction to artificial Neural systems by Jacek M. Zurada, 1994, Jaico Publ. House.

Reference Books: “Neural Networks :A Comprehensive formulation”, Simon Haykin, 1998, AW “Neural Networks”, Kosko, 1992, PHI. “Neural Network Fundamentals” – N.K. Bose , P. Liang, 2002, T.M.H


CSL-412 Mobile Communication L T P Total Credits=3 3 - -


UNIT – 1 Introduction to Cellular Mobile Systems: A basic cellular system, performance criteria, uniqueness of mobile radio environment, operation of cellular systems, planning a cellular system, overview of generations of cellular systems. Elements of Cellular Radio Systems Design and Interference: General description of the problem, concept of frequency reuse channels, co-channel interference reduction factor, desired C/I from a normal case in an omni directional antenna system, cell splitting, consideration of the components of cellular systems, Introduction to co-channel interference, co-channel measurement design of antenna system, antenna parameter and their effects.

UNIT – 2 Cell Coverage for Signal & Antenna Structures: General introduction, obtaining the mobile point to point mode, propagation over water or flat open area, foliage loss, propagation near in distance, long distance propagation, point to point prediction model – characteristics, cell site, antenna heights and signal coverage cells, mobile to mobile propagation, Characteristics of basic antenna structures, antenna at cell site, mobile antennas. Frequency Management & Channel Assignment, Hand Off & Dropped Calls: Frequency Management, fixed channel assignment, non-fixed channel assignment, traffic & channel assignment, Why hand off, types of handoff and their characteristics, dropped call rates & their evaluation. UNIT – 3 Modulation methods and coding for error detection and correction: Introduction to Digital modulation techniques, modulation methods in cellular wireless systems, OFDM, Block Coding, convolution coding and Turbo coding. Multiple access techniques: FDMA, TDMA, CDMA: Time-division multiple access (TDMA), code division multiple access (CDMA), CDMA capacity, probability of bit error considerations, CDMA compared with TDMA. UNIT – 4 Second generation, digital, wireless systems: GSM, IS_136 (D-AMPS), IS-95, mobile management, voice signal processing and coding. Text Books: 1. William, C. Y. Lee, “Mobile Cellular Telecommunications”, 2nd Edition, McGraw Hill, 1990.

2. Mischa Schwartz, “Mobile Wireless Communications”, Cambridge University Press, UK, 2005.

Reference Books: 1. “Mobile Communication Hand Books”, 2nd Edition, IEEE Press. 2. Theodore S Rappaport, “Wireless Communication Principles and Practice”, 2nd Edition,

Pearson Education, 2002. 3. Lawrence Harte, “3G Wireless Demystified”, McGraw Hill Publications, 2001. 4. Kaveh Pahlavan and Prashant Krishnamurthy”, Principles of Wireless Networks”, PHI, 2001.


CSL-414 System Programming & System Administration L T P Total Credits=3 3 - -


Unit-1

Evolution of Components of Systems Programming, Assemblers, Loaders, Linkers, Macros, Compilers. software tools, Text editors, Interpreters and program generators, Debug Monitors, Programming environment.

Compiler: Brief overview of compilation process, Incremental compiler, Assembler: Problem statement, single phase and two phase assembler, symbol table; Loader schemes, compile and go Loader, general loader schemes, absolute loader, Subroutine linkage, Relocating loader, Direct linkage Loader, Binders, Linking loader, overlays.

Unit-2

Macro language and macro-processor, macro instructions, features of macro facility, macro instruction arguments, conditional macro expansion, macro calls with macro instruction defining macros.

Theoretical Concept of Unix Operating System: Basic features of operating system; File structure: CPU scheduling; Memory management: swapping, demand paging; file system: block and fragments, inodes, directory structure; User to user communication.

Unit-3

Getting Started with Unix: User names and Students' Societies, logging in; Format of Unix commands; Changing your password; Characters with special meaning; Unix documentation; Files and directories; Current directory, looking at the directory contents, absolute and relative pathnames, some Unix directories and files; Looking at the file contents; File permissions; basic operation on files; changing permission modes; Standard files, standard output; Standard input, standard error; filters and pipelines; Processes; finding out about processes; Stopping background process; Unix editor vi. Test Manipulation: Inspecting files; File statistics; Searching for patterns; Comparing files; Operating on files; Printing files; Rearranging files; Sorting files; Splitting files; Translating characters; AWK utility. Unit-4

Shell Programming: Programming in the Borne and C-Shell; Wild cards; Simple shell programs; Shell variables; Shell programming constructs; interactive shell scripts; Advanced features.

System Administration: Definition of system administration; Booting the system; Maintaining user accounts; File systems and special files; Backups and restoration; Role and functions of a system manager. Overview of the linux. Operating system

Text Books: Systems Programming by Donovan, TMH. The unix programming environment by Brain Kernighen & Rob Pike, 1984, PHI & Rob Pike. Design of the Unix operating system by Maurich Bach, 1986, PHI. Introduction to UNIX and LINUX by John Muster, 2003, TMH. Reference Book: Advanced Unix programmer’s Guide by Stephen Prato, BPB Unix- Concept and applications by Sumitabha Das, 2002, T.M..H


CSL-416 Data Warehouse & Data Mining L T P Total Credit=3 3 - -


UNIT-1 Data warehousing Definition, usage and trends. DBMS vs data warehouse, Data marts, Metadata, Multidimensional data mode, Data cubes, Schemas for Multidimensional Database: stars, snowflakes and fact constellations. Data warehouse process & architecture, OLTP vs OLAP, ROLAP vs MOLAP, types of OLAP, servers, 3-Tier data warehouse architecture, distributed and virtual data warehouses, data warehouse manager. UNIT -2 Data warehouse implementation, computation of data cubes, modelling OLAP data, OLAP queries manager, data warehouse back end tools, complex aggregation at multiple granularities, tuning and testing of data warehouse. Data mining definition & task, KDD versus data mining, data mining techniques, tools and applications. UNIT -3 Data mining query languages, data specification, specifying knowledge, hierarchy specification, pattern presentation & visualization specification, data mining languages and standardization of data mining. Data mining techniques: Association rules, Clustering techniques, Decision tree knowledge discovery through Neural Networks & Genetic Algorithm, Rough Sets, Support Victor Machines and Fuzzy techniques. UNIT -4 Mining complex data objects, Spatial databases, Multimedia databases, Image Database Time series and Sequence data; mining Text Databases and mining Word Wide Web. Text Books:

Data Warehousing In the Real World; Sam Anahory & Dennis Murray; 1997, Pearson Data Mining- Concepts & Techniques; Jiawei Han & Micheline Kamber- 2001,

Morgan Kaufmann. Data Mining Techniques; Arun Pujar; 2001, University Press; Hyderbad.

Reference Books:

Data Mining; Pieter Adriaans & Dolf Zantinge; 1997, Pearson,

Data Warehousing, Data Miniing and OLTP; Alex Berson, 1997, Mc Graw Hill. Data warehousing System; Mallach; 2000, Mc Graw Hill. Building the Data Warehouse; W.H. Inman, 1996, John Wiley & Sons. Developing the Data Warehouses; W.H Ionhman,C.Klelly, John Wiley & Sons. Managing the Data Warehouses; W.H.Inman, C.L.Gassey, John Wiley & Sons. .


CSL-418 Software Testing L T P Total Credits=3 3 - -


Note: Eight questions will be set in all by the examiners taking two questions from each unit. Students will be required to attempt five questions in all selecting at least one question from each unit. UNIT – 1 Introduction: What is software testing and why it is so hard?, Error, Fault, Failure, Incident, Test Cases, Testing Process, Limitations of Testing, No absolute proof of correctness, Overview of Graph Theory.

UNIT ‐ 2

Functional Testing: Boundary Value Analysis, Equivalence Class Testing, Decision Table Based Testing, Cause Effect Graphing Technique. Structural Testing: Path testing, DD-Paths, Cyclomatic Complexity, Graph Metrics, Data Flow Testing, Mutation testing.

UNIT - 3

Reducing the number of test cases:

Prioritization guidelines, Priority category, Scheme, Risk Analysis, Regression Testing, Slice

based testing

Testing Activities: Unit Testing, Levels of Testing, Integration Testing, System Testing, Debugging, Domain Testing.

UNIT - 4

Object Oriented Testing: Issues in Object Oriented Testing, Class Testing, GUI Testing, Object Oriented Integration and System Testing. Testing Tools: Static Testing Tools, Dynamic Testing Tools, Characteristics of Modern Tools.

Text Books: 1. William Perry, “Effective Methods for Software Testing”, John Wiley & Sons, New

York, 1995. 2. Louise Tamres, “Software Testing”, Pearson Education Asia, 2002 3. Robert V. Binder, “Testing Object-Oriented Systems-Models, Patterns and Tools”,

Addison Wesley, 1999. Reference Books: 1. Cem Kaner, Jack Falk, Nguyen Quoc, “Testing Computer Software”, Second Edition,

Van Nostrand Reinhold, New York, 1993.

2. K.K. Aggarwal & Yogesh Singh, “Software Engineering”, 2nd Ed., New Age International Publishers, New Delhi, 2005

3. Boris Beizer, “Software Testing Techniques”, Second Volume, Second Edition, Van Nostrand Reinhold, New York, 1990.

4. Boris Beizer, “Black-Box Testing – Techniques for Functional Testing of Software and Systems”, John Wiley & Sons Inc., New York, 1995.


CSL-420 System Simulation L T P Total Credits=3 3 - -

Unit-1

System models and role of simulation. Entities, Attributes, States and Activities. Types of systems - Deterministic, Stochastic, Continuous and Discrete systems. Steps in simulation studies.

Unit-2

Statistical tools and techniques- generation of pseudorandom numbers, random variate generation for uniform, Poisson and normal distributions, sampling and estimation, maximum likelihood estimation, confidence intervals and hypothesis testing, stochastic processes and Markov models.

Unit-3

Discrete event simulation languages. Simulation of inventory and queuing systems - single and multiserver queues, network of queues. Modelling and performance evaluation of computers and computer communication networks. Workload characterization. Continuous system simulation languages, growth and decay models, system dynamics diagrams.

Unit-4

Biological and Sociological system simulation. Verification and validation of simulation models - input/output validation, sensitivity analysis, performance measures and their estimation. Case studies.

References : 1. Bernard P. Zeigler, Theory of Modelling and Simulation, Krieger Publishing Co., Inc., Melbourne, FL, 1984 2. Narsingh Deo, System Simulation with Digital Computer, Prentice Hall PTR, Upper Saddle River, NJ, 1983 3. Graham M. Birtwistle, DEMOS: a system for discrete event modelling on Simula, Springer-Verlag New York, Inc., New York, NY, 1987








CSP-420 Major Project

L T P Total Credits=2 - - 4 Duration of Exam: 3 Hrs Students may choose a project based on any subject of Computer Science. The student will submit a synopsis at the beginning of the semester for approval from the departmental committee in a specified format. The student will have to present the progress of the work through seminars and progress reports.

CSP-422 Seminar

L T P Total Credit=1 - - 2 Duration of Exam: 3 Hrs A Departmental Committee will evaluate the performance of the students & marks will be awarded accordingly.

CSP-424 Java Programming Lab

L T P Total Credit=1 - - 2 LIST OF EXPRIMENTS Development of programs relating to:

JDBC

Servlets

Beans

RMI

JSP

GFP-426 General Proficiency

L T P Total Credits=2 - - -

School of Engineering & Sciences - Bhagat Phool Singh ...

Documents

Transcript of School of Engineering & Sciences - Bhagat Phool Singh ...