Kumar Book Seller
Kumar Book Seller
Kumar Book Seller
KURUKSHETRA UNIVERSITY KURUKSHETRA SCHEME OF STUDIES & EXAMINATIONS B.Tech. 1ST YEAR (SEMESTERI) COMMON FOR ALL BRANCHES (2004-2005)
Course No.
MATH-101E PHY-101E BT-101E HUM-101E ME-101E / CE-101E / EL101E ME-105E ME-103E CH-101E CSE-101E EE-101E ES-101E PHY-103E ME-107E CH-103E CSE-103E EE-103E ME-109E CE109E EL-109E
Course title
Mathematics-I Physics-I Introduction to Biotechnology OR Communication skills in English Elements of Mechanical Engineering / Elements of Civil Engg./ Elements of Electronics Engg. * OR Engg. Graphics and Drawing Manufacturing Processes OR Chemistry Fundamentals of Computer & Programming in c OR Electrical Technology Environmental Studies** Physics Lab.-I Workshop Practice Or Chemistry Lab. Computer Programming Lab. OR Electrical Technology Lab. Elements of Mechanical Engineering / Elements of Civil Engg./ Elements of Electronics Engg. * Total
Teaching Schedule L
4 3 3 3 3
T
1 1 1 1 1
P
-
Theory
100 100 100 100 75
Practical ------
Total
150 150 150 150 100
Duration of Exams.
3 3 3 3 3
4 3 3 3 4 -----24/20
--1 2 2 -----6/6
3 -2 3 2 2 2 2 9/9
3 4 4 5 5 4 2 3 2 2 2 2 35/35
50 50 50 50 50 25 25 25 25 25 25 25 375/375
3 3 3 3 3 3 3 3 3 3 3 3
Note:- 1.
Students will study either Group A (BT-101E, ME-101E/ CE-101E/ EL-101E, ME-103E, CSE-101E. ME107E, CSE-103E, ME-109E/ EL-109E/ CE-109E) OR Group B (HUM-101E, ME-105E, CH-101E, EE-101E, ES-101E, CH-103E, EE-103E) SEMESTER-I/SEMESTER -II branches to be decided by the concerned institution. Students are allowed to use single memory, non-programmable scientific calculator during examination. Practical Examinat ion will consist of 10 marks for viva-voce and 15 marks for Experiment. *Institutes will offer one of these electives **Subject is qualifying. It shall carry 25 sess ional marks for field work (to be conducted by the institute) report.
B.Tech. 1ST
Course No. Course title
T
1 1 1 1 1
P
-
Theory
100 100 100 100 75
Practical ------
Total
150 150 150 150 100
Duration of Exams.
3 3 3 3 3
.. 4 3 3 3 4 -----20/16
--1 2 2 -----6/6
3 -2 3 2 2 2 2 9/9
3 4 4 5 5 4 2 3 2 2 2 2 35/35
50 50 50 50 50 25 25 25 25 25 25 25 375/375
75 -----25 25 25 25 25 25 100/150
3 3 3 3 3 3 3 3 3 3 3 3
Note:- 1.
Students will study either Group A (BT-101E, ME-101E/ CE-101E/ EL-101E, ME-103E, CSE-101E. ME107E, CSE-103E, ME-109E/ EL109E/ CE-109E) OR Group B (HUM- 101E, ME-105E, CH-101E, EE-101E, ES-101E, CH-103E, EE-103E) SEMESTER-I/SEMESTER-II branches to be decided by the concerned institution. Students are allowed to use single memory, non programmable scientific calculator during examination.
3. Practical Examination will consist of 10 marks for viva-voce and 15 marks for Experiment. *Institutes will offer one of these electives
**Subject is qualifying. It shall carry 25 sess ional marks for field work (to be conducted by the institute) report.
L T P 3 1
PHYSICAL OPTICS Interference: Division of wave front-Fresnel's biprism, Division of amplitudeNewton's rings, Michelson interferometer, applications. Diffraction: Difference between Fraunhofer and Fresnel diffraction. Fraunhofer diffraction through a slit. Plane transmission diffraction grating, its dispersive and resolving powers. Polarization: Polarised and unpolarized light, double refraction; Nicol prism, quarter and half wave plates, Polarimetry; Biquartz and Laurent's half-shade polarimeters, Simple concepts of photoelasticity. UNIT-II LASER: Spontaneous and stimulated emissions, Laser action, characteristics of laser beamconcepts of coherence, He-Ne and semiconductor lasers (simple ideas), applications. FIBRE OPTICS: Propagation of light in fibres, numerical aperture, single mode and multi mode fibres, applications. UNIT-III WAVE AND OSCILLATIONS: Simple concepts of Harmonic Oscillator, resonance, quality factor. E.M. wave theory-review of basic ideas, Maxwell's equations, simple plane wave equations, simple concepts of wave guides and co-axial cables, Poynting vector. DIELECTRICS: Molecular theory, polarization, displacement, susceptibility, dielectric coefficient, permitivity & various relations between these, Gauss's law in the presence of a dielectric, Energy stored in an electric field. Behavior of dielectrics in a.c. field-simple concepts, dielectric losses. UNIT-IV SPECIAL THEORY OF RELATIVITY: Michelson-Moreley experiment, Lorentz transformations, variation of mass with velocity, mass energy equivalence. NUCLEAR PHYSICS: Neutron Cross-section, Nuclear fission, Moderators, Nuclear reactors, Reactor criticality, Nuclear fusion. Interaction of radiation with matter-basic concepts, radiation detectors-ionisation chamber, G.M. Counter, Scintillation and solid state detectors, cloud chamber and bubble chamber. TEXT BOOKS: 1. Physics of the Atom - Wehr, Richards & Adair (Narosa) 2. Perspectives of Modern Physics - Arthur Beiser (TMH) 3. Modern Engineering Physics A.S. Vasudeva (S. Chand) REFERENCE BOOKS: 1. Electricity and Magnetism F.W. Sears (Narosa) 2. Physics Vol-I & II Resnick & Halliday (Wiley Eastern) 3. A Text Book of Optics Brij Lal & Subramanyam Note: The Examiners will set eight questions, taking two from each unit. The students are required to attempt five questions in all selecting at least one from each unit. All questions will carry equal marks.
L T P 3 1 -
UNIT-I Building Materials & Construction: Cement, sand, aggregate, bricks, reinforcing bars, structural steel sections. Brick masonry: Bonds in brick work, reinforced brick work, load bearing walls, damp-proofing and water proofing, doors and windows Making of concrete, reinforced concrete: columns, beams, lintels, floors and roofs, staircases, water retaining structures, foundations. UNIT-II Structural Steel: Properties, design of tension and compression members, beams and roof Trusses, constructions- rewetted bolted and welded, industrial buildings and towers UNIT-III Soils and Foundations: Types of soils, bearing capacity of soils, improving the bearing capacity, earth pressure, foundation for walls, columns, machines and transmission towers, pile foundation. UNIT-IV Water supply and treatment: Water needs, estimation of water demand, impurities in water and their sanitary significance, water quality standards, water treatment systems, distribution systems- gravity, pumping and dual system, need for sanitation, systems of sanitation-water borne and conservancy methods of sanitation, sewerage systems-partial, combined and separate systems. References: 1. Building Construction by Sushil Kumar, Standard Pub., New Delhi. 2. Reinforced Concrete by I.C.Syal & A.K.Goyal, A.H Wheeler & Co., Delhi 3. Design of steel Structures by A.S.Arya & J.L.Ajonani Nem Chand & Bros. 4. Basics & Applied Soil Mechanics by Gopal Ranjan & ASR Rao, New Age Int. Pub., New Delhi 5. Water Supply Enggi. By S.K. Garg. Note: The Examiners will set eight questions, taking two from each unit. The students are required to attempt five questions in all selecting at least one from each unit. All questions will carry equal marks.
Examination : 100 marks Sessional: 50 marks Total: 150 marks Time: 3 Hrs.
Unit-I Various types of projections, First and Third angle systems of orthographic projections. Projections of points in different quadrants. Projections of straight lines parallel to one or both reference planes, contained by one or both planes, perpendicular to one of the planes, inclined to one plane but parallel to the other plane, inclined to both the planes, true length of a line and its inclinations with reference planes, traces of a line. Unit-II Projections of Polyhedra Solids and solids of Revolution in simple positions with axis perpendicular to a plane, with axis parallel to both planes, with axis parallel to one plane and inclined to the other. Development of surface of various simple solids such as cubes, cylinders, prisms, pyramids etc. orthographic views, orthographic drawings of Bolts, Nuts, Bolted joints, screw threads, screwed joints. Note : Some simple exercise may be attempted with AUTOCAD. Text Book 1. Engineering Drawing Plane and Solid Geometry: N.D. Bhatt and V.M.Panchal, Forty-Fourth Edition 2002, Charotar Publishing House. Reference Books 1. Engineering Graphics and Drafting: P.S. Gill, Millennium Edition, S.K. Kataria and Sons. 2. A Text Book of Engineering Drawing: S.B. Mathur, Second Revised and Enlarged Edition 2000, Vikas Publishing House. 3. Engineering Graphics using AUTOCAD 2000 : T. Jeyapoovan, First Edition 2002, Vikas Publishing House.
Unit-1 An Overview of Computer System: Anatomy of a digital Computer, Memory Units, Main and Auxiliary Storage Devices, Input Devices, Output Devices, Classification of Computers. Radix number system: Decimal, Binary, Octal, Hexadecimal numbers and their inter-conversions; Representation of information inside the computers. Operating System Basics: Introduction to PC operating Systems: DOS, Unix/Linux, Windows 2000. Unit-2 Programming Languages: Machine-, Assembly-, High Level- Language, introduction to Assembler, Compiler, Interpreter, Debuggers, Linker and Loader. Programming fundamentals: problem definition, algorithms, flow charts and their symbols. Internet basics: How Internet works, Major features of internet, Emails, FTP, Using the internet. Unit-3 C Programming language: C fundamentals, formatted input/ output, expressions, selection statements, loops and their applications; Basic types, arrays, functions, including recursive functions, program organization: local and external variables and scope & arrays. Unit-4 Strings: strings literals, string variables, I/O of strings, arrays of strings; applications. Structures, Unions and Enumerations: Structure variables and operations on structures; Structured types, nested array structures; unions; enumeration as integers, tags and types. Standard library: Input / output; streams, file operations, formatted I/O, character I/O, line I/O, block, string I/O, Library support for numbers and character data, error handling: Text Books: 1. Using Information Technology, 5th Edi, Brian K Williams & Stacey C. Sawyer, 2003, TMH 2. The C Programming Language by Dennis M Ritchie, Brian W. Kernigham, 1988, PHI. 3. C Programming A modern approach by K.N. King, 1996, WW Norton & Co. Reference Books: 1. Information technology, Dennis P. Curtin, Kim Foley, Kunal Sen, Cathleen Morin, 1998, TMH 2. Theory and problem of programming with C, Byron C Gottfried, TMH 3. Teach yourself all about computers by Barry Press and Marcia Press, 2000, IDG Books India. 4. Using Computers and Information by Jack B. Rochester, 1996, Que Education & Training. Note: The Examiners will set eight questions, taking two from each unit. The students are required to attempt five questions in all selecting at least one from each unit. All questions will carry equal marks.
UNIT-I D.C. CIRCUITS: Ohms Law, Kirchoffs Laws, D.C. Circuits, Nodal and Loop methods of analysis. A.C. CIRCUITS: Sinusoidal signal, instantaneous and peak values, RMS and average values, phase angle, polar & rectangular, exponential and trigonometric representations; R,L and C components, behaviors of these components in A.C. circuits. Concept of complex power, power factor. UNIT-II TRANSIENT RESPONSE: Transient response of RL, RC and RLC Circuits with step input. NETWORK THEOREMS: Thevenins theorem, Nortons theorem, superposition theorem, maximum power transfer theorem, Star to Delta & Delta to Star transformation. SERIES AND PARALLEL A.C. CIRCUITS: Series and parallel A.C. circuits, series and parallel resonance, Q factor, cut-off frequencies and bandwidth. UNIT-III THREE PHASE CIRCUITS: Phase and line voltages and currents, balanced star and delta circuits, power equation, measurement of power by two wattmeter method, Importance of earthing. TRANSFORMERS: Principle, construction & working of transformer, Efficiency and regulation. UNIT-IV ELECTRICAL MACHINES: D.C. Machine: Principle, construction, EMF equation, Torque Equation, Types of Machine, internal & external characterstics, speed control. Induction motor: Principle, construction, EMF equation, Types of motors, slip concept, Synchronous motor: Principle, construction, Types of motors TEXT BOOKS: 1. Basic Electrical Engg (2nd Edition) : Kothari & Nagarath, TMH 2. Electrical Technology (Vol-I) : B.L Theraja & A K Theraja, S.Chand REFERENCE BOOKS: 1. Electrical Engineering Fundamentals : Deltoro, PHI 2. Network Analysis :Valkenburg, PHI Note: The Examiners will set eight questions, taking two from each unit. The students are required to attempt five questions in all selecting at least one from each unit. All questions will carry equal marks.
The structure of the question paper being. PART A : Short Answer Pattern PART B : Essay type with inbuilt choice PART C : Field Work
The examination will be conducted by the college concerned at its own level earlier than the annual examination and each student will be required to score minimum of 35% marks each in theory and Practical. The marks obtained in this qualifying paper will not be included in determining the percentage of marks obtained for the award of degree. However, these will be shown in the detailed marks certificate of the student.
PHYSICS LAB.-I (COMMON FOR ALL BRANCHES) L T P Sessional Work:25 Marks - - 2 Examination: 25 Marks Total: 50 Marks Duration of Exam: 3 Hrs. Note: Students will be required to perform atleast 10 experiments out of the list in a semester. LIST OF EXPERIMENTS The experiments in Ist semester will be based mainly upon optics, electrostatics, wave and oscillations which are the parts of the theory syllabus of Ist semester. 1. To find the wavelength of sodium light by Newton's rings experiment. 2. To find the wavelength of sodium light by Fresnel's biprism experiment. 3. To find the wavelength of various colours of white light with the help of a plane transmission diffraction grating. 4. To verify Newtons formula and hence to find the focal lenth of convex lens 5. To find the wavelength of sodium light by Michelson interferometer. 6. To find the resolving power of a telescope. 7. To find the specific rotation of sugar solution by using a polarimeter. 8. To compare the capacitances of two capacitors by De'sauty bridge and hence to find the dielectric constant of a medium. 9. To find the frequency of A.C. mains by using sonometer. 10. To find low resistance by carrey foster Bridge 11. To find the resistance of a galvenometer by Post office Box 12. To Find Value of high Resistance by substitution method 13. To Find the value of high resistance by leakage method 14. To Convert a galveno meter in to an Ammeter of given range. RECOMMENDED BOOKS: 1. Advanced Practical Physics B.L. Worshnop and H.T. Flint (KPH) 2. Practical Physics S.L.Gupta & V.Kumar (Pragati Prakashan).
3. Advanced Practical Physics Vol.I & II Chauhan & Singh (Pragati Prakashan)
NOTE : 1. At least ten experiments/ jobs are to be performed/ prepared by students in the semester. 2. At least 8 experiments/ jobs should be performed / prepared from the above list, remaining two may either be performed/ prepared from the above list or designed & set by the concerned institution as per the scope of the syllabus of Manufacturing Processes and facilities available in the Institute. List of Experiments / Jobs 1. To study different types of measuring tools used in metrology and determine least counts of vernier calipers, micrometers and vernier height gauges. 2. To study different types of machine tools ( lathe, shape or planer or slotter, milling, drilling machines ) 3. To prepare a job on a lathe involving facing, outside turning, taper turning, step turning, radius making and parting-off. 4. To study different types of fitting tools and marking tools used in fitting practice. 5. To prepare lay out on a metal sheet by making and prepare rectangular tray, pipe shaped components e.g. funnel. 6. To prepare joints for welding suitable fo r butt welding and lap welding. 7. To perform pipe welding. 8. To study various types of carpentry tools and prepare simple types of at least two wooden joints. 9. To prepare simple engineering components/ shapes by forging. 10. To prepare mold and core assembly, to put metal in the mold and fettle the casting. 11. To prepare horizontal surface/ vertical surface/ curved surface/ slots or V-grooves on a shaper/ planner. 12. To prepare a job involving side and face milling on a milling machine.
Note:
LIST OF EXPERIMENTS 1. Determination of Ca++ and Mg++ hardness of water using EDTA solution. 2. Determination of alkalinity of water sample. 3. Determination of dissolved oxygen (DO) in the given water sample. 4. To find the melting & eutectic point for a two component system by using method of cooling curve. 5. Determination of viscosity of lubricant by Red Wood viscometer (No. 1 & No. 2). 6. To determine flash point & fire point of an oil by Pensky -Marten's flash point apparatus. 7. To prepare Phenol-formaldehyde and Urea formaldehyde resin. 8. To find out saponification No. of an oil. 9. Estimation of calcium in lime stone and dolomite. 10. 10. Determination of concentration of KMnO4 solution spectrophotomet-erically. 11. Determination of strength of HCl solution by titrating it against NaOH solution conductometerically. 12. To determine amount of sodium and potassium in a, given water sample by flame photometer. 13. Estimation of total iron in an iron alloy. SUGGESTED BOOKS : 1. A Text Book on Experimental and Calculation Engineering Chemistry, S.S. Dara, S. Chand & Company (Ltd.) 2. Essential of Experimental Engineering Chemistry, Shashi Chawla, Dhanpat Rai Publishing Company. 3. Theory & Practice Applied Chemistry O.P. Virmani, A.K. Narula (New Age)
LIST OF EXPERIMENTS: 1. To verify KCL and KVL. 2. To verify Thevenins & Norton's Theorems. 3. To verify Superposition theorems. 4. To study frequency response of a series R-L-C circuit and determine resonant frequency& Qfactor for various Values of R,L,C. 5. To study frequency response of a parallel R-L-C circuit and determine resonant frequency & Q -Factor for various values of R,L,C. 6. To perform direct load test of a transformer and plot efficiency Vs load characteristic. 7. To perform O.C. and S.C. tests on transformer. 8. To perform speed control of DC motor. 9. To perform O.C. and S.C. tests of a three phase induction motor. 10. Measurement of power in a 3 phase system by two watt meter method.
List Of Experiments: 1. To study the half wave and full wave rectifier. 2. To study the effect of various filters circuits. 3. To study the characteristics of pnp & npn transistor in common amitter & determine H- parameter from characteristics 4. To study the characteristics of pnp & npn transistor in CB & determine h-parameter from characteristics 5. To determine the Av, Ai of RC coupled CE transistor amplifier 6. Determine the frequency of oscillation in herteley oscillator 7. Determine the frequency of oscillation in phase shift oscillator 8. Determine the effect of negative feedback on bandwidth & gain in CE, RC coupled amplifier 9. Study TC Op-Amp as a inverting amplifier & scale changer 10. Study IC Op-Amp as a non inverting amplifier 11. Study IC Op-Amp as an integrator 12. Study IC Op-Amp as a differentiator
Note: 1. Total ten experiments are to be performed in the Semester. 2. At least seven experiments should be performed from the above list. Remaining three experiments should be performed as designed & set by the concerned Institution as per the scope of the syllabus. LIST OF EXPERIMENTS 1. To study Cochran & Babcock & Wilcox boilers. 2. To study the working & function of mountings & accessories in boilers. 3. To study 2-Stroke & 4-Stroke diesel engines. 4. To study 2-Stroke & 4-Stroke petrol engines. 5. To calculate the V.R., M.A. & efficiency of single, double & triple start worm & worm wheel. 6. To calculate the V.R., M.A. & efficiency of single & double purchase winch crabs. 7. To find the percentage error between observed and calculated values of stresses in the members of a Jib crane. 8. To draw the SF & BM diagrams of a simply supported beam with concentrated loads. 9. To study the simple & compound screw jacks and find their MA, VR & efficiency. 10. To study the various types of dynamometers. 11. To the constructional features & working of Pelton/Kaplan/Francis. 12. To prepare stress-strain diagram for mild steel & cast iron specimens under tension and compression respectively on a Universal testing machine. 13. To determine the Rockwell / Brinell /Vickers hardness no. of a given specimen on the respective machines.
UNIT-I Matrices & its Applications : Rank of a matrix, elementary transformations, elementary matrices, inverse using elementary transformations, normal form of a matrix, linear dependence and in dependence of vactors, 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-II Ordinary Differential Equations & its 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 coefficients. Applications of linear differential equations to simple pendulum, oscillatory electric circuits. UNIT-III Laplace Transforms and its Applications : Laplace transforms of elementary functions, properties of Laplace transforms, existence conditions, transforms of derivaties, transforms of integrals, multiplication by tn, division by t. Evaluation of integrals by Laplace transforms. Laplace transform of Unit step function, unit impulse function and periodic function. Inverse transforms, convolution theorem, application to linear differential equations and simultaneous linear differential equations with constant coefficients. UNIT-IV Partial Differential Equations and Its Applications : Formation of partial differential equations, Lagranges linear partial differential equation, First order non-linear partial differential equation, Charpits 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 REFERENCE BOOKS : 1. Differential Equations H.T.H. Piaggio. 2. Elements of Partial Differential Equations I.N. Sneddon. 3. Advanced Engineering Mathematics R.K. Jain, S.R.K.Iyengar. 4. Advanced Engg. Mathematics Michael D. Greenberg. Note: The Examiners will set eight questions, taking two from each unit. The students are required to attempt five questions in all selecting at least one from each unit. All questions will carry equal marks.
Bachelor of Technology (Computer Engineering) Scheme of studies / Examination L T P Total 3 1 4 Teaching Schedule 3 3 3 3 3 18 1 1 1 1 1 6 3 3 3 2 11 4 4 4 4 4 3 3 3 2 35
(Semester- 3)
Sl. 1 No 2 3 4 5 6 7 8 9 10
Course No. MATH-201E /HUM-201E CSE-201 E CSE-203 E CSE-205 E CSE-207 E ECE-203 E IT-253 E CSE-209 E CSE-211 E ECE-207E
Mathematics-III / Subject Basics of Economics & Management Data Base Management Systems Data Structures Discrete Structures Internet Fundamentals Analog Comm. Internet Lab Data Base Management Systems Lab. Data Structures Lab Analog Comm. Lab
Prac Theory Sessional tical 100 Examination Schedule 50 (Marks) 100 100 100 100 100 600 50 50 50 50 50 50 25 50 25 450 25 25 25 25 100
Duration of Exam (Hours) T 150 150 150 150 150 150 75 50 75 50 1150 3 3 3 3 3 3 3 3 3 3
TOTAL
BASICS OF ECONOMICS & MANAGEMENT HUM 201 E L T 3 1 UNIT-I P Sessional Theory Total Duration of Exam. : : : : 50 100 150 3 Hrs. Marks Marks Marks
Meaning of Industrial Economic, Production Function, its types, Least Cost Combination, Law of Variable Proportion, Laws of Return Increasing, Constant & Diminishing. Fixed & variable costs in short run & long run, opportunity costs, relation between AC & MC, U-shaped short run AC Curve. Price & Output Determination under Monopoly in short run & long run. Price Discrimination, Price Determination under Discriminating Monopoly. Comparison between Monopoly & Perfect Competition.
UNIT II
Meaning of Management, Characteristics of Management, Management Vs. Administration, Management Art, Science & Profession, Fayols Principles of Management. Human Realtions Approach,Functions of Management
UNIT III
Planning & Organising Planning ,steps in planning,Planning premises ,difference b/w planning policy & strategy,Authority & Responsibility,Centralization & decentralization.
UNIT IV
Staffing,Directing & Controlling-Manpower planning,Recruitment & section styles,Leadership,Communication Process & barriers,Control process and steps in controlling TEXT BOOKS: 1. Modern Economic Theory Dewett, K.K., S. Chand & Co. 2. Economic Analysis K.P. Sundharam & E.N. Sundharam (Sultan Chand & Sons). 3. Micro Economic Theory M.L. Jhingan (Konark Publishers Pvt. Ltd.). 4. Principles of Economics M.L. Seth (Lakshmi Narain Aggarwal Educational Publishers Agra). 5. An Introduction to Sociology, D.R. Sachdeva & Vidya Bhusan. 6. Society An Introductory Analysis, R.M. Maclver Charles H. Page. 7. Principles and Practices of Management: R.S. Gupta; B.D. Sharma; N.S. Bhalla; Kalyani. REFERENCE BOOKS 1. Organization and Management: R.D. Aggarwal, Tata McGraw Hill. 2. Business Organization and Management: M.C. Shukla Note : Eight questions are to be set taking two from each unit. The students are required to attempt five questions in all, taking at least one from each unit.
L 3
T 1
P -
UNIT I Fourier Series : Eulers Formulae, Conditions for Fourier expansions, Fourier expansion of functions having points of discontinuity, change of interval, Odd & even functions, Half-range series. Fourier Transforms : Fourier integrals, Fourier transforms, Fourier cosine and sine transforms. Properties of Fourier transforms, Convolution theorem, Persevals identity, Relation between Fourier and Laplace transforms, Fourier transforms of the derivatives of a function, Application to boundary value problems. UNIT-II Functions of a Complex Variables: Functions of a complex variable, Exponential function, Trigonometric, Hyperbolic and Logarithmic functions, limit and continuity of a function, Differentiability and analyticity. Cauchy-Riemann equations, Necessary and sufficient conditions for a function to be analytic, Polar form of the Cauchy-Riemann equations, Harmonic functions, Application to flow problems, Conformal transformation, Standard transformations (Translation, Magnification & rotation, inversion & reflection, Bilinear). UNIT-III Probability Distributions: Probability, Bayes theorem, Discrete & Continuous probability distributions, Moment generating function, Probability generating function, Properties and applications of Binomial, Poisson and normal distributions. UNIT-IV Linear Programming: Linear programming problems formulation, Solution of Linear Programming Problem using Graphical method, Simplex Method, Dual-Simplex Method. Text Book 1. Higher Engg. Mathematics: B.S. Grewal 2. Advanced Engg. Mathematics: E. Kreyzig Reference Book 1. Complex variables and Applications : R.V. Churchil; Mc. Graw Hill 2. Engg. Mathematics Vol. II: S.S. Sastry; Prentice Hall of India. 3. Operation Research : H.A. Taha 4. Probability and statistics for Engineer: Johnson. PHI. Note : Examiner will set eight question, taking two from each unit. Students will be required to attempt five questions taking at least one from each unit.
Text Books:
Duration of Exam: 3 Hrs. Database System Concepts by A. Silberschatz, H.F. Korth and S. Sudarshan, 3rd edition, 1997, McGraw-Hill, International Overview of database Management System; Various views of data, data Models, Schemes, Unit1:Introduction Edition. Introduction to Languages & Environments. by Bipin Desai, 1991, over file processing systems, Responsibility of Introduction to DatabaseDatabase Management system Advantages of DBMS Galgotia Pub. Database Administrator, Three levels architecture of Database Systems, : Introduction to Client/Server architecture. Reference Books: Fundamentals of Database Systems by R. Elmasri and S.B. Navathe, 3rd edition, 2000, Addision-Wesley, Low Data Models : E-R Diagram (Entity Relationship), mapping Constraints, Keys, Reduction of E-R diagram into tables, Priced Edition. Naming Secondary Storage Devices. Network & Hierarchical Model. An Introduction to Database Systems by C.J. Date, 7th edition, Addison-Wesley, Low Priced Edition, 2000. Database Management and Design by G.W. Hansen and J.V. Hansen, 2nd edition, 1999, Prentice-Hall of India, Eastern Economy Edition. Database Management Systems by A.K. Majumdar and P. Bhattacharyya, 5th edition, 1999, Tata McGraw-Hill Publishing. A Guide to the SQL Standard, Date, C. and Darwen,H. 3rd edition, Reading, MA: 1994, Addison-Wesley. Data Management & file Structure by Looms, 1989, PHI
Total:
150
Marks
Note: Eight questions will be set in all by the examiners taking at least two questions from each unit .Students will be required to attempt five questions in all at least one from each unit.
CSE-203 E L T 3 1
P -
DATA STRUCTURES Sessional: 50 Marks Exam: 100 Marks Total: 150 Marks Duration of Exam: 3 Hrs.
Unit-1: Introduction: Introduction to Data Structures: Definition & abstract data types, Static and Dynamic implementations, Examples and real life applications; built in and user defined data structures, Ordered list and Operations on it. Arrays: Definition, implementation, lower bound, upper bound, addressing an element at a particular index for one dimensional arrays, Two dimensional arrays and Multi-dimensional arrays. Implementation of Data Structures like structure/ Record, Union,Sparse matrices: implementation of transpose. Stacks: Sequential implementation of stacks, operations, Polish-notations, Evaluation of postfix expression, Converting Infix expression to Prefix and Postfix expression, Applications. Unit-2: Queues: Definition, Sequential implementation of linear queues, Operations. Circular queue: implementation (using arrays), Advantage over linear queue, Priority queues & Applications. Linked Lists :Need of dynamic data structures, continuous & linked implementation of lists. Operations on lists. Dynamic implementation of linked lists, Operations. Comparison between Array and Dynamic Implementation of linked list. Linked implementation of stacks and queues. Circular lists, implementation of primitive operations. Doubly linked lists: continuous & dynamic implementation, operations. Unit-3: Trees: Definition, Basic terminology, Binary tree, Array and Dynamic Implementation of a binary tree, primitive operations on binary trees. External and internal nodes. Binary tree traversals : preorder, inorder and postorder traversals. Representation of infix, postifix and prefix expressions using trees. Representation of lists as binary trees.Introduction to Binary Search Trees, B trees, B+ trees , AVL Trees, threaded trees, balanced multi way search trees, Unit- 4: Graphs: Definition of undirected & Directed Graphs & Networks, Basic terminology, Representation of graphs,. Graph traversals and spanning forests, minimum-spanning trees, computer representation of graphs. Tables: Definition, Hash Functions, Implementation & Applications. Sorting & Searching: Basic Searching techniques (Linear & binary), Introduction to Sorting. Sorting using selection, insertion, bubble, merge, quick, radix, heap sort.
Text Book: Data Structures using C by A. M. Tenenbaum, Langsam, Moshe J. Augentem, PHI Pub. Reference Books: Data Structures and Algorithms by A.V. Aho, J.E. Hopcroft and T.D. Ullman, Original edition, Addison-Wesley, 1999, Low Priced Edition. Fundamentals of Data structures by Ellis Horowitz & Sartaj Sahni, Pub, 1983,AW Fundamentals of computer algorithms by Horowitz Sahni and Rajasekaran. Data Structures and Program Design in C By Robert Kruse, PHI, Theory & Problems of Data Structures by Jr. Symour Lipschetz, Schaums outline by TMH Introduction to Computers Science -An algorithms approach , Jean Paul Tremblay, Richard B. Bunt, 2002, T.M.H. Data Structure and the Standard Template library Willam J. Collins, 2003, T.M.H Note: Eight questions will be set in all by the examiners taking at least two questions from each unit .Students will be
Discrete Structures
Sessional: 50 Marks
Exam: Total:
100 150
Marks Marks
Unit-1: Set Theory: Introduction to set theory, Set operations, Algebra of sets, combination of sets, Duality, Finite and Infinite sets, Classes of sets, Power Sets, Multi sets, Cartesian Product, Representation of relations, Types of relation, Binary Relations, Equivalence relations and partitions, Partial ordering relations and lattices, Mathematics Induction, Principle of Inclusion & Exclusion, Propositions. Function and its types, Composition of function and relations, Cardinality and inverse relations. Functions & Pigeo principles. Unit-2: Propositional Calculus: Basic operations: AND (^), OR (v), NOT (~), Truth-value of a compound statement, propositions, tautologies, contradictions.
Techniques Of Counting: Rules of Sum of products, Permutations with and without repetition, Combination.
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, elementary properties of algebric structures, examples of a Monoid, Submonoid, Semigroup, Groups and rings, Homomorphism, Isomorphism and Automorphism, Subgroups and Normal subgroups, Cyclic groups, Integral domain and fields, Cosets, Lagranges theorem, Rings, Division Ring.
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, Eurelian path and circuits, Hamilton paths and circuits, Planar graphs, Eulers formula, Trees, Rooted Trees, Spanning Trees & cut-sets, Binary trees and its traversals Text Book: Elements of Discrete Mathematics C.L Liu, 1985, McGraw Hill Reference Books: Concrete Mathematics: A Foundation for Computer Science, Ronald Graham, Donald Knuth and Oren Patashik, 1989, Addison-Wesley. Mathematical Structures for Computer Science, Judith L. Gersting, 1993, Computer Science Press. Applied Discrete Structures for Computer Science, Doerr and Levasseur, (Chicago: 1985,SRA Discrete Mathematics by A. Chtewynd and P. Diggle (Modular Mathematics series), 1995, Edward Arnold, London, Schaums Outline series: Theory and problems of Probability by S. Lipshutz, 1982, McGraw-Hill Singapore Discrete Mathematical Structures, B. Kolman and R.C. Busby, 1996, PHI Discrete Mathematical Structures with Applications to Computers by Tembley & Manohar, 1995, Mc Graw Hill.
CSE-205 E
L T P
CSE-207 E
L 3 T 1 P -
Internet Fundamentals
Sessional: 50 Marks Exam : 100 Marks Total : 150 Marks Duration of Exam: 3 Hrs.
Unit-1 : The Internet: Introduction to networks and internet, history, Internet, Intranet & Extranet, Working of Internet, Internet Congestion, internet culture, business culture on internet. Collaborative computing & the internet. Modes of Connecting to Internet, Internet Service Providers(ISPs), Internet address, standard address, domain name, DNS, IP.v6.Modems, Speed and time continuum, communications software; internet tools. Unit-2 : World Wide Web : Introduction, Miscellaneous Web Browser details, searching the www: Directories search engines and meta search engines, search fundamentals, search strategies, working of the search engines, Telnet and FTP, HTTP, Gophar Commands, TCP/IP. Introduction to Browser, Coast-to-coast surfing, hypertext markup language, Web page installation, Web page setup, Basics of HTML & formatting and hyperlink creation.Using FrontPage Express, Plug-ins. Unit-3: Electronic Mail: Introduction, advantages and disadvantages, User Ids, Pass words, e-mail addresses, message components, message composition, mailer features, E-mail inner workings, E-mail management, MIME types, Newsgroups, mailing lists, chat rooms, secure-mails, SMTP, PICO, Pine, Library cards catalog, online ref. works. Languages: Basic and advanced HTML, Basics of scripting languages XML, DHTML, Java Script. Unit-4 : Servers : Introduction to Web Servers: PWS, IIS, Apache; Microsoft Personal Web Server. Accessing & using these servers. Privacy and security topics: Introduction, Software Complexity, Attacks, security and privacy levels, security policy, accessibility and risk analysis, Encryption schemes, Secure Web document, Digital Signatures, Firewalls, Intrusion detection Text Book: systems Fundamentals of the Internet and the World Wide Web, Raymond Greenlaw and Ellen Hepp 2001, TMH Internet & World Wide Programming, Deitel,Deitel & Nieto, 2000, Pearson Education Reference Books: Complete idiots guide to java script,. Aron Weiss, QUE, 1997 Network firewalls, Kironjeet syan -New Rider Pub. Networking Essentials Firewall Media. www.secinf.com www.hackers.com
ANALOG COMMUNICATION (ECE-203E) L 3 T P 1 THEORY : SESSIONAL : TOTAL : TIME : 100 Marks 50 Marks 150 Marks 3 Hrs.
UNIT I NOISE: Classification of Noise, Various sources of Noise, Methods of Noise Calculation in networks and inter connected networks. Addition of noise due to several sources; noise in amplifiers in cascade, noise in reactive circuits, Noise figure, its calculation and measurement. Noise temperature, Mathematical representation of random noise, narrow band noise and its representation. Transmission of noise through linear systems, signal to noise ratio, noise bandwidth. UNIT-II MODULATION TECHNIQUES: Basic constituents of Communication Systems, need of modulation, Amplitude modulation, spectrum of AM wave, modulation index, DSBSC modulation, SSB Modulation, Collector modulation, Square law modulation methods, Methods of generating SSB Signals, vestigial side band modulation, Detection of AM Signal; Diode detector, Square Law Detector. Time Constant RC in diode detector. Diode detector with filter. FDM, Power relations in AM wave. UNIT-III ANGLE MODULATION: frequency and phase modulation, spectrum of FM Wave, modulation index and Bandwidth of FM Signal, NBFM and WBFM, Comparison between FM and PM Signals, FM and AM signals, AM and NBFM Signals, FM generation methods, Demodulation methods; slope detector, ratio detector, Foster-Seeley discriminator. Pre-emphasis & De-emphasis, effect of noise on carrier; noise triangle. UNIT-IV TRANSMITER AND RECEIVER: Classification of radio transmitters, Block diagram of AM transmitter, Frequency Scintillation, Frequency drift, Radio broadcast transmitter, Radio telephone transmitter, Privacy devices, Armstrong FM transmitter, Simple FM transmitter using Reactance modulator. Classification of radio receivers, TRF receives, superheterodyne receivers, Image Signal rejection, frequency mixers. Tracking and alignment of receivers, Intermediate frequency, AGC, AFC, SSB receiver. REFERENCE BOOKS: 1. Taub & Schilling, Principles of Communication Systems, TMH. 2. Mithal G K, Radio Engineering, Khanna Pub. 3. Sirnon Haykin, Communication Systems, John Wiley. 4. Dungan F.R., Electronics Communication System, Thomson-Delmar 5. Electronics Communication System: Kennedy; TMH
NOTE: Eight questions are to be set in all by the examiner taking two questions from each unit. Students will be required to attempt five questions in all.
Internet Lab.
Sessional : Exam : Total : Duration of Exam: 50 Marks 25 Marks 75 Marks 3 Hrs.
PC Software: 1. 2. 3. 4.
Application of basics of MS Word 2000, MS Excel 2000, MS Power Point 2000, MS Access 2000, HTML
To prepare the 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. Design Web pages containing information of the Deptt.
HTML Lists : 1. Create a new document that takes the format of a business letter. Combine <P> and <BR> tags to properly separate the different parts of the documents. Such as the address, greeting, content and signature. What works best for each. 2. Create a document that uses multiple <BR> and <P> tags, and put returns between <PRE> tags to add blank lines to your document see if your browser senders them differently. 3. Create a document using the <PRE>tags to work as an invoice or bill of sale, complete with aligned dollar values and a total. Remember not to use the Tab key, and avoid using emphasis tags like <B> or <EM> within your list. 4. Create a seven-item ordered list using Roman numerals. After the fifth item, increase the next list value by 5. 5. Beginning with an ordered list, create a list that nests both an unordered list and a definition list. 6. Use the ALIGN attribute of an <IMG> tags to align another image to the top of the first image.. play with this feature, aligning images to TOP, MIDDLE and BOTTOM. 7. Create a table of contents style page (using regular and section links) that loads a different document for each chapter or section of the document. Internet : 1. Instilling internet & external modems, NIC and assign IP address. 2. Study of E-mail system. 3. Create your own mail-id in yahoo and indiatimes.com. 4. Add names (mail-ids) in your address book, compose and search an element. Reference Books: Complete PC upgrade & maintenance guide, Mark Mines, BPB publ. PC Hardware: The complete reference, Craig Zacker & John Rouske, TMH Upgrading and Repairing PCs, Scott Mueller, 1999, PHI,
CSE- 209 E
L T P
1.
Create a database and write the programs to carry out the following operation : 1. 2. 3. 4. 5. 6. Add a record in the database Delete a record in the database Modify the record in the database Generate queries Data operations List all the records of database in ascending order.
2. 3.
Create a view to display details of employees working on more than one project. Create a view to display details of employees not working on any project.
4.
5. 6. 7.
Create a view to display employees name and projects name for employees working on projects
Using two tables create a view which shall perform EQUIJOIN. Write trigger for before and after insertion. Detection and updation process. Write a procedure to give incentive to employees working on all projects. If no such employee found give app.
Message.
8. Write a procedure for computing amount telephone bill on the basic of following conditions. Usage of S/w: 1. VB, ORACLE and/or DB2 2. VB, MSACCESS 3. ORACLE, D2K VB, MS SQL SERVER 2000
5.
CSE-211 E
L T P
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.. Write a program to implement Queue. 5.Write a program to implement Stack. 6. Write a program to implement the various operations on string such as length of string concatenation, reverse of a string & copy of a string to another. 7. Write a program for swapping of two numbers using call by value and call by reference strategies. 8. Write a program to implement binary search tree.( Insertion and Deletion in Binary search Tree) 9. Write a program to create a linked list & perform operations such as insert, delete, update, reverse in the link list 10. Write the program for implementation of a file and performing operations such as insert, delete, update a record in the file. 11. Create a program toand perform the following operations on italgorithms and compare their 12. Write a linked list simulate the various searching & sorting for a list of 1000 a node b) Delete a node a) add elements. 13. Write a program to simulate the various graph traversing algorithms. 14 15 16
Note:
timings
Write a program, which simulates the various tree traversal algorithms. Write a program to implement various Searching Techniques. Write a program to implement Sorting Techniques.
At least 5 to 10 more exercises to be given by the teacher concerned.
ANALOG COMMUNICATION LAB (ECE-207E) L T P - - 2 Sessional : Viva : Total : Time : 25 Marks 25 Marks 50 Marks 3hrs.
LIST OF EXPERIMENTS: 1. To study Double Sideband Amplitude Modulation and determine its modulation factor and power in sidebands. ii) To study amplitude demodulation by linear diode detector. 2. i) To study Frequency Modulation and determine its modulation factor. ii) To study PLL 565 as frequency demodulator 3. To study Sampling and reconstruction of pulse amplitude modulation system. 4. To study the Sensitivity characteristics of superhetrodyne receiver. 5. To study the Selectivity characteristics of superhetrodyne receiver. 6. To study the Fidelity characteristics of superhetrodyne receiver. 7. i) To study Pulse Amplitude Modulation a) Using switching method b) By sample and hold circuit. ii) To demodulate the obtained PAM signal by IInd order Low pass filter. 8. To study Pulse Width Modulation / Demodulation. 9. To study Pulse Position Modulation / Demodulation. 10. To study active filters (Low-pass, High-pass, Band-pass, Notch filter). NOTE: At least seven experiments are to be performed from above list and the concerned institution as per the scope of the syllabus can set remaining three. i)
Sl. No.
Course No.
Bachelor of Technology (Computer Engineering/Information Technology) Scheme of studies / Examination (Semester- 4) Teaching Examination Schedule Schedule (Marks) Subject
L T P Total Theory Sessional Practical Total
1 2 3 4 5 6 7 8 9 10
CSE-202 E CSE-204 E IT-252 E ECE-204 E ECE-216 E IT-256 E ECE-212 E ECE 218 E GPCSE210
Mathematics III / Basics of Industrial Sociology, Economics & Management Computer Architecture and Organization
Programming Languages
3 3 3 3 3 3 1
1 1 1 1 1 1 3 3 3 -
4 4 4 4 4 4 3 3 3 1 34
50 50 50 50 50 50 50 50 25 50 475
25 25 25 75
Object Oriented Programming using C++ Digital Electronics Microprocessors & Interfacing C++ Programming Lab. Digital Electronics Lab Microprocessors & Interfacing Lab. General Proficiency/Practical Training TOTAL
19 6 9
UNIT-I Meaning of social change, nature of social change, theories of social change. The direction of social change, the causes of social change, the process of social change. Factors of social change the technological factors, the cultural factors, effects of technology on major social institutions, social need of status system, social relations in industry. UNIT-II Meaning of Industrial Economic, Production Function, its types, Least Cost Combination, Law of Variable Proportion, Laws of Return Increasing, Constant & Diminishing. Fixed & variable costs in short run & long run, opportunity costs, relation between AC & MC, Ushaped short run AC Curve. Price & Output Determination under Monopoly in short run & long run. Price Discrimination, Price Determination under Discriminating Monopoly. Comparison between Monopoly & Perfect Competition. UNIT III Meaning of Management, Characteristics of Management, Management Vs. Administration, Management Art, Science & Profession, Fayols Principles of Management. Personnel Management Meaning & Functions, Manpower Process of Manpower Planning, Recruitment & Selection Selection Procedure. Training Objectives & Types of Training, Various Methods of Training. Labour Legislation in India Main provisions of Industrial disputes Act 1947; UNIT IV Marketing Management Definition & Meaning, Scope of Marketing Management, Marketing Research Meaning, Objectives. Purchasing Management Meaning & Objectives, Purchase Procedure, Inventory Control Techniques. Financial Management Introduction, Objectives of Financial decisions, Sources of Finance. Note : Eight questions are to be set taking two from each unit. The students are required to attempt five questions in all, taking at least one from each unit. TEXT BOOKS : 1. Modern Economic Theory Dewett, K.K., S. Chand & Co. 2. Economic Analysis K.P. Sundharam & E.N. Sundharam (Sultan Chand & Sons). 3. Micro Economic Theory M.L. Jhingan (Konark Publishers Pvt. Ltd.). 4. Principles of Economics M.L. Seth (Lakshmi Narain Aggarwal Educational Publishers Agra). 5. An Introduction to Sociology, D.R. Sachdeva & Vidya Bhusan. 6. Society An Introductory Analysis, R.M. Maclver Charles H. Page. 7. Principles and Practices of Management : R.S. Gupta; B.D. Sharma; N.S. Bhalla; Kalyani. REFERENCE BOOKS 1. Organization and Management : R.D. Aggarwal, Tata McGraw Hill. 2. Business Organization and Management : M.C. Shukla
T
1
Sessional:
Exam : Total:
50
100 150
Marks
Marks Marks
Computer Organization and Design, 2nd Ed., by David A. Patterson and John L. Hennessy, Morgan 1997, Kauffmann. Computer Architecture and Organization, 3rd Edi, by John P. Hayes, 1998, TMH. Reference Books: Operating Systems Internals and Design Principles by William Stallings,4th edition, 2001, PrenticeHall Upper Saddle River, New Jersey Computer Organization, 5th Edi, by Carl Hamacher, Zvonko Vranesic,2002, Safwat Zaky. Structured Computer Organisation by A.S. Tanenbaum, 4th edition, Prentice-Hall of India, 1999, Eastern Economic Edition. Computer Organisation & Architecture: Designing for performance by W. Stallings, 4th edition, 1996, Prentice-Hall International edition.
Programming Languages
Sessional: 50 Marks Exam: 100 Marks Total: 150 Marks Duration of Exam: 3 Hrs.
Unit-1: Introduction: A brief history, 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. Syntax & Semantics: Introduction, general problem of describing syntax, formal method of describing syntax, attribute grammar dynamic semantic. 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, over loaded subprograms, generic subprograms. Unit3: 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. Concurrency subprogram level concurrency, synchronization through semaphores, monitors & message passing 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, logical, functional and object oriented programming language, Comparison of C & C++ programming languages. Text Book: Programming languages Design & implementation by T.W. .Pratt, 1996, Prentice Hall Pub. Programming Languages Principles and Paradigms by Allen Tucker & Robert Noonan, 2002, TMH, Reference Books: Fundamentals of Programming languages by Ellis Horowitz, 1984, Galgotia publications (Springer Verlag), Programming languages concepts by C. Ghezzi, 1989, Wiley Publications., 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 at least two questions from each unit .Students will be required to attempt five questions in all at least one from each unit.
Unit1: Introduction to C++, C++ Standard Library, Basics of a Typical C++ Environment, Pre-process ors Directives , Illustrative Simple C++ Programs. Header Files and Namespaces, library files. Concept of objects, basic of object modeling, object classes, associations, behaviors, description, Object Oriented Analysis & Object Modeling techniques, Object Oriented Concepts : Introduction to Objects and Object Oriented Programming, Encapsulation (Informati on Hiding), Access Modifiers: Controlling access to a class, method, or variable (public, protected, private, package), Other Modifiers, Polymorphism: Overloading,, Inheritance, Overriding Methods, Abstract Classes, Reusabilit y, Classs Behavior s. Classes and Data Abstraction: Introduction, Structure Definitions, Accessing Members of Structures, Class Scope and Accessing Class Members, Separating Interface from Implementation, Controlling Access Function And Utility Functions, Initializing Class Objects: Constructors, Using Default Arguments With Constructors, Using Destructors, Classes : Const(Constant) Object And Const Member Functions, Object as Member of Classes, Friend Function and Friend Classes, Using This Pointer, Dynamic Memory Allocation with New and Delete, Static Class Members, Container Classes And Integrators, Proxy Classes, Function overloading . Unit-2: Operator Overloading: Introduction, Fundamentals of Operator Overloading, Restrictions On Operators Overloading, Operator Functions as Class Members vs. as Friend Functions, Overloading, <<, >> Overloading Unary Operators, Overloading Binary Operators . Inheritance: Introduction, Inheritance: Base Classes And Derived Classes, Protected Members, Casting BaseClass Pointers to Derived- Class Pointers, Using Member Functions, Overriding Base Class Members in a Derived Class, Public, Protected and Private Inheritance, Using Constructors and Destructors in derived Classes, Implicit Derived Class Object To Base- Class Object Conversion, Composition Vs. Inheritanc e. Unit3: Virtual Functions and Polymorphism: Introduction to Virtual Functions, Abstract Base Classes And Concrete Classes, Polymorphism, New Classes And Dynamic Binding, Virtual Destructors, Polymorphism, Dynamic Binding. Files and I/O Streams: Files and Streams, Creating a Sequential Access File, Reading Data From A Sequential Access File, Updating Sequential Access Files, Random Access Files, Creating A Random Access File, Writing Data Randomly To a Random Access File, Reading Data Sequentially from a Random Access File. Stream Input/Output Classes and Objects, Stream Output, Stream Input, Unformatted I/O (with read and write), Stream Manipulators, Stream Format States, Stream Error States. Unit-4: Templates & Exception Handling: Function Templates, Overloading Template Functions, Class Template, Class Templates and Non-Type Parameters, Templates and Inheritance, Templates and Friends, Templates and Static Member s. Introduction, Basics of C++ Exception Handling: Try Throw, Catch, Throwing an Exception, Catching an Exception, Re-throwin g an Exception , Exceptio n specifications , Processin g Unexpecte d Exceptions, Stack Unwinding, Constructors, Destructors and Exception Handling, Exceptions and Inheritance .
Note: Eight questions will be set in all by the examiners taking at least two questions from each unit .Students will be required to attempt five questions in all at least one from each unit.
L 3
T 1
P -
UNIT 1 FUNDAMENTALS OF DIGITAL TECHNIQUES: Digital signal, logic gates: AND. OR, NOT. NAND. NOR- EX-OR, EX-NOR, Boolean algebra. Review of Number systems. Binary codes: BCD, Excess-3. Gray codes. COMBINATIONAL DESIGN USING GATES: Design using gates. Karnaugh map and Quine Mcluskey methods of simplification. UNIT 2 COMBINATIONAL DESIGN USING MST DEVICES Multiplexers and Demultiplexers and their use as logic elements. Decoders. Adders / Subtracters. BCD arithmetic Circuits. Encoders. Decoders / Drivers for display devices. 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, Design of Synchronous and Asynchronous sequential circuits. UNIT 3 DIGITAL LOGIC FAMILIES: Switching mode operation of p-n junction, bipolar and MOS-devices. Bipolar logic families: RTL, DTL, DCTL. HTL, TTL, ECL, MOS, and CMOS logic families. Tristate logic. Interfacing of CMOS and TTL families. 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 -comparator, successive approximation, counting type. Dual-slope ADC, specifications of ADCs. PROGRAMMABLE LOGIC DEVICES: ROM, PLA. PAL, Introduction to FPGA and CPLDs. TEXT BOOK: 1. Modem 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. Digital Design: Morris Mano: PHI, NOTE: Eight questions are to be set in all by the examiner taking at least one question from each unit. Students will be required to attempt five questions in all.
Computer Architecture & Organisation by M. Mano, 1990, Prentice-Hall. Computer Architecture- Nicholas Carter, 2002, T.M.H.
Note: Eight questions will be set in all by the examiners taking at least two questions from each
unit .Students will be required to attempt five questions in all at least one from each unit.
Unit-1:THE 8085 PROCESSOR : Introduction to microprocessor, 8085 microprocessor : Architecture, instruction set, interrupt structure, and assembly language programming. MEMORY INTERFACING: Semiconductor memory and its types- Static and dynamic RAM, ROM, EPROM, EEROM and NOVRAM- Interfacing memory- Interfacing SRAM, DRAM, EPROM etc. Timing of RAM and ROM signals. Unit-2 : THE 8086 MICROPROCESSOR ARCHITECTURE : Architecture, block diagram of 8086, details of sub-blocks such as EU, BIU; memory segmentation and physical address computations, program relocation, addressing modes, instruction formats, pin diagram and description of various signals. 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. Unit-3 : INTERFACING DEVICE : The 8255 PPI chip: Architecture, control words, modes and examples.Interfacing D/A and A/D converters Unit-4: DMA : Introduction to DMA process, 8237 DMA controller, INTERRUPT AND TIMER : 8259 Programmable interrupt controller, Programmable interval timer chips. Text Books : Microprocessor Architecture, Programming & Applications with 8085 : Ramesh S Gaonkar; Wiley Eastern Ltd. The Intel Microprocessors 8086- Pentium processor : Brey; PHI Reference Books : Microprocessors and interfacing : Hall; TMH The 8088 & 8086 Microprocessors-Programming, interfacing,Hardware & Applications :Triebel & Singh; PHI Microcomputer systems: the 8086/8088 Family: architecture, Programming & Design : Yu-Chang Liu & Glenn A Gibson; PHI. Advanced Microprocessors and Interfacing : Badri Ram; TMH Note: Eight questions will be set in all by the examiners taking at least two questions from each unit .Students will be required to attempt five questions in all at least one from each unit.
C ++ Programming Lab.
Sessional: 50 Marks Exam: 25 Marks Total: 75 Marks Duration of Exam: 3 Hrs.
Q1. 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. Q2. 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 Q 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 Q4. 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 Q 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.
Q13. 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. Q 14. Assume that a bank maintains two kinds of accounts for customers, one called as savings account and the other as current account. The savings account provides compound interest and withdrawal facilities but no cheque book facility. The current account provides cheque book facility but no interest. Current account holders should also maintain a minimum balance and if the balance falls below this level, a service charge is imposed.
Create a class account that stores customer name, account number and type of account. From this derive the classes cur_acct and sav_acct to make them more specific to their requirements. Include necessary member functions in order to achieve the following tasks:
a) b) c) d) e) f)
Accept deposit from a customer and update the balance. Display the balance. Compute and deposit interest. Permit withdrawal and update the balance. Check for the minimum balance, impose penalty, necessary and update the balance. Do not use any constructors. Use member functions to initialize the class members.
Q 15. 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 baseclass 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
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. To verify the operation of multiplexer & Demultiplexer. 4. To verify the operation of comparator. 5. To verify the truth tables of S-R, J-K, T & D type flip flops. 6. To verify the operation of bi-directional shift register. 7. To design & verify the operation of 3-bit synchronous counter. 8. To design and verify the operation of synchronous UP/DOWN decade counter using J K flipflops & drive a seven-segment display using the same. 9. To design and verify the operation of asynchronous UP/DOWN decade counter using J K flipflops & drive a seven-segment display using the same. 10. To design & realize a sequence generator for a given sequence using J-K flip-flops. 11. Study of CMOS NAND & NOR gates and interfacing between TTL and CMOS gates. 12. Design a 4-bit shift-register and verify its operation . Verify the operation of a ring counter and a Johnson counter. 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.
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. Write a program using 8086 for division of a defined double word (stored in a data segment) by another double word division and verify.
10. Write a program using 8086 for finding the square root of a given number and verify. 11. Write a program using 8086 for copying 12 bytes of data from source to destination and verify. 12. Write a program using 8086 and verify for: a. Finding the largest number from an array. b. Finding the smallest number from an array. 13. Write a program using 8086 for arranging an array of numbers in descending order and verify. 14. Write a program using 8086 for arranging an array of numbers in ascending order and verify. 15. Write a program for finding square of a number using look-up table and verify. .
16. Write a program to interface a two digit number using seven-segment LEDs. Use 8085/8086 microprocessor and 8255 PPI. 17. Write a program to control the operation of stepper motor using 8085/8086 microprocessor and 8255 PPI.
Duration of Exam(Hours) 3 3 3 3 3 3 3 3 -
17 9
35
450
Note to the paper setter: The number of questions to be set will be seven, one from each unit. Out of these one question will be compulsory. The examinees will be required to attempt the compulsory one and any other four questions. All questions shall carry equal marks. Unit 1: Financial Management Introduction of financial management ,Objectives of financial decisions, status and duties of financial Executives. Financial Planning tools of financial planning, Management of working capital, Factors affecting requirements of working capital, Capital structure decision, Features of appropriate capital structure , Sources of finance. Unit 2: Personnel Management Personnel management Meaning. nature and importance. Functions of personnel Management (a) Managerial Functions and (b) Operative functions. Job analysisMeaning and importance. Process of Job analysis, job Description and job specification. Human Resource Development Meaning and Concept. Unit 3: Production Management Production Management Definition and Objectives, Plant Location: Ideal Plant Location, Factors affecting plant Location. Plant Layout : Ideal Plant Layout, Factors affecting plant layout Work Measurement: Meaning , Objectives and Essentials of work Measurement Production Control: Meaning and importance of production control and steps involved in production control. Unit 4: Marketing Management Nature, Scope and importance of marketing management Modern marketing concepts, Role of marketing in economic development. Marketing information system, Meaning nature and scope of international Marketing.
Unit 1 Introduction Review of elementary data structures, analysing algorithms, asymptotic notation, recurrence relations, hash tables, Binary search trees. Sorting and Order Statistics Heapsort, Priority queues,Quicksort, Sorting in linear time, medians and order statistics, dynamic order statistics. Unit 2 Advanced Design and analysis Techniques Dynamic programming Elements, Matrix-chain multiplication, longest common subsequence, optimal polygon traingulation, Greedy algorithms- Elements , activityselection problem, Huffman codes, task scheduling problem. Advanced data Structures Operations in B-Trees, Binomial heaps, Fibonacci heaps, data structures for disjoint sets, strings. Unit 3 Graph Algorithms Review of graph algorithms, topological sort, strongly connected components,minimum spanning trees- Kruskal and prims,Single source shortest paths, relaxation, Dijkstras algorithm, Bellman- Ford algorithm, Single source shortest paths for directed acyclic graphs, difference constraints and shortest paths, All pairs shortest paths- shortest paths and matrix multiplication, Floyd-Warshall algorithm, Johnsons algorithm. Unit 4 Flow and Sorting Networks Flow networks, Ford- Fulkerson method, Maximum bipartite matching, Sorting Networks, Comparison network, The zero- one principle, Bitonic sorting network, merging network Note:- There will be 8 questions in all. Two Questions will be set from each unit. Students are required to attempt five questions selecting at least one question from each unit. Books : 1 Corman, Leiserson and Rivest : Introduction to Algorithms, 2/e, PHI 2 Horowitz, Ellis and Sahni, Sartaj : Fundamentals of Computer Algorithms. Galgotia Publications 3 Aho, Hopcroft and Ullman : The Design and Analyses of Computer Algorithms. Addison Wesley. 4 R.B.Patel, Expert Data Structures with C, Khanna Publications , Delhi, India, 2nd
UNIT 1 Network functions, Network Topologies, Network Services, Switching approaches, Transmission media and systems, multiplexing and signaling techniques, Error detection and correction, ISDN and BISDN.
Layered architectures
Example OSI Reference Model, Overview of TCP/IP architecture, Socket System calls, SMTP, Electronic mail. UNIT 2 Peer-To-Peer Protocols Protocols, Service Models and end-to-end requirements, ARQ, Sliding window, RTP, HDLC, PPP protocols, Statistical multiplexing
TCP/IP
Architecture, Internet Protocols IP packet, addressing, Subnet Addressing, IP routing, CIDR, ARP, RARP, ICMP, Reassembly, IPv6, UDP, Transmission control Protocol TCP, Reliable stream service, Operation Protocol, DHCP, Mobile IP, Internet Routing Protocols, Multicast routing. NOTE There will be 8 questions in all. 2 questions will be set from each unit. Students have to attempt five questions selecting at least one from each unit. BOOKS 1. Leon Garrcia and Indra Widjaja: communication Networks Fundamentals and Concepts and Key Architectures TMH 2000. 2. A.S. Tanenbaum: Computer Networks 3/e .PHI, 1997.
Unit-1 Finite Automata and Regular Expression: Finite State System, Basic Definition NonDeterministic finite Automata (NDFA). Deterministic finite Automata (DFA), Equivalence of DFA and NDFA, Finite Automata with E-moves. Regular Expression, Equivalence of finite Automata and expression. Regular expression conversion and ViceVersa. Unit-2 Introduction to Machines: Concept of basic machines, Properties and limitations of FSM, Moore and Mealy Machines, Equivalence of Moore and Mealy Machines. Conversion of NFA and DFA by Ardens method. Unit-3 Grammars: Definitions, 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 push-down machines, Application of push down machines. Unit-4 Turing Machines, Deterministic and Non-Deterministic Turing Machines, Design of T.M., Halting Problem of T.M. PCP problem. Chomsky Hierarchy: Chomsky hierarchies of grammars, unrestricted grammar, Context sensitive Language, Relation between Languages of classes. Computability: Basic Concepts, Primitive Recursive Functions. Note: There will be 8 questions in all. Two Questions will be set from each umit. Students are required to attempt five questions selecting at least on question from each unit. Text Books 1. R.B. Patel, & Prem Nath, Theory of Automata and Formal Languages, Umesh Publication, New Delhi, Ist Edition 2005, ISBN-81-88114-53-7, pp. 1-496. 2. John C. Martin: Introduction to Language and the Theory of Computation, MGH. Books 1. Lewis & Papadimitriou: Elements of the Theory of Computation. PHI. 2. Daniel I.A. Cohen: Introduction to Computer Theory: John Wiley. 3. J.E. Hoproft and J.D. Ullman: Introduction to Automata Theory Languages and Computation, Narosa. 4. Introduction to Automata Theory, Language & computations Hoproaft & O.D. Ullman, R. Motwani.
Operating System(CSE-307)
L T 3 1 P Theory: 75 Sessionals:25
UNIT 1 File and CPU Management: Operating system functions and characterstics,historical evalution of operating system,Real time systems,Distributed systems,Methodologies for implementation of o/s service system calls,system programs,interrupt mechanism s,concept of threading . File System: Functions of the systems,file access and allocation methods,Directory system:structured organization,Directory and file protection mechanism,implementation issues;hierarichy of file and device managemen t. CPU Scheduling: Levels of scheduling,comparative study of scheduling algorithms,multiple processor scheduling . UNIT 2 Storage and Device Management: Storage Management: Storage allocation methods:single contiguous allocation,multiple contiguous allocation,Paging, Segmentation,Combination of Paging and Segmentation,Virtual memory concepts,Demand paging,Page replacement algorithms,Thrashing Device Management:Hardware organization,device scheduling,policies and I/O Management . Protection: Mechanism and Policies, implementati on. UNIT 3 Deadlocks and Cuncurrency Control: Deadlock:Deadlock characterization,Dea dlock prevention and avoidance,Deadlock detection and recovery,practica l considerations . Concurrent Processes: Critical section problem,Semaphores,Classical process coordination,problems and their solutions,interprocess communication,multithreadin g. UNIT 4 CaseStudies: DOS: Study of DOS with reference to storage management,device
L T 1 2 3 4
P 3
Practical: 25 Sessionals:50
EXPERIEMENT
Implement the algorithm to compute roots of optimal subtrees. An Euler circuit for an undirected graph is a path that starts and ends at the same vertex and uses each edge exactly once. A connected undirected graph G has an Euler Circuit. If and only if every vertex is of even degree. Give an algorithm and implement to find the Euler Circuit in a graph with edges provided one exists . Give an algorithm to determine whether a directed graph with positive and negative cost edges has negative cost cycle. Write an algorithm in which given an nxn matrix M of positive integers is given and that finds a sequence of adjacent entries starting from M[n,1] and ending at M[1,n] such that the sum of the absolute values of differences between adjacent entries is minimized. Two entries M[i, j] and M[k, i] are adjacent if (a) I-k+-1 and j-1 or (b) I=k and j=1+-1 For ex. In the following figure sequence 7,5,8,7,9,6,12 is a solution 1 8 5 7 9 7 9 3 6 3 11 2 12 5 4 6
7 .
Write a complete LC branch and bound algorithm for the job sequencing with deadlines
8 .
problem. Use the fixed tuple size formulation. Write a LC branch and bound algorithm for the knapsack problem using the fixed tuple size formulation. The postfix representation of an infix arithmetic expression LDR is defined recusively to the postfix representation of L followed by the postfix representation of R followed by 0. L & R are respectively the left and right periods of 0. considers some examples : Infix postfix
Make a left to right scan off using a stack to store operands and results. When even an operator is run in E, the top two operands on the stack are its right and left operands). Write an algorithm to obtain the postfix form of an infix expression E. Again assume E has only the binary operators +,-,*, and /. (Hint: Make a left to right scan of E using a stack to store operators until both the left and right operands of an operator have been output in postfix form). Note that E may contain parenthesis.
L T P 3
Practical: 50 Sessionals:50
1 2 EXPERIMENTS
Study of H/W & S/W requirement of different operating system. Implementation of contiguous, linked and indirect allocation strategies assuming randomly generated free space list.
3 4
Implementation of worst, best & first fit contiguous allocation assuming randomly generated free space list. 5 Implementation of compaction for the continually changing memory layout & calculate total movement of data.
6 7 8
Calculation of external & Internal fragmentation for different program & for different page
size.
9 1 0
Implementation of resource allocation graph. Implementation of Bnakers algorithm. Conversion of response allocation graph to wait for graph.
Implementation of Bernsteins condition for concurrency. Implementation of Fork & Join Construct.
1 . 2 . 3 . 4 . 5 .
Learn Basics of Java language and its development libraries/ tools. Generate an editor screen containing menus, dialog boxes etc using Java. Create an applet with a text field and three buttons. When you press each button, make some different text appear in the text field. Add a check box to the applet created, capture the event and insert different text in the text field. Create an applet with a button and a text field. Write a handleEvent( ) so that if the button has the focus, characters typed into it will appear in the text field. Create your own java bean called VALVE that contains two properties: a Boolean called on and an integer called level. Create a manifest file, use jar to package your bean then load it into the beanbox or into your own beans enabled program builder tool. Develop a servlet that gets invoked when a form on a Web page in HTML is submitted. Create a cookie object and enter/display value for that Cookie. Java Networking Java Sockets and RMI. Programming under development tool ASP.net. Using JAVA develop a front end for a contact management program using a flat file database. DB needs to be distributed or centralized.
6 .
Sr . No .
1.
Course No.
* CSE-302
Subject
Theory
100 100 100 100 100 600
Sessional
50 50 25 50 25 50 50 50 350
Practica l 50 50 50 150
Total 150 150 125 150 125 100 100 100 1000
TOTAL
*Departmental Elective: 1. 2. 3. 4. 5. 6. CSE-320 CSE-321 CSE-322 CSE-323 CSE-324 CSE-325 Digital Signal Processing Multimedia Technique Graph Theory & Combinations Logic of Programming Advanced Database Systems Parallel Computing
Unit 1. Parallel & Distributed Databases Architecture for parallel databases, Parallel query evaluation. parallel individual operations. parallel query optimization Introduction to distributed databases. distributed DBMS architectures. storing data in a distributed DBMS. distributed catalog management, distributed query processing. updating distributed data. introduction to distributed transactions. distributed concurrency control. recovery. Unit 2. Data Mining Introduction, counting co-occurrences, mining for rules, tree structured rules. clustering, similarity search over sequences. Unit 3. Object Database Systems User defined ADT. structured types. objects & reference types. inheritance. design for an ORDBMS. challenges in implementing an ORDBMS. ORDBMS. comparison of RDBMS with OODBMS & ORDBMS. Unit 4. Advanced Topics Advanced transaction processing. integrated access to multiple data source. mobile databases main memory databases. multimedia databases. GIS. temporal & sequence databases. Note: - There will be 8 questions in all. Two Questions will be set from each unit. Students arc required to attempt five questions selecting at least one question from each unit BOOKS 1. R. Ramakrishnan & J. Gehrks Database Management Systems: MGH. International Ed. 2000. 2.Korth. Silberschatz. Sudcrshan: Data Base concepts. MGH. 2001. 3. C.I. Date. Database Systems:. 7th Ed.. Addison Wesley. Pearson Education. 2000.
Unit 1. Memory Memory, memory chips. & Modules, memory types, advanced memory technologies. Troubleshooting memory. Power Supply Power supply function and operation, power supply quality an&-: specification, power protection and back up. backup power system: UPS; troubleshooting power supply. 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; 011 board I/O devices, ROMBIOS, ROM POST. CMOS setup. 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 monitors, tro~lble-shootil1g drives and peripherals. Note: - There will be 8 questions in all. Two Questions will be set from each unit. Students are required to attempt five questions selecting at least one question from each unit BOOKS 1. Craig Zacker & .John Rourtrc: PC Hardware- The complete reference 2. Mark Minosi: The complete PC Upgrade & Maintenance Guide publications. 3. S.K. Chauhan: PC Upgrading. Maintenance and troubleshooting guide
CSE-308 L 4 T 1 P -
Unit 1.Software and Software engineering- Software characteristics, software crisis, software engineering paradigm. Planning a software project-software cost estimation, project scheduling. Personal planning. Team structure. Unit 2 Software configuration management. quality assurance. project monitoring. risk management.Software requirement analysis- structured analysis, object oriented analysis and data modeling. software requirement specification, validation, Unit 3.Design and implementation of software - software design fundamentals. design methodology (structured design and object oriented design). design verification, monitoring and control coding. Software reliability: metric and specification. fault avoidance and tolerance. exception handling, defensive programming. Unit 4.Testing - Testing fundamentals. white box and black box testing software testing software testing strategies: unit testing. integration testing. validation testing. system testing. debugging. Software Maintenance -- maintenance characteristics. maintainability. maintenance tasks. maintenance side effects.CASE tools. Note: - There will be 8 questions in all. Two Questions will be set from each unit. Students are required to attempt five questions selecting at least one question from each unit. Books: 1. Pressman S.Rogcr, Software Engineering. 'Tata McGraw-Hill 2, Jalote Pankaj, An integrated approach to software engineering .Narosa Publishing House 3. Sommerville Ian. Software Engineering. 5th ed., Addison Wesley-2000 4. Fairley Richard, Software. Software Engineering Concepts. Tata Mcgraw-Hill
L T P Practical : 50 Marks 3 Sessional : 50 Marks I. To solder and de-solder various components. 2. To check and measure various supply voltages of Pc. 3. To make comparative study of motherboards: 386,486, PI. PII. PIII. 4. To observe and study various cables, connections and parts used in computer Communication. 5. To study various cards used in a system viz. display card, LA1'rbrd etc. 6. To remove, study and replace Floppy disk drive. 7. To remove, study and replace hard disk. 8. To remove, study and replace CD ROM drive. 9. To study monitor, its circuitry and various presets and some elementary fault Detection. 10. To study printer assembly and elementary fault detection of DMP and laser Printers. 11.To observe various cables and connectors used in networking. 12.To study pa!1S of keyboard and mouse. 13.To assemble a Pc. 14.Troubleshooting exercises related to various components of computer like monitor. drives, memory, and printers etc. BOOKS 1. Mark Mines Complete PC upgrade & maintenance guide, BPB publications. 2. Craig Zacker & John Rouske, PC Hard ware: The Complete Reference. TMH. 3. Scott Mueller, Upgrading and Repairing PCs, PHI, 1999
1. Design a prototype that implements the Cache management for a mobile computing environment? 2. Design a System: The challenges or developing high performance. high reliability. and high quality software systems arc too much for ad hoc and informal engineering techniques that might have worked in the past on less demanding systems. New techniques for managing these growing complexities are required to meet today's timeto-market. productivity and quality demands. 3. Peer-to-peer communication system: As computers become more pervasive and homes become better connected. a new generation of applications will be deployed over the Internet. In this model. peer-to-peer applications become very attractive because they improve scalability and enhance performance by enabling direct and real-time communication among the peers. We need to propose a decentralized management system that manages the peer-to-peer applications and the system resources in an integrated way: monitors the behavior of the peer-to-peer applications transparently and obtains accurate resource projections. Manages the connections between the peers and distributes the objects in response to the user requests and changing processing and networking conditions. 4. Write programs that implement the few sorting algorithms (bubble,selection, etc.)for n data. It stops the operation when the counter for sorting index is at 100, 1000. 10000 and so on, stores the contents of the registers, program counter and partially sorted list of data, etc. It resumes the operation after 30 sec from the point of the termination. 5. Write a program that implements the bubble sort for n data. It stops the operation when the counter for sorting index is at 100, 1000, 10000. and so on. Stores the contents of the registers, program counter and partially sorted list of data. etc. It transfers the code and data - across the network on the new destination and resumes the operation from the point of termination on the previous node. Finally the result from the last node in the itinerary is sent back to the process-initiating node. 6. Develop a prototype that perform parallel computation of the same task on different nodes. Finally process initiator (master node)- receive Yes the result It and computation time required to complete the task on an each node and displays to the user. Compare the computing power of different nodes. Books 1. Mobility: Processes, Computers. and Agents. Dejan Milojieie. federick Douglis, Richard Wheeler, Addison-Wesley Professional; 1st edition (April 19, 1999). 2. Ivan Stojmenovic' (Editor), Handbook of Wireless Networks and Mobile Computingm. Wiley, ISBN: 0-471-41902-8, February 2002 3. Core Java Volume I and II from Sun Micro Systems. 4. Huges. Java Networking, Hut Publication. Pune 5. Java 2: The Complete Reference 4/c: Herbert Schildt, TMH Delhi. 6. Java Beans Programming from the Ground Up: Joseph Q'Neil, TMH. Delhi 7. Java Servlets: Application Development; Karl Moss. TMH, Delhi.
1. (i) Implement Receipt Acknowledgement and updation of Inventory (RAUP) a) Find unadjusted Functional points (UFP) b) Calculate FPC by Mark II Method (ii) To estimate effort and schedule Calculate the compression factor and the manpower required based on given information of software. 2. Suggest an action plan for the following risks without compromising the project, process or product parameters a) Language skills inadequate in two people in a team of five. b) Specially ordered hardware and software likely to be delivered three Months late. c) Customer and end user not convinced on new technology implementation as a correct choice. d) Software required interface with other technologies on which the project team has no experience. 3. Implement a Testing strategy for the following software development cases: (a) Rule based deterministic closed large but simple payroll system for a company. (b) Development or a customer relation management system lor a retail distribution chain. The retail organization is not sure about the scope, and failure feature. (c) Modification to existing order processing system for a multi location,multi-product company. 4. Build a work breakdown structure for the following a) Delivery orthe software, initiation to development covering lifecycle. b) Development of prototype c) Development of a process for a function 5. In a hospital management system develop the following diagrams for a Ward Service Management System (SMW). (a) Work Flow (b) System Flow (c) DFD Develop on effective modular design of SMW using these diagrams. 6. Draw three level DFDs for CLPS. Modl1larize the CLPS and structure them top-down as functional model. 7. Conduct a task analysis for the following users: (a) officer at railway ticket reservation window (b) officer at insurance claim settlement desk. (c) clerk at call center. answering queries of customers who have purchased cars from the company. 8. Based on the business model of DEL develop a modular structure for a business system model. Draw a complete system flowchart. Books 1. W. S. Jawadekar, Software Engineering Principle and Approaches. TMH. 2004. 2. Pressman S.Roger. Software Engineering. Tata McGraw-Hill 3. Jalote Pankaj. An integrated approach to software engineering. Narosa Publishing
L T P Theory : 100 Marks 3 2 Sessional : 50 Marks Unit 1. Basics of Multimedia Technology Computers, Communication and Entertainment: Multimedia -An introduction: Framework for multimedia systems; multimedia devices CD Audio. CD-ROM. CD-I: presentation devices and the user interface; multimedia presentation and authoring; professional development tools: LANs & multimedia. Internet, World Wide Web & Multimedia; distribution network ATM & ADSL; multimedia servers & databases: vector graphics; 3-D graphics programs; animation techniques; shading; anti-aliasing; morphing: video on demand Unit 2. Image Compression & Standards Making still images: editing and capturing images; scanning images; computer color models: color palettes; vector drawing; 3-D drawing and rendering; JPEG-objectives and architecture: JPEG-DCT encoding and quantization, JPEG statistical coding; JPEG predictive loss less coding; JPEG performance; Overview of other image file formats as GIF, TIFF. BMP. PNG etc. Unit 3. Audio & Video Digital representation of sound: time domain sampled representation; method of encoding the analog signals; sub-band coding; Fourier method: transmission of digital sound; digital audio signal processing; stereophonic & quadraphonic signal processing; editing sampled sound: MPEG Audio; audio compression & decompression: brief survey of speech recognition and generation; audio synthesis; Musical Instrument Digital Interface (MIDI); digital video and image Compression; MPEG Motion video compression standard; DVI technology: time based media representation and delivery. Unit 4. Virtual Reality Applications of multimedia, Intelligent multimedia system, Desktop Virtual Reality (VR). VR operating System, Virtual environment displays and orientation tracking; visually coupled system requirements; intelligent VR software systems. Applications of environments in various fields viz. Entertainment. manufacturing. Business, education, etc. Note: - There will be 8 questions in all. Two Questions will be set from each unit. Students are required to attempt five questions selecting at least one question from each unit BOOKS 1. Villamil & Molina Multimedia: An Introduction. PHI. 2. Lozano. Multimedia: Sound & Video PHI. 3. Villamil & Molina Multimedia: Production. Planning and Delivery, PHI 4. Sinclair. Multimedia on the Pc. BPB. 5. Tay Vaughan. Multimedia :Making it work. TMH
Unit 1. Introduction Basic concepts, sub graphs, vertex, degrees. walks. paths, circuits, cycles, trees. spanning trees, cut vertices and cut edges. connectivity, Euler tours and Hamiltonian cycles. matching perfect matching, connectivity. and separability, network flows. I-isomorphism and 2-isomorphism. Unit 2. Advanced Features Vertex coloring, chromatic polynomial. edge coloring, planar and non-planar graphs. Euler's formula Kuratowski's theorem. test for planarity. directed graphs. tournaments, networks. max now, min cut theorems. graph enumeration, Polya's counting theorem. Unit 3. Graph Algorithms Computer representation of graph. shortest path algorithms, minimal spanning tree. fundamental circuit. depth first search. planarity testing. directed circuits. isomorphism. performance of graph theoretic algorithms. Unit 4. Combinatorics Basic combination numbers. recurrence relations. generating functions. multinomial. counting principles, Polya' s theorem, inclusion and exclusion principles. block design and error correcting codes, Hadamard matrices, finite geometry. Note: - There will be 8 questions in all. Two Questions will be set from each unit. Students are required to attempt five questions selecting at least one question from each unit BOOKS 1. Deo N.: Graph Theory and Applications. Prentice Hall 2. D.B.West: Introduction to Graph Theory. Prentice Hall 3. S.A.Choudum: A First Course in Graph Theory, MacMillan [India] 4. V.Krishnamurthy: Combinatorics-- Theory and Applications. Affiliated East-West 5. Alan Tucker: Applied combinatories. Wiley. .
Unit 1. Fundamentals Propositions. Tautologies, Precedence rules. System definition. J~easoning using Transformations. Formal Systems, Axioms, Inference Rules. Predicates. Quantification, Free and bound identifiers. Data Values & Types. Generators. semantic definitions of functions. Generator Induction, defined ness condition. Unit 2. Semantics Predicate Transformers, various commands. Alternative and Iterative commands. Procedure call, The characterization of semantics. The semantic characterization of programming language. Two Theorems. Design of Properly terminating constructs. Euclid's Algorithms.. Interrupts. spin locks. Unit 3. Communicating Sequential Processes (CSP) Parallel commands. Co routines. Subroutines and data representation. monitors and scheduling. Integer semaphore. Dining Philosophers Problcm
Note: - There will be 8 questions in all. At least two Questions will be set from each unit. Students are required to attempt five questions selecting at least one question from each unit BOOKS 1. David Cries. The Science of Programming. Narosa Publishing House 2. E.W..Dijkstra. A Discipline of Programming PHI 3. Hoare and .lones, Essays in Computing Science, TMH.
Unit 1. Parallel & Distributed Databases Architecture for parallel databases, Parallel query evaluation. parallel individual operations. parallel query optimization Introduction to distributed databases. distributed DBMS architectures. storing data in a distributed DBMS. distributed catalog management, distributed query processing. updating distributed data. introduction to distributed transactions. distributed concurrency control. recovery. Unit 2. Data Mining Introduction, counting co-occurrences, mining for rules, tree structured rules. clustering, similarity search over sequences. Unit 3. Object Database Systems User defined ADT. structured types. objects & reference types. inheritance. design for an ORDBMS. challenges in implementing an ORDBMS. ORDBMS. comparison of RDBMS with OODBMS & ORDBMS. Unit 4. Advanced Topics Advanced transaction processing. integrated access to multiple data source. mobile databases main memory databases. multimedia databases. GIS. temporal & sequence databases. Note: - There will be 8 questions in all. Two Questions will be set from each unit. Students arc required to attempt five questions selecting at least one question from each unit BOOKS 1. R. Ramakrishnan & J. Gehrks Database Management Systems: MGH. International Ed. 2000. 2.Korth. Silberschatz. Sudcrshan: Data Base concepts. MGH. 2001. 3. C.I. Date. Database Systems:. 7th Ed.. Addison Wesley. Pearson Education. 2000.
CSE-325 L 3 T 2 P -
Unit 1. Introduction: Paradigms of parallel computing: Synchronous - vector/array. SIMD, Systolic; Asynchronous - MIMD, reduction paradigm. Hardware taxonomy: Flynn's classifications, Handler's classifications. Software taxonomy: Kung's taxonomy. SPMD. Unit 2. Abstract parallel computational models: Combinational circuits, Sorting network. PRAM models, Interconnection RAMs. Parallelism approaches - data parallelism, control parallel ism Performance Metrics: Laws governing performance measurements. Metrics speedups, efficiency. utilization. communication overheads. single/multiple program performances. bench marks. Unit 3. Parallel Processors: Taxonomy and topology - shared memory multiprocessors, distributed memory networks. Processor organization - Static and dynamic interconnections. Embeddings and simulations. Parallel Programming: Shared memory programming. distributed memory programming, object oriented programming, data parallel programming. functional and dataflow programming. Unit 4. Scheduling and Parallelization: Scheduling parallel programs. Loop scheduling. Parallelization of sequential programs. Parallel programming support environments. Note: - There will be 8 questions in all. Two Questions will be set from each unit. Students are required to attempt five questions selecting at least one question from each unit. Books 1. M. J. Quinn. Parallel Computing: Theory and Practice. McGraw Hill. New York,1994. 2. T. G. Lewis and H. EI-Rewini. Introduction to Parallel Computing. Prentice Hall, New Jersey, 1992. . 3. T. G. Lewis. Parallel Programming: A Machine-Independent Approach, 1EEE Computer Society Press, Los A lamitos, 1994.
KUMAR BOOK SELLER Bachelor of technology (Computer Engineering) Schemes of Studies / Examination (Semester-7th)
S. N o. Course No. Subject Teaching Schedule L T P Examination Schedule Duration of Exam (Hours)
1 2 3
* **
Departmental Elective-II Departmental Elective-III Compiler Design Web Engineering Statistical Models for Computer Science Unix & Linux Programming (Pr) Web Engineering (Pr) Minor Project Seminar Training Viva
3 3 4 3 4 -
1 1 1 1 1 2 -
*1+2 2 6 -
4 4 5 4 5 3 2 6 2 -
75 75 100 75 100 75 -
50 50 25 25 25 50 25 50 50 75
50 25 -
3 3 3 3 3 3 3 3 -
17 7
11
35
1000
Department Elective-II 1. CSE-441 Software Project Management 2. CSE-443 Embedded System Design 3. CSE-445 Artificial Intelligence 4. CSE-447 Image Processing Departmental Elective-III 1. CSE-471 Unix & Linux Programming 2. CSE-473 Security & Cryptography
Familiarize with Unix/Linux logging/logout and simple commands. Familiarize with vi editor. Using Bash shell develop simple shell programs. develop advanced shell programs using grep, fgrep & egrep. Comile and debug various C programs using different options. learning of installation and upgradation of Linux operating system. Install, Linux on a PC having some other previously installed operating system. All Oss should be usable. 8. As supervisor create and maintain user accounts, learn package installation, taking backups, creation of scripts for file and user management, creation of startup and shutdown scripts using at, cron etc. Note: Atleast 5 to 10 more exercises are to be given by the teacher concerned. Teacher are supposed to devote I period for giving instructions to clear the concepts UNIX & Linux and 2 periods for the lab work.
1. Chalk out the storyboard and design of Diary Food Limited. As the name reflects your site diary products and aims at opening an online store. Your story board should cover all the features that you plan to have on the site. 2. Create your own page with your favorite hobbies. 3. Create a menu or a table of content web page. Each menu item or section of the table of content should load a different web page. For example, if the user clicks on menu one or section I then the link should take him to respective menu html or section and so on. 4. Create a web site for your college. 5. Create a frameset that is divided into three sections. The frameset should have three zones. The Topmost section of the frameset should take up about just 15% of the browser window. Name this frame title. The middle section should be 70% of the browser window. Name this frame title. The lower section should be 15% of the browser window. Name this frame menu. Crteate pages for each section. For the lowermost section, create page that loads the content into the middle section. The topmost section should contain a page describing the web page itself. 6. Create a web page, which displays the map of your country Link, each city/state on the image map, such that the respective HTML page of the city/state is displayed when the user selects an area. 7. Add the tickertape applet to your page by customizing it for the following settings: Increase the count by one. Accordingly update the message count. Change the text color to (237, 192, 171) Experiment with changing the scrolling speed. Customize the message text as per your page requirement. 8. Incorporate a quest book into the Diary Food Webpage and use Java Script to build validations into the form. 9. Use Style sheet to modify the following: Change background to modify the following. Change font type, face and color. Align Text. Remove underlines from hyperlinks. 10. Use Microsofts Personal Web Server to set up your Website.
Introduction: Definition of Artificial Intelligence (AI), Evolution of Computing History of AI, Classical Romantic and modern period, Subject area, Architecture of AI machines, logic family, classification of logic. Production System: Production rules, the working memory, Recognize-act cycle, conflict resolution by meta rules, Architecture of production system. Unit-2 Propositional Logic: Proposition, tautologies, Theorem proving, Semantic method of theorem proving, forward chaining, backward chaining standard theorems, method of substitution, Theorem proving using Wangs algorithm. Predicate Logic: Alphabet of first order logic(FOL), predicate, well formed formula, clause form, algorithm for writing sentence into clause form, Unification of predicates, unification algorithm, resolution Robinsons interface rule, Scene interpretation using predicate logic. Unit-3 Default and Non monotonic Logic: Axiomatic theory, Monotonicity, non-atomic reasoning using McDermotts NML-I, problems with NML-I, reasoning with NML-II, Case study of Truth Maintenance System(TMS), neural network fundamentals. Imprecision and Uncertainty: Definition, Probabilistic techniques, Certainty factor based reasoning, conditional probability, Medical diagnosis problem, Bayes Theorem and its limitations, Bayesian belief network, propagation of belief, Dumpster-Shafer theory of uncertainty management, belief interval, Fuzzy relation, inverse Fuzzy relations, Fuzzy post inverse, Fuzzy Inversion, Unit-4 Intelligent Search Techniques: Heuristic function, AND-OR graph, OR Graph, Heuristic search, A* algorithm and examples. Logic Programming with Prolog: Logic program, Horn clause, program for scene interpretation, unification of goals, SLD resolution, SLD tree, flow of satisfaction, controlling back track using CUT, Command use of CUT, implementation of backtracking using stack, risk of using cuts, fail predicate, application of cut-fail combination, replacing cut-fail by not. Note: - There will be 8 questions in all. Two questions will be set from each unit students are3 required to attempt five questions selecting at least one question from each unit. Books 1. A.Konar: Artificial Intelligence and Soft Computing-Behavioral and Cognitive Modeling of Human Brain, CRC Press, USA. 2. E. Charniak and D.McDermott: Introduction to Artificial Intelligence, Addison Welley Longman.
Department Elective-IV 1. CSE-440 Distributed Operating System 2. CSE-442 Software Quality Models & Testing 3. CSE-444 Bioinformatics 4. CSE-446 Expert Systems 5. CSE-448 Real Time System & Software 6. CSE-450 Software Verification, Validation & Testing Departmental Elective-V 1. CSE-472 Object Oriented Software Engineering
S. N o.
Course No.
1 2 3 4 5 6 7 8 9
Departmental Elective-IV Departmental Elective-V Neural Networks and Fuzzy Logic Interactive Computer Graphics Neural Networks (Pr.) Major Project Seminar Comprehensive VivaVoce General Fitness & Professional Aptitude
3 3 4 4 -
1 1 1 1 2 -
3 12 15
4 4 5 5 3 12 2 35
75 75 100 100 -
50 50 50 25 50
50
3 3 3 3 3 3 3
100 100 50 50 75
14 6
L T P 4 I UNIT-1 Display Devices: Line and point plotting systems: Raster, vector, pixel and point plotters, Continual refresh and storage displays, Digital frame buffer, Plasma panel display, Very high-resolution devices. High-speed drawing, Display processors, Character generators, Colour Display techniques (shadow mask and penetration CRT, colour look-up tables, analog false colours, hard copy colour printers) UNIT-2 Display Description: Screen co-ordinates; user co-ordinates, Graphical data structures (compressed incremental list, vector list, use of homogeneous coordinates); Display code generation Graphical functions: the view algorithm. Two-dimensional transformation, Line drawing, Circle drawing algorithms. UNIT-3 Interactive graphics: Pointing and position devices (cursor, lightpen, digitizing tablet, the mouse, track balls). Interactive graphical techniques, Positioning (Elastic or Rubber Band lines, Linking, zooming, panning clipping, windowing, scissoring). Mouse programming. UNIT-4 3-D Graphics: Wire-frame, perspective display, perspective depth, projective transformations, Hidden line and surface elimination, Transparent solids, shading. Two-dimensional transformations, 3-dimensional transformations, Interactive Graphical Techniques GUI. Note:- There will be 8 questions in all. Two Questions will be set from each unit. Students are required to attempt five questions selecting at least one question from each unit. Books 1. Giloi, W.K. Interactive Computer Graphic, Prentice Hall 2. Newman, W. Sproul, R.F. Principles of Interactive Computer Graphic, McGraw Hill 3. Harrington, S. Computer Graphic: A Programming Approach, Tata McGraw Hill 4. Hearn, D. Baker, Computer Graphics, Prentice Hall 5. Kelley Bootle, Mastering Turbo C
HCTM-SY- COE VIII PAGE 3/3
Design & train 1. NN for AND ,OR gate using perception. 2. Perception to classify odd and even numbers. 3. NN for alphabet recognition using backpropagation. 4. Hopfield n/w for recognizing patterns such as + and -. 5. Nn for EX-OR classification using Back propagation. 6. CPN for image classification. 7. Name and telephone number recognition system.
Departmental Elective-IV Distributed Operating System (CSE-440) L T P Theory : 75 3 1 Sessional : 50 Unit-1 Architecture of distributed operating system: Introduction, motivation, system architecture type, issues in distributed operating system, Communication primitive. Unit-2 Distributed mutual Inclusion: Introduction, classification, preliminaries,simple solution, non token based algorithm,Lamport algorithm,Ricart algorithm,Maekowas algorithm, A generalized non token based algorithm, Broadcast algorithm, Heuristic algorithm, tree based algorithm, comparative performance analysis. Unit-3 Distributed deadlock detection: Introduction, deadlock handling strategies, issues in deadlock detection & resolution, Control organization, centralized, distributed & hierarchical detection algorithm.
HCTM-SY- COE VIII PAGE 2/3
Unit-4 Distributed File System: Introduction, architecture, mechanism for building, design issues, log structured file system. Distributed Scheduling: Introduction, motivation, issues in load distribution, component of load algorithm, stabilizing load distribution algorithm, performance comparison, selection of a suitable load sharing algorithm, requirement for load distribution, task migration, issues in task migration. Note: - There will be 8 questions in all. Two questions will be set from each unit. Students are required to attempt five questions selecting at least one question from each unit. Books 1. Mukesh Singhal & N.G Shivaratri: Advanced Concepts in OS 2. AS Tanenbaum: Modern OS PHI A.Silberschatz,P.Galving,G.Gahne: Applied O.S Concepts
Expert Systems (Departmental Elective IV) CSE-446 L T P 3 1 Unit-1 Feature of expert system, Representation and organization of knowledge, Basics characteristics, types of problems handled by expert systems, Case study of PROSPECTOR. Unit-2 Expert system Tools: Techniques of knowledge representations in expert systems, knowledge engineering, System-building aids, support facilities, stage in the development of expert systems. Unit-3 Building an Expert System: Expert system development, Selection of tool, Acquiring knowledge, Building process. Unit-4 Problems with Expert Systems: Difficulties, common pitfalls in planning, dealing with domain expert, difficulties during development. Note: - There will be 8 questions in all. Two questions will be set from each unit students are3 required to attempt five questions selecting at least one question from each unit. Books 1. Waterman D.A.A Guide to Expert Systems, Addison Wesley Longman 2. Hayes-Roth, Lenat and Waterman: Building Expert Systems, Addison Wesley 3. Weiss S.M. and Kulikowski C.A.A Practical Guide to Designing Expert Systems, Rowman & Allanheld, New Jersey Theory : 75 Sessional : 50