(solan) h. p. - iecuniversity.com · 1 i.e.c. university, baddi (solan) h. p. scheme & syllabi...

1

I.E.C. UNIVERSITY, BADDI(SOLAN) H. P.

SCHEME&

SYLLABIOF THE

FOUR YEARB. TECH(COMPUTER SCIENCE &

ENGINEERING)FROM THE

ACADEMIC SESSION 2014 -2015

2

INDEX

1. Programme Objectives

2. Programme Outcomes

3. Infrastructure Facilities

4. Career

5. IEC University Advantage

6. Academic Regulations

7. Flexible Credit base system

8. Proposed Scheme of Evaluation

9. Detailed syllabus semester wise

3

Programme Objectives

This four year program lays emphasis on software & hardware engineering, dataand information systems engineering, as well as on networking technologies,wired, optical fiber, and wireless. The Department provides exposure toemerging technologies as well as futuristic technologies like Nano-technology,and quantum computing. Our aim in the program is to make software andsystem both usable and useful. Graduates will have specific domain knowledgeof interactive system designed to support everything from the conventionalsingle user working to E-Commerce, virtual worlds, multimedia andcollaborative applications. The objective of B.Tech (CSE) Programme is.

To provide the highest level of education in technology and science andto produce competent, creative and imaginative engineers and scientists

To be a role model of educational institutions in the Country To promote a spirit of free and objective enquiry in different fields of

knowledge To make a significant contribution towards the development of skilled

technical manpower, and To create an intellectual reservoir to meet the growing demands of the

nation

Programme Outcomes

A graduate of the Computer Science and Engineering Program will demonstrate

a. An ability to apply knowledge of computing, mathematical foundations,algorithmic principles, and computer science and engineering theory inthe modeling and design of computer-based systems to real-worldproblems (fundamental engineering analysis skills).

b. An ability to design and conduct experiments, as well as to analyze andinterpret data (information retrieval skills).

c. An ability to design, implement, and evaluate a computer-based system,process, component, or program to meet desired needs, within realisticconstraints such as economic, environmental, social, political, health andsafety, manufacturability, and sustainability (creative skills).

d. An ability to function effectively on multi-disciplinary teams (teamwork).

4

e. An ability to analyze a problem, and identify, formulate and use theappropriate computing and engineering requirements for obtaining itssolution (engineering problem solving skills).

f. An understanding of professional, ethical, legal, security and social issuesand responsibilities (professional integrity).

g. An ability to communicate effectively, both in writing and orally(speaking / writing skills).

h. The broad education necessary to analyze the local and global impact ofcomputing and engineering solutions on individuals, organizations, andsociety (engineering impact assessment skills).

i. Recognition of the need for, and an ability to engage in continuingprofessional development and life-long learning (continuing educationawareness).

j. A knowledge of contemporary issues (social awareness).

k. An ability to use current techniques, skills, and tools necessary forcomputing and engineering practice (practical engineering analysis skills).

l. An ability to apply design and development principles in the constructionof software and hardware systems of varying complexity (softwarehardware interface).

m. An ability to recognize the importance of professional development bypursuing postgraduate studies or face competitive examinations that offerchallenging and rewarding careers in computing (successful career andimmediate employment).

5

Infrastructure Facilities:

This division will offer exposure to the front end & back end technologies in thefield of Computer science & engineering through an elaborate setup oflaboratories consisting of the following:

IBM-RAD lab. IBM-RFT lab. EMC2 DB2 lab. CN lab. DAA/OS lab. Data Structure lab. DBMS lab. Distributed System lab. E-Communication lab. Logic design lab. OOPS lab. Server Room lab. WT lab. Operating System Lab Computer Graphics Lab Cryptography and Network Security Lab SPM Lab ACA Lab Project Lab Artificial Intelligence Lab

6

Career:

Computer Security Analysts. Computer Engineer. Consulting Engineer. Research, Development & Design of Computer & Software. Computer Operations Manager. Customer Engineer. Computer Network Manager.

IEC UNIVERSITY ADVANTAGE

Varied choices of programs. Excellence in Teaching. Active Research. Campus Placement. Industrial knowledge. Strategic Location. Equal Opportunities. Scholarships Scheme. Personality Development.

7

ACADEMIC REGULATIONS

PREAMBLE

B.Tech programme under Flexible Credit System Based (FCBS) shall adopt aSemester system. There will be two semesters in an academic year. Normally theODD semester will be from July to December & Even Semester from December toMay.

As part of our objective of providing quality education & making the graduatesemployable, IEC University is taking up the step in this direction by introducing theFlexible Credit Based System (FCBS).

Thus, the students can register courses of their choice & alter the pace of learningwithin the broad framework of academic programmes & credit requirements.

Students can register courses according to their interest & academic ability incompleting them.

FCBS allows students in deciding their academic plan & permits students to alter it asthey progress during the programme.

The academic counsellor helps the students in identifying the courses based onprogramme requirement, course pre requisite, students’ ability & interest in variousacademic disciplines.

The extract of UG Academic regulations given hereunder is for general information,& the students are advised to go through the detailed regulations of the programme inwhich he/she is admitted.

ADMISSION AND ENROLMENT OF STUDENTS

• Admission shall be done on the basis of Rank holders in JEE MAIN and aggregateminimum 50% or equivalent in 10+2 in the following subjects

• Compulsory subjects—Physics & Mathematics

• Any of these — Chemistry, Computer Science

ELIGIBILITY CRITERIA FOR ADMISSION

Qualification 10+2 in the following subjects

Compulsory subjects—Physics & Mathematics

Any of these — Chemistry, Computer Science

The candidate should also satisfy the conditions regardingminimum marks, the number of attempts in the qualifyingexamination & age as prescribed by the AICTE/UGC fromtime to time & physical fitness as may be prescribed by theAcademic Council of the University.

8

Eligibility criteria for admission to Foreign Nationals (FN)/ Person Of Indian

Origin(PIO)/ Children Of Indian Workers In Gulf Countries ( CIWGC) In UG/

Integrated Programmes

The FN/ PIO/ CIWGC students shall meet the eligibility conditions outlined above.

The qualifying examinations passed by FN/ PIO/ CIWGC students should be

considered equivalent to eligibility examinations by the Association of Indian

Universities/ Academic council.

The candidate should also satisfy other conditions as prescribed by the AICTE/UGC

from time to time, & physical fitness as may be prescribed by the Academic Council

of the University.

Note: The candidates appearing in the qualifying examinations are also eligible to apply,

subject to the condition that they must fulfil the eligibility criteria as given above at the

time of registration in the programme.

MEDIUM OF INTRUCTION AND EXAMINATIONS

The medium of instructions and examination shall be English.

UNIVERSITY FEE

Every student has to deposit his total Fee, other charges and dues, if any, in the beginning of

the semester at the time of Registration, failing which he will not be permitted for registration

in the programme.(I)A reasonable and rational fee structure shall be established consistent

with the objectives of the University.

(ii)The course and the examination fees chargeable from students for various programmes

Of studies shall be proposed by a Fee Committee constituted by the Board of management

The Recommendations of the Fee Committee shall be considered and approved by the Board

of management.

(iii)The University Fee Committee may review the escalation and the levels of fees and when

Required basis and if necessary may recommend any change in the fee structure as it may

consider appropriate for forwarding to HP Government Fee Committee.

9

FELLOWSHIPS, SCHOLARSHIPS, STIPENDS, MEDALS AND PRIZES

Fellowships, Scholarships, Stipends, Medals and Prizes may be instituted by the University

and awarded as per rules.

REGISTRATION

• Every Student will register every semester for courses that he wishes to pursue in that

semester.

• A non-registered student will not be allowed to attend classes and take examination

even if he has paid the fees.

• The late registration of a freshman who is admitted after the start of the semester

may be done at the time of admission by the authorized official.

Adding and Dropping of Courses

• A student may be permitted to add or drop course(s) within two weeks of the

beginning of the semester.

• In case a student has been allowed to change the course or programme during

the current semester by the University, the classes attended in the previous

course may also be considered in calculation of attendance to determine the

eligibility for appearing in ESE.

MID – TERM MIGRATION OF STUDENTS

• Inter-university migration shall not be allowed in normal circumstances.

• Under exceptional circumstances, mid-term transfer of a student from any other

University to IEC University may be permitted on a case to case basis. In all such

cases, the approval on the transfer of relevant credits the student has already

earned in that University may be granted by the Academic Council.

TRANSFER OF PROGRAMME

A student once admitted and registered in a programme will not be allowed

to change the programme under any circumstances.

10

ACADEMIC SYSTEM

• The University will follow semester system in all of its UG/ Integrated programmes.

Summer Semester

• The Vice Chancellor may decide to hold a Summer semester on the

recommendation of the Academic Advisory Committee.

• Summer semester is a special privilege to be offered at the discretion of the

University, and the University will not be under any obligation to offer summer

semester every year.

• Summer semester, if offered, may be allowed only for students who are not ondisciplinary probation.

• A list of courses to be offered in the summer semester is brought out during the evensemester before the ESE. Only a few selected courses as decided by the Universitymay be offered during the summer semester.

• A course may be offered in the summer semester if there are a minimum of tenstudents registering for it.

• Unless prescribed otherwise in the Regulations of any specific programme, theSummer semester is a fast-paced semester where all the rules for the normalsemester shall apply but the registration shall be limited to three courses havingtotal credits not exceeding 12.

• The Summer semester may be of about seven to eight weeks duration and eachcourse may run on about two times the normal load, thus imparting equivalent toabout 16 weeks of teaching, but at an accelerated pace.

• Whenever possible, the deficient students may be allowed to register for backlogcourses and/ or marginal courses (in which they have obtained D grade) in thesummer semesters on payment of necessary fees per course.

• A student can normally register only for backlog or marginal courses for thesummer semester.

• In view of the short duration of the Summer semester, late registration and addingand dropping of courses are not permitted beyond three days of the start of classes

11

Academic Counsellor

• Upon joining the University, each student will be assigned an Academic Counsellor.

• The Academic Counsellor will discuss with the student his academic performance in

previous semester(s) and suggest the number and nature of courses the student should

register during the ensuing semester, within the framework of that Programme

curriculum.

• The Academic Counsellor may advice students having many backlog courses to

register for lesser number of credits (subject to the minimum credits specifications)

and prepare a revised plan of study for the student with a slower pace.

Curriculum

Each programme contains a prescribed course structure which is generally calledCurriculum.

These courses will be offered to a student in a pre determined manner in eachsemester.

Students are expected to take course in each semester & clear them to various

conditions prescribed in this regulation.

Syllabus

• A course syllabus is a document that explains what a student is going to study in that

course.

• Each course will have a course code, course title, Lecture- Tutorial- Practical- Credit

(LTPC) distribution indicating the weightage of the course, version of syllabus

revision, course pre-requisites/ anti-requisites/ co-requisites (if any), course objectives,

expected outcome, short and detailed description of the topics, suggested text and

reference books, the mode of evaluation adopted, the effective date of application of

the revised version of the syllabus.

Course Plan

• A course plan consists of a list of lectures/ experiments carried out in each

instructional class/ lab by the course teacher during the semester as per the LTPC of

the course, with details like mode of delivery, reference material used, etc.

12

• One hour of lecture/ tutorial classes or two hours of laboratory work/ seminar/

practical/ group discussion per week constitutes ONE credit for the course. Separate

course plans need to be prepared for the theory and laboratory portions of any course,

if the course has an embedded lab component.

Example:

An LTPC of 2-1-2-4 means 2 hour of class room lecture; one hour of tutorial and one hour of

laboratory, all delivered within a calendar week. This course will have 4 credits.

Credits:

Maximum Credits: 180

Project/ Thesis/ Dissertation:

• Wherever required in the UG/ Integrated programme, all students of that programmes

should successfully complete Project/ Thesis/ Dissertation work.

• A student has to select a thesis supervisor at the beginning of the last year of the

programme, if not done earlier.

• A student shall not normally have more than two supervisors at any given time.

• Thesis supervisor(s) of a student will normally be appointed from amongst the faculty

members of the University using modalities decided by the departments.

• A student can have a co-supervisor from outside the University on the

recommendation of the Supervisor and with approval of the Director of the Institute.

• In case there has been a change/addition in the supervisor(s), the thesis will not be

submitted earlier than three months from the date of such change.

• Normally, a faculty member shall not supervise more than five individual UG

candidates. However the department may evolve a transparent policy for the

distribution of UG students amongst the faculty members in the department.

• In case a faculty member is suspended / debarred for indulging in lowering the

prestige of the University in any manner, he shall cease to be a thesis supervisor.

13

• Submitting a thesis that was bought (purchased)/ borrowed/ thesis submitted in

another University/ Institution shall be considered as examination malpractice and

will be awarded an ‘F’ grade.

• Students have the responsibility to decide on the specific thesis area and title, and

carry out substantial portion of the literature survey at the beginning of their final year.

Industrial/Practical Training

Wherever required in the programme, all the students of that programme should

undergo industrial/ practical training in a reputed industry in, anytime after one

year of study. This is listed in course structure.

Students who have completed their training are required to register for industrial/

practical training in the following semester for award of the grades.

Minimum/ Maximum Credit Limits for Course Registration

• The Average Academic Load in a regular semester will be of 23 credits.

• However, a fast pace student can register for a maximum of 28 credits.

• Similarly a slow pace student can register for a minimum of 16 credits in a regular

semester (other than during summer semester).

• Under no circumstances, a student will be permitted to cross these limits.

• A student carrying out the last registration of his Programme will be permitted to

register less than 16 credits if the minimum credit requirements for the completion of

Programme so require.

• The average number of credits a student can register during a summer semester shall

be between 6 and 8, or 2 courses.

• However, in special cases, the student may be permitted to register a maximum of 12

credits during a summer semester.

• There is no minimum number of credits fixed for course registration during summer

semester.

14

Course Prerequisites / Anti-requisites/ C-requisites

• Some courses may have specific prerequisites to be met before a student can register

for the course in the current semester.

• Students who had received an ‘F’ grade in a prerequisite course are also permitted to

register the next level course by assuming that they had attained the required

‘exposure’ by attending that course.

• This stand is adopted so that the student can make further progress towards earning

credits and his progress need not be pulled down by backlog courses. Thus,

concurrent registration of a prerequisite and next level course becomes a possibility.

• Similarly, a course may have an anti-requisite and/ or co-requisite.

• When two courses having almost similar/ same course contents and considered as

equivalent are made available to a student to choose within a group, and to prevent

students crediting both the courses, the anti-requisite option can be used.

• Similarly, an independent laboratory course can be coupled with a theory alone course

through a co-requisite thereby forcing a student to register both the courses together.

Vice Chancellor’s List

• Students who maintain a CGPA of 9.50 and above, starting from the beginning of

3rd semester results and subsequently, having no ‘F’ grade to their credit, having

never debarred for lack of attendance in any ESE or indiscipline, will be placed on

Vice Chancellor’s List for their meritorious performance.

• Their name will be removed from the Vice Chancellor’s List if their CGPA falls

below 9.50 or they receive an ‘F’ grade or are debarred due to lack of attendance

in any ESE or an act of indiscipline subsequently.

• Such students will be accorded benefits/ recognition as per rules.

Conversion Factor for Converting CGPA into Marks Equivalent

If a conversion to marks is required, the following formula may be used to calculate

the same:

The Equivalent Percentage of Marks = CGPA* 9.0 + 5

15

ATTENDANCE REQUIREMENTS

• A student must have 75% or more attendance in aggregate of delivered classes, in

all registered courses of theory (lectures plus tutorial) and practicals (including

workshops training, seminar, projects, industrial training etc.) of the

concerned semester.

• Only such students who fulfill the above 75% attendance criteria will be permitted to

appear in End Semester Examination (ESE).

• The cases of students having attendance less than 75% but more than or equal to 60%

shall be reviewed by the University on a case to case basis as per the Ordinance.

• If a student’s attendance falls below 60%, for any reason including medical, he will not

be allowed to appear in the ESE of any course registered in the semester. He will be

awarded ‘F’ grades in all the courses of that semester.

• Calculation of attendance for determining the eligibility to appear in ESE will be

based on the date of actual registration of the candidate, if late registration is

permitted by the University.

COMPONENTS OF EVALUATIONThe components of Evaluation for each

course will be as under:

For Non-Practical Subjects:(a) Continuous A ssessment (CA), -- 20 Marks in the form of:

(i) Assignments (15 Marks)(ii) Attendance (05 Marks),

(b) Mid-Term Exams (MSE), ---------40 Marks(i) First MSE to be held after completion of 35% - 40% course

coverage,(ii) Second MSE to be held after completion of 70% - 80% course

coverage(c) End- semester Exams (ESE), ------ 40 Marks

For Practical Subjects:(a) Continuous A ssessment (CA), -- 15 Marks in the form of:




coverage(c) End- semester Exams (ESE), ------ 30 Marks(d) Practical(Internal-15,External-10)---- 25 Marks

16

SYSTEM OF EVALUATION BASED ON BROAD BAND GRADES

• The University shall follow the Broad-band Grades systems for various UG

programmes as specified in the respective Programme detail.

• The course credit (C), number of lectures, tutorials, practicals (L), (T), (P) in a course

are related as C = (L + T + 0.5 P)

• The students will be awarded grades using relative grading in a course and

result cards will show individual course grades, the course credits and the

overall weighted performance indices such as SGPA (Semester Grade Point

Average) and CGPA (Cumulative Grade Point Average).

• The following broadband letter grades will be used to report a student’s performance

on a 10-point scale.

• The letter grades and their numerical equivalents on a 10-point scale (called Grade

Points) are as follows:

Letter

Grade

A+ A B+ B C D F

Grade

Points

10 9 8 7 6 4 0

• In addition to the above, there are three letter grades viz., I, S, and X which stands

for Incomplete, Satisfactory, and Unsatisfactory, respectively.

• For courses with zero weightage (audit) only satisfactory (S)/ Unsatisfactory (X)

grades are awarded.

• No student shall be awarded ‘A’ grade in any course unless he has secured a

minimum of 80% marks in the total of all components of evaluation in that course.

• No students shall be awarded ‘F’ grade in any course if he has secured a

Minimum of 40% marks in the total of all components of evaluation in that course.

• In case a student repeats a particular course during summer semester along with

his juniors, he will be awarded only up to a maximum of AB grade based on his

current performance and the grade he obtained earlier.

17

• The statistical method shall invariably be used with marginal adjustment for the

natural cut off if the number of students appearing in a course is 60 or more. The

mean and standard deviation (σ) of marks obtained of all the students in a course

shall be calculated and the grades shall be awarded to a student depending upon

the marks and the mean and the standard deviation as per Table given below:

Lower Range of Marks Grade Upper Range of Marks

A+ ≥ Mean + 2.5 σ

Mean + 1.5 σ ≤ A < Mean + 2.5 σ

Mean + 0.5 σ ≤ B+ < Mean + 1.5 σ

Mean - 0.5 σ ≤ B < Mean + 0.5 σ

Mean - 1.5 σ ≤ C < Mean - 0.5 σ

Mean - 2.5 σ ≤ D < Mean - 1.5 σ

F < Mean - 2.5 σ

If the number of students appearing in any course is less than 60, the grades in that

course will be awarded in the following manner :

Marks Obtained in a course out of 100 (M) Letter Grade

85 <= M <= 100 A+

75 <= M <= 84 A

65 <= M <= 74 B+

55 <= M <= 64 B

50 <= M <= 54 C

40 <= M <= 49 D

M <= 39 F

Incomplete I

18

• A student may be awarded the grade ‘I’ (Incomplete) in a course if he has missed

the ESE for a genuine reason.

• This grade must, however, be converted by the Faculty-In-Charge into an

appropriate letter grade within ten days from the completion of ESE.

• Any ‘I’ grade still outstanding two days after the prescribed last date, shall be

automatically be converted into ‘F’ grade.

• The course(s) in which a student has earned ‘F’ grade will be termed as back-log

course(s), which he has to improve by repeating/ replacing the course(s) as per the

rules.

• ‘F’ grade is also awarded to a student who is not allowed to/ do not appear in ESE in

a particular subject due to shortage of attendance, though he might have

undergone other components such as MSE, assignments, class tests, projects, etc.

• Such a student will be required to repeat the course in the Summer semester in

which he has secured ‘F’ grade.

• The Semester Grade Point Average is a weighted average of the grade points earned

by a student in all the courses credited and describes his academic performance in

a Semester. If the grade point associated with the letter grades awarded to a

student are say, g1, g2, g3,………. and the corresponding weightage is (credits)

are say, w1, w2, w3,………. the SGPA is given by:

• The Cumulative Grade Point Average indicates overall academic

performance of a student in all the courses registered up to and including

the latest completed Semester. It is computed in the same manner as SGPA,

considering all the courses (say, n), and is given by:

CGPA=∑ {credit of semester*SGPA of semester}/total credits

• The minimum CGPA requirement for the award of an Post Graduate degree/

diploma/ certificate will be 5.5 subject to getting ‘D’ or above grade in each of

the courses individually.

19

• A minimum of 4.5 SGPA in a UG programme is required in each semester for

moving to the higher semester.

• A student will not be allowed to move to higher Semester without clearing the

backlog courses so as to obtaining the required minimum SGPA and/ or CGPA.

• A student will be required to get grade ‘D’ or above in a course for passing in

the course.

• A student will be issued a Cumulative Grade Card at the end of each semester

indicating the grades secured for all the registered courses up to and including the

last semester.

EXAMINATION

• The period of Examination(s) (Mid semester and End semester) shall be as specified

in the Academic Calendar.

• All students who have registered for a particular course are eligible to write the

ESE of that course, except if he is declared ineligible due to one or more of reasons

listed below.

1. Shortage of attendance

2. Acts of indiscipline

3. Withdrawal of a course from Registration

• Make-up examinations are special examinations conducted for students who could

not take regularly scheduled examination and have been awarded the ‘I’ grade or

‘Incomplete’ result.

• Make–up examination is a special privilege to be offered at the discretion of the

University and the University will not be under any obligation to allow a student a

make-up examination. The student(s) shall have no right to cite the non-availability

of this facility as an excuse for his/ their poor performance.

• Make-up Examination for MSE and/ or ESE may not be allowed to students on

disciplinary probation

• A student, who has missed one or more papers in a regular examination because of a

genuine medical reason, may be permitted in Make-up Examination as per rules.

20

• A student appearing in a make up examination for ESE and/ or MSE in any course

shall not be awarded ‘A’ grade in that course.

• After valuation of MSE answer scripts, they will be handed over to students.

• Recounting of ESE answer scripts is permitted.

• There is no provision of re-evaluation of ESE answer scripts.

TERMINATION OF THE PROGRAMME

A student will be declared “Not Fit for the Programme (NFP)” and shall have to

discontinue if he does not satisfy following conditions:

After the completion of the First Year the student should have passed a

minimum of forty percent (40%) courses prescribed in the first year to be

calculated after the summer semester, if any.

Second Year onwards, the academic performance of a student is reviewed at

the end of every semester by the Academic Advisory Committee, and the

decision is taken on a case to case basis as per rules..

MAXIMUM DURATION FOR THE COMPLETION OF THE PROGRAMME

The maximum duration for completion of the degree/ diploma/ certificate, for the completion of

the course, subject to other conditions, shall be as follows:

Normal

Duration

Maximum Duration

Allowed

4 Years 8 Years

RESULT AND DIVISION

• A student will be issued a Cumulative Grade Card at the end of each semester

indicating the grades secured for all the registered courses up to and including the

last semester.

• The minimum CGPA requirement for the award of an Post Graduate degree/ diploma/

certificate/ integrated programme will be 5.5 subject to getting ‘D’ or above grade

in each of the courses individually.

• The result of a student may be withheld if,

21

(1) he has not paid all the dues, or

(2) if there is a case of indiscipline or use of unfair means or of

academic misconduct pending against him, or

(3) for any other reason as deemed fit by the University.

• Four divisions as defined below shall be awarded:

Division CGPA

First with Honors and

Certificate of Merit

> = 9.0

First with Honours > = 8.0 < 9.0

First > = 6.5 < 8.0

Second > = 5.0 < 6.5

• For securing degree/ diploma/ certificate in First Division with Honors and First

Division with Honors and certificate of Merit , a student shall have passed all the

courses (Theory and Practical) of the programme in the first attempt, i.e., without

ever being awarded a Re-appear or a Fail.

MAINTENANCE OF DISCIPLINE AMONG STUDENTS

• All powers relating to maintenance and enforcement of discipline in the University

and taking disciplinary action against the students and employees of the University

shall vest in the Vice-Chancellor, which he may delegate as he deems proper.

• All acts given in details in Ordinance shall amount to acts of indiscipline or

misconduct or ragging on the part of a student of the University and colleges /

institutions.

• The University Authority in the exercise of the powers, order or direct that any

student –

22

(a) be expelled from the University, college or institution, or

(b) be, for a stated period, rusticated or

(c) be not, for a stated period, admitted to a course or courses of study of the

University; or

(d) be imposed with the fine of a specified amount of money;

(e) be debarred from taking a University examination or examinations for one or

more years.

ACADEMIC MISCONDUCT AND USE OF UNFAIR MEANS

• Plagiarism, collusion and cheating are all forms of academic misconduct and

use of unfair means as defined in the Examination Ordinances.

• In case the student has come to examination under the influence of any

intoxicating material, misbehaves with one or more members of the

supervisory staff, it will also be treated as an act of Unfair Means and

academic misconduct.

• In relation to continuous assessment, Academic misconduct and use of Unfair

Means is classified as Major Misconduct or Minor Misconduct as described

below:

(1) Major Misconduct: Where plagiarism, collusion or cheating is detected

in Thesis, Dissertation or Major Project of a programme.

(2) Minor Misconduct: All other academic misconduct excluding

those defined in major misconduct will be regarded as a minor misconduct

and will be dealt accordingly.

• If the Unfair Means Board (UFMB) finds the student guilty, one of the following

actions may be taken:

(1) The student may be disqualified for one or more semester, or

(2) The student may be rusticated for one or more semester, or

(3) The academic programme of the student may be terminated.

(4) Any other action as deemed fit by the UMB.

23

PROPOSED SCHEME OF EVALUATION FOR B.TECH

FIRST YEAR (Common for all branches)

SEMESTER I

Sr.No

CourseCode

Subject Periods Evaluation Scheme Subject

Total

Credits

L T P Sessional Exam

MSE CA P Total ESE

(Theory)

1 EE-

101/ME-

101

Basic Electrical

Engineering/

Engineering

Mechanics

3 1 0 30 15 0 45 30 75 3.5

2 ECE-

101/ME-

102

Basic Electronics

Engineering/

Engg. Graphics

3 1 0 30 15 0 45 30 75 3.5

3 MAT-

101

Engineering

Mathematics-1

3 1 0 40 20 0 60 40 100 3.5

4 CSE-101 Fundamental of

computer and

programming in C

3 1 0 30 15 0 45 30 75 3.5

5 HUM-

101/

EVS-106

Communication

Skills/EnvironmentScience andtechnology

2

2

0

0

0

0

30

40

15

20

0

0

45

60

30

40

75

100

2

2

6 PHY-

101/

CHE-101

Engineering

Physics/Engg

Chemistry

3 1 0 30 15 0 45 30 75 3.5

24

(Practical/Training/Project)

1 PHY-151/

CHE-151

PhysicsLab./ChemistryLab

0 0 2 15 10 25 1

2 CSE-151 Programming in“C” lab.

0 0 2 15 10 25 1

3 ECE-151/ ME-

151

Basic Electronicslab./EnggMechanics Lab

0 0 2 15 10 25 1

4 EE-151/ME-152

Basic ElectricalEngineeringlab./Workshop lab

0 0 2 15 10 25 1

5 HUM-151

*CommunicationSkills Lab

0 0 2 15 10 25 1

Total 600 24.5/

23.5

25

Semester II

1 MAT-111

Engineering

Mathematics-11

3 1 0 40 20 0 60 40 100 3.5

2 PHY-

101/

CHE-101

Engineering

Physics/Engg

Chemistry

3 1 0 30 15 0 45 30 75 3.5

3 EE-

101/ME-

101

Basic Electrical

Engineering/

Engineering

Mechanics

3 1 0 30 15 0 45 30 75 3.5

4 HUM-

101/

EVS-106

Communication

Skills/EnvironmentScience andtechnology

2

2

0

0

0

0

30

40

15

20

0

0

45

60

30

40

75

100

2

2

5 CSE-111

Programming inC++ 3 1 0 30 15 0 45 30 75 3.5

6 ECE-

101/ME-

102

Basic Electronics

Engineering/

Engg. Graphics

3 1 0 30 15 0 45 30 75 3.5

26


1 PHY-151/CHE-151

PhysicsLab./ChemistryLab

0 0 2 15 10 25 1

2 CSE-161 Programming in“C++” lab.

0 0 2 15 10 25 1

3 ECE-151/ME-151

BasicElectronicslab./EnggMechanics Lab

0 0 2 15 10 25 1

4 EE-151/ME-152

Basic ElectricalEngineeringlab./Workshoplab

0 0 2 15 10 25 1

5 HUM-151 *CommunicationSkills Lab

0 0 2 15 10 25 1

Total 600 23.5/

24.5

27

COMPONENTS OF EVALUATION

The components of Evaluation for each course will be as under:

For Non-Practical Subjects:(a) Continuous A ssessment (CA), -- 20 Marks in the form of:




coverage(c) End- semester Exams (ESE), ------ 40 Marks

For Practical Subjects:(a) Continuous A ssessment (CA), -- 15 Marks in the form of:



Coverage,(ii) Second MSE to be held after completion of 70% - 80% course

Coverage(c) End- semester Exams (ESE), ------ 30 Marks(d) Practical (Internal-15, External-10) ---- 25 Marks

*Communication Skills Lab will be taught only in one SEM.

28

SECOND YEAR SEMESTER III

Sr.No

CourseCode


Total

Credits


MSE CA P Total ESE

1 MAT-

201

Engineering

Mathematics

III

3 1 0 40 20 0 60 40 100 3.5

2 ECE-

201

Digital

Electronics

3 1 0 30 15 0 45 30 75 3.5

3 CSE-

201

Data StructureUsing C

3 1 0 30 15 0 45 30 75 3.5

4 CSE-

202

Programming

Languages

3 1 0 40 20 0 60 40 100 3.5

5 CSE-

203

Computer

Organization

3 1 0 30 15 0 45 30 75 3.5

6 HUM-

202

Human Values& ProfessionalEthics

2 1 0 40 20 0 60 40 100 2.5

Total 20

29


1 CSE-251

Data StructureUsing C Lab

0 0 2 15 10 25 1

2 ECE-252

DigitalElectronics Lab

0 0 2 15 10 25 1

3 CSE-252

PC HardwareLab

0 0 2 15 10 25 1

Total 600 Credits 23

Semester IV

1 CSE-211

Theory ofComputation

3 1 0 40 20 0 60 40 100 3.5

2 CSE-212

SoftwareEngineering

3 1 0 40 20 0 60 40 100 3.5

3 CSE-213

Data BaseManagementSystem

3 1 0 30 15 0 45 30 75 3.5

4 CSE-214

E-Commerce 3 1 0 30 15 0 45 30 75 3.5

5 CSE-215

ComputerNetworks

3 1 0 30 15 0 45 30 75 3.5

6 MBA-211

Human ResourceManagement

2 1 0 40 20 0 60 40 100 2.5

Total 20


1 CSE-261

DBMS Lab 0 0 2 15 10 25 1

2 CSE-262

Software Engg.& Testing Lab

0 0 2 15 10 25 1

3 CSE-263

ComputerNetworks Lab

0 0 2 15 10 25 1

Total 600 23

30

THIRD YEAR SEMESTER V

Sr.No

CourseCode


Total

Credits


MSE CA P Total ESE

(Theory)

1 CSE-

301

Data

Warehousing &

Data Mining

3 1 0 40 20 0 60 40 100 3.5

2 CSE-

302

Operating

System

3 1 0 30 15 0 45 30 75 3.5

3 ECE-

301

Microprocessor& itsApplications

3 1 0 30 15 0 45 30 75 3.5

4 CSE-

303

ComplierDesign

3 1 0 40 20 0 60 40 100 3.5

5 CSE-

304

WebDevelopment

3 1 0 30 15 0 45 30 75 3.5

6 MBA-

301

ManagerialEconomics

2 1 0 40 20 0 60 40 100 2.5

Total 20

31


1 CSE-351

OperatingSystem Lab

0 0 2 15 10 25 1

2 CSE-352

WebDevelopment& Core java Lab

0 0 2 15 10 25 1

3 ECE-351

MicroprocessorLab

0 0 2 15 10 25 1

Total 600 Credits23

Semester VI

1 CSE-311

Analysis &Design ofAlgorithm

3 1 0 40 20 0 60 40 100 3.5

2 ECE-311

Digital ImageProcessing

3 1 0 30 15 0 45 30 75 3.5

3 CSE-312

ComputerGraphics

3 1 0 30 15 0 45 30 75 3.5

4 CSE-313

Advance Java 3 1 0 30 15 0 45 30 75 3.5

5 CSE-314

SystemAdministration 3 1 0 40 20 0 60 40 100 3.5

6 MBA-311

Principle ofManagement 2 1 0 40 20 0 60 40 100 2.5

Total 20

32

FOURTH YEAR SEMESTER VII


1 CSE-361

Advance JavaLab

0 0 2 15 10 25 1

2 ECE-361

Digital ImageProcessing Lab

0 0 2 15 10 25 1

3 CSE-362

ComputerGraphics Lab

0 0 2 15 10 25 1

Total 600 23

Sr.No

CourseCode


Total

Credits


MSE CA P Total ESE

(Theory)

1 CSE-

401

Artificial

Intelligence

3 1 0 30 15 0 45 30 75 3.5

2 CSE-

402

.Net Technology 3 1 0 30 15 0 45 30 75 3.5

3 CSE-

403

Neural Networks 3 1 0 40 20 0 60 40 100 3.5

4 CSE-

404

Management

Information

System

3 0 0 40 20 0 60 40 100 3.0

5 Elective – I 3 1 0 40 20 0 60 40 100 3.5

Total 17.0

33

List of Electives

Elective – I Elective – II

(1)Software Project Management (1) Software Testing

(2) Fuzzy Logic (2) Natural Language Processing

(3) Object Oriented System Development (3) Nano technology


1 CSE-451

ArtificialIntelligenceLab

0 0 2 15 10 25 1

2 CSE-452

.Net TechnologyLab

0 0 2 15 10 25 1

3 CSE-453

Minor Project 0 0 4 50 2

4 CSE-491

Seminar 0 0 2 15 10 25 1

Total 550 Credits22.0

Semester VIII

1 CSE-411

DistributedOperatingSystem

3 1 0 40 20 0 60 40 100 3.5

2 CSE-412

AdvancedComputerArchitecture

3 1 0 40 20 0 60 40 100 3.5

3 CSE-413

MobileComputing

3 1 0 40 20 0 60 40 100 3.5

4 Elective – II 3 1 0 40 20 0 60 40 100 3.5

Total 14


1 CSE-461

Major Project 0 0 8 100 4

Total 500 18

34

DETAILED SYLLABUS SEMESTER-1st

CHE-101 ENGG. CHEMISTRY L (3) T (1) P (-)

Note: Question Paper will contain three sections of 100 marks, Section (A) iscompulsory & will contain 10 short questions each will carrying weightage of 2marks(Fill in the blanks/ True –false/ MCQ/One Word answer)

Section B will contain question no 2 and 3. Each question will have six subquestions and candidate will attempt any four questions from each questioncarrying weightage of 5 marks.)

Section C will contain question no 4 and 5. Each question will have four subquestions and candidates will attempt any two questions from each questioncarrying weightage of 10 marks.

UNIT I

PHYSICAL & WATER CHEMISTRY (9 hrs.)Rate of reaction, order & molecularity of reaction, Zero order, First Order, concept ofactivation energy, energy barrier, cell potential, liquid junction potential, conductance &its variation with dilution.Introduction, Source of water, Impurities in water. Softness and hardness of water, Causes,Determination of hardness of water. Treatment of Water for Domestic use. Removal ofHardness of water: Lime soda method, Zeolite or Permutit method and Ion-exchange orDeionization or Demineralization Method. Reverse Osmosis. Numerical Problems.

Unit-II

FUELS AND LUBRICANTS (6 hrs.)FUELSIntroduction, classification, solid, liquid and gas fuel; Nuclear energy- Breeder reactor andlight water nuclear reactor for power generation (Block diagram only), solar energyconservation and solar cells; Fuel Cells- Introduction, types and their characteristics, alternatefuels.LUBRICANTSIntroduction, Mechanisms of lubrication, Types and selection of lubricants, syntheticlubricants, properties and different methods for testing of lubricating oils and greases.

Unit-IIIPOLYMERS (7 Hrs.)

Introduction, classification, types of polymerization, synthesis and applications of someimportant polymers. PVC, Polyamides, Polyurethane, Polyethylene, Poly propylene, PET,Resins (Phenol Formaldehyde), PMMA, PAN. Conducting and Biodegradable polymersIntroduction: Rubber and different types of rubber, Vulcanization of rubber. Natural andsynthetic rubber. Some important rubber and its uses.

35

Unit-IV

CHARACTERIZATION TECHNIQUES (10 hrs.)

Introduction to spectroscopy;Titrimetric analysis with reference to acid-base, redox, precipitation and complexometrictitrationsUV-Visible spectroscopy- Absorption laws, Instrumentation, Beer,s Lambart’s law,Chromophore and auxochrome concept, application of UV-Visible spectroscopy.IR spectroscopy- Principle, spectral features of some classes of compounds, importantfeatures of IR spectroscopy and applications;NMR- Principle, shielding-desheilding effects, spin-spin coupling, applications of NMR;MS spectroscopy- Basic principle, Instrumentation, important features of mass spectroscopy;Chromatography- Introduction, types of chromatography: Instrumentation, principles andapplications of TGA, DTA and DSC.

Unit VGreen Chemistry: (10 Hrs.)Solvents: Reactions in solvent less systems, use of supercritical fluids such as CO2, Ionicliquids.Catalysts: For increased selectivity, reduced energy requirement, photocatalyticreaction and asymmetric synthesis.Synthetic Methodologies: New synthetic protocols using new energy sources likeMicrowaves, Ultrasound etc.

Students are encouraged to use available library resources, electronic media and internetinformation for further understanding of the subject. The following books are suggested asreference works for teachers/students

1. Organic Chemistry, P.Y. Bruice , Ninth Impression, 2011, Pearson India

2. Chemistry 3 , A. Burrows, john Holman, A, Parsons, G. Pilling, G.Price, OxfordUniversity Press, 2009

3. Engineering Chemistry, A Text book of Chemistry for Engineers published by John Wileyand Sons,India 2011

4. Unit processes in Organic Synthesis by Groggins, Tata McGraw Hill, 2001

5. Spectroscopic Methods in Organic Chemistry, D H Williams and I. Fleming, Tata McGrawHill, 1991

6. Applied Chemistry- A textbook for engineers and technologist by H.D. Gesser.

7. Engineering Chemistry: by P C Jain & Monika Jain

8. A Text Book of Engineering Chemistry: by Shashi Chawla

9. Fundamental of organic spectroscopy by Y. R. Sharma

10. Science and Engineering of Materials by Askeland and Phule

36


CHE-151 ENGG. CHEMISTRY LAB L (-) T (-) P (2)

1. Determination of total, permanent and temporary hardness of water

sample EDTA method - i)

2. Estimation of dissolved oxygen in water [winkler’s method]

3. Estimation of chloride content in water by argentometric method

[mohr’s method]

4. Estimation of alkality in water sample.

5. Determination of viscosity of lubricant oils.

6. Determine the flash point and fire point of an oil.

7. Estimation of total iron in iron ore.

8. Estimate the residual chlorine.

References:

1. Vogel’s quantitative Analysis A I Vogel, G Svelha Seventh Edition longmanGroup ltd.

2. Elementary Practical Organic Chemistry Fifth Edition Quantitave analysis, AI Vogel, Longman Group Ltd.

3. Practical Eng. Chemistry S. S. Dara , First edition S. Chand Company.

4. Engg. Chemistry Sudha Rani and S.K. Bhasin First edition Dhanpat raiPublication.

5. Saltcomindia.gov.in./NIDCCP- EstimatContent.html

37


EVS 106 ENVIRONMENTAL SCIENCE AND TECHNOLOGY L (2) T (- )P (-)




SECTION 1: INTRODUCTION (10 hours)

Definition and Scope: Importance, Public awareness and education.

Natural Resources: Introduction, Renewable and non-renewable, Forest, water, mineral,

food, energy and land resources, Conservation of resources, Equitable use of resources.

Human population and the environment: Population growth, Environment and human

health, Human rights, HIV/AIDS, Value education, Women and child welfare.

SECTION 2: ECOLOGY (7 hours)

Ecosystems: Concept, Structure, Function, Energy flow, Ecological pyramids, Forest,

grassland, desert and aquatic ecosystems - Introduction, characteristic features, structure and

function.

Biodiversity: Genetic, Species and ecological diversity, Threats to biodiversity, Conservation

of Biodiversity.

SECTION 3: SOCIAL ISSUES & ENVIRONMENTAL LEGISLATION (8 hours)

Social Issues: Sustainable development, Water conservation, Climatic change, Concept of

Green Computing, and Green Building

Environmental Laws: Environmental ethics, EIA, Environmental protection acts and issues.

38

SECTION 4: POLLUTION &WASTE MANAGEMENT (11 hours)

Pollution: Definition, Causes, effects and control measures of the pollution – Air, soil, Noise,

Water, Marine and Thermal and Nuclear Pollution.

Disaster management: Flood, Earthquake, Cyclone, Landslide, Drought.

Solid waste management: Waste Management hierarchy; Collection, transportation and

storage of MSW; Treatment and disposal of MSW.

SECTION 5: ENVIRONMENTAL CHEMISTRY (6 hours)

General Chemistry: Review of concepts like oxidation-reduction, Gas laws, pH and Buffers.

Atmospheric Chemistry: Photochemical reactions in atmosphere, Major chemical pollutants

and their effects.

Water and Wastewater Chemistry: Hardness, Residual chlorine, Dissolved oxygen, BOD,

COD, Solids.

Green Chemistry: Principles, Green materials, reactions, reagents and product.

Suggested Readings:

Text Books:

• Environmental Studies by J.P.Sharma.

• Environmental studies by Smriti Srivastava.

Reference Books:

• Environment and Ecology by H.Kaur.

• Environmental Studies by Ranjit Daniels.

• Fundamentals of Ecology by P. Odum.

39


MAT-101 Engineering Mathematics-I L (3) T (1) P (-)




Units-I Differential calculus: a brief review of basic concepts, asymptotes(Cartesiancoordinates only) curvature, Rectification.

Unit-II Differential Calculus: Partial Differentiation, Euler’s Theorem on HomogeneousFunctions, Maxima and minima of two and more independent variables, Langrange’s Methodof Multipliers.

Unit-III Integral Calculus: Surface and volume of solids of revolutions, Double integral,double integral by changing into polar form, area and volume by double integration, betafunction and gamma function (simple properties).

Unit-IV Differential Equations: Differential Equations of first order and first degree, linearform, reducible to linear form, exact form and linear differential equation of higher order withconstant coefficient only.

Unit-V Differential Equations: Second order ordinary Differential Equations with variablesCoefficients, homogeneous and exact forms, change of dependent variable, change ofindependent variable, method of variation of parameters.

Text Books:

1. Higher Engineering Mathematics, H.K. Dass, S.Chand.

2. A Text Book of Engineering Mathematics, N.P. Bali, Luxmi Publication.

3. Higher Engineering Mathematics, Dr. BS Grewal.

References:

1. Higher Engineering Mathematics, B.V. Ramana, Tata McGraw Hill.

40


ECE 101 BASIC ELECTRONICS ENGINEERING L (3) T (1) P (-)




Unit 1 Semiconductors and Diodes (12 lectures)

Conductors, semiconductors and insulators, doping in semiconductors, n-type and p-typesemiconductors, temperature effect on semiconductor, Intrinsic and extrinsic semiconductors,Hall Effect and mass action law.

PN-Junction, Junction Theory, V-I characteristics of a PN-Junction Diode, Ideal Diode, Useof Diode in Rectifiers: Half wave rectifiers, full wave rectifiers, breakdown of diode, ZenerDiode, Varacter Diode,. Diode as a switch, rectifiers, clipper and clamper circuits.

Unit 2 Bipolar junction transistors (8 lectures)

Introduction, Junction Transistor Structure, Operation, Transistor amplifying action, CB, CCand CE Configuration, characteristics, application of transistor as an amplifier, transistorbiasing.

Unit 3 Field effect transistors (8 lectures)

Introduction, Types of FET’s, JFET’s, MOSFET’s, CMOS, characteristics, working,applications.

Unit 4 Operational amplifiers (6 lectures)

Introduction to Op-amp, Inverting and non-inverting configuration, Op-amp applicationsadder, sub tractor, integrator, differentiator and comparator, practical op -amps.

Unit 5 Number System and Embedded system (8 lectures)

Binary, Octal, Hexadecimal number systems and their inter-conversion, Embedded system,introduction to microcontroller, introduction to microprocessor, difference betweenmicrocontroller and microprocessor, 8085 and 8051.

41

Text Books

1. Electronics Devices and circuits by Millman & Halkias.2. Electronics devices and circuit theory by Robert Boylestad3. M. Morris Mano, Digital Design, Prentice Hall of India.4. R.S. GAONKAR, Microprocessor Architecture, Programming and applications with the8085/8080A.


ECE 151 Basic electronics lab L (-) T (-) P (2)

List of Experiments

1. To observe sine wave, square wave, triangular wave and ramp waveforms on the C.R.O.and to measure amplitude and frequency of the waveforms.

2. To obtain V-I characteristics of PN junction diode.

3. To study observe waveform at the output of half wave rectifier .

4. To study observe waveform at the output of full wave bridge rectifier.

5. To obtain V-I characteristics of Zener diode.

6. To draw the input and output characteristics of NPN transistor for common baseconfigurations.

7. To draw the input and output characteristics of NPN transistor for common Emitterconfigurations.

8. To observe waveforms at the output of clamper circuits.

9. To observe waveforms at the output of clipper circuits

42


EE-101 Basic Electrical Engineering L (3) T (1) P (-)




UNIT I: Introduction to Electrical Engineering: Essence of electricity, Conductor,semiconductor and insulator; Electric Field, Electric Current, Potential and Potentialdifference, Electromotive Force, Electric Power, Ohm’s law, Basic circuit component andFaradays law Electromagnetic Induction.

UNIT II: Network Analysis: Basic definition, type of elements, type of sources, ResistiveNetwork, Inductive Network, Capacitive Network, series parallel circuits, star-delta anddelta-star transformation. Network theorems: Norton’s, Superposition, Thevenin’s, MaximumPower Transfer Theorem in dc circuit with simple problem.

UNIT III: Magnetic Circuits: Basic definitions, Analogy between electric and magneticcircuits, series magnetic circuit, parallel magnetic circuit, magnetic circuits with air gap, self-inductance and mutual inductance, magnetic coupling, coefficient of coupling.

UNIT IV: Study of AC circuits consisting of pure resistance, pure inductance, purecapacitance and corresponding voltage current phasor diagram and waveforms, Developmentof concept of reactance. Study of series R-L, R-C, R-L-C circuit and resonance, study ofparallel RL,RC and RLC circuit, concept of impedance, admittance, conductance andsusceptance in case of above combination and relevant voltage-current phasor diagrams,concept of active, reactive and apparent power, power factor.

UNIT V: Basic concept of transformers and rotating electrical machines (operating principle,construction and working ), Basic instrument: Introduction, classification of instruments,operating principles, essential features of measuring instruments, Moving Coil PermanentMagnet (PMMC) Instruments, Moving Iron of ammeters and voltmeters (elementarytreatment only).

43

Text Books:

1. Basic Electrical Engineering- By M.S. Naidu and S. Kamakshiah-TMH2. Basic Electrical Engineering- By T.K. Nagasarkar and M.S. Sukhija Oxford

University Press.

References:

1. Theory and problems of Basic Electrical Engineering by D.P. Kothari and I.J. NagrathPHI.

2. Principles of Electrical Engineering by V.K. Mehta, S.Chand Publications.3. Essentials of Electrical and computer Engineering by David V. Kerns, JR. J. David

Irwin Pearson.

44


EE-151 Basic Electrical Engineering Lab. L (-) T (-) P (2)

1. Verification of Kirchoffs laws.

2. Verification of Superpostion theorem and Thevenin’s theorem.

3. Verification of Maximun Power Transfer theorem.

4. Study of study of phenomenon of resonance in RLC series circuit and obtain resonancefrequency.

5. Measurement of power in a three phase circuit by two watt meter method anddetermination of its power factor.

6. To study VI characteristics of PN diode.

7. To study VI characteristics of NPN diode.

8. Determination of parameters in a single phase RLC circuit.

9. To study running and speed reversal of a three phase induction moter and record in bothdirections.

10.Determination of

a)voltage ratio b)polarity c)efficiency

by load test of a single phase transformer.

11. Measurement of power and power factor in a single phase AC series inductive circuit andstudy improvement of power factor using a capacitor.

12. Calibration of energy meter with the help of watt meter.

13. Short circuit/open circuit tests on single phase transformer.

14. Measure the armature and field resistance of a dc machine.

15. Starting and speed control of a DC shunt motor.

45


PHY-101 ENGG. PHYSICS L (3) T (1) P (-)




UNIT – I

Electromagnetic fields and em wave: Gradient of a scalar, divergence and cul of a vector,Gauss’s law (integral and differential form) and its applications, Electric potential andelectric field (in vector form), Dieletrics, Polarization, Electric displacement, Susceptibilityand permittivity, Lorentz foce law, Magnetic field of a steady current (Biot-Savart’s law),Faraday’s law, Ampere’s circuital law and its applications, Maxwell’s equations a dn theirsignificance, Electromagnetic Spectrum (basic idea of different regions).

UNIT – II

Quantum Theory: Need of Quantum Mechanics, Davisson-Germer Experiment and Matterwaves, Group and Phase velocities. Uncertainity Principle and its applications, Time-independent and Time-Dependent Schrödinger Wave equation, Eigen values and EigenFunctions, Applications of Schrödinger Wave equation to Particle in a box (one dimensional).

UNIT – III

Lasers and Optical Fibers: Spontaneous and Stimulated Emission, Einstein’s coefficients,Population Inversion and Optical Pumping, Three-level and Four-level Lasers, Ruby, He-Ne,CO2, Semiconductor Lasers, Application of lasers, Basic theory of fiber optics, accepatance

angle, numerical aperture, modes of propagation, material and pulse dispersion, applicationof optical fibers.

UNIT – IV

Magnetic materials and Superconductivity: Hard and soft magnetic materials and theirapplications, Ferrites and their applications, Phenomenon of superconductivity, Magneticproperties of superconductors (Meissner effect), Type-I and Type-II Superconductors,Applications of Superconductivity.

45






UNIT – I


UNIT – II


UNIT – III



UNIT – IV


45






UNIT – I


UNIT – II


UNIT – III



UNIT – IV


46

UNIT – V

Radiation Physics: A few X- and Gamma-radioisotopes (109Cd, 241Am, 60Co, 137Cs) and theirapplications, Coolidge tube; Continuous and Characteristic X-rays; Moosley’s law; Absorption of X-rays and gamma rays; X-ray Diffraction and Bragg’s law, EDXRF and WDXRF (qualitative idea).

47


PHY-151 ENGG.PHYSICS LAB L (-) T (-) P (2)

List of Experiments

1. To determine the specific rotation of cane sugar solution with the help of polarimeter.

2. To determine Planck’s constant

3. To determine the dispersive power of the material of the prism using mercury lightwith the help of a spectrometer.

4. To determine the wavelength of sodium light by Newton’s Ring.

5. To determine the Energy Band Gap of a Semiconductor by using Four probe method.

6. To measure the numerical aperture of the given an optical fiber.

7. To determine the specific resistance of a given wire using Carey Foster’s bridge.

8. To determine e/m ratio using Thompson’s method

9. To determine angle of divergence of Laser beam

10. To determine angle of prism and minimum deviation using spectrometer.

48


ME-101 ENGINEERING MECHANICS L (3) T (1) P (-)




UNIT-ITwo Dimensional Concurrent Force Systems: Basic concepts, Units, Forcesystems, Laws of motion, Moment and Couple, Vectors - Vectorialrepresentation of forces and moments - Vector operations. Principle ofTransmissibility of forces,, Resultant of a force system, Equilibrium andEquations of Equilibrium, Equilibrium conditions, Free body diagrams,Determination of reaction, Resultant of Two dimensional concurrent forces,Applications of concurrent forces

8UNIT-II

Two Dimensional Non-Concurrent Force Systems: Basic Concept,Varignon’s theorms, Transfer of a force to parallel position, Distributed forcesystem, Types of supports and their reactions, converting force into couple andVise versa Applications. 3Friction: Introduction, Laws of Coulomb Friction, Equilibrium of Bodiesinvolving Dry-friction, Belt friction, ladder Friction, Applications of Friction indaily life.

3Structure: Plane truss, perfect and imperfect truss, assumption in the trussanalysis,analysis of perfect plane trusses by the method of joints, method of section. 4

3 3

UNIT-IIICentroid and Moment of Inertia: Centroid of plane, curve, area, volume andcomposite bodies, Moment of inertia of plane area, Parallel Axes Theorem,Perpendicular axes theorems, Mass Moment of Inertia of Circular Ring, Disc,Cylinder, Sphere and Cone about their , Axis of Symmetry. Pappus theorems,polar moment of inertia, Applications of Moment of Inertia in daily life.

8

UNIT IVKinematics of Rigid Body: Introduction, plane rectilinear motion of rigid body,Plane curvilinear Motion of Rigid Body, Velocity and Acceleration underTranslation and Rotational Motion, Relative Velocity.

8

49

UNIT (V)Kinetics of Rigid Body: Introduction, Force, Mass and Acceleration, Workand Energy, Impulse and Momentum, D’Alembert’s Principles and DynamicEquilibrium, Friction in moving bodies 8

Text books:

1. Engineering Mechanics Statics , J.L Meriam , Wiley2. Engineering Mechanics Dynamics , J.L Meriam , Wiley3. Engineering Mechanics by Irving H. Shames, Prentice-Hall4. Engineering Mechanics : Statics and Dynamics, R. C. Hibbler5. Mechanics of Solids by Abdul Mubeen, Pearson Education Asia.6. Mechanics of Materials by E.P.Popov, Prentice Hall of India Private limited.

50


ME-151 ENGINEERING MECHANICS LAB L (-) T (-) P (2)

List of Experiments

1. To study the 2-stroke & 4-stroke I.C. Engine models.

2. Friction experiment(s) on inclined plane.

3. To determine the velocity ratio, mechanical advantage and efficiency of a simplescrew jack.

4. Simple & compound gear-train experiment.

5. Belt-Pulley experiment.

6. Torsion of rod/wire experiment.

7. Experiment on Trusses.

8. Dynamics experiment on momentum conservation.

9. Experiment on Moment of Inertia.

10. To draw the load-extension curve of a metallic wire and hence determine the modulusof elasticity of the material of the wire.

11. To investigate the relationship between shear stress and shear strain for rubber and todetermine the modulus of rigidity of the material.

12. To determine the central deflection of a simply supported beam loaded by aconcentrated load at mid point and hence determine the modulus of elasticity of the materialof the beam.

13. To determine the central deflection of a fixed ended beam loaded at mid-span byconcentrated loads and to compare with theoretical value.

14. To verify the laws of shearing force and bending moment on a beam.

Outcome of the course:

The students are expected to compare experimental results with theoretical concepts,speculate about reasons for discrepancies, and learn from deductive reasoning. The purposesof experimentation as a subject in the curriculum are many, but perhaps the most importantones are to provide opportunities for the student to:

1. Verify certain theories

2. Become familiar with methods of measurements

3. Organize his/her own work and carry it through systematically and carefully

4. Organize the work of a team

5. Analyze data, assess its reliability and draw conclusions.

51

References:

1. “Applied Mechanics and Strength of Materials”, U.C. Jindal, Galgotia Publications

2. “Engineering Mechanics For Uptu With Experiments”, D.S. Kumar, S.K. Katariapublication

3. “Advanced Practical Physics for Students”, Worsenop & Flint

52


ME-102 ENGINEERING GRAPHICS L (3) T (1) P (-)




UNIT-IIntroduction (10 Lectures)Sheet layout, Drawing instruments and their uses, Lettering and free hand practicing,Dimensioning, Types of lines, BIS conventions.

UNIT-II

Orthographic projections (12 Lectures)Definitions, Planes of projection, Reference line and convention employed, Projections ofpoints, lines, True and apparent lengths, inclinations, Orthographic projections of planesurfaces.

UNIT-III

Projections of solids (8 Lectures)Definitions, Projections of right regular tetrahedron, Projections of hexahedron, Projectionsof prisms, Projections of pyramids, cylinders and cones.

UNIT-IV

Isometric projections (10 Lectures)Isometric scales, Isometric projections of simple figures, tetrahedron, hexahedron, rightregular prisms, pyramids, cylinder and cones, Spheres, cut spheres and combination of solids.

UNIT-V

Introduction to computer aided sketching (8 Lectures)Computer screen: layout of menus/tool bars, Creations of 2D/3DEnvironment, Drawingscale, units etc., Creation of shapes: square,rectangle, circle, curves etc, Dimensioning.

]

53

Text books:

1. Engineering Drawing – N D Bhatt & V M Panchal, 48th edition, 2005 CharotarPublishing House, Gujarat.

2. A Primer on Computer Aided Engineering Drawing – 2006, Published by VTU,Belgaum.

3. A Textbook of Engineering Graphics, K. Venugopal and V. Prabhu Raja, New AgeInternational Publishers.

4. Engineering Drawing and Graphics using Auto Cad, T. Jeyapoovan, Vikas PublishingHouse Pvt. Ltd.

Reference Books:

1. Computer Aided Engineering Drawing – S. Trymabaka Murthy, I K InternationalPublishing House Pvt. Ltd., New Delhi, 3rd revised edition – 2006.

2. Engineering Graphics – K R Gopalakrishna, 32nd edition, 2005 – Subhash Publishers,Bangalore.

3. Fundamentals of Engineering Drawing with an introduction to Interactive ComputerGraphics for Design and Production – Luzadder Warren J., duff John M., EasternEconomy Edition, 2005 - Prentice – Hall of India Pvt. Ltd., New Delhi.

54


ME-152 WORKSHOP LAB L (-) T (-) P (3)

Carpentry Shop

Job No. 1

Objective: To Prepare a “T–LAP JOINT” as per sketch.

55

Job No. 2

Objective: To prepare a “Cross Lap Joint” as per given sketch.

56

Job No. 3

Objectives: To prepare Mortise and Tenon Joint

57

Fitting Shop

Job No. 1

Objectives: To Make Right Angle Fitting Job

58

Job No. 2

Objectives: To Make A Square Fitting Job

59

Machine Shop

Job No. 1

Objective: To prepare the job as per the given specificationsprovided for different operations on lathe machine

Swiveling angle = Half of the taper angle = 4°

All Dimensions are in mm

Tolerance = ± 0.5mm

60

Welding ShopJob No. 1

Objective: Beading practice with arc welding

61

Job No. 2

Objective: To make a butt joint by arc welding.

62


HUM-101 COMMUNICATION SKILLS L (2) T (-) P (-)




SECTION-ACommunication: Meaning of Communication, Types of Communication, Process ofCommunication, Channels of Communication, modes of communication, Barriers tocommunication, Role of communication in society.Reading Skills: Characteristics of reading, Types of reading, Purpose of reading, Process ofreading, Rules for faster comprehension, Approach to reading, SQ3R, Comprehension(Unseen passage).

SECTION-B

Listening Skills: Process of listening, Types of listening, and Barriers to effective listening,Difference between hearing and listening, Feedback skills.

Speaking Skills: Study of Vowels symbols & diagram( Long, Short, Open, Close, Rounded,Unrounded, Monophthongs, Diphthongs) , Consonants & symbols , Accent , Stress , VoiceModulation

SECTION-CGrammar: Abbreviations, Idioms & phrases, One word substitution, Antonyms, Synonyms,Homophones, Homonyms, Word formation: prefix, suffix, Punctuation. Transformation ofsentences: Simple to compound, compound to Complex& vice versa..

SECTION-DWriting Skills: Business letters: principles, structure, Writing a memo, Job application letters,preparing a personal resume; Writing notices, Agenda and Minutes of meetings; Paragraphwriting, Report writing: Characteristics, types of reports, structure of technical/researchreports, preparatory steps to report writing.

63

Text Books:

1. Bhattacharya, Inderjit, an Approach to Communication Skills. Dhanpat Rai Co., (Pvt.)Ltd. New Delhi.

2. K.K.Sinha, Business Communication, Galgotia Publishing Company, New Delhi,1999.

References:

1. Sheila H.A. Smith, M and Thomas, L., Methuen, Reading to Learn; London, 1982.2. McGraw, SJ;Basic Managerial Skills for all, Prentice Hall of India, New Delhi 19913. Technical Reporting Writing British Association for commercial and Industrial Education,

BACIE, 19924. Chrissie Wright (Ed.); Handbook of Practical Communication Skills; JAICO Books5. Common Errors in English, by Sudha Publication (P) Ltd., B-5, Prabhat Kiran Building,

Rajendra Place, New Delhi – 110008.6. Abul Hashem, Common Errors in English, Ramesh Publishing House, Daryagang New

Delhi.7. Objective English by Tata McGraw Hill Publishing Co. Ltd., New Delhi.8. R.K.Bansal & J.B. Harrison, spoken English for India, Orient Longman.9. Veena Kumar, the Sounds of English, Makaav Educational Software, New Delhi.

64


HUM-151 COMMUNICATION SKILLS LAB L (-) T (-) P (2)

Practical syllabus-

a) Group Discussionb) Just a minutes session: Speaking Extempore for one minutes on given topicsc) Reading aloud of newspaper headlines and important articles.d) Improving pronunciation through tongue twisters.e) Soft Skills: Mannerism or Etiquette.f) Mock Interviewg) Preparing PPTsh) Telephonic Skillsi) Phonetics

65


CSE-101 FUNDAMENTALS OF COMPUTERS & PROG. IN C L (3) T (1) P (-)




SECTION-AAn Overview of Computer System: Anatomy of a digital Computer, Memory Units, Mainand Auxiliary Storage Devices, Input Devices, Output Devices, Classification of Computers,Introduction to microprocessor, commonly used CPUs, Input/output ports and connectors.Radix Number System: Decimal, Binary, Octal, Hexadecimal numbersOperating System: The user Interface, Running Programmes, Managing files, Introductionto PC operating Systems: Unix/Linux, DOS, and Windows 2000.

SECTION-B

Networking Basics: Introduction to the basic concepts of Networks and DataCommunications, Network topologies, Network Types (LAN, WAN and MAN), HowInternet works, Major features of internet, Emails, FTP, Using the internet.Programming Languages: Machine-, Assembly-, High Level- Language, Assembler,Compiler, Interpreter, debuggers, Programming fundamentals: problem definition, algorithms,flow charts and their symbols, introduction to compiler, interpreter, assembler, linker andloader and their inter relationship.

SECTION-CC Programming language: C fundamentals formatted input/ output, expressions, selectionstatements, loops and their applications; Basic types, arrays, union, structure, functions,including recursive functions, program organization: local and external variables and scope,pointers & arrays.

SECTION-DStrings: 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 andtypes. Standard library: Input / output; streams, file operations, formatted I/O, characterI/O, line I/O, block, string I/O, Library support for numbers and character data, errorHandling:

TEXT BOOKS:1. Using Information Technology, 5th Edi, Brian K Williams & Stacey C. Sawyer, 2003,

TMH2. 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.4. Fundamentals of Computing and C Programming, R. B. Patel, Tech Publications, New

Delhi.

66


CSE-151 PROGRAMMING IN ‘C’ LAB L (-) T (-) P (2)

List of Experiments

(1) WAP TO ADD TWO NUMBERS.(2) WAP TO SWAP TWO NUMBERS.(3) WAP TO FIND SIMPLE INTEREST.(4) WAP TO CHECK NO IS ODD/EVEN.(5) WAP TO FIND GREATEST NO. OUT OF THREE NUMBERS.(6) WAP TO FIND GREATEST & SECOND GREATEST OUT OF THREE NUMBERS.(7) WAP TO FIND YEAR IS CENTUARY/LEAP YEAR OR NOT.(8) WAP TO FIND GRADE WITH PERCENTAGE.(9) WAP TO FIND INCOME TAX FROM TOTAL SALARY.(10) WAP TO PRINT DAY OF WEEKS USING SWITCH STATEMENT.(11) WAP TO PRINT NO OF DAYS OF MONTHS USING SWITCH STATEMENT.(12) WAP TO PRINT ‘N’ NATURAL NUMBERS USING WHILE LOOP.(13) WAP TO FIND NUMBER OF DIGITS IN AN INTEGER USING WHILE LOOP.(14) WAP TO FIND REVERSE OF AN INTEGER USING WHILE LOOP.(15) WAP TO CHECK WHEATHER NUMBER IS PALLINDROME OR NOT USING WHILE

LOOP.(16) WAP TO FIND SUM OF AN INTEGER USING DO-WHILE LOOP.(17) WAP TO USE GOTO & CONTINUE STATEMENT(18) WAP FOR LINEAR SEARCH(19) WAP FOR BINARY SEARCH(20) WAP FOR BUBBLE SORT(21) WAP TO FIND ADDITION OF TWO MATRICES(22) WAP TO FIND MULTIPLICATION OF TWO MATRICES(23) WAP TO FIND TRANSPOSE OF A MATRIX(24) WAP TO FIND WHEATHER THE MATRIX IS SYMMETRIC OR NOT(25) WAP TO PRINT ADDRESS USING POINTERS(26) WAP FOR STRUCTURE(27) WAP FOR UNION

67

DETAILED SYLLABUS SEMESTER-2nd

MAT- 111 ENGINEERING MATHEMATICS-II L (3) T (1) P (-)




UNIT-I

Matrices: Rank of a matrix, Rank of matrix by reducing to normal forms, Consistency ofsystems of linear simultaneous equations and its solution, Eigen values and Eigen vectors,Cayley-Hamilton theorem (without proof), Diagonalization of matrix.

(10 lectures)

UNIT-II

Vector Calculus: Scalar and vector field, Differentiation & Integration of vector functions,Gradient of a scalar field and directional derivative, Divergence and Curl of a vector field,Line integral, Surface integral and volume integral. Application of Vector Calculus: Green’sTheorem, Gauss’s Theorem and Stoke’s Theorem (without proof) and their Applications.

(10 lectures)

UNIT-III

Laplace transform: Laplace transform of elementary functions, Laplace transform ofderivatives and integrals, multiplication by tn , division by t , Evaluation of integrals byLaplace transform, Laplace transform of Unit step function, Inverse transforms, convolutiontheorem, application to linear differential equations and simultaneous linear differentialequations with constant coefficients.

(11 lectures)

UNIT-IV

Partial differential equations: Formation of partial differential equations, Lagrange’s linearpartial differential equations, First order non-linear partial differential equations (

),(),(,0),,(),,(,0),( 21 qyfpxfqpzfqpfqypxzqpf ), Charpit’s method

(9 lectures)

UNIT-V

Application of Partial differential equations: Homogeneous linear equations withconstants coefficients, Non-homogeneous linear partial differential equations, Method ofseparation of variables and its application, One dimensional wave equation, One dimensionalheat equation.

68

(9 lectures)

Suggested Readings:

1. Higher Engineering Mathematics, H.K. Dass, S. Chand, 11th Edition.2. Higher Engineering Mathematics, B.V. Ramana, Tata McGraw Hill.3. Thomas Calculus, Maurice D. Weir, Joel Hass and others, Pearson, 11th Edition.4. A Text Book of Engineering Mathematics, N.P. Bali Laxmi publication.5. Engineering Mathematics -1, (RTU), N.P. Bali Laxmi publication.6. Higher Engineering Mathematics, Dr. B. S. Grewal, Khanna Publishers.

69


CSE-111 PROGRAMMING IN C++ L (3) T (1) P (-)




SECTION-A

Overview of C: C Fundementals, Selection Statements, Loops, Array, Pointer, Structure,Union, Function, Recursion, Strings.Introduction to C++, Preprocessors Directives, Illustrative Simple C++ Programs. HeaderFiles and Namespaces, Concept of objects, Object Oriented Analysis & Object Modelingtechniques.Object Oriented Concepts: Encapsulation (Information Hiding), Access Modifiers:Controlling access to a class, method, or variable (public, protected, private, package),Polymorphism: Overloading, Inheritance, Overriding Methods, Abstract Classes, Reusability.

SECTION-B

Classes and Data Abstraction: Introduction, Structure Definitions, Accessing Members ofStructures, Class Scope and Accessing Class Members, Initializing Class Objects:Constructors, Using Default Arguments With Constructors, Using Destructors, Classes:Const (Constant) Object And Const Member Functions, Object as Member of Classes, FriendFunction and Friend Classes, Using This Pointer, Dynamic Memory Allocation with New andDelete, Static Class Members, Function overloading.Operator Overloading: Introduction, Fundamentals of Operator Overloading, RestrictionsOn Operators Overloading, Operator Functions as Class Members vs. as Friend Functions,Overloading, <<, >> Overloading Unary Operators, Overloading Binary Operators.

SECTION-C

Inheritance: Introduction, Inheritance: Base Classes and Derived Classes, ProtectedMembers, Casting Base- Class Pointers to Derived- Class Pointers, Overriding Base –ClassMembers in a Derived Class, Public, Protected and Private Inheritance, Using Constructorsand Destructors in derived Classes.Virtual Functions and Polymorphism: Introduction to Virtual Functions, Abstract BaseClasses and Concrete Classes, Polymorphism, New Classes and Dynamic Binding, VirtualDestructors, Polymorphism, Dynamic Binding. Files and I/O Streams: Files and Streams,Creating a Sequential Access File, e.g. , Random Access Files, Creating A Random AccessFile, e.g. Stream Input/output Classes and Objects, e.g., Stream Manipulators.

70

SECTION-D

Templates & Exception Handling: Function Templates, Class Template, Templates andInheritance, Basics of C++ Exception Handling: Try, Throw, Catch, Throwing an Exception,Catching an Exception, Re-throwing an Exception

Text Books:• C++ How to Program by H M Deitel and P J Deitel, 1998, Prentice Hall• Object Oriented Programming in Turbo C++ by Robert Lafore ,1994, The WAITE GroupPress.• Programming with C++ By D Ravichandran, 2003, T.M.H

Reference books: • Object oriented Programming with C++ by E Balagurusamy, 2001, TataMcGraw-Hill• Computing Concepts with C++ Essentials by Horstmann, 2003, John Wiley,• The Complete Reference in C++ By Herbert Schildt, 2002, TMH.• C++ Programming Fundamentals by Chuck Easttom, Firewall Media.

71


CSE-161 PROGRAMMING IN ‘C++’ LAB L (-) T (-) P (2)

List of Experiments

(1) WAP FOR FUNCTION WITHOUT ARGUMENTS(2) WAP FOR FUNCTION WITH ARGUMENTS(3) WAP TO FIND FACTORAIL OF A NUMBER USING RECURSION(4) WAP FOR PASSING AN ARRAY IN FUNCTION(5) WAP FOR CALLBYVALUE & CALL BY REFERENCE(6) WAP TO FIND LENGTH OS A STRING(7) WAP TO FIND CONCETANATION OF TWO STRINGS(8) WAP TO FIND COPY OF A STRING(9) WAP TO FIND WHEATHER STRING IS PALINDROME OF NOT(10) WAP TO FIND REVERSE OF A STRING(11) WAP TO FIND SUM & AVERAGE OF A NUMBER IN C++(12) WAP FOR INLINE FUNCTIONS(13) WAP FOR FUNCTION OVERLOADING(14) WAP FOR CLASSES DECLARTION(15) WAP FOR SCOPE RESULTION OPERATOR(16) WAP FOR STATIC DATA MEMBERS(17) WAP FOR SATAIC MAMBERS FUNCTION(18) WAP FOR CONSTRUCTOR(19) WAP FOR CONSTRUCTOR OVERLOADING(20) WAP FOR DESTRUCTORS(21) WAP FOR FRIEND CLASSES(22) WAP FOR CONTAINER CLASSES(23) WAP FOR ABSTRACT CLASSES(24) WAP FOR OPERATOR OVERLOADING(25) WAP FOR VARIOUS TYPES OF INHERITENCE(26) WAP FOR VIRTUAL BASE CLASSES(27) WAP FOR POLYMORPHISM(28) WAP FOR VIRTUAL FUNCTIONS(29) WAP FOR FILE HANDLING

72

DETAILED SYLLABUS SEMESTER-3rd

MAT-201 ENGG. MATHEMATICS – III L (3) T (1) P (-)




SECTION-AFourier Series: Periodic functions, Fourier series of period 2 , Euler’s formulas, Dirichlet’scondition, Fourier series for discontinuous functions, Change of interval, Odd and evenfunction, Half- range sine and cosine series.Fourier Transforms: Fourier integrals, Fourier transforms, Fourier cosine and sinetransforms, Properties of Fourier transforms, Convolution theorem, Perseval’s identity,Relation between Fourier and Laplace transforms, Fourier transforms of the derivatives of afunction, Application to boundary value problems.

SECTION-B

Functions of a Complex Variables: Functions of a complex variable, Exponential function,limit and continuity of a function, Analytic function, Cauchy-Riemann equations, Necessaryand sufficient conditions for a function to be analytic, Polar form of the Cauchy-Riemannequations, Harmonic functions, Cauchy integral theorem, Cauchy residue theorem.

SECTION-C

Numerical analysis: Solution of algebraic and transcendental equations by the Bisection,Regula-falsi and Newton-Raphsion methods, Solution of linear simultaneous equations by

Gauss elimination method, Iteration methods, Jacobi’s iteration method, Gauss-seidel method,Relaxation method, Numerical integration methods, Trapezoidal rule, Simpson’s one-third

rule, Simpson’s three-eighth rule, Numerical solution of differential equations, Picard’smethod, Taylor’s series method, Euler’s method and forth-order Runge-Kutta method.

SECTION-D

Linear Programming: Linear programming problems formulation, Solution of LinearProgramming Problem using Graphical method, Simplex Method, Dual-Simplex Method.Text Book1. Higher Engg. Mathematics : B.S. Grewal2. Advanced Engg. Mathematics : E. Kreyzig

Reference Book1. Complex variables and Applications : R.V. Churchil; Mc. Graw Hill2. Engg. Mathematics Vol. II: S.S. Sastry; Prentice Hall of India.3. Operation Research : H.A. Taha4. Probability and statistics for Engineer : Johnson. PHI.

73


ECE-201 DIGITAL ELECTRONICS L (3) T (1) P (-)




Section -ANumber system and their inter conversion, Signed binary numbers, binary codes, cyclic codes,error detecting and correcting codes, hamming codes.

Logic Gates, Minimization of logic gates using K- map method and Quine Mc-Cluskymethod (Tabular method)

Combinational circuits, analysis procedure, design procedure, binary adder-subtractor,decimal adder, binary multiplier, magnitude comparator, decoders, encoders, multiplexers,demultiplexers.

Section-BSequential circuits, Flip flops, SR flip flop JK flip flop.D Flip flop and T flip flop.Registers and counters: Shift registers, ripple counter, synchronous counter, other counters

Section-C

Introduction and performance criteria for logic families, various logic families - DCTL, RTL, DTL,TTL & ECL working and their characteristics in brief, MOS Gates and GMOS Gates, comparison ofvarious logic families.

Section-DMemory and programmable logic: Introduction, Memory organisation, Classificationand characteristics of memories, Sequential memories, RAM, ROM, PLA, and PAL.

Text Book:

• M. Morris Mano and M. D. Ciletti, “Digital Design”, 4th

Edition, Pearson Education• Pedroni - Digital Electronics & Design, Elsevier• R.P. Jain , “Modern digital electronics” , 3rd edition , 12th reprint TMH Publication,

2007.• Digital Design and computer organization: Nasib Singh Gill & J. B. Dixit

Reference Books :• Grout - Digital Design using FPGA'S & CPLD's, Elsevier• F. Vahid: Digital Design: Wiley Student Edition, 2006• J. F. Wakerly, Digital Design Principles and Practices, Fourth Edition, Prentice-Hall,

2005.• R. L. Tokheim, Digital electronics, Principles and applications, 6th Edition, Tata

McGraw Hill Edition, 2003

74


CSE-201 DATA STRUCTURES USING C L (3) T (1) P (-)




Section-AOverview of C, Introduction, Stacks and QueuesOverview of ‘C’ :Introduction , Flow of Control, Input output functions, Arrays andStructures, FunctionsData structures and Algorithms: an overview : concept of data structure, choice of rightdata structures, types of data structures, basic terminology Algorithms, how to design anddevelop an algorithm: stepwise refinement, use of accumulators and counters; algorithmanalysis, complexity of algorithms Big-oh notation.Arrays : Searching Sorting: Introduction, One Dimensional Arrays, operations defined :traversal, selection, searching, insertion, deletion, and sortingSearching: linear search, binary search; Sorting : selection sort, bubble sort, insertion sort,merge sort, quick sort, shell sort. Multidimensional arrays, address calculation of a location inarrays.Stacks and queues: Stacks, array representation of stack. Applications of stacks. Queues,Circular queues, , array representation of Queues,. Deques, priority queues, Applications ofQueues.

Section-BPointers and Linked Lists;Pointers: Pointer variables, Pointer and arrays, array of pointers, pointers and structures,Dynamic allocation.Linked Lists: Concept of a linked list,. Circular linked list, doubly linked list, operations onlinked lists. Concepts of header linked lists. Applications of linked lists, linked stacks, linkedQueues.

Section-CTrees and GraphsTrees: Introduction to trees, binary trees, representation and traversal of trees, operations onbinary trees, types of binary trees, threaded binary trees, B Trees, . Application of trees.Graphs : Introduction, terminology, ‘set, linked and matrix’ representation, operations ongraphs, Applications of graphs.

Section-DFile Handling and Advanced data StructureIntroduction to file handling, Data and Information, File concepts, File organization, files andstreams, working with files. AVL trees, Sets, list representation of sets, applications of sets,skip lists

75

Text Book:• Data Structures using C by A. M. Tenenbaum, Langsam, Moshe J. Augentem, PHI Pub.• Data Structures using C by A. K. Sharma, Pearson

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, Schaum’s 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

76


CSE-202 PROGRAMMING LANGUAGES L(3) T(1) P(-)




Section A:Introduction:Syntactic and semantic rules of a Programming language, Characteristics of a goodprogramming 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.

Section B:Structured data objects, Subprograms and Programmer Defined Data Type :Structured data objects & data types , specification & implementation of structured datatypes, Declaration & type checking of data structure ,vector & arrays, records Characterstrings, variable size data structures , Union, pointer & programmer defined data objects, sets,files.Evolution of data type concept, abstraction, encapsulation & information hiding,Subprograms, type definitions, abstract data types.

Section C:Sequence Control and Data Control:Implicit & explicit sequence control, sequence control within expressions, sequence controlwithin statement, Subprogram sequence control: simple call return, recursive subprograms,Exception & exception handlers, co routines, sequence control. Names & referencingenvironment, static & dynamic scope, block structure, Local data & local referencingenvironment, Shared data: dynamic & static scope. Parameter & parameter transmissionschemes.

Section D:Storage Management, Programming languages:Major run time elements requiring storage ,programmer and system controlled storagemanagement & phases , Static storage management , Stack based storage management, Heapstorage management ,variable & fixed size elements.Introduction to procedural, non-procedural ,structured, functional and object oriented programming language, Comparison ofC & C++ programming languages.

77

Text Book:• Programming languages Design & implementation by T.W. .Pratt, 1996, Prentice HallPub.• Programming Languages – Principles and Paradigms by Allen Tucker & RobertNoonan, 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.

78


CSE-203 COMPUTER ORGANIZATION L (3) T (1) P (-)




Section ABoolean algebra and Logic gates, Combinational logic blocks(Adders, Multiplexers,Encoders, de-coder), Sequential logic blocks(Latches, Flip-Flops, Registers, Counters) Storeprogram control concept, Flynn’s classification of computers (SISD, MISD, MIMD);Multilevel viewpoint of a machine: digital logic, micro architecture, ISA, operating systems,high level language; structured organization; CPU, caches, main memory, secondary memoryunits & I/O; Performance metrics; MIPS, MFLOPS.

Section BInstruction Set Architecture:Instruction set based classification of processors (RISC, CISC, and their comparison);addressing modes: register, immediate, direct, indirect, indexed; Operations in the instructionset; Arithmetic and Logical, Data Transfer, Control Flow; Instruction set formats (fixed,variable, hybrid); Language of the machine: 8086 ; simulation using MSAM.

Section CBasic non pipelined CPU Architecture and Memory Hierarchy & I/O TechniquesCPU Architecture types (accumulator, register, stack, memory/ register) detailed data path ofa typical register based CPU, Fetch-Decode-Execute cycle (typically 3 to 5 stage);microinstruction sequencing, implementation of control unit, Enhancing performance withpipelining.The need for a memory hierarchy (Locality of reference principle, Memory hierarchy inpractice: Cache, main memory and secondary memory, Memory parameters: access/ cycletime, cost per bit); Main memory (Semiconductor RAM & ROM organization, memoryexpansion, Static & dynamic memory types); Cache memory (Associative & direct mappedcache organizations.

Section DIntroduction to Parallelism and Computer Organization [80x86]:Goals of parallelism (Exploitation of concurrency, throughput enhancement); Amdahl’s law;Instruction level parallelism (pipelining, super scaling –basic features); Processor levelparallelism (Multiprocessor systems overview).Instruction codes, computer register, computer instructions, timing and control, instructioncycle, type of instructions, memory reference, register reference. I/O reference, Basics ofLogic Design, accumulator logic, Control memory, address sequencing, micro-instructionformats, micro-program sequencer, Stack Organization, Instruction Formats, Types ofinterrupts; Memory Hierarchy.

79

Text Books:• Computer Organization and Design, 2

ndEd., 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, Prentice-Hall 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.• Computer System Architecture by M. Mano, 2001, Prentice-Hall.• Computer Architecture- Nicholas Carter, 2002, T.M.H.

80


HUM-202 HUMAN VALUES & ETHICS L (2) T (1) P (-)

SECTION-ACourse Introduction - Need, Basic Guidelines, Content and Process for Value EducationUnderstanding the need, basic guidelines, content and process for Value Education. SelfExploration–what is it?- its content and process; „Natural Acceptance‟ and ExperientialValidation- as the mechanism for self exploration. Continuous Happiness and Prosperity- Alook at basic Human Aspirations Right understanding, Relationship and Physical Facilities-the basic requirements for fulfillment of aspirations of every human being with their correctpriority Understanding Happiness and Prosperity correctly- A critical appraisal of the currentscenario Method to fulfill the above human aspirations: understanding and living in harmonyat various levels

SECTION-BUnderstanding Harmony in the Human Being - Harmony in Myself! Understanding humanbeing as a co-existence of the sentient “I” and the material „Body‟ Understanding the needsof Self („I‟) and „Body‟ - Sukh and Suvidha Understanding the Body as an instrument of „I‟(I being the doer, seer and enjoyer) Understanding the characteristics and activities of „I‟ andharmony in „I‟ Understanding the harmony of I with the Body: Sanyam and Swasthya;correct appraisal of Physical needs, meaning of Prosperity in detail Programs to ensureSanyam and Swasthya)

SECTION-CUnderstanding Harmony in the Family and Society- Harmony in Human-HumanRelationship Understanding harmony in the Family- the basic unit of human interactionUnderstanding values in human-human relationship; meaning of Nyaya and program for itsfulfillment to ensure Ubhay-tripti; Trust (Vishwas) and Respect (Samman) as thefoundational values of relationship Understanding the meaning of Vishwas; Differencebetween intention and competence Understanding the meaning of Samman, Differencebetween respect and differentiation; the other salient values in relationship Understanding theharmony in the society (society being an extension of family): Samadhan, Samridhi, Abhay,Sah-astitva as comprehensive Human Goals Visualizing a universal harmonious order insociety- Undivided Society (Akhand Samaj), Universal Order (Sarvabhaum Vyawastha )-from family to world family!

SECTION-DUnderstanding Harmony in the Nature and Existence - Whole existence as CoexistenceUnderstanding the harmony in the Nature Interconnectedness and mutual fulfillment amongthe four orders of naturerecyclability and self-regulation in nature Understanding Existenceas Co-existence (Sah-astitva) of mutually interacting units in all-pervasive space Holisticperception of harmony at all levels of existence.

TEXT BOOKS1. 1. Charles D. Fleddermann, “Engineering Ethics”, Pearson Education / Prentice Hall,

New Jersey,2004 (Indian Reprint)2. Charles E Harris, Michael S. Protchard and Michael J Rabins, “Engineering Ethics –

Concepts and Cases”, Wadsworth Thompson Learning, United States, 2000 (IndianReprint now available)

3. John R Boatright, “Ethics and the Conduct of Business”, Pearson Education, NewDelhi, 2003

81


CSE-251 DATA STRUCTURES USING ‘C’ LAB L (-) T (-) P (2)

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 Method3. Write a program to perform following operations on tables using functions only(a) Addition (b) Subtraction (c) Multiplication (d) Transpose4. Using iteration & recursion concepts write the programs for Quick Sort Technique5. 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.6. Write a program for swapping of two numbers using ‘call by value’ and ‘call by referencestrategies.7. Write a program to implement binary search tree.( Insertion and Deletion in Binary search Tree)8. Write a program to create a linked list & perform operations such as insert, delete, update,

reverse in the link list9 . Write the program for implementation of a file and performing operations such as insert,

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

timings for a list of 1000 elements.12. Write a program to simulate the various graph traversing algorithms.13. Write a program which simulates the various tree traversal algorithms.

82


ECE-252 DIGITAL ELECTRONICS LAB L (-) T (-) P (2)

Objective:To understand the digital logic and create various systems by using these logics.

1. Introduction to digital electronics lab- nomenclature of digital ICs, specifications, study of

the data sheet, concept of Vcc and ground, verification of the truth tables of logic gates using

TTL ICs.

2. Implementation and verification of various logic gates..

3. Verification of state tables of RS, JK, T and D flip-flops.

4. Implementation and verification of Decoder/De-multiplexer and Encoder using logic gates.

5. Implementation of 4x1 multiplexer using logic gates.

6. Implementation of 4-bit parallel adder using 7483 IC.

7. Design, and verify the 4-bit synchronous counter.

NOTE :Ten experiments are to be performed, out of which at least seven experiments should beperformed from above list. Remaining three experiments may either be performed fromthe above list or designed & setup by the concerned institution as per the scope of thesyllabus.

83


CSE-252 PC HARDWARE LAB L (-) T (-) P (2)

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

Access 2000.1. To prepare the Your Bio Data using MS Word2. 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.3. Prepare a presentation explaining the facilities/infrastructure available in your

college/institute.4. Create a database of books in the library on a mini scale w.r.t. Computers and manipulate

the database using different forms and reports.

PC Hardware:1. To check and measure various supply voltages of PC.2. To make comparative study of motherboards.3. To observe and study various cables, connections and parts used in computer

communication.4. To study various cards used in a system viz. display card, LAN card etc.5. To remove, study and replace floppy disk drive.6. To remove, study and replace hard disk.7. To remove, study and replace CD ROM drive.8. To study monitor, its circuitry and various presents and some elementary fault detection.9. To study printer assembly and elementary fault detection of DMP and laser printers.10. To observe various cables and connectors used in networking.11. To study parts of keyboard and mouse.12. To assemble a PC.13. Troubleshooting exercises related to various components of computer like monitor,

drives, memory and printers etc.

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,

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

84

DETAILED SYLLABUS SEMESTER-4th

CSE-211 THEORY OF COMPUTATION L (3) T (1) P (-)




Section-AFinite Automata and Regular Expressions: Finite State Systems, Basic Definitions Non-Deterministic finite automata (NDFA), Deterministic finite automata (DFA), Equivalence ofDFA and NDFA Conversion of NFA to DFA Finite automata with E- moves, RegularExpressions, Equivalence of finite automata and Regular Expressions, Regular expressionconversion and vice versa.Introduction to Machines: Concept of basic Machine, Properties and limitations of FSM.Moore and mealy Machines, Equivalence of Moore and Mealy machines, state and proveArden‟s Method.

Section-BProperties of Regular Sets: The Pumping Lemma for Regular Sets, Applications of thepumping lemma, Closure properties of regular sets, Myhill-Nerode Theorem andminimization of finite Automata, Minimization Algorithm.Grammars: Definition, Context free and Context sensitive grammar, Ambiguity regulargrammar, Reduced forms, Removal of useless Symbols, unit production and null productionChomsky Normal Form (CNF), Griebach Normal Form (GNF).

Section-CPushdown Automata: Introduction to Pushdown Machines, Application of PushdownMachinesTuring Machines: Deterministic and Non-Deterministic Turing Machines, Design of T.M,Halting problem of T.M., PCP Problem.

Section-DChomsky Hierarchies: Chomsky hierarchies of grammars, Unrestricted grammars, Contextsensitive languages, Relation between languages of classes.Computability: Basic concepts, Primitive Recursive Functions.Text Book:

1. Introduction to automata theory, language & computations- Hopcroaft & O.D.Ullman,R Mothwani, 2001, AW

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

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

RamondGreenlaw and H. James Hoover, 1998, Harcourt India Pvt. Ltd..

85


CSE-212 SOFTWARE ENGINEERING L (3) T (1) P (-)




Section-AIntroduction: The process, software products, emergence of software engineering, evolvingrole of software, software life cycle models, Software Characteristics, Applications, Softwarecrisis.Software project management: Project management concepts, software process and projectmetrics Project planning, project size estimation metrics, project estimation Techniques,empirical estimation techniques, COCOMO- A Heuristic estimation techniques, staffing levelestimation, team structures, staffing, risk analysis and management, project scheduling andtracking.

Section-BRequirements Analysis and specification requirements engineering, system modeling andsimulation Analysis principles modeling, partitioning Software, prototyping: , Prototypingmethods and tools; Specification principles, Representation, the software requirementsspecification and reviews Analysis Modeling: Data Modeling, Functional modeling andinformation flow: Data flow diagrams, Behavioral Modeling; The mechanics of structuredanalysis: Creating entity/ relationship diagram, data flow model, control flow model, thecontrol and process specification; The data dictionary; Other classical analysis methods.System Design: Design concepts and principles: the design process: Design and softwarequality, design principles; Design concepts: Abstraction, refinement, modularity, softwarearchitecture, control hierarchy, structural partitioning, data structure, software procedure,information hiding; Effective modular design: Functional independence, Cohesion, Coupling;Design Heuristics for effective modularity; The design model; Design documentation.

Section-CArchitectural Design: Software architecture, Data Design: Data modeling, data structures,databases and the data warehouse, Analyzing alternative Architectural Designs ,architecturalcomplexity; Mapping requirements into a software architecture; Transform flow, Transactionflow; Transform mapping: Refining the architectural design.Testing and maintenance: Software Testing Techniques, software testing fundamentals:objectives, principles, testability; Test case design, white box testing, basis path testing:Control structure testing: Black box testing, testing for specialized environments,architectures and applications. Software Testing Strategies: Verification and validation, Unittesting, Integration testing,; Validation testing, alpha and beta testing; System testing:Recovery testing, security testing, stress testing, performance testing; The art of debugging,the debugging process debugging approaches. Software re-engineering , reverse engineering,restructuring, forward engineering.

86

Section-DSoftware Reliability and Quality Assurance :Quality concepts, Software quality assurance ,SQA activities; Software reviews: cost impact of software defects, defect amplification andremoval; formal technical reviews: The review meeting, review reporting and record keeping,review guidelines; Formal approaches to SQA; Statistical software quality assurance;software reliability: Measures of reliability and availability ,The ISO 9000 Quality standards:The ISO approach to quality assurance systems, The ISO 9001 standard, SoftwareConfiguration Management. Computer Aided software Engineering: CASE, building blocks,integrated case environments and architecture, repository.

Text Book:1. Software Engineering – A Practitioner‟s Approach, Roger S. Pressman, 1996, MGH.

Reference Books:1. Fundamentals of software Engineering, Rajib Mall, PHI2. Software Engineering by Ian sommerville, Pearson Edu, 5th edition, 1999, AW,3. Software Engineering – David Gustafson, 2002, T.M.H4. Software Engineering Fundamentals Oxford University, Ali Behforooz and Frederick

J. Hudson 1995 JW&S,

87


CSE-213 DATA BASE MANAGEMENT SYSTEM L (3) T (1) P (-)




Section - AIntroduction, Client Server Arch., E-R Diagram and KeysOverview of database Management System; Various views of data, data Models, Introductionto Database Languages. Advantages of DBMS over file processing systems, Responsibility ofDatabase Administrator,Introduction to Client/Server architecture, Three levels architecture of Database Systems, E-RDiagram (Entity Relationship), mapping Constraints, Keys, Reduction of E-R diagram intotables.

Section - BFile Organization and Relational Model and Calculus:Sequential Files, index sequential files, direct files, Hashing, B-trees Index files.Relational Model, Relational Algebra & various operations, Relational and Tuple calculus.

Section - CIntroduction to Query Languages:QLB , QBE, Structured query language – with special reference of (SQL of ORACLE),

integrity constraints, functional dependencies & NORMALISATION – (up to 4th

Normalforms), BCNF (Boyce – code normal forms)

Section - DIntroduction to Distributed Data processing, parallel Databases, data mining & datawarehousing, network model & hierarchical model, Introduction to transaction, properties oftransaction and life cycle of transaction, Introduction to Concurrency control and Recoverysystems., need of concurrency control and recovery system, problems in concurrenttransactions.Text Books:

• Database System Concepts by A. Silberschatz, H.F. Korth and S. Sudarshan, 3rdedition, 1997, McGraw-Hill, International Edition.

• Introduction to Database Management system by Bipin Desai, 1991, Galgotia Pub.Reference Books:

• Fundamentals of Database Systems by R. Elmasri and S.B. Navathe, 3rd edition, 2000,Addision-Wesley, Low Priced Edition.

• An Introduction to Database Systems by C.J. Date, 7th edition, Addison-Wesley, LowPriced 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.

88


CSE-214 E-COMMERCE L (3) T (1) P (-)




Section AIntroduction: Definition of Electronic Commerce, E-Commerce: technology and prospects,Incentives for engaging in electronic commerce, needs of E-Commerce, advantages andDisadvantages, framework, Impact of E-commerce on business, E-Commerce Models.Network Infrastructure for E- Commerce:Internet and Intranet based E-commerce- Issues, problems and prospects, NetworkInfrastructure, Network Access Equipments, Broadband telecommunication (ATM, ISDN,and FRAME RELAY).

Section B

Mobile Commerce: Introduction, Wireless Application Protocol, WAP technology, MobileInformation device.Web Security: Security Issues on web, Importance of Firewall, components of Firewall,Transaction security, Emerging client server, Security Threats, Network Security, Factors toConsider in Firewall design, Limitation of Firewalls.

Section C

Encryption: Encryption techniques, Symmetric Encryption: Keys and data encryptionstandard, Triple encryption, Secret key encryption; Asymmetric encryption: public andprivate pair key encryption, Digital Signatures, Virtual Private Network.

Section D

Electronic Payments: Overview, The SET protocol, Payment Gateway, certificate, digitalTokens, Smart card, credit card, magnetic strip card, E-Checks, Credit/Debit card based EPS,online Banking.EDI Application in business, E- Commerce Law, Forms of Agreement, Govt. policies andAgenda.

Text Book & Reference Books:1. Ravi Kalakota, Andrew Winston, “Frontiers of Electronic Commerce”, Addison- Wesley.2. Pete Lohsin , John Vacca “Electronic Commerce”, New Age International3. Goel, Ritendra “E-commerce”, New Age International4. Laudon, “E-Commerce: Business, Technology, Society”, Pearson Education5. Bajaj and Nag, “E-Commerce the cutting edge of Business”, TMH6. Turban, “Electronic Commerce 2004: A Managerial Perspective”, Pearson Education

89


CSE-215 COMPUTER NETWORKS L (3) T (1) P (-)




Section-AOSI Reference Model and Network Architecture: Introduction to Computer Networks,Example networks ARPANET, Internet, Private Networks, Network Topologies: Bus-, Star-,Ring-, Hybrid -, Tree -, Complete -, Irregular –Topology; Types of Networks : Local AreaNetworks, Metropolitan Area Networks, Wide Area Networks; Layering architecture ofnetworks, OSI model, Functions of each layer, Services and Protocols of each layer

Section-BTCP/IP: Introduction, History of TCP/IP, Layers of TCP/IP, Protocols, Internet Protocol,Transmission Control Protocol , User Datagram Protocol, IP Addressing, IP address classes,Subnet Addressing, Internet Control Protocols, ARP, RARP, ICMP, Application Layer,Domain Name System, Email – SMTP, POP,IMAP; FTP, NNTP, HTTP, Overview of IPversion 6.

Section-CLocal Area Networks: Introduction to LANs, Features of LANs, Components of LANs,Usage of LANs, LAN Standards, IEEE 802 standards, Channel Access Methods, Aloha,CSMA, CSMA/CD, Token Passing, Ethernet, Layer 2 & 3 switching, Fast Ethernet andGigabit Ethernet, Token Ring, LAN interconnecting devices: Hubs, Switches, Bridges,Routers, Gateways.Wide Area Networks: Introduction of WANs, Routing, Congestion Control, WANTechnologies, Distributed Queue Dual Bus (DQDB),

Section-DSynchronous Digital Hierarchy (SDH)/ Synchronous Optical Network (SONET),Asynchronous Transfer Mode (ATM), Frame Relay.,Wireless Links.Introduction to Network Management: Remote Monitoring Techniques: Polling, Traps,Performance Management, Class of Service, Quality of Service, Security management,Firewalls, VLANs, Proxy Servers, Introduction to Network Operating Systems: Client-Serverinfrastructure, Windows NT/2000.Text Book:

1. Computer Networks (3rd edition), Tanenbaum Andrew S., International edition, 1996.

Reference Books:1. Data Communications, Computer Networks and Open Systems (4th edition), Halsall

Fred, 2000,2. Addison Wesley, Low Price Edition.3. Business Data Communications, Fitzgerald Jerry,.

90


MBA-211 HUMAN RESOURCES MANAGEMENT L (2) T (1) P (-)

SECTION-AHuman Resources Management (HRM) : Meaning, Nature and Scope, Difference betweenHRM and Personnel Management, HRM functions and objectives, Evolution of HRMenvironment – external and internal.Human Resources Development in India: evolution and principles of HRD, HRD Vs.Personnel functions, Role of HR managers.Strategic Human Resource Management : Nature of Strategies and Strategic Management,Strategic Management Process – Environmental Scanning, Strategy Formulation,implementation and evaluation.

SECTION-BHuman Resources planning: Definition, purposes, processes and limiting factors; HumanResources Information system (HRIS): HR accounting and audit, Job Analysis – JobDescription, Job Specification.The systematic approach to recruitment: recruitment policy, recruitment procedures,recruitment methods and evaluation.The systematic approach to selection: the selection procedure, the design of application form,selection methods, the offer of employment, and evaluation of process.

SECTION-CTraining and Development: Purpose, Methods and issues of training and managementdevelopment programmes.Performance Appraisal: Definition, Purpose of appraisal, Procedures and Techniquesincluding 360 degree Performance Appraisal, Job Evaluation.Compensation Administration: Nature and Objectives of compensation, components of paystructure in India, Wage Policy in India – Minimum Wage, Fair Wage and Living Wage.Incentive Payments : Meaning and Definition, Prerequisites for an effective incentive system,Types and Scope of incentive scheme, Incentive Schemes in Indian Industries, FringeBenefits.

SECTION-DDiscipline and Grievance Procedures: Definition, Disciplinary Procedure, GrievanceHandling Procedure.Industrial Relations: Nature, importance and approaches of Industrial Relations.Promotion, Transfer and Separation: Promotion – purpose, principles and types; Transfer –reason, principles and types; Separation – lay-off, resignation, dismissal, retrenchment,Voluntary Retirement Scheme.

Text Books:1. Human Resources and Personal Management-K . Aswathappa-Tata McGraw Hill

Publishing Company Ltd.2. Personnel Management : C.B. Mamoria, Himalaya Publishing House.3. Organisational Behaviour – Dr. L.M Prasad (Sultan Chand & Sons)

Reference Books:1. Personnel Management & Industrial Relations : Dr. T.N. Bhagoliwal : Sahitya Bhawan

Agra.2. Personnel Management : V.G. Karnik, Jaico Publishing House.3. Personnel Management & Industrial Relation: Tripathi: Sultan, Chand & Sons.

91


CSE-261 DATABASE MANAGEMENT SYSTEMS LAB L (-) T (-) P (2)

I. Create a database and write the programs to carry out the following operation:1. Add a record in the database2. Delete a record in the database3. Modify the record in the database4. Generate queries5. Generate the report6. List all the records of database in ascending order.

II Develop two menu driven project for management of database system:1. Library information system

a. Engineeringb. MCA

2. Inventory control systema. Computer Labb. College Store

3. Student information systemc. Academicd. Finance

4. Time table development systeme. CSE, IT & MCA Departmentsf. Electrical & Mechanical Departments

Usage of S/w:1. VB, ORACLE and/or DB22. VB, MSACCESS3. ORACLE, D2K4. VB, MS SQL SERVER 2000

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

92


CSE-262 SOFTWARE ENGG. & TESTING LAB L (-) T (-) P (2)

EXPERIMENT-1Phases in software development project, overview, need, coverageof topicsEXPERIMENT-2 To assign the requirement engineering tasksEXPERIMENT-3 To perform the system analysis: Requirement analysis, SRSEXPERIMENT-4 To perform the function oriented diagram: DFD and StructuredchartEXPERIMENT-5 To perform the user’s view analysis: Use case diagramEXPERIMENT-6 To draw the structural view diagram: Class diagram, objectdiagramEXPERIMENT-7 To draw the behavioral view diagram: Sequence diagram,Collaboration diagramEXPERIMENT-8 To draw the behavioral view diagram: State-chart diagram, ActivitydiagramEXPERIMENT-9 To draw the implementation view diagram: Component diagramEXPERIMENT-10 To draw the environmental view diagram : Deployment diagramEXPERIMENT-11 To perform various testing using the testing tool unit testing,integration testing

93


CSE-263 COMPUTER NETWORKS LAB L (-) T (-) P (2)

This course provides students with hands on training regarding the design, troubleshooting,modeling and evaluation of computer networks. In this course, students are going toexperiment in a real test-bed networking environment, and learn about network design andtroubleshooting topics and tools such as: network addressing, Address Resolution Protocol(ARP), basic troubleshooting tools (e.g. ping, ICMP), IP routing (e,g, RIP), route discovery(e.g. traceroute), TCP and UDP, IP fragmentation and many others. Student will also beintroduced to the network modeling and simulation, and they will have the opportunity tobuild some simple networking models using the tool and perform simulations that will helpthem evaluate their design approaches and expected network performance.

94


CSE-301 DATA WAREHOUSING & DATA MINING L (3) T (1) P (-)




Section-A

Overview, Motivation (for Data Mining), Data Mining-Definition & Functionalities, DataProcessing, Form of Data Preprocessing, Data Cleaning: Missing Values, NoisyData,(Binning, Clustering, Regression, Computer and Human inspection),Inconsistent Data,Data Integration and Transformation. Data Reduction:-Data Cube Aggregation,Dimensionality reduction, Data Compression, Numerosity Reduction, Clustering,Discretization and Concept hierarchy generation

Section-B

Concept Description:- Definition, Data Generalization, Analytical Characterization, Analysisof attribute relevance, Mining Class comparisons, Statistical measures in large Databases.Measuring Central Tendency, Measuring Dispersion of Data, Graph Displays of BasicStatistical class Description, Mining Association Rules in Large Databases, Association rulemining, mining Single-Dimensional Boolean Association rules from TransactionalDatabases– Apriori Algorithm, Mining Multilevel Association rules from TransactionDatabases and Mining Multi-Dimensional Association rules from Relational Databases

Section-C

Classification and Predictions:What is Classification & Prediction, Issues regarding Classification and prediction, DecisionTree, Bayesian Classification, Classification by Back propagation, Multilayer feed-forwardNeural Network, Back propagation Algorithm, Classification methods K-nearest neighborClassifiers, Genetic Algorithm.Cluster Analysis:Data types in cluster analysis, Categories of clustering methods, Partitioning methods.Hierarchical Clustering- CURE and Chameleon, Density Based Methods-DBSCAN,OPTICS, Grid Based Methods- STING, CLIQUE, Model Based Method –StatisticalApproach, Neural Network approach, Outlier Analysis

95

Section-D

Data Warehousing: Overview, Definition, Delivery Process, Difference between DatabaseSystem and Data Warehouse, Multi Dimensional Data Model, Data Cubes, Stars, SnowFlakes,Fact Constellations, Concept hierarchy, Process Architecture, 3 Tier Architecture,Data Marting.Aggregation, Historical information, Query Facility, OLAP function and Tools. OLAPServers, ROLAP, MOLAP, HOLAP, Data Mining interface, Security, Backup and Recovery,Tuning Data Warehouse, Testing Data Warehouse.

Books:

1. M.H.Dunham,”Data Mining:Introductory and Advanced Topics” PearsonEducation2. Jiawei Han, Micheline Kamber, ”Data Mining Concepts & Techniques” Elsevier3. Sam Anahory, Dennis Murray, “Data Warehousing in the Real World : A Practical Guidefor Building Decision Support Systems, Pearson Education4. Mallach,”Data Warehousing System”,McGraw –Hill

96


CSE-302 OPERATING SYSTEM L (3) T (1) P (-)




Section-AIntroduction: Introduction to Operating System Concepts (including Multitasking,multiprogramming, multi user, Multithreadingetc)., Types of Operating Systems: Batch operating system, Time-sharing systems,Distributed OS, Network OS, Real Time OS; Various Operating system services,architecture, System programs and calls.Process Management: Process concept, process scheduling, operation on processes; CPUscheduling, scheduling criteria, scheduling algorithms -First Come First Serve (FCFS),Shortest-Job-First (SJF), Priority Scheduling, Round Robin(RR), Multilevel QueueScheduling.

Section-BMemory Management: Logical & Physical Address Space, swapping, contiguous memoryallocation, non-contiguous memory allocation paging and segmentation techniques,segmentation with paging; virtual memory management - Demand Paging & Page-Replacement Algorithms; Demand Segmentation.

Section-CFile System: Different types of files and their access methods, directory structures, variousallocation methods, disk scheduling and management and its associated algorithms,Introduction to distributed file system.Process-Synchronization & Deadlocks: Critical Section Problems, semaphores; methodsfor handling deadlocks-deadlockprevention, avoidance & detection; deadlock recovery.

Section - DI/O Systems: I/O Hardware, Application I/O Interface, Kernel, Transforming I/O requests,Performance Issues and ThresdsUnix System And Windows NT OverviewUnix system call for processes and file system management, Shell interpreter, Windows NTarchitecture overview, Windows NT file system.Text Books:

1. Operating System Concepts by Silberchatz et al,5th

edition, 1998, Addison-Wesley.2. Modern Operating Systems by A. Tanenbaum, 1992, Prentice-Hall. Th3. Operating Systems Internals and Design Principles by William Stallings,4 edition,2001, Prentice-Hall4. Operating System By Peterson , 1985, AW. Operating System By Milankovic, 1990,

TMH.

97


ECE-301 MICROPROCESOR & ITS APPLICATIONS L (3) T (1) P (-)




Section-AIntroduction to Microprocessor, Microprocessor architecture and its operations, Memory,Input & output devices, Logic devices for interfacing, The 8085 MPU, Example of an 8085based computer, Memory interfacing.Basic interfacing concepts, Interfacing output displays, Interfacing input devices, Memorymapped I/O, Flow chart symbols, Data Transfer operations, Arithmetic operations, LogicOperations, Branch operation, Writing assembly language programs, Programmingtechniques: looping, counting and indexing

Section-BAdditional data transfer and 16 bit arithmetic instruction, Arithmetic operations related tomemory, Logic operation: rotate, compare, counter and time delays, Illustrative program:Hexadecimal counter, zero-to-nine, (module ten) counter, generating pulse waveforms,debugging counter and time delay, Stack, Subroutine, Restart, Conditional call and returninstructions, Advance subroutine concepts, The 8085 Interrupts, 8085 vector interrupts

Section-CProgram: BCD-to-Binary conversion, Binary-to-BCD conversion, BCD-to- Seven segmentcode converter, Binary-to-ASCII and ASCII-to-Binary code conversion, BCD Addition, BCDSubtraction, Introduction to Advance instructions and Application, Multiplication,Subtraction with carry.

Section-D8255 Programmable peripheral interface, interfacing keyboard and seven segment display,8254 (8253) programmable interval timer, 8259A programmable interrupt controller, DirectMemory Access and 8237 DMA controller. Introduction to 8086 microprocessor:Architecture of 8086 (Pin diagram, Functional block diagram, Register organization).TEXT BOOKS :

1. Microprocessor Architecture, Programming & Applications with 8085 : Ramesh SGaonkar; Wiley Eastern Ltd.

2. The Intel Microprocessors 8086- Pentium processor : Brey; PHI

REFERENCE BOOKS:1. Microprocessors and interfacing : Hall; TMH2. The 8088 & 8086 Microprocessors-Programming, interfacing,Hardware &

Applications :Triebel & Singh; PHI3. Microcomputer systems: the 8086/8088 Family: architecture, Programming & Design :

Yu-Chang Liu & Glenn A Gibson; PHI.4. Advanced Microprocessors and Interfacing : Badri Ram; TMH

98


CSE-303 COMPLIER DESIGN L (3) T (1) P (-)




SECTION A

Introduction to Compilers:Need for translators – Structure of a compiler – Error handling –Compiler writing tools.

Lexical Analysis:

The role of lexical analyze – Design – Languages for specifying lexical analyzerimplementation.

SECTION BParsing:Parsers – Shift reduce parsers – Operator Precedence parsing – Top down

Parsing – Predictive parsers.

Automatic Construction of Efficient Parsers:

LR Parsers – Construction SLR, Canonical LR and LALR Parsing tables –

Automatic parser generation – Implementation of LR parsing tables.

SECTION CSyntax Directed Translation:

Schemes – Implementation – Intermediate code – Parse trees and syntax trees – ThreeAddress code – Quadruples and triples – Translation of assignment statements – Booleanexpressions.Symbol tables and runtime storage:

Contents of Symbol table – Data structures for symbol table – Representation of scopeinformation – Implementation of stack allocation schemes – Block Structured languages andstorage allocation.

SECTION DIntroduction to Code Optimization:Principal sources – Loop optimization – Global data flow analysis.Code Generation:Object program – Problems in code generation – A simple code generator -Register allocation and assignment.

99

Text Books:

Alfred V.Aho & Jeffrey D. Ullman : PRINCIPLES OF COMPILER DESIGN; Narosa PublishingHouse, 1990

References:

1. Alfred V. Aho et.al. : COMPILERS:PRINCIPLES, TECHNIQUES AND

TOOLS; Addison Wesley Publishing Company, 1986

2. Dhamdhere D.M.: COMPILER CONSTRUCTION-PRINCIPLES AND PRACTICE;McMillan India Ltd.

1. Ravi Sethi & Ullman: COMPILER DESIGN; Narosa Publishing House.2. David Gries :COMPILER CONSTRUCTION FOR DIGITALCOMPUTERS; John Wiley

&Sons

100


CSE-304 WEB DEVELOPMENT L (3) T (1) P (-)




Section AJAVA: Introduction to JAVA, Basics Data Types, Operators, Classes and Methods, AccessSpecifiers, Arrays, Inheritance, Polymorphism, Threads, Package and Interfaces, ExceptionHandling, IO Applets, Generics and Collections

Section BBasic terms: WWW, XML, HTML, XHTML, W3C.Descriptive markup: Meta tags for common tasks, semantic tags for aiding search, thedoubling code and RDF. Separating style from structure with style sheets: Internal stylespecifications within HTML, External linked style specification using CSS, page and sitedesign considerations.Client side programming: Introduction to the JavaScript syntax, the JavaScript objectmodel, Event handling, Output in JavaScript, Forms handling, miscellaneous topics such ascookies, hidden fields, and images; Applications.

Section CServer side programming: Introduction to Server Side Technologies CGI/ASP/JSP.,Programming languages for server Side Scripting, Configuring the server to support CGI, itsapplications; Input /output operations on the WWW. Forms processing, (using PERL /VBScript / JavaScript)

Section DOther dynamic content Technologies: Introduction to ASP & JSP, Delivering multimediaover web pages, The VRML idea, The Java phenomenon-applets and Servlets, issues andweb development.Introduction to Microsoft .NET Technology and its comparison with the competingTechnologiesText Books:

1. JAVA: The Complete Reference, Herbert Schildt2. Beginning XHTML by Frank Boumpery, Cassandra Greer, Dave Raggett, Jenny

Raggett, Sebastian Schnitzenbaumer & ted Wugofski, 2000, WROX press (IndianShroff Publ. SPD) 1st edition

3. HTML & XHTML: The Definitive Guide by Chuck Musciano, Bill Kennedy, 2000,4th Edi.

Reference books:1. XHTML Black Book by Steven Holzner, 20002. CGI Programming on the World Wide Web. O’Reilly Associates.3. Web Technologies By Achyut S Godbole , Atul Kahate, 2003, T.M.H

101


MBA-301 MANEGERIAL ECONOMICS L (2) T (1) P (-)




Section-AIntroduction to Economics; Nature and Scope of Management Economics, Significance indecision-making and fundamental concepts. Objectives of a firm.

Section-BDemand Analysis; Law of Demand, Exceptions to the law of Demand, Determinants ofDemand. Elasticity of Demand- Price, Income, Cross and Advertising Elasticity; Uses ofElasticity of Demand for managerial decision making, measurement of Elasticity of Demand.Demand forecasting meaning, significance and methods.Supply Analysis; Law of Supply, Supply Elasticity; Analysis and its uses for managerialdecision making.Production concepts & analysis; Production function, single variable-law of variableproportion, two variable-Law of returns to scale.Cost concept and analysis, short-run and long-run cost curves and its managerial use.

Section-CMarket Equilibrium and Average Revenue Concept.Market Structure: Perfect Competition, features, determination of price under perfectcompetition.Monopoly: Feature, pricing under monopoly, Price Discrimination.Monopolistic: Features, pricing under monopolistic competition, product differentiation.Oligopoly: Features, kinked demand curve, cartels, price leadership.Pricing Strategies; Price determination, full cost pricing, product line pricing, priceskimming, penetration pricing.

Section-DNational Income; Concepts and various methods of its measurement, Inflation, types andcauses, Business Cycle, Profit concept and major theories of profits; Dynamic Surplus theory,Risk & Uncertainty bearing theory and Innovation theory.

Text Books:1. Principles of Economics : P.N. Chopra (Kalyani Publishers).2. Modern Economic Theory – K.K. Dewett (S.Chand)Reference Books :1. A Text Book of Economic Theory Stonier and Hague (Longman’s Landon)2. Micro Economic Theory – M.L. Jhingan (S.Chand)

102


CSE-351 OPERATING SYSTEM LAB L (-) T (-) P (2)

Study of WINDOWS 2000 Operating System.

Administration of WINDOWS 2000 (including DNS,LDAP, Directory Services)

Study of LINUX Operating System (Linux kernel, shell, basic commands pipe& filter

Administration of LINUX Operating System.

Writing of Shell Scripts (Shell programming).

AWK programming.

103


CSE-352 WEB DEVELOPMENT & CORE JAVA LAB L (-) T (-) P (2)

Java programs using classes & objects and various control constructs such as loops etc , anddata structures such as arrays , structures and functions.

Java programs for creating Applets for display of Images ,Texts and Animation Programsrelated to interfaces & packages

Input output & Random files programs in java Java programs using Event driven conceptPrograms related to

Network ProgrammingDevelopment of Web site for the college or newspaper agency.

Books recommended for Lab.1. Java Elements – Principles of Programming in Java , Duane A. Bailey , Duane W.

Bailey, 2000, T.M.H2. The Java Handbook by Patrick Naughton, TMH, N.Delhi

104


ECE-351 MICROPROCESSOR LAB L (-) T (-) P (2)

List of Experiments:-1.Simple programs for sorting a list of numbers in ascending and descending order.2. To find the largest and smallest number in an array of data using 8085 instruction set.3. Sorting a list without destroying the original list.4. Code conversion - Binary to Gray/Gray to Binary.5. Program for addition of BCD numbers.6. Program for multiplication of 8-bit numbers .7. Interface an LED array and 7-segment display through 8255 and display a specified bitpattern/character sequence at an interval of 2 seconds.8. Interface the given microprocessor kit to a personal computer through R.S-232C. The bandrate is specified. Verify data transfer in both directions ( P - PC and PC - P)9. Assembly language programming of 8086

Note:At least ten experiments have to be performed in the semester out of which sevenexperiments should be performed from above list.

Remaining three experiments may either be performed from the above list or designed & setby the concerned institution as per the scope of the syllabus of EE-309-C.

105


CSE-311 ANALYSIS & DESIGN OF ALGORITHM L (3) T (1) P (-)




Section-ABrief Review of Graphs, Sets and disjoint sets, union, sorting and searching algorithms andtheir analysis in terms of space and time complexity.Divide and Conquer: General method, binary search, merge sort, qick sort, selection sort,Strassen‟s matrix multiplication algorithms and analysis of algorithms for these problems.

Section-BGreedy Method: General method, knapsack problem, job sequencing with dead lines,minimum spanning trees, single souce paths and analysis of these problems.Dynamic Programming: General method, optimal binary search trees, O/I knapsack, thetraveling salesperson problem.

Section-CBack Tracking: General method, 8 queen‟s problem, graph colouring, Hamiltonian cycles,analysis of these problems.Branch and Bound: Method, O/I knapsack and traveling salesperson problem, efficiencyconsiderations. Techniques for algebraic problems, some lower bounds on parallelcomputations.

Section-DNP Hard and NP Complete Problems: Basic concepts, Cook‟s theorem, NP hard graph andNP scheduling problems some simplified NP hard problems.Text Books:

1. Fundamental of Computer algorithms, Ellis Horowitz and Sartaj Sahni, 1978, GalgotiaPubl.

2. Introduction To Algorithms, Thomas H Cormen, Charles E Leiserson And Ronald LRivest: 1990, TMH

Reference Books:1. The Design and Analysis of Computer Algorithm, Aho A.V. Hopcroft J.E., 1974,

Addison Wesley.2. Algorithms-The Construction, Proof and Analysis of Programs, Berlion, P.Bizard, P.,

1986. Johan Wiley & Sons,3. Writing Efficient Programs, Bentley, J.L., PHI4. Introduction to Design and Analysis of Algorithm, Goodman, S.E. & Hedetnieni, 1997,

MGH.5. Introduction to Computers Science- An algorithms approach , Jean Paul Trembley,

Richard B.Bunt, 2002, T.M.H.

106


ECE-311 DIGITAL IMAGE PROCESSING L (3) T (1) P (-)

SECTION – AIntroduction and FundamentalsMotivation and Perspective, Applications, Components of Image Processing System, Elementof Visual Perception, a Simple Image Model, Sampling and Quantization.Image Enhancement in Frequency DomainFourier Transform and the Frequency Domain, Basis of Filtering in Frequency Domain,Filters –Low-pass, High-pass; Correspondence between Filtering in Spatial and FrequencyDomain; Smoothing Frequency Domain Filters – Gaussian Low pass Filters; SharpeningFrequency Domain Filters – Gaussian High pass Filters; Homomorphism Filtering.

SECTION – BImage Enhancement in Spatial DomainIntroduction; Basic Gray Level Functions – Piecewise-Linear Transformation Functions:Contrast Stretching; Histogram Specification; Histogram Equalization; Local Enhancement;Enhancement using Arithmetic/Logic Operations – Image Subtraction, Image Averaging;Basics of Spatial Filtering; Smoothing - Mean filter, Ordered Statistic Filter; Sharpening –The Laplacian.

SECTION – CImage RestorationA Model of Restoration Process, Noise Models, Restoration in the presence of Noise only-Spatial Filtering – Mean Filters: Arithmetic Mean filter, Geometric Mean Filter, OrderStatistic Filters –Median Filter, Max and Min filters; Periodic Noise Reduction by FrequencyDomain Filtering –Band pass Filters; Minimum Mean-square Error Restoration.Morphological Image ProcessingIntroduction, Logic Operations involving Binary Images, Dilation and Erosion, Opening andClosing, Morphological Algorithms – Boundary Extraction, Region Filling, Extraction ofConnected Components, Convex Hull, Thinning, Thickening

SECTION – DRegistrationIntroduction, Geometric Transformation – Plane to Plane transformation, Mapping, StereoImaging –Algorithms to Establish Correspondence, Algorithms to Recover DepthSegmentationIntroduction, Region Extraction, Pixel-Based Approach, Multi-level Thresholding, LocalThresholding, Region-based Approach, Edge and Line Detection: Edge Detection, EdgeOperators, Pattern Fitting Approach, Edge Linking and Edge Following, Edge ElementsExtraction by Thresholding, Edge Detector Performance, Line Detection, Corner Detection.

Text Books:1. Digital Image Processing 2ndEdition, Rafael C. Gonzalvez and Richard E. Woods.Publishedby: Pearson Education.2. Digital Image Processing and Computer Vision, R.J. Schalkoff. Published by: JohnWiley and Sons, NY.3. Fundamentals of Digital Image Processing, A.K. Jain. Published by Prentice Hall,Upper Saddle River, NJ.

107


CSE-312 COMPUTER GRAPHICS L (3) T (1) P (-)




Section-AIntroduction to Computer Graphics: What is Computer Graphics, Computer GraphicsApplications, Computer Graphics Hardware and software, Two dimensional GraphicsPrimitives: Points and Lines, Line drawing algorithms: DDA, Bresenham‟s; Circle drawingalgorithms: Using polar coordinates, Bresenham‟s circle drawing, mid point circle drawingalgorithm; Filled area algorithms: Scanline: Polygon filling algorithm, boundary filledalgorithm.

Section-BTwo/Three Dimensional Viewing: The 2-D viewing pipeline, windows, viewports, windowto view port mapping; Clipping: point, clipping line (algorithms):- 4 bit code algorithm,Sutherland-cohen algorithm, parametric line clipping algorithm (Cyrus Beck).Polygon clipping algorithm: Sutherland-Hodgeman polygon clipping algorithm. Twodimensional transformations: transformations, translation, scaling, rotation, reflection,composite transformation.

Section-CThree-dimensional transformations: Three dimensional graphics concept, Matrixrepresentation of 3-D Transformations, Composition of 3-D transformation.Viewing in 3D: Projections, types of projections, the mathematics of planner geometricprojections, coordinate systems.Hidden surface removal: Introduction to hidden surface removal. The Z- buffer algorithm,scanline algorithm, area sub-division algorithm.

Section-DRepresenting Curves and Surfaces: Parametric representation of curves: Bezier curves, B-Spline curves. Parametric representation of surfaces; Interpolation method.Illumination, shading, image manipulation: Illumination models, shading models forpolygons, shadows, transparency. What is an image? Filtering, image processing, geometrictransformation of images.Text Books: & Reference Books:

1. Computer Graphics Principles and Practices second edition by James D. Foley,Andeies van Dam, Stevan K. Feiner and Johb F. Hughes, 2000, Addision Wesley.

2. Computer Graphics by Donald Hearn and M.Pauline Baker, 2nd

Edition, 1999, PHI3. Procedural Elements for Computer Graphics – David F. Rogers, 2001, T.M.H Second

Edition Fundamentals of 3Dimensional Computer Graphics by Alan Watt, 1999,Addision Wesley. Computer Graphics: Secrets and Solutions by Corrign John, BPB

108


CSE-313 ADVANCED JAVA L (3) T (1) P (-)




SECTION-A

Core JavaIntroduction to Java, Data types, variables, operators, Arrays, Control Statements, Classes &Methods, Inheritance, Exception Handling, Multithreading, Collections, I/O streams, AVVT& Apolet Programming.

NetworkingConnecting to a Server, Implementing Servers, Sending E-Mail, Making URL Connections,Advanced Socket Programming

SECTION-B

Database NetworkingThe Design of JDBC. The Structured Query Language, JDBC Installation, Basic JDBCProgramming Concepts, Query Execution, Scrollable and Updatable Result Sets, Matadata,Row Sets, Transactions, Advanced Connection Management, Introduction of LDAP

Distributed Objects

The Roles of Client and Server, Remote Method Invocations, Setup for Remote MethodInvocation, Parameter Passing in Remote Methods Server Object Activation, Java IDL andCCRA, Remote Method Calls with SOAP

SECTION-C

Swing

Lists, Trees, Tables, Styled Text Components, Progress Indicators, Component Organizers

AWT

The Rendering Pipeline, Shapes, Areas, Strokes, Paint, Coordinate Transformations,Clipping, Transparency and Composition, Rendering Hints, Readers and Writers for Images,Image Manipulation, Printing. The Clipboard, Drag and Drop

109

SECTION-D

Javabeans Components

Beans, The Bean-Writing Process, Using Beans to Build an Application, Naming Patterns forBean Components and Events Bean Property Tubes Beaninfo Classes Property EditorsCuatomizes

Security

Class Loaders, Bytecode Verification, Security Managers and Permissions, DigitalSignatures, Code Signing, Encryption

Text Book:

Core JavaTM

2, Volume II-Advanced Features, 7th

Edition by Cay Horetmann, Gary CornelllPearson Publisher, 2004

Reference Books:

1. Professional Java Programming by Brett Spell, WROX Publication

2. Advanced Java 2 Platform, How to Program, 2nd

Edition, Harvey. M. Dietal, PrenticeHall

110


MBA-311 PRINCIPLE OF MANAGEMENT L (2) T (1) P (-)




Section-AManagement: Concept, Nature, Importance; Management: Art and Science, Management Asa Profession, Management Vs. Administration, Management Skills, Levels of Management,And Characteristics of Quality Managers. Evolution of Management: Early contributions,Taylor and Scientific Management, Fayol’s Administrative Management, Bureaucracy,Hawthorne Experiments and Human Relations, Social System Approach, Decision TheoryApproach. Social Responsibility of Managers and Ethics in Managing.

Section-BIntroduction to Functions of Management Planning: Nature, Scope, Objectives andSignificance of Planning, Types of Planning, Process of Planning, Barriers to EffectivePlanning, Planning Premises and Forecasting, Key to Planning, Decision Making.Organizing: Concept, Organization Theories, Forms of Organizational Structure, CombiningJobs: Departmentation, Span of Control, Delegation of Authority, Authority &Responsibility, and Organizational Design.

Section-CStaffing: Concept, System Approach, Manpower Planning, Job Design, Recruitment &Selection, Training & Development, Performance Appraisal Directing: Concept, Directionand Supervision Motivation: Concept, Motivation and Performance, Special Motivationaltechniques: Money, participation, reward systems, Quality of Work Life, Job Enrichment &Morale Building.

Section-DLeadership: Concept and Functions, Process and models of Leadership Development,Contemporary views on Leadership: Transformational-Transactional, Charismatic-Visionaryleadership. Controlling: Concept, Types of Control, Methods: Pre-control: ConcurrentControl: Post-control, An Integrated Control System, The Quality Concept Factors affectingQuality, Developing a Quality Control System, Total Quality Control, Pre-control of Inputs,Concurrent Control of Operations. Post Control of Outputs.Reference Books:

1. Stoner, Freeman & Gilbert Jr - Management (Prentice Hall of India, 6Th Edition)2. Koontz Harold & Weihrich Heinz – Essentials of management (Tata Mc Graw Hill, 5th

Edition 2008)3. Robbins & Coulter - Management (Prentice Hall of India, 9th Edition)4. Robbins S.P. and Decenzo David A. - Fundamentals of Management: Essential

Concepts and Applications (Pearson Education, 6th Edition)5. Weihrich Heinz and Koontz Harold - Management: A Global and Entrepreneurial

Perspective (McGraw Hill, 12th Edition 2008)

111


CSE-314 SYSTEM ADMINISTRATION (UNIX) L (3) T (1) P (-)




Section AIntroduction to LINUX and UNIX, Architecture of UNIX operating system, System Structure,User perspective, Essential tasks of system administrator, LINUX installation

Booting and shutting down : Boot strapping /Booting/Boot Loaders (LILO, GRUB), bootingsingle user mode, rebooting and shutting down

System Management : Super user, choosing root password, system configuration, systemdirectories & files, Performance analysis tools & processes

Section BUser management : Password files, managing user environment, adding user, removing user,login access, disabling user, account management utilities, managing groups, light weightdirectory access protocol.File Management : Path names, mounting and unmounting filessystems, file tree, file types, file attributes, configuring RAID devices,

Process management: components of a process, (PID, PPID, UID, EUID,) signals, sendsignals, (kill, killall), process states, nice and renice, monitor processes, (ps, top), runwayprocesses

Section CAdding a Disk : Disk interfaces, disk installation procedure, ext2 and ext3 filesystems,FSCK(check and repair file systems), Adding a disk to linux

Devices and printer : serial standard, alternative connectors, hard and soft carriers, serialdevice files, software configuration for serial devices, configuration of hardware terminals,special character and terminal drivers, modems, common I/O ports multimedia devices(sound,video and DVD ), installing sound, network & other cards

Section DBackup devices and media ,setting up backup using dump, restore.System and Log files:logging policies, LINUX LOG files, LOGROTATE, SYSLOG, condensing log files to usefulinformation. Kernal Administration: precautionary steps for modifying kernel, kernaladaptation, configuration methods, building a LINUX kernel

112

TEXT BOOKS:

1. Richard L. Petersen " LINUX the complete reference "

2. Maurice J. Bach " The design of UNIX operating System "

3. Evi Nemath, Garth Snyder , Trent R Hein " Linux Administration Hand Book "

REFERENCE BOOKS:-1. “The UNIX programming Environment “Brain Kernighem & Rob Pike2. “Introduction to UNIX & LINUX “ John Muster3. Advanced UNIX programmer’s Guide “ Stephen Prato4. “UNIX concepts & Applications Featuring SCO UNIX & LINUX “ 2nd Ed. Sumitabha

D

113


CSE-361 ADVANCED JAVA LAB L (-) T (-) P (2)

Development of programs relating to:

• JDBC

• Servlets

• Beans

• RMI

• JSP

114


ECE-361 DIGITAL IMAGE PROCESSING L (-) T (-) P (2)

The following programs should be developed in ‘C’ language preferably on ‘UNIX‘platform.The graphical development environment can be created using some appropriate library like‘OpenGL’:1. Implement the spatial image enhancement functions on a bitmap image –(a) Mirroring (Inversion) (b) Rotation(Clockwise) (c) Enlargement (Double Size)

2. Implement (a) Low Pass Filter (b) High Pass Filter

3. Implement (a) Arithmetic Mean Filter (b) Geometric Mean Filter

4. Implement Smoothing and Sharpening of an eight bit color image

5. Implement (a) Boundary Extraction Algorithm (b) Graham's Scan Algorithm

6. Implement (a) Edge Detection (b) Line Detection

115


CSE-362 COMPUTER GRAPHICS LAB L (-) T (-) P (2)

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

transformation.7. Write a program for rotation of a 3D object about arbitrary axis.8. Write a program for Hidden surface removal from a 3D object.

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

116


CSE-401 ARTIFICAL INTELLIGENCE & EXPERT SYSTEM L (3) T (1) P (-)




SECTION-AIntroduction to Artificial intelligence: Scope, history & applications: AI asrepresentation and search the predicate calculus inference rules. Logic based financialadvisor, structures and strategies for state space search graph theory, strategies forspace search, using state space to represent reasoning with the predicate calculus.

Heuristic Search: An algorithm for heuristic search, admissibility monotonicity andinformed ness heuristics in games, complexity issues, control and implementation ofstate space search recursion based search, pattern directed search. Production systems,predicate calculus and planning the black board architecture for problems solving.

SECTION-BLISP and PROLOG: Knowledge representation languages issues in knowledgerepresentation, network representation language, structured representations,introduction to LISP, Search in LISP: a functional approach to the farmer, Wolf, Goatand cabbage problem, higher order functions & procedural abstraction, searchstrategies in LIPS.

SECTION-CExpert systems: Introduction, History basic concepts, structure of expert systems, thehuman element in ES how ES works, problem areas addressed by ES, ES successfactors, types of expert systems, ES and the internet interacts web, knowledgeengineering, scope of knowledge, difficulties, in knowledge acquisition methods ofknowledge acquisition, machine learning, intelligent agents, selecting an appropriateknowledge acquisition method, knowledge acquisition form multiple expertsvalidation and verification of the knowledge base, analyzing coding, documenting &diagramming.

SECTION-DExpert systems- II, societal impacts reasoning in artificial intelligence, inference withrules, with frames: model based reasoning, case based rezoning, explanation & metaknowledge inference with uncertainty representing uncertainty probabilities andrelated approaches, theory of certainty (certainty factors) Qualitative reasoning, thedevelopment life cycle, phases I, II, III, IV, V, VI the future of expert systemdevelopment process societal impacts.

117

Text Books:

1. Efrain Turban and Jay E Aranson: Decision support systems & intelligent systems (5thEdn.) Prentice hall, 1998.

2. Donald A Waterman: A Guide to expert Systems, Addison -Wesley 1995

3. G.F. Luger & W.A Stubble Field -Artificial Intelligence structures and Strategies forcomplex problem solving, 3 rd Edn. Addision Wesley 1998.

4. E.Rich and Knight, Artificial Intelligence, Second Edn, Tata Mc. Graw Hill Publishing,1981.

118


CSE-405 SOFTWARE PROJECT MANAGEMENT L (3) T (1) P (-)




SECTION-AIntroduction to Software Project Management (SPM): Definition of a Software Project(SP), SP Vs. other types of projects activities covered by SPM, categorizing SPs, project as asystem, management control, requirement specification, information and control inorganization.Stepwise Project planning: Introduction, selecting a project, identifying project scope andobjectives, identifying project infrastructure, analyzing project characteristics, identifyingproject products and activities, estimate efforts each activity, identifying activity risk, allocateresources, review/ publicize plan.

SECTION-BProject Evaluation & Estimation: Cost benefit analysis, cash flow forecasting, cost benefitevaluation techniques, risk evaluation. Selection of an appropriate project report; Choosingtechnologies, choice of process model, structured methods, rapid application development,water fall-, V-process-, spiral- models. Prototyping, delivery. Albrecht function pointanalysis.Activity planning & Risk Management: Objectives of activity planning, project schedule,projects and activities, sequencing and scheduling activities, network planning model,representation of lagged activities, adding the time dimension, backward and forward pass,identifying critical path, activity throat, shortening project , precedence networks.Risk Management: Introduction, the nature of risk, managing risk, risk identification, riskanalysis, reducing the risks, evaluating risks to the schedule, calculating the z values..

SECTION-CResource allocation &Monitoring the control: Introduction, the nature of resources,identifying resource requirements, scheduling resources creating critical paths, counting thecost, being specific, publishing the resource schedule, cost schedules, the schedulingsequence.Monitoring the control: Introduction, creating the frame work, collecting the data,visualizing progress, cost monitoring, earned value, prioritizing monitoring, getting theproject back to target, change control.Managing contracts and people: Introduction, types of contract, stages in contract,placement, typical terms of a contract, contract management, acceptance, Managing peopleand organizing terms: Introduction, understanding behavior, organizational behavior: a background, selecting the right person for the job, instruction in the best methods, motivation,working in groups, becoming a team, decision making, leadership, organizational structures,conclusion, further exercises..

119

SECTION-DSoftware quality: Introduction, the place of software quality in project planning, theimportance of software quality, defining software quality, ISO 9126, Practical softwarequality measures, product versus process quality management, external standards, techniquesto help enhance software quality.Study of Any Software Project Management software: viz Project 2000 or equivalent

Text Book:• Software Project Management (2

ndEdition), by Bob Hughes and Mike Cotterell, 1999,

TMH

Reference Books:• Software Engineering – A Practitioner’s approach, Roger S. Pressman (5

thedi), 2001,

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

120


CSE-402 .NET TECHNOLOGY L (3) T (1) P (-)




SECTION-A

Introduction to .NET Technology, Introduction to VB.NET, Software development andVisual Basic .NET, Visual Basic .NET and .NET frame.

Visual Basic fundamentals: The Visual Basic .NET Development Environment, The elementof VB.NET, VB.NET operators, Software design, Conditional structure and control flow,Methods.

SECTION-B

Classes and Objects: Types, Structure and Enumeration, Classes, Interfaces, Exceptionhandling and Classes, Collections, Arrays and other Data Structure.

SECTION-C

Advance design concepts, Patterns, Roles and Relationships, Advanced Interface Patterns:Adapters and Delegates and Events Data Processing and I/O.

SECTION-D

Writing Software with Visual Basic .NET, Interfacing with the End User, Introduction toASP.NET and C#.NET and their features.

BOOKS1. Jeffrey R. Shapiro “The Complete Reference Visual Basic .NET” Tata Mcgraw Hill(2002 Edition).

2. Rox “Beginner and Professional Edition VB.NET” Tata Mcgraw Hill.

3. Steven Holzner “Visual Basic .NET Black Book” Wiley Dreamtech Publication.

4. Alex Homer, Dave Sussman “Professional ASP.NET1.1” Wiley Dreamtech

5. Bill Evzen,Bill Hollis “Professional VB.NET 2003” Wiley Dreamtech

6. Tony Gaddis “Starting Out VB.NET PROG.2nd Edition” Wiley Dreamtech

121


CSE-403 NEURAL NETWORKS L (3) T (1) P (-)




SECTION-A

Overview of biological neurons: Structure of biological neurons relevant to ANNs.Fundamental concepts of Artificial Neural Networks: Models of ANNs; Feedforward &feedback networks; learning rules; Hebbian learning rule, perception learning rule, deltalearning rule, Widrow-Hoff learning rule, correction learning rule, Winner –lake all elarningrule, etc.

SECTION-BSingle layer Perception Classifier: Classification model, Features & Decision regions;training & classification using discrete perceptron, algorithm, single layer continuousperceptron networks for linearlyseperable classifications.Multi-layer Feed forward Networks: linearly non-seperable pattern classification, Deltalearning rule for multi-perceptron layer, Generalized delta learning rule, Error back-propagation training, learning factors, Examples.

SECTION-CSingle layer feed back Networks: Basic Concepts, Hopfield networks, Training &Examples.Associative memories: Linear Association, Basic Concepts of recurrent Auto associativememory: rentrieval algorithm, storage algorithm; By directional associative memory,Architecture, Association encoding & decoding, Stability.

SECTION-DSelf organizing networks: UN supervised learning of clusters, winner-take-all learning,recall mode, Initialisation of weights, seperability limitations

Text Books:• Introduction to artificial Neural systems by Jacek M. Zurada, 1994, Jaico Publ. House.

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

122


CSE-406 FUZZY LOGIC L (3) T (1) P (-)




SECTION-A

Classical and Fuzzy Sets: Overview of Classical Sets, Membership Function, a-cuts,Properties of a-cuts, Decomposition, Theorems, Extension Principle,Operations on Fuzzy Sets:Compliment, Intersections, Unions, Combinations of Operations,Aggregation Operations

SECTION-B

Fuzzy Arithmetic:Fuzzy Numbers, Linguistic Variables, Arithmetic Operations on intervals& Numbers, Lattice of Fuzzy Numbers, Fuzzy Equations.Fuzzy Relations: Crisp & Fuzzy Relations, Projections & Cylindric Extensions, BinaryFuzzy Relations, Binary Relations on single set, Equivalence, Compatibility & OrderingRelations, Morphisms, Fuzzy Relation Equations.

SECTION-C

Possibility Theory:Fuzzy Measures, Evidence & Possibility Theory, Possibility versusProbability Theory.Fuzzy Logic: Classical Logic, Multivalued Logics, Fuzzy Propositions, Fuzzy Qualifiers,Linguistic Hedges.

SECTION-D

Uncertainty based Information:Information & Uncertainity, Nonspecificity of Fuzzy &Crisp sets, Fuzziness of Fuzzy Sets.Applications of Fuzzy Logic in soft computing.

Text / Reference books :•Fuzzy Sets, Uncertainty & Information by G.J.Klir & T.A. Folyger, PHI, 1988.•Fuzzy sets & Fuzzy logic by G.J.Klir & B.Yuan, PHI, 1995

123


CSE-407 OBJECT ORIENTED SYSTEM DEVELOPMENT L (3) T (1) P (-)




SECTION-A

Introduction:Review of the Traditional Methodologies, Advantages of Object OrientedMethodologies over Traditional Methodologies, Classes, Objects, Encapsulation,Association, Aggregation, Inheritance, Polymorphism, States and Transitions.Visual Modelling using Unified Modelling Language (UML):What is Visual Modelling? Object Oriented Modelling, Introduction to Unified ModellingLanguage (UML): History of UML, Overview of UML – Capabilities, Usage of UML.Introduction to Rational Rose CASE tool: Introduction – Importance of Rational Rose,Capabilities of Rational Rose Case Tool.Introduction to Objectory Software Development Process:Introduction, Benefits, Phasesand Iterations, Elaboration Stage, Construction Stage, Transition Stage.

SECTION-B

Creating Use Case Diagrams:Actors and Use Cases, Use Case Relationships, Types ofRelationships, Use Case Diagrams: Creating Main Use Case -,Relationships - , AdditionalUse Case - Diagrams in Rational Rose, Activity Diagrams Activities, Transitions, DecisionPoints, SwimlanesIdentifying Classes ,Packages and drawing a Class Diagram: State, Behaviour, Identity ofObjects, Stereotypes and Classes,Creating and Documenting Classes inrational Rose,Packages, Drawing a Class Diagram Specifying Relationships : The Need of DefiningRelationships, Association and Aggregation Relationships, Naming Relationships, RoleNames, Multiplicity Indicators, Reflexive Relationships, Package Relationships, Inheritance,Finding Relationships, Creating Relationships in Rational Rose

SECTION-C

Discovering Object Interactions:Documenting Scenarios using Interaction Diagrams, Typesof Interaction Diagrams, Adding Behaviour and Structure: Representing Behaviour andStructure, Creating Attributes & operations and documenting them, Displaying attributes andoperations, Association Classes, Analysing Object Behaviour: Modelling DynamicBehaviour, States

124

SECTION-D

Checking the Model:Making the Model Homogeneous, Combining Classes, SplittingClasses,Eliminating Classes, Consistency Checking, Scenario Walk-through, Event Tracing,Documentation Review,Designing the System Architecture : The need for Architecture, The “4+1” viewofArchitecture, The Logical view, The Component View, The Process View, The DeploymentView, The Use Case view.The Iteration Planning Process:Benefits, Goals, Design the User Interface, Adding DesignClasses, The Emergence of Patterns, Designing Relationships, Designing Attributes andOperations, Designing for Inheritance, Coding, Testing, and Documenting the Iteration.

Text Books:•“UML User Guide”, Grady Booch, James Rumbaugh, Ivar Jacobson, 2000, AddisonWesley.•Visual Modeling with Rational Rose 2000 and UMLBy Terry Quatrani Foreword byGrady Booch, 2000Reference Books:•“UML Reference Guide”, James Rumbaugh, Ivar Jacobson, Grady Booch, 2000,Addison Wesley.•“The Objectory Software Development Process”, Ivar Jacobson, Grady Booch, JamesRumbaugh, 1999,Addison Wesley.•UML Distiled by Maxtin Fowler with Kendall Scott,2000 ,Second Edition•Sams Teach Yourself “UML” In 24Hours By Joseph Schmuller ,2000

125


CSE-404 MANGEMENT INFORMATION SYSTEM L (3) T (1) P (-)




SECTION-A

Organisation & Types, Decision Making, Data & information, Characteristics &Classification of information, Cost & value of information, Various channels of information& MIS. 6Foundation of Information System : Introduction to Information System in BusinessFundamentals of Information System, Solving Business Problems with Information System,Concept of Balanced MIS, Effectiveness & Efficiency Criteria. Tool and Techniques of MIS-dataflow diagram, flow chart etc. 10

SECTION-B

Business application of information technology, electronic commerce, Internet, Intranet,Extranet & Enterprise Solutions, Information System for Business Operations, Information

system for managerial Decision Support, Information System for Strategic Advantage.

SECTION-C

Managing Information Technology, Enterprise & Global Management, Security & EthicalChallenges, Planning & Implementing Change.Reports: Various types of MIS reports, GUI &Other Presentation tools. 6

SECTION-D

Advanced concepts in information system: Enterprise Resource Planning: introduction,various modules like Human Resources, Finance, Accounting, Production & Logistics.Supply Chain Management, CRM, Procurement Management System Object Orientedmodeling case studies. 10Books

1. O.Brian, “Introduction to Information System”, Mc-Graw Hill.

2. O.Brian, “Management Information System”, TMH.

3. Alter, “Information Systems : A Management Perspective”, Addison Wesley.

126


CSE-451 AI LAB L (-) T (-) P (2)

1. Study of PROLOG. Write the following programs using PROLOG.2. Write a program to solve 8 queens problem.3. Solve any problem using depth first search.4. Solve any problem using best first search.5. Solve 8-puzzle problem using best first search6. Solve Robot (traversal) problem using means End Analysis.7. Solve traveling salesman problem.

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

127


CSE-452 .NET TECHNOLOGY LAB L (-) T (-) P (2)

C#

Getting Started with .Net Framework, Exploring Visual Studio .NET, Inside a C#Program, Data Types, Statements, Arrays, Using Strings, Objects, Classes andStructs, Properties, Inheritance, Indexers, Delegates, Events, Namespaces, Generics,Collections and Data Structures, Exception Handling, Threading, Using Streams andFiles, Reflection, Assemblies, versioning, Windows Forms, Controls, Data binding toControls, Advanced Database Programming using ADO.net, Using GDI +,Networking, .net Remoting, Manipulating XML.

VB.netCreating Applications with Visual Basic.NET, Variables, Constants, andCalculations, Making Decisions and Working with Strings, Lists, Loops, Validation,Sub Procedures and Functions, Multiple Forms, Standard Modules, and Menus,Arrays, Timers, Form Controls, File Handling,Exception Handling, Working with Databases, Advanced Database Programming usingADO.net, Classes, Generics, Collections, Inheritance, Custom Controls, Packaging &deployment, Using Crystal Reports.

ASP.net

Building a Web Application, Examples Using Standard Controls, Using HTMLControls, Validating Form Input Controls using Validation Controls, UnderstandingApplications and State, Applying Styles, Themes, and Skins, Creating a Layout UsingMaster Pages, Binding to Databases using Controls, Data Management with ADO.net, Creating a Site Navigation Hierarchy, Navigation Controls, Membership and RoleManagement, Login Controls, Securing Applications, Caching For Performance,Working with XML, Using Crystal Reports in Web Forms

128


CSE-411 DISTRIBUTED OPERATING SYSTEM L (3) T (1) P (-)




SECTION-A

Introduction: Introduction to Distributed System, Goals of Distributed system, Hardwareand Software concepts, Design issues. Communication in distributed system: Layeredprotocols, ATM networks, Client – Server model, Remote Procedure Calls and GroupCommunication. Middleware and Distributed Operating Systems.

SECTION-B

Synchronization in Distributed System: Clock synchronization, Mutual Exclusion,Election algorithm, the Bully algorithm, a Ring algorithm, Atomic Transactions, Deadlock inDistributed Systems, Distributed Deadlock Prevention, Distributed Deadlock Detection.Processes and Processors in distributed systems: Threads, System models, ProcessorsAllocation, Scheduling in Distributed System, Real Time Distributed Systems.

SECTION-C

Distributed file systems: Distributed file system Design, Distributed file systemImplementation, Trends in Distributed file systems.Distributed Shared Memory: What is shared memory, Consistency models, Page baseddistributed shared memory, shared variables distributed shared memory.

SECTION-D

Case study MACH: Introduction to MACH, process management in MACH,communication in MACH, UNIX emulation in MACH.

Text Book:• Distributed Operating System – Andrew S. Tanenbaum, PHI.

129


CSE-412 ADVANCED COMPUTER ARCHITECTURE L(3) T(1) P(-)




SECTION-A

Architecture And Machines: Some definition and terms, interpretation andmicroprogramming. The instruction set, Basic data types, Instructions, Addressing andMemory. Virtual to real mapping. Basic Instruction Timing.Time, Area And Instruction Sets: Time, cost-area, technology state of the Art, TheEconomics of a processor project: A study, Instruction sets, Professor Evaluation Matrix

SECTION-B

Cache Memory Notion: Basic Notion, Cache Organization, Cache Data, adjusting the datafor cache organization, write policies, strategies for line replacement at miss time, CacheEnvironment, other types of Cache. Split I and D-Caches, on chip caches, Two level Caches,write assembly Cache, Cache references per instruction, technology dependent Cacheconsiderations, virtual to real translation, overlapping the Tcycle in V-R Translation, studies.Design summary.

SECTION-C

Memory System Design: The physical memory, models of simple processor memoryinteraction, processor memory modeling using queuing theory, open, closed and mixed-queuemodels, waiting time, performance, and buffer size, review and selection of queueing models,processors with cache.

SECTION-D

Concurrent Processors: Vector Processors, Vector Memory, Multiple Issue Machines,Comparing vector and Multiple Issue processors.Shared Memory Multiprocessors: Basic issues, partitioning, synchronization andcoherency, Type of shared Memory multiprocessors, Memory Coherence in shared MemoryMultiprocessors.

Text Book:• Advance computer architecture by Hwang & Briggs, 1993, TMH.

Reference Books:• Pipelined and Parallel processor design by Michael J. Fiynn – 1995, Narosa.

130


CSE-413 MOBILE COMPUTING L(3) T(1) P(-)




SECTION-A

Introduction, issues in mobile computing, overview of wireless telephony: cellularconcept, GSM: air-interface, channel structure, location management: HLR-VLR,hierarchical, handoffs, channel allocation in cellular systems, CDMA, GPRS.

SECTION-B

Wireless Networking, Wireless LAN Overview: MAC issues, IEEE 802.11, Blue Tooth,Wireless multiple access protocols, TCP over wireless, Wireless applications, databroadcasting, Mobile IP, WAP: Architecture, protocol stack, application environment,applications.

SECTION-C

Data management issues, data replication for mobile computers, adaptive clustering formobile wireless networks, File system, Disconnected operations.

Mobile Agents computing, security and fault tolerance, transaction processing in mobilecomputing environment.

SECTION-D

Ad Hoc networks, localization, MAC issues, Routing protocols, global state routing(GSR), Destination sequenced distance vector routing (DSDV), Dynamic source routing(DSR), Ad Hoc on demand distance vector routing (AODV), Temporary ordered routingalgorithm (TORA), QoS in Ad Hoc Networks, applications.

Books:1. J. Schiller, Mobile Communications, Addison Wesley.2. A. Mehrotra , GSM System Engineering.3. M. V. D. Heijden, M. Taylor, Understanding WAP, Artech House.4. Charles Perkins, Mobile IP, Addison Wesley.5. Charles Perkins, Ad hoc Networks, Addison Wesley.

131


CSE-414 SOFTWARE TESTING L (3) T (1) P (-)




SECTION-AFundamentals of TestingHuman and errors, Testing and Debugging, Software Quality, Requirement Behavior andCorrectness, Fundamentals of Test Process, Psychology of Testing, General Principles ofTesting, Test MetricsRole of Testing in SDLCReview of software development models (Waterfall Models, Spiral Model, W Model, VModel) Agile Methodology and Its Impact on testing, Test Levels (Unit, Component,Module, Integration, System, Acceptance, Generic)

SECTION-BApproaches to Testing - IStatic Testing ,Structured Group Examinations, Static Analysis ,Control flow & Data flow,Determining Metrics ,Dynamic Testing ,Black Box Testing ,Equivalence Class Partitioning,Boundary Value Analysis, State Transition Test, Cause Effect Graphing and Decision TableTechnique and Used Case Testing and Advanced black box techniques ,White Box TestingStatement Coverage, Branch Coverage, Test of Conditions, Path Coverage, Advanced WhiteBox Techniques, Instrumentation and Tool Support ,Gray Box Testing, Intuitive andExperience Based Testing

SECTION-CTest ManagementTest Organization ,Test teams, tasks and Qualifications ,Test Planning ,Quality AssurancePlan, Test Plan, Prioritization Plan, Test Exit Criteria ,Cost and economy Aspects ,TestStrategies ,Preventive versus Reactive Approach, Analytical versus heuristic ApproachTest Activity Management, Incident Management, Configuration ManagementTest Progress Monitoring and ControlSpecialized Testing: Performance, Load, Stress & Security Testing

132

SECTION-DTesting ToolsAutomation of Test Execution, Requirement tracker, High Level Review ,Types of test ToolsTools for test management and Control, Test Specification, Static Testing, Dynamic Testing,Non functional testing ,Selection and Introduction of Test ToolsTool Selection and Introduction, Cost Effectiveness of Tool IntroductionTesting Object Oriented SoftwareIntroduction to OO testing concepts, Differences in OO testing

References:1. Software Testing Foundations, Andreas Spillner, Tilo Linz, Hans Schaefer, Shoff Publishersand Distributors

2. Software Testing: Principles and Practices by Srinivasan D and Gopalswamy R, PearsonEd,2006

3. Foundations of Software Testing by Aditya P. Mathur – Pearson Education custom edition2000

4. Testing Object Oriented Systems: models, patterns and tools, Robert V Binder, AddisonWesley, 1996

5. Software Engineering – A practitioner’s approach by Roger S. Pressman, 5th Edition, McGrawHill

6. The art of software testing by GJ Myers, Wiley.

133


CSE-415 NATURAL LANGUAGE PROCESSING L (3) T (1) P (-)




SECTION-A

Components of natural language processing: lexicography, syntax, semantics, pragmatics:word level representation of natural languages prosoty & natural languages.Formal languages and grammars: chomsky hierarchy, Left-Associative grammars,ambiguousgrammars, resolution of ambiguities.

SECTION-BComputation linguistics: recognition and parsing of natural language structures: ATN &RTN,General techniques of parsing: CKY, Earley & Tomitas algorithm.

SECTION-CSemantics-knowledge representation semantic networks logic and inference pragmatics,graph models and optimization, prolog for natural language semantic.

SECTION-DApplication of NLP: intelligent work processors: Machine translation, user interfaces, Man-Machine interfaces, natural language querying, tutoring and authoring systems, speechrecognition, commercial use of NLP.

Text Book:•“Natural Language Understanding” James Allen ,Benjamin-1995, cummings Pub. Comp.Ltd.,Reference Books:•“Language as a cognitive process”, Terry Winograd 1983, AW•“Natural Language processing in prolog” G. Gazder, 1989, Addison Wesley.•“ Introduction of Formal Language Theory, Mdlj Arbib & Kfaury, 1988, Springer Verlog

134


CSE-416 NANO TECHNOLOGY L (3) T (1) P (-)




SECTION-AIntroduction To Nanotech Crystalline noncrystalline materials, fundamental of NanoTechnology & Nano-materials in metals, other materials & Biosystem molecular recognition,quantum mechanics and quantum idea in nanotechnology,semiconductor nano particles.

SECTION-BPreparation And Characterization Of Nanoparticles Nanoscale lithography,dip penlithography,e-beam lithography,nanosphere life off,lithography,molecularsynthesis,nanocrystal growth,polymerization nanobricks & building block: tool for measuringnanostructures-scanning probe instrument,spectroscopy,electrochemistry, electronmicroscopytools to make nanostructure.

SECTION-CProperties & Application Of Nano Crystalline MaterialsApplication in sensors, nanoscale biostructure electronics, magnets, optics, fabricationmedical application, smart materials self healling structures, heterogeneous nano structure &composites encapsulation carbon nanotubes.

SECTION-DSynthesis of semiconductor nanocluster,processing of nanomaterials,nanobusiness-boom,bust&nanotechnology,nanoethics

References1.Camarata. R.C. Nanomaterials synthesis, properties and application Institute of PhysicsPublication.2.Madou. Fundamentals of microfabrication, Mcgraw Hill.3.Sibelia, J.P. A Guide to material characterization, Prentice Hall.4.Mark Ratner, Deniel Ratner – Nano Technology – A gentle Introduction to the Next BigIdea.

(solan) h. p. - iecuniversity.com · 1 i.e.c. university, baddi (solan) h. p. scheme & syllabi...

Documents