B.Tech. Degree Programme Computer Science & Engineering

B.Tech. Degree ProgrammeComputer Science & Engineering(Effective from 2009-2010)

Lingaya’s University, FaridabadABBREVIATIONS/DEFINITIONS• "AC" means, Academic Council of the University.• "BOM" means, the Board of Management of the University.• "BOS" means, the Board of Studies of the Department.• “CAU/AUC-option” CAU/AUC means change from Credit to Audit option / changefrom Audit to Credit option• "Class/Course Committee" means, the Class/Course Committee of a class/course.• "Course" means, a specific subject usually identified by its course-number and course-title,with a specified syllabus / course-description, a set of references, taught by someteacher(s) / course- instructor(s) to a specific class (group of students) during a specificacademic-semester / term.• “Course Instructor" means, the teacher or the Course Instructor of a Course.• "Curriculum" means the set of Course-Structure and Course-Contents.• "DAA" means, the Dean of Academic Affairs.• “DAAB” means Departmental Academic Appeals Board.• “DEC/PEC” means Dissertation Evaluation Committee / Project Evaluation committee.• “Department” means a group in the University devoted to a specific discipline also called aSchool. Department and School are used interchangeably.• "DSA" means, Dean Student Affairs.• “ETE” means End Term Examination.• "Faculty Advisor/Class Counsellor” means, the Faculty Advisor or the Panel of FacultyAdvisors, in a Parent Department, for a group (admission-batch) of students. Also knownas Class Counsellor.• “Grade Card” means the detailed performance record in a term/ programme.• "He" means both genders “he” and “she”; similarly "his" and/or "him" includes "her" aswell, in all the cases.• "HOD" means, the Head of the Department.• “MET” means Make-up End Term.• “MLC” means Mandatory Learning Course.• “MTE” means Mid Term Examination.• "Parent Department" or "Degree Awarding Department" means, the department that offersthe degree programme that a student undergoes.• "Project Guide" means, the faculty who guides the Major Project of the student.• "Regulations" means, set of Academic Regulations.• "University" or “LU” means, Lingaya’s University, Faridabad• "VC" means, the Vice Chancellor, Lingaya’s University, Faridabad.1

B.Tech. Computer Science & Engineering (Regular)CODE OF CONDUCT AND ETHICS FOR STUDENTS1. Wear decent dress respecting his/her modesty as well as that of others.2. Expected to respect and show regard for teachers, staff and fellow students.3. Inculcate civic sense and sensitivity for environment protection.4. Not to resort to collection of funds for any use without written permission of VC.5. To exhibit exemplary behaviour, discipline, diligences, and good conduct and are a rolemodel to other students.6. Not to indulge in offences of cognizable nature.7. Not to practice casteism, communalism.8. Not to indulge in any other conduct unbecoming of a professional student of theUniversity.9. Not to outrage the status, dignity and honour of any person.10. Not to get involved in physical assault or threat, and use of physical force against anybody.11. Not to expose fellow students to ridicule and contempt that may affect their self esteem.12. Not to form any kind of student’s Union, etc.13. Not to take active or passive part in any form of strikes/protests.14. To observe all safety precautions while working.15. Not to disfigure/damage the University property, building, furniture, machinery, librarybooks, fixtures, fittings, etc. (Damage / loss caused shall have to be made good by thestudents).16. Use of mobile/video camera phones is strictly prohibited inside the examination halls,class rooms, laboratories and other working places. LU has the right to confiscate themobile phones in case of any violation.17. Not to indulge in ragging/teasing, smoking, gambling, use of drugs or intoxicants,drinking alcohol, rude behavior, and use of abusive language.18. Not to resort to violence, unruly travel in buses, bullying, threatening and coercing others forundesirable act, such as preventing from attending classes, writing exam. / tests, etc etc.19. All the students of the LU shall be under the disciplinary control of the VC.20. Students are deemed to be under the care and guidance of parents. It is obligatory for theformer to appraise their progress (given by the CC) to the parents.21. Fine, if ever imposed, is only to improve discipline and shall be paid promptly.22. While on campus, students have to take care of their belongings and no responsibility forany loss or damage can be held by the University.23. Every student shall produce the I-Card on demand, and if lost, get a duplicate issued.24. The students must attend all lectures, tutorials and practical classes in a course punctually(The attendance will be counted course-wise).25. To abide by the rules and regulations of the University stipulated from time to time.2

IMPORTANT ACADEMIC RULESB.Tech. Degree Programme (Regular)Lingaya’s University, FaridabadGENERAL• The Regulations may evolve and getrevised/refined or updated or amended or modifiedor changed through approvals from the AcademicCouncil from time to time, and shall be binding onall parties concerned, including the Students,Faculty, Staff, Departments, University Authoritiesand officers. Further, any legal disputes shall belimited to the legal jurisdiction determined by thelocation of the University and not that of any otherparties.• If, at any time after admission, it is found that acandidate had not in fact fulfilled all therequirements stipulated in the offer of admission,in any form whatsoever, including possiblemisinformation etc., the matter will be reported tothe AC, recommending revoking the admission ofthe candidate.• The University reserves the right to cancel theadmission of any student at any stage of his studyprogramme in the University on the grounds ofunsatisfactory academic performance orindiscipline or any misconduct.• Medium of Instruction shall be English.PROGRAMME• The normal duration of the programme leading toB.Tech degree will be four years comprisingtwelve trimesters (or terms).• The B.Tech. Degree programme consists of twomodes i.e. (a) Project Mode and (b) withInternship.• The total course package for a Regular B.TechDegree Programme with Project Mode will typicallyconsist of the following components.(i) General courses(ii) Basic Science and Mathematics(iii) Engineering Science and Technical Arts(iv) Core Courses(v) Elective CoursesAn Elective Course can be any of thefollowing:a) Departmental Electiveb) Open Elective(vi) Project/Internship (Supervised)(vii) Major Project/Internship (Supervised)(viii) Industrial Training(ix) Mandatory Learning Courses• The Regular B. Tech. Degree Programme withinternship will typically consist of all thecomponents of the Regular Project Mode asabove, however with different weightage toindustrial training and core courses.• The student has to opt for the Internship Schemein the ninth term which will not be revoked in anycircumstances. In the absence of exercising theoption, it will be presumed that option is for ProjectMode.• A student having registered for internship scheme ofa programme cannot opt out of that scheme.• The minimum credit requirement for the B.Tech.Degree programme is 190. However, consideringa case for award of honours the minimum creditswill be 195.• The project will be assigned in tenth term. It maybe extended to Major Project. The Major Projectshall comprise of Phase-I and Phase-II, spreadover eleventh and twelfth terms. Appropriatedouble-letter grade is awarded as per theevaluation scheme which will be considered forTGPA and CGPA calculations. It is recommendedthat an external expert from industry/academiamay be a member of the evaluation team of fourpersons (two professors, external expert andrespective project guide).• MLC must be completed by a student atappropriate time or at his convenience. The ‘S'grade is awarded for satisfactory completion of thecourse and ‘N' grade is awarded for nonsatisfactorycompletion of the course. In case ‘N'grade is awarded, the student has to re-register forthe same course if no alternative options areavailable. However, one can opt for other coursesif provided with multiple options. The ‘S' and 'N'grades do not carry grade-points and, hence, arenot included in the TGPA and CGPAcomputations.Courses that come under this category are thefollowing:(a) Environment Science and Ecology(b) Community Service Oriented Project(c) Professional Development Courses• Students admitted to the University will be requiredto take suitable additional Courses in Mathematics(5-0-0) and or Communication Skills (3-0-0), iffound deficient.ASSOCIATION• Every under graduate student of the Universityshall be associated with Parent Department(degree awarding department) offering the degreeprogramme that the student undergoes throughouthis study period, right from the very first day ofadmission into the programme. However, in thefirst year class he may report to the Dept. ofApplied Science and Humanities foradministrative/academic purpose.• A student will be placed in GROUP-A/B/C for allthe three terms in an academic year.• The schedule of academic activities for a term,including the dates of registration, mid-termexaminations (MTE), end-term examination (ETE),inter-term vacation, etc. shall be referred to as theAcademic Calendar of the term, and announced atleast two weeks before the closing date of theprevious term.PRE-REGISTRATION• In order to facilitate proper planning of the academicactivities of a term, it is essential for the students todeclare their intent to register for a course well inadvance, before the actual start of the academic3

B.Tech. Computer Science & Engineering (Regular)session, through the process of Pre-Registration,which is mandatory for all those students of second orsubsequent term who propose to deviate fromrecommended scheme of studies.• Pre-registration is an expression of intention of astudent to pursue particular course(s) in the nextterm. It is information for planning for next term.Every effort will be made to arrange for a courseopted by the student. However, it is not obligatoryon the part of the university to offer the course(s)and no course may be offered if the number ofstudents opting for the course is less than 15 or 25percent of the admission strength whichever isless.• If a student fails to pre-register it will be presumedthat he will follow suggested normal scheme ofstudies provided that he is progressing at a normalpace. For remaining students the HOD of theparent department will plan for courses as per theconvenience of the department.REGISTRATION TO COURSES• Every Student after consulting his Faculty-Advisoris required to register for the approved courseswith the HOD of parent department at thecommencement of each term on the days fixed forsuch registration as notified in the academiccalendar.• A student shall register for courses from amongstthe courses being offered in the term keeping inmind the minimum and maximum credits allowedfor a degree and other requirements i.e. prerequisiteif any, TGPA and CGPA after consultingthe Faculty Advisor. No registration will be validwithout the consent of HOD of the parentdepartment.• A student will be permitted to register in the nextterm as per the suggested normal scheme only ifhe fulfills the following Conditions:(a) Satisfied all the Academic Requirements tocontinue with the programme of studieswithout termination.(b) Cleared all university, library and hostel duesand fines (if any) of the previous term.(c) Paid all required advance payments of the(d)university and hostel for the current term.Not been debarred from registering on anyspecific ground by the University.• The students will be permitted to register forcourse(s) being offered in a term other than hisnormal suggested scheme provided that the timetable permits.• The registration in the critical cases will be doneas per the priority given below:(a)(b)(c)Fulfillment of minimum credit requirement forcontinuation,The completion of programme in minimumperiod needed for degree, (Those who needto improve TGPA/CGPA)The fulfillment of pre-requisite requirement ofcourses.• Students who do not register on the dayannounced for the purpose may be permittedLATE REGISTRATION up to the notified day inacademic calendar on payment of late fee.• REGISTRATION IN ABSENTIA will be allowedonly in exceptional cases with the approval of theDAA after the recommendation of HOD throughthe guardian of the student.• Credits will be awarded in registered courses only.CREDIT LIMITS• A student of the B.Tech. degree programme mustregister for a minimum of 10 credits, and up to amaximum of 21 credits in a Term. However, theminimum / maximum credit limit can be relaxed bythe DAA on the recommendation of the HOD, onlyunder exceptional circumstances. The maximumcredits that a student can register in a SummerTerm are 8.• Professional Development courses are one creditcourses each, with multiple options, to becompleted at student's convenience in each Term.Some of them may be mandatory and others twolettergrade category. However, registration has tobe done for all courses.CHANGE IN REGISTRATION• A student has the option to ADD courses forregistration till the date specified for lateregistration in the Academic Calendar.• On recommendation of the Teaching Departmentas well as the Parent Department, a student hasthe option to DROP courses from registration untiltwo weeks after the commencement of the classesin the term, as indicated in the Academic Calendar.• A student can register for auditing a course, or acourse can be converted from credit to audit or fromaudit to credit, with the consent of the Faculty Advisorand Course Instructor within two weeks after thecommencement of the classes in the term asindicated in the Academic Calendar. However, CORECourses shall not be available for audit.ATTENDANCE REQUIREMENTS• LU academic programmes are based primarily onthe formal teaching-learning process. Attendancein classes, participating in classroom discussionsand participating in the continuous evaluationprocess are the most essential requirements ofany academic programme.• Attendance will be counted for each coursescheduled teaching days as per the academiccalendar.• The attendance requirement for appearing in endterm examination shall be a minimum of 75% ofthe classes scheduled in each course.LEAVE OF ABSENCE• The leave of absence must be authorized as perregulations.• A student short of attendance in a course (lessthan needed after leave of absence andcondonation by VC) will be awarded ‘FF’ grade inthe course.• All students must attend all lecture, tutorial andpractical classes in a course. The attendance willbe counted course wise.• To account for approved leave of absence e.g.representing the University in sports, games orathletics; professional society activities, placement4

Lingaya’s University, Faridabadactivities, NCC/NSS activities, etc. and/or anyother such contingencies like medicalemergencies, etc., the attendance requirementshall be a minimum of 75% of the classesscheduled in each course to appear in theexamination.• A student with less attendance in a course duringa trimester, in lectures, tutorials and practicalstaken together as applicable, shall be awarded‘FF’ grade in that course, irrespective of hisacademic performance, and irrespective of thenature of absence.• If the period of leave is more than three days andless than two weeks, prior application for leaveshall have to be submitted to the HOD concerned,with the recommendation of the Faculty-Advisor,stating fully the reasons for the leave requested,along with supporting documents.• If the period of leave is two weeks or more, priorapplication for leave shall have to be made to theDAA with the recommendations of the Faculty-Advisor, HOD concerned stating fully the reasonsfor the leave requested, along with the supportingdocuments. The DAA may, on receipt of suchapplication, grant leave or decide whether thestudent be asked to withdraw from the course forthat particular term because of long absence.• If a student fails to apply and get sanction forabsence as in (a) and (b) above, hisparent/guardian may apply to the VC with reasonsduly recommended by the faculty advisor, HODand DAA and explain in person to the VC thereasons for not applying in time. The VC willconsider on merit and decide to grant the leave orwithdrawal from the course for that particular termsubject to any condition that he may like toimpose. The decision of the VC shall be final andbinding.ABSENCE DURING EXAMINATIONS• A student who has been absent during MTE due toillness and/or any exigencies may give a requestfor make-up examination within one week after theMTE to the HOD with necessary supportingdocuments in person. The HOD may considersuch requests depending on the merits of thecase, and after consultation with the CourseInstructor, may permit the Make-up examinationfor the student concerned. However, no makeupexamination will be permitted if the attendance inthe course is less than 60% till the date ofexamination.• In case of absence from ETE of a course(s) onMedical ground and/or other specialcircumstances, the student can apply for award of‘I’ grade in the course(s) with necessarysupporting documents and certifications by anauthorized person to the HOD within one weekafter the ETE. The HOD may consider the request,depending on the merit of the case, and afterconsultation with the Course(s) Instructor(s)/Faculty Advisor permit the MET Examination forthe student concerned. The student maysubsequently complete all course requirementswithin the date stipulated by BOS (which maypossibly be extended till first week of term underspecial circumstances) and ‘I’ grade will thenconverted to an appropriate Double-letter grade,as per Clause No: G5.9. All the details of such adecision with date of finalizing the grade shall becommunicated to DAA. If such an application forthe ‘I’ grade is not made by the student then adouble-letter grade will be awarded based on histerm performance.COURSE CREDIT ASSIGNMENT• Every course comprises of specific Lecture-Tutorial-Practical (L-T-P) schedule. The credits forvarious courses are shown in the Scheme ofStudies & Syllabus.• The Academic Performance Evaluation of astudent shall be according to a Letter GradingSystem, based on the Class PerformanceDistribution.• The double-letter grade (AA, AB, BB, BC, CC, CD,DD, FF) indicates the level of academicachievement, assessed on a decimal (0-10) scale.Letter-Grades and Grade-Points:LETTER- GRADE-GRADE POINTSREMARKSAA 10AB 9BB 8BC 7CC 6CD 5DD 4FF 0 FailI - IncompleteU - AuditedW - WithdrawalS - SatisfactoryN - UnsatisfactoryDESCRIPTION OF GRADES• An 'AA' grade stands for outstanding performance,relative to the class which may includeperformance with previous batches. The CourseInstructor is supposed to take utmost care inawarding of this highest double-letter grade.• The 'DD' grade stands for marginal performanceand is the minimum passing double-letter grade.• The 'FF' grade denotes very poor performance, i.e.failure in a course, and the Course Instructor issupposed to take utmost care while awarding thislowest double-letter grade.• A student, who obtains 'FF' grade in a core course,has to repeat (re-register) that core course, insubsequent terms/sessions whenever the courseis offered, until a passing grade is obtained.However, for an elective course in which ‘FF’grade has been obtained, the student may eitherrepeat the same course, or register for any otherelective course.• An ’I' grade denotes incomplete performance inany course due to absence at the end termexamination (see also Clause No: G7.4). Whenthe ‘I' grade is converted to a regular double5

B.Tech. Computer Science & Engineering (Regular)letter grade, a penalty of ONE Grade-Point isimposed, by awarding the double-letter gradethat is immediately below the one that thestudent would have otherwise received exceptwhen the student has 95% attendance record inthe subject concerned. For example, if on thebasis of the performance including METExamination, a student gets AB grade, he willbe awarded BB grade if not under exceptionrule.• ‘U’ grade is awarded in a course that thestudent opts to register for audit. It is notmandatory for the student to go through theentire regular process of evaluation in an auditcourse. However, the student has to go throughsome process of minimal level of evaluation andalso the minimum attendance requirement, asstipulated by the Course Instructor andapproved by the corresponding BOS, for gettingthe ‘U’ grade awarded in a course, failing whichthat course will not be listed in the Grade Card.• A ‘W' grade is awarded when the studentwithdraws from the course. Withdrawal from acourse is permitted only under extremelyexceptional circumstances (like medicalemergencies, family tragedies and/or otherunavoidable contingencies) and has to berecommended by the HOD and approved by theDAA. However, no withdrawal is permitted afterthe finalization of the grades in the term.• ‘S’/’N’ grades are awarded for the MandatoryLearning Courses. The 'S' grade denotessatisfactory performance and completion of acourse. The `N' grade is awarded for noncompletionof course requirements and the studentwill have to register for the course until he obtainsthe ‘S' grade.FEEDBACK TO STUDENTS• A student requires feedback on the progress of hislearning. For this purpose, the Instructor willconduct at least two quizzes for a theory course ina term-one before MTE and the other there after.The quizzes will form a component of class work,the other components being tutorials, homeassignments or any other mode.• For a laboratory course, the continuousassessment’s feed back will be given through thelaboratory records which are required to besubmitted after performing the experiment in thenext laboratory class.• The continuous feedback on project/major project willbe through project diary and interim report.• For Internship stream, the continuous assessmentand feedback is to be through seminars,professional dairy and interim reports at the placeof work.EVALUATIONTheory Course:• The double-letter grade awarded to a student in acourse other than a practical course, i.e. it shall bedenoted by L-T-0 course for which he has registered,shall be based on his performance in quizzes,tutorials, assignments etc., as applicable, in additionto one MTE and ETE. The weightage of thesecomponents of continuous evaluation may be asfollows:End-term Examination : 50%Mid-term Examinations : 30%Quizzes, Tutorials, Assignments, etc.(Several over the term) :20%Total : 100%Laboratory Course:• The double letter grade awarded to the student ina practical course i.e. 0-0-P course will be basedon his performance in regular conduct ofexperiments, viva voce, laboratory report, quizzesetc., in addition, to term practical examination. Theweightage of the components of continuousevaluation may be as follows:Conduct of Experiments (as persyllabus) :40%Lab Record : 10%Quizzes/Viva Voice : 20%End-term Examination : 30%Total : 100%Project (Including Seminar):• The double letter grade awarded to the student inProject (Includes Seminar) i.e. 0-0-P course will bebased on his performance in technical workpertaining to the solution of a small size problem,project report, and presentation of work anddefending it in a viva-voce. The weightage of thecomponents of continuous evaluation may be asfollows:Technical Work : 50%Report : 25%Seminar, Presentation & Viva-voce : 25%Total : 100%Major Project:• The double letter grade awarded to the student inMajor Project Phase-I and Phase-II i.e. 0-0-P coursewill be based on his performance in technical workpertaining to the solution of a problem, project report,presentation and defending in a viva-voce. Theweightage of the components of continuousevaluation may be as follows:Technical Work : 50%Report : 25%Presentation & Viva-voce : 25%Total : 100%Internship:• The Internship-II will be treated as Major Projectfor evaluation purpose. The double letter gradeawarded to the student in Internship-II i.e. 0-0-Pcourse will be based on his performance intechnical work pertaining to the solution of a reallifeproblem, project report, presentation anddefending in a viva-voce. The weightage of thecomponents of continuous evaluation may be asfollows:Technical Work : 50%Report : 25%Presentation & Viva-voce : 25%Total : 100%The continuous assessment and feedback is to bethrough seminars, professional diary and enteringreport at the place of work.6

Lingaya’s University, FaridabadSeminar:• The double letter grade awarded to the student inSeminar i.e. 0-0-P course will be based on hisperformance in oral presentation with emphasis ontechnical contents, presentation and ability toanswer questions. The weightage of thecomponents of continuous evaluation may be asfollows:Technical Contents : 40%Presentation : 30%Questions and answers : 30%Total : 100%Industrial/Field Training/Internship-I:• The double letter grade awarded to the student inIndustrial/Field Training/Internship-I i.e. 0-0-Pcourse will be based on PracticalTraining/Internship-I in an industry, professionalorganization/ research laboratory. Thecomponents of continuous evaluation withweightage may be as follows:Training report : 40%Presentation : 30%Questions and answers : 30%Total : 100%Professional Development:• There are 14 credits divided into 14 courses of onecredit each. The evaluation process of thesecourses will be as per the nature, contents anddelivery of these courses. Some of the commoncomponents of evaluation could be quizzes, vivavoce,practical test, group discussion, etc.Participation by students is to be given moreweightage in Co-curricular courses.SCHEME OF EXAMINATION• The duration of examinations for a theory coursewill be 3 hours for ETE and 1½ hours for MTE.• The pattern of question paper/examination will beas under:• Theory Courses:The University shall conduct the ETE for all theorycourses being taught in the term.(a) There will be eight questions in all distributedover all the units in a course syllabus. Thequestion paper will be in three parts withweightage 20 percent, 40 percent and 40percent respectively.(b) Part-A will be short answer type with multipleparts covering all the units in the syllabus,which will be compulsory.(c) Part-B will have three questions from any threeunits, which will have long answers ofderivation/descriptive type. Two questions areto be answered from this part.(d) Part-C will consist of four questions from theremaining four units and they will be ofproblem solving type in order to measureability on comprehension/ analysis/synthesis/ application. The relevant data willbe made available. The student is requiredto solve two questions. However, for Part-C,the external examiner may select thequestions from the question bank suppliedby the University.• Students are allowed in the examination the use ofsingle memory, non-programmable calculator.However, sharing of calculator is not permitted.• Laboratory Courses:(a) The ETE in laboratory course will beconducted jointly by an external examiner(other than the instructor) and an internalexaminer (the coordinator / instructor) jointly.(b)The student will be given randomly anexperiment to perform from within the list ofexperiments in the course.(c) No change in the experiment will be permittedafter the draw, if the student had performedthe same in the class.• Mid-Term Examination:Question 1 is compulsory covering all topics taughttill then. Question 2 and 3 will be essay type, out ofwhich student will answer any one. Question 4 and5 will be to measure to ability of analysis /comprehension / synthesis / application. Thestudent will answer any one.TRANSPARENCY• The answer books of all MTE and ETE will beshown to the students within three days of the lastpaper. It is the responsibility of the student tocheck this evaluation and affix his signature inconfirmation.• If the student finds some discrepancy, he shouldbring it to the notice of the Course Coordinator.The Course Coordinator will look into the complaintand remove the doubts of the student and proceedwith the work of grading.• The entire process of evaluation shall betransparent, and the course instructor shall explainto a student the marks he is awarded in variouscomponents of evaluation.RESULT• The final marks shall be displayed on the noticeboard for ONE day, (the date of which will beindicated in the academic calendar). A student canapproach the Course Instructor(s) concerned forany clarification within Two days of display. Theprocess of evaluation shall be transparent and thestudents shall be made aware of all the factorsincluded in the evaluation. In case of anycorrection, the Course Instructor shall have toincorporate the same before finalization of thegrades.• The Student’s Grade Card shall contain the Letter-Grade for each registered course; along with theTGPA at the end of the term, and the CGPA at thecompletion of the programme.APPEAL FOR REVIEW OF GRADE• If a student is not satisfied with the award of thegrade after the announcement of the grades, hemay appeal on a Grievance Form duly filled inalong with the fee receipt for this purpose to the7

B.Tech. Computer Science & Engineering (Regular)HOD of the parent department within one week ofthe following term. The HOD will forward the formalong with his recommendation based on therecords of the case to DAAB within the datespecified in the Academic Calendar.• The fee for such an appeal will be decided fromtime to time. If the appeal is upheld by DAAB, thenthe fee amount will be refunded to the studentwithout interest.• VC shall have power to quash the result of acandidate after it has been declared, if(a) He is disqualified for using malpractice inthe examination;(b)(c)A mistake is found in his result;He is found ineligible to appear in theexaminationAWARD OF DIVISIONS• The overall performance of a student will beindicated by two indices:(i) TGPA which is the Term Grade Point Average(ii) CGPA which is the Cumulative Grade PointAverageTGPA for a Term is computed as follows:TGPA = ∑ C i G i / ∑ C iWhere,C i denotes credits assigned to i th course withdouble-letter grade, and G i denotes the gradepoint equivalent to the letter grade obtained by thestudent in i th course with double-letter grade,including all ‘FF’ grades in that term.CGPA is computed as follows:CGPA = ∑ C i G i / ∑ C iWhere,C i denotes credits assigned to i th course withdouble-letter grade, and G i denotes the gradepoint equivalent to the letter grade obtained by thestudent in i th course for all courses with doublelettergrades, including all ‘FF’ grades in all termsat the end of the programme.For CGPA calculation, the following grades are tobe counted:(i) Grades in all core courses,(ii) The best grades in the remaining eligiblecourses to fulfill the minimum creditsrequirement for a programme.• The degree will be awarded only upon complianceof all the laid down requirements for programmeas under:(i) There shall be University requirement ofearning a minimum credits for a degree,satisfactory completion of mandatorylearning courses and other activities as perthe course structure.(ii) There shall be a minimum earned creditrequirement on all Departmental CoreCourses, Elective courses and Major Projectas specified by BOS.(iii) There shall be a maximum duration forcomplying to the degree requirement.(iv) The candidate will be placed in First Divisionwith Honours/First Division withDistinction/First Division/Second Divisionwhich will be mentioned on the degreecertificate as under:DIVISIONCONDITIONS TO BEFULFILLEDCGPA ≥ 8.5First Divisionwith HonoursNo ‘FF’, N or W grade in anycourse during the programmeand total 195 creditsFirst Division withCGPA ≥Distinction8.5First Division CGPA ≥ 6.75Second Division CGPA ≥ 5.0 but < 6.75Note:Although, there is no direct conversion fromgrades to marks, however, for comparisonpurposes percentage of marks may be assumed tobe CGPA multiplied by nine.B. TECH. DEGREE REQUIREMENTS• The requirements of the award of B.Tech. Degreeprogramme are as follows:(a) University Requirements:(i) Minimum Earned Credit Requirementfor Degree is 190 for regularprogramme. However, the creditsrequired for consideration for honoursdegree will be 195.(ii) Satisfactory completion of allMandatory Learning Courses.(b) Programme Requirements:Minimum Earned Credit Requirements onall Core Courses, Elective Courses andMajor Project/Internship as specified by theBOS.(c) The CGPA at the end of programme isatleast 5.0.(d) The Maximum duration for a student forcomplying with the Degree Requirement isSEVEN years from date of first registrationfor first Term.GRADE IMPROVEMENT• A student may be allowed to improve the TGPA inan appropriate Term, if his TGPA falls below 5.0.Similarly, any student may be allowed to improveperformance in any course provided the course isbeing floated and available.TERMINATION FROM THE PROGRAMME• A student shall be required to leave the Universitywithout the award of the Degree, under one ormore of the following circumstances:(1) If a student fails to earn the minimum creditsspecified below:CHECK POINTCREDITTHRESHOLD**End of FIRST year 20*End of SECOND year 50*End of THIRD year 85End of FOURTH year 1258

Lingaya’s University, FaridabadNote 1:* A student may be given one more chance tocover the shortfall in the threshold during thefollowing summer term as follows:(i) if a student earns 12 credits or more butless then 20 at the end of first year.(ii) if a student earns 42 or more credits butless than 50 at the end of second year.In case he fails to clear the threshold evenafter the summer term he has to leave thecourse.** If at any stage, a student fails to cross thethresh hold with a TGPA of minimum 5.0 inany term, he will be treated as critical caseand will be advised to improve the grades.Note 2:The period of temporary withdrawal is not to becounted for the above credit threshold.(2) If a student is absent for more than 4 (four)weeks at a stretch in a term withoutsanctioned leave.(3) Based on disciplinary action by the AC, on therecommendation of the appropriatecommittee.Note:Under any circumstances of termination, theconditions specified in permanent withdrawal shallalso apply.WITHDRAWAL FROM PROGRAMMETemporarily:• A student who has been admitted to a degreeprogramme of the University may be permitted towithdraw temporarily, for a period of one term ormore, on the grounds of prolonged illness or gravecalamity in the family, etc., provided:(i)(ii)(iii)(iv)He applies to the University stating fully thereasons for withdrawal together withsupporting documents and endorsementfrom his parent/guardianThere are no outstanding dues or demands,from the Departments/ University /Hostels/Library and any other centers;Scholarship holders are bound by theappropriate Rules applicable to them.The decision of the VC of the Universityregarding withdrawal of a student is final andbinding.• Normally, a student will be permitted only onesuch temporary withdrawal during his tenure as astudent and this withdrawal will not be counted forcomputing the duration of study.Permanently:• Any student who withdraws permanentlyadmission before the closing date of admission forthe academic session is eligible for the refund offee as per the University rules. Once theadmission for the year is closed, the followingconditions govern withdrawal of admission:• A student who wants to leave the University forgood, will be permitted to do so (and take TransferCertificate from the University, if needed), onlyafter clearing all the dues for the remainingduration of the course.• A student who has received any scholarship,stipend or other form of assistance from theUniversity shall repay all such amounts, inaddition, to clearing all the dues for the remainingduration of the course.• The decision of the VC regarding all aspects ofwithdrawal of a student shall be final and binding.*****9

B.Tech. Computer Science & Engineering (Regular)Department of Computer Science & EngineeringDEGREE OBJECTIVETo impart dynamic and quality technical education of highest order to the students inthe field of Computing, making them fit to analyze and mould themselves accordingto the industry needs from time to time, through limited specialization in the areas ofSoftware Development, Research & Development, Advanced Computing and ITServices & Management.The students will have good exposure to the technological developments in variousspheres of Computing and ultimately, develop sufficient skills in the areas ofcomputing, especially, in Artificial Intelligence, Data Mining and SoftwareDevelopment.10

Lingaya’s University, FaridabadCOURSE CATEGORYGeneral (Humanities. Soc Sc. Man) (GEN.)1 BA-225 Economics 5-0-0 32 BA-226 Principles of Management 5-0-0 33Environmental Science &CE-101Ecology5-0-0 34 EN-101 Communication Skills 5-0-0 35 EN-151 Language Lab 0-0-2 16Essentials ofEN-291 Communication Objective 5-0-0 3(Bridge Course)7Mathematics (MakeupMA-191Course)5-0-0 38Mathematics (BridgeMA-291Course)5-0-0 3Basic Science & Mathematics including Computer(BSM)1 CH-101 Applied Chemistry 5-0-0 32 CH-151 Applied Chemistry Lab 0-0-2 13 CS-101 Computer Programming 5-1-0 44Computer ProgrammingCS-151Lab0-0-2 15 MA-101 Applied Mathematics-I 5-1-0 46 MA-102 Applied Mathematics-II 5-1-0 47 MA-201 Applied Mathematics – III 5-1-0 48Applied NumericalMA-202Methods5-1-0 49Applied NumericalMA-252Methods Lab0-0-2 110 PH-101 Physics 5-1-0 411 PH-102 Applied Physics 5-1-0 412 PH-151 Physics Lab 0-0-2 113 PH-152 Applied Physics Lab 0-0-2 114 PH-152 Applied Physics Lab 0-0-2 1Engineering Science & Technical Arts (ESTA)1 EC-204 Electronics Engineering 5-1-0 42Electronics EngineeringEC-254Lab0-0-2 13 EL-101 Electrical Engineering 5-1-0 44 EL-151 Electrical Engineering Lab. 0-0-2 15 ME-101 Engineering Mechanics 5-1-0 46 ME-151 Engineering Mechanics Lab 0-0-2 17 ME-152 Workshop Practice 0-0-4 28 ME-153 Engineering Graphics 0-0-6** 3Department Core (DC)1Database ManagementCA-101Systems5-1-0 42Database ManagementCA-151Systems Lab0-0-2 13Data Structures &CS-201Algorithms5-1-0 44 CS-202 Programming Languages 5-0-0 35 CS-203 Discrete Structures 5-1-0 46Computer Organization &CS-204Architecture5-1-0 47Analysis & Design ofCS-205Algorithms5-1-0 48Data Structures &CS-251Algorithms Lab0-0-2 19Computer Organization &CS-254Architecture Lab0-0-2 110 CS-301 Theory of Computations 5-0-0 311 CS-302 Operating Systems 5-0-0 312 CS-303 Computer Graphics 5-1-0 413 CS-352 Operating Systems Lab 0-0-6 114 CS-353 Computer Graphics Lab 0-0-2 115 CS-401 Neural Networks 5-0-0 316 CS-402 Artificial Intelligence 5-0-0 317 CS-451 Neural Networks Lab 0-0-2 118 CS-452 Artificial Intelligence Lab 0-0-2 119Digital & AnalogEC-208Communications5-0-0 320Microprocessors andEC-302Interfacing5-0-0 321 EC-304 Digital System Design 5-1-0 422 EC-307 Wireless Communication 5-1-0 423Microprocessors andEC-352Interfacing Lab0-0-2 124 EC-354 Digital System Design Lab 0-0-2 125 IT-202 Computer Networks 5-0-0 326 IT-252 Computer Networks Lab 0-0-2 127 IT-301 Web Development 5-0-0 328 IT-302Open Source Based RapidApplication Development5-1-0 429 IT-304 Software Engineering 5-0-0 330 IT-305Data Mining & DataWarehousing5-1-0 431 IT-307 Multimedia Technologies 5-0-0 332 IT-351 Web Development Lab 0-0-2 133 IT-352Open Source Based RADLab0-0-2 134 IT-355Data Mining & DataWarehousing Lab0-0-2 135 IT-357Multimedia TechnologiesLab0-0-2 136 IT-402 Advanced Java 5-0-0 337 IT-452 Advanced Java Lab 0-0-2 138 CS-453 Department Lab 0-0-4 2Department Elective (DE)1 CS-421 Compiler Design 5-0-0 32Cryptography and DataCS-422Compression5-0-0 33Advanced ComputerCS-431Architecture5 0 0 34Natural LanguageCS-432Processing5 0 0 35Computer Vision/ImageCS-433Processing5 0 0 36 CS-434 Expert Systems 5 0 0 37 CS-435 Robotics 5 0 0 38Speech Recognition &CS-436Generation5 0 0 39 CS-437 Soft Computing 5 0 0 310Advanced DatabaseCS-441Management Systems5 0 0 311 CS-442 Digital Image Processing 5 0 0 311

B.Tech. Computer Science & Engineering (Regular)12 CS-443 Distributed Computing 5 0 0 313Real-time OperatingCS-444Systems5 0 0 314 EC-305 Embedded Systems Design 5 0 0 315 IT-306Software ProjectManagement5-0-0 316 IT-422 Computer Software Testing 5-0-0 317 IT-423Introduction to E-commerce& ERP5-0-0 318 IT-424 Mobile Computing 5-0-0 319 IT-425Object Oriented SoftwareEngineering & UML5-0-0 320 IT-431 Bioinformatics 5-0-0 321 IT-441Network Security & 5-0-0Management322 IT-442 Information Security 5 0 0 323 IT-443Information Storage & 5-0-0Management324 IT-444 Pervasive Computing 5-0-0 325 IT-445 Human Computer Interaction 5-0-0 3Open Elective (OE)1 AE-411 Transport Management 5-0-0 32Human ResourceBA-271Management5-0-0 33 BA-272 EntrepreneurshipDevelopment5-0-0 34Advanced TrafficCE-471Engineering5-0-0 35Elements of Town PlanningCE-472and Architecture5-0-0 36 CH-471 Advanced Applied Chemistry 5-0-0 37 CS-303 Computer Graphics 5-0-0 38Cryptography and DataCS-422Compression5-0-0 39 EC-305 Embedded System Design 5-0-0 310 EC-401 Mobile Communication 5-0-0 311Programmable LogicEE-401Controllers & SCADA5-0-0 312 EE-431 INDUSTRIALELECTRONICS5-0-0 313Renewable Energy SourceEL-421and Energy Conservation5-0-0 314High Voltage Direct CurrentEL-422Transmission5-0-0 315 EL-423 High Voltage Engineering 5-0-0 316 EN-471 ProfessionalCommunication5-0-0 317 EN-472 Business Communication 5-0-0 318 IT-423Introduction to E-commerce& ERP5-0-0 319 IT-443Information Storage &Management5-0-0 320 MA-471 Discrete Mathematics 5-0-0 321Advanced HigherMA-472Engineering Mathematics5-0-0 322Advanced NumericalMA-473Techniques5-0-0 323 MA-474 Operation Research 5-0-0 324 ME-442 Ergonomics 5-0-0 325 ME-443 Finite Element Analysis 5-0-0 326Renewable Sources ofME-461Energy5-0-0 327Non Destructive TestingPH-471Techniques5-0-0 328 PH-472 Nano Technology 5-0-0 329 PH-473 Laser Technology 5-0-0 3Project/Internship, Seminar Training, CSOP1Community ServiceCS-491Oriented Project (CSOP)0-0-2 12 CS-481 Major Project Phase-I 0-0-10 53 CS-482 Major Project Phase-II 0-0-6 34Project (includinngCS-492Seminar)0-0-4 25Industrial Training/FieldCS-493Training0-0-2 16 CS-494 Seminar – I 0-0-2 17 CS-495 Seminar – II 0-0-2 1Professional Development (PD) – Gen.1Basics of ComputerPD-151Fundamentals0-0-2 12 PD-191 Co-curricular Activities 13 PD-192 Personality Skills 0-0-2 14 PD-193 Entrepreneurial &Professional Skills0-0-2 15 PD-251 MATLAB 0-0-2 16 PD-291 Co-curricular Activities 17 PD-292 Effective Communication 0-0-2 18 PD-293 Intra & Inter-personal Skills 0-0-2 19System & NetworkPD-353Administration Lab0-0-2 110 PD-391 Co-curricular Activities 111 PD-392 Problem Solving Skills 0-0-2 112Advanced ProfessionalPD-393Development0-0-2 113Visual ProgrammingPD-453Techniques Lab0-0-2 114 PD-491 Co-curricular Activities 1Mandatory Learning Course (MLC)1Environmental Science &CE-101Ecology5-0-0 32Community ServiceCS-491Oriented Project (CSOP)0-0-2 13 PD-292 Effective Communication 0-0-2 14Advanced ProfessionalPD-393Development0-0-2 112

Lingaya’s University, FaridabadSUGGESTED PLAN OF STUDIESCourse→ 1 2 3 4 5 6 7 8 9 10Term-ITerm-IITerm-IIIPH-101/EL-101/PH-102PH-101/EL-101/PH-102PH-101/EL-101/PH-102MA-101/ME-101/MA-102MA-101/ME-101/MA-102MA-101/ME-101/MA-102CH-101/CS-101/CE-101CH-101/CS-101/CE-101CH-101/CS-101/CE-101EN-101/ME-102/ME-103EN-101/ME-102/ME-103EN-101/ME-102/ME-103ME-151ME-151ME-151PH-151/PH-152/EL-151PH-151/PH-152/EL-151PH-151/PH-152/EL-151CH-151/CS-151CH-151/CS-151CH-151/CS-151EN-151/ME-152/ME-153EN-151/ME-152/ME-153EN-151/ME-152/ME-153Term-IV MA-201 CS-201 EC-208 IT-202 CS-251 IT-252 - -Term-V BA-225 CA-101 CS-202 EC-201 CA-151 EC-251 - -Term-VI CS-203 CS-204 CS-205 MA-202 CS-254 MA-252 - -Term-VII CS-301 EC-302 EC-304 CS-302 EC-352 EC-354 CS-352 -Term-VIII IT-301 IT-302 CS-303 IT-304 IT-352 CS-353 IT-351 -Term-IX BA-226 IT-305 EC-307 IT-307 IT-355 IT-357 - -Term-X(Project)IT-402Dept.Elect.-IPD-192/PD-193/PD-151PD-192/PD-193/PD-151PD-192/PD-193/PD-151PD-292/PD-293/PD-251PD-292/PD-293/PD-251PD-292/PD-293/PD-251PD-392/PD-393/PD-353PD-392/PD-393/PD-353PD-392/PD-393/PD-353PD-191PD-191PD-191PD-291PD-291PD-291PD-391PD-391PD-391CS-401 IT-452 CS-451 CS-491 CS-492 CS-493 PD-453 PD-491Term-X(Internship)IT-402Dept.Elect.-ICS-401 IT-452 CS-451 CS-491 CS-492 CS-483 PD-453 PD-491Term-XI(Project)CS-402OpenElect.CS-452 CS-481 CS-494 - - - - PD-491Term-XI(Internship)CS-494 CS-484 - - - - - - - PD-491Term-XII(Project)Dept.Elect.-IIDept.Elect.-IIIDept.Elect.-IVCS-453 CS-482 CS-495 - - - PD-491Term-XII(Internship)Dept.Elect.-IIDept.Elect.-IIIDept.Elect.-IVCS-453 CS-485 CS-495 - - - PD-49113

B.Tech. Computer Science & Engineering (Regular)Scheme of StudiesB. Tech. Degree Programme (Regular)(Common to all Branches)1 st YearTERM – ITHEORYEvaluation SchemePeriods Components of Evaluation withSl.Weightage (%)No. Group CourseCourse NameCrNo.Class MTE ETEL-T-PTotalWork (1½ Hrs) (3 Hrs)A MA-101 Applied Mathematics-I 5-1-0 20 30 50 100 41 B MA-101 Applied Mathematics-I 5-1-0 20 30 50 100 4C ME-101 Engineering Mechanics 5-1-0 20 30 50 100 4A PH-101 Physics 5-1-0 20 30 50 100 42 B PH-101 Physics 5-1-0 20 30 50 100 4C EL-101 Electrical Engineering 5-1-0 20 30 50 100 4A CH-101 Applied Chemistry 5-0-0 20 30 50 100 3B CS-101 Computer Programming 5-1-0 20 30 50 100 43Environmental Science &C CE-1015-0-0 20 30 50 100 3Ecology***4 A EN-101 Communication Skills 5-0-0 20 30 50 100 3PRACTICAL/DRAWING/DESIGNEvaluation SchemePeriods Components of Evaluation WithSl.CourseWeightage (%)GroupCourse NameNo.No.L-T-PEXPT.LabRecordMTEQuizzes/Viva-voceCrETE(2 Hrs) Total1 C ME-151 Engineering Mechanics Lab 0-0-2 40 10 20 30 100 1A PH-151 Physics Lab 0-0-2 40 10 20 30 100 12 B PH-151 Physics Lab 0-0-2 40 10 20 30 100 1C EL-151 Electrical Engineering Lab 0-0-2 40 10 20 30 100 1A CH-151 Applied Chemistry Lab 0-0-2 40 10 20 30 100 13Computer ProgrammingB CS-151Lab0-0-2 40 10 20 30 100 1A EN-151 Language Lab 0-0-2 40 10 20 30 100 14 B ME-152 Workshop Practice 0-0-4 40 10 20 30 100 2C ME-153 Engineering Graphics 0-0-6** 40 10 20 30 100 3A PD-192 Personality Skills 0-0-2 40 10 20 30 100 15B PD-193Enterpreneural &Professional Skills0-0-2 40 10 20 30 100 1C PD-151Basics of ComputerFundamentals0-0-2 40 10 20 30 100 16 A/B/C PD-191 Co-curricular Activities 1*Note: A student will be placed in GROUP A/B/C for all the three terms in an academic year.GROUP TOTAL CONTACT HOURS TOTAL CREDITSA 20-2-8 (30) 18B 15-3-10 (28) 17C 15-2-12 (29) 17FINAL EVALUATION IN GRADES(L-T-P-Cr) – Lectures-Tutorials-Practicals-CreditsCW - Class WorkMTE – Mid-Term ExamETE – End-Term Exam* One credit to be earned in Term-III through Co-Curricular Activities outside contact hours. However, a studentis to register for this course in all the three terms of first year.** One hour for explanation/demonstration.*** CE-101 is a Mandatory Learning Course.14

Lingaya’s University, FaridabadScheme of StudiesB. Tech. Degree Programme (Regular)(Common to all Branches)1 st YearTERM – IITHEORYEvaluation SchemePeriods Components of Evaluation withSl.Weightage (%)No. Group CourseCourse NameCrNo.Class MTE ETEL-T-PTotalWork (1½ Hrs) (3 Hrs)A MA-102 Applied Mathematics-II 5-1-0 20 30 50 100 41 B ME-101 Engineering Mechanics 5-1-0 20 30 50 100 4C MA-101 Mathematics-I 5-1-0 20 30 50 100 4A PH-102 Applied Physics 5-1-0 20 30 50 100 42 B EL-101 Electrical Engineering 5-1-0 20 30 50 100 4C PH-101 Physics 5-1-0 20 30 50 100 4A CS-101 Computer Programming 5-1-0 20 30 50 100 43 B CE-101Environmental Science &Ecology***5-0-0 20 30 50 100 3C CH-101 Applied Chemistry 5-0-0 20 30 50 100 34 C EN-101 Communication Skills 5-0-0 20 30 50 100 3PRACTICAL/DRAWING/DESIGNEvaluation SchemePeriods Components of Evaluation With WeightageSl.(%)No. Group CourseCourse NameNo.L-T-PEXPT.LabRecordMTEQuizzes/Viva-voceCrETE(2 Hrs) Total1 B ME-151 Engineering Mechanics Lab 0-0-2 40 10 20 30 100 1A PH-152 Applied Physics Lab 0-0-2 40 10 20 30 100 12 B EL-151 Electrical Engineering Lab 0-0-2 40 10 20 30 100 1C PH-151 Physics Lab 0-0-2 40 10 20 30 100 13A CS-151 Computer Programming Lab 0-0-2 40 10 20 30 100 1C CH-151 Applied Chemistry Lab 0-0-2 40 10 20 30 100 1A ME-152 Workshop Practice 0-0-4 40 10 20 30 100 24 B ME-153 Engineering Graphics 0-0-6** 40 10 20 30 100 3C EN-151 Language Lab 0-0-2 40 10 20 30 100 1Enterpreneural &40 10A PD-1930-0-220 30 100 1Professional Skills5Basics of Computer40 10B PD-1510-0-220 30 100 1FundamentalsC PD-192 Personality Skills 0-0-2 40 10 20 30 100 16 A/B/C PD-191 Co-curricular Activities 1*Note: A student will be placed in GROUP A/B/C for all the three terms in an academic year.GROUP TOTAL CONTACT HOURS TOTAL CREDITSA 15-3-10 (28) 17B 15-2-12 (29) 17C 20-2-8 (30) 18FINAL EVALUATION IN GRADES(L-T-P-Cr) - Lectures-Tutorials-Practicals-CreditsCW - Class WorkMTE-Mid-Term ExamETE – End-Term Exam* One credit to be earned in Term-III through Co-Curricular Activities outside contact hours. However, a studentis to register for this course in all the three terms of first year.** One hour for explanation/demonstration.*** CE-101 is a Mandatory Learning Course.15

B.Tech. Computer Science & Engineering (Regular)Scheme of StudiesB. Tech. Degree Programme (Regular)(Common to all Branches)1 st YearTERM – IIITHEORYEvaluation SchemePeriods Components of Evaluation withSl.Weightage (%)No. Group CourseCourse NameCrNo.Class MTE ETEL-T-PTotalWork (1½ Hrs) (3 Hrs)A ME-101 Engineering Mechanics 5-1-0 20 30 50 100 41 B MA-102 Applied Mathematics-II 5-1-0 20 30 50 100 4C MA-102 Applied Mathematics-II 5-1-0 20 30 50 100 4A EL-101 Electrical Engineering 5-1-0 20 30 50 100 42 B PH-102 Applied Physics 5-1-0 20 30 50 100 4C PH-102 Applied Physics 5-1-0 20 30 50 100 4A CE-101 Environmental Science & Ecology*** 5-0-0 20 30 50 100 33 B CH-101 Applied Chemistry 5-0-0 20 30 50 100 3C CS-101 Computer Programming 5-1-0 20 30 50 100 44 B EN-101 Communication Skills 5-0-0 20 30 50 100 3PRACTICAL/DRAWING/DESIGNEvaluation SchemePeriods Components of Evaluation WithSl.Weightage (%)No. Group CourseCourse NameNo.L-T-PEXPT.LabRecordMTEQuizzes/Viva-voceCrETE(2 Hrs) Total1 A ME-151 Engineering Mechanics Lab 0-0-2 40 10 20 30 100 1A EL-151 Electrical Engineering Lab 0-0-2 40 10 20 30 100 12 B PH-152 Applied Physics Lab 0-0-2 40 10 20 30 100 1C PH-152 Applied Physics Lab 0-0-2 40 10 20 30 100 13B CH-101 Applied Chemistry 0-0-2 40 10 20 30 100 1C CS-151 Computer Programming Lab 0-0-2 40 10 20 30 100 1A ME-153 Engineering Graphics 0-0-6** 40 10 20 30 100 34 B EN-101 Language Lab 0-0-2 40 10 20 30 100 1C ME-152 Workshop Practice 0-0-4 40 10 20 30 100 2Basics of Computer40 10A PD-1510-0-220 30 100 1Fundamentals5 B PD-192 Personality Skills 0-0-2 40 10 20 30 100 1Enterpreneural &C PD-1930-02 40 10 20 30 100 1Professional Skills6 A/B/C PD-191 Co-curricular Activities 1*Note: A student will be placed in GROUP A/B/C for all the three terms in an academic year.GROUP TOTAL CONTACT HOURS TOTAL CREDITSA 15-2-12 (29) 17+1*B 20-2-8 (30) 18+1*C 15-3-10 (28) 17+1*FINAL EVALUATION IN GRADES(L-T-P-Cr) – Lectures-Tutorials-Practicals-CreditsCW – Class WorkMTE – Mid-Term ExamETE – End-Term Exam* One credit to be earned in Term-III through Co-Curricular Activities outside contact hours. However, a studentis to register for this course in all the three terms of first year.** One hour for explanation/demonstration.*** CE-101 is a Mandatory Learning Course.16

Department of Computer Science & EngineeringScheme of StudiesB. Tech. Degree Programme (Regular)2 nd YearLingaya’s University, FaridabadTERM-IVSN Course No. Course Name L-T-P Cr1 MA-201 Applied Mathematics – III 5-1-0 42 CS-201 Data Structures & Algorithms 5-1-0 43 EC-208 Digital & Analog Communications 5-0-0 34 IT-202 Computer Networks 5-0-0 35 CS-251 Data Structures & Algorithms Lab 0-0-2 16 IT-252 Computer Networks Lab 0-0-2 17PD-292/PD-293/Effective Communication**/Intra & Inter-personal Skills/0-0-2 1PD-251 MATLAB8 PD-291 Co-curricular Activities 1*20-2-6 (28) 17TERM-VSN Course No. Course Name L-T-P Cr1 BA-225 Economics 5-0-0 32 CA-101 Database Management Systems 5-1-0 43 CS-202 Programming Languages 5-0-0 34 EC-201 Electronics Engineering 5-1-0 45 CA-151 Database Management Systems Lab 0-0-2 16 EC-251 Electronics Engineering Lab 0-0-2 17PD-292/PD-293/PD-251Effective Communication**/Intra & Inter-personal Skills/MATLAB0-0-2 18 PD-291 Co-curricular Activities 1 *20-2-6 (28) 17TERM-VISN Course No. Course Name L-T-P Cr1 CS-203 Discrete Structures 5-1-0 42 CS-204 Computer Organization & Architecture 5-1-0 43 CS-205 Analysis & Design of Algorithms 5-1-0 44 MA-202 Applied Numerical Methods 5-1-0 45 CS-254 Computer Organization & Architecture Lab 0-0-2 16 MA-252 Applied Numerical Methods Lab 0-0-2 17PD-292/PD-293/PD-251Effective Communication**/Intra & Inter-personal Skills/MATLAB0-0-2 18 PD-291 Co-curricular Activities 1*20-4-6 (30) 19+1*FINAL EVALUATION IN GRADES(L-T-P-Cr) - Lectures-Tutorials-Practicals-Credits* One credit to be earned in Term-VI through Co-Curricular Activities outside contact hours. However, astudent is to register for this course in all the three terms of second year.** PD-292 is a Mandatory Learning Course.17

B.Tech. Computer Science & Engineering (Regular)Department of Computer Science & EngineeringScheme of StudiesB. Tech. Degree Programme (Regular)3 rd YearTERM-VIISN Course No. Course Name L-T-P Cr1 CS-301 Theory of Computations 5-0-0 32 EC-302 Microprocessors and Interfacing 5-0-0 33 EC-304 Digital System Design 5-1-0 44 CS-302 Operating Systems 5-0-0 35 EC-352 Microprocessors and Interfacing Lab 0-0-2 16 EC-354 Digital System Design Lab 0-0-2 17 CS-352 Operating Systems Lab 0-0-2 18PD-392/PD-393/PD-353Problem Solving Skills/Advanced Professional Development**/System & Network Administration Lab0-0-2 19 PD-391 Co-curricular Activities 1*20-1-8 (29) 17TERM-VIIISN Course No. Course Name L-T-P Cr1 IT-301 Web Development 5-1-0 42 IT-302 Open Source Based Rapid Application Development 5-1-0 43 CS-303 Computer Graphics 5-1-0 44 IT-304 Software Engineering 5-0-0 35 IT-352 Open Source Based Rapid Application Development Lab 0-0-2 16 CS-353 Computer Graphics Lab 0-0-2 17 IT-351 Web Development Lab 0-0-2 18PD-392/PD-393/PD-353Problem Solving Skills/Advanced Professional Development**/System & Network Administration Lab0-0-2 19 PD-391 Co-curricular Activities 1*20-3-8 (31) 19TERM-IXSN Course No. Course Name L-T-P Cr1 BA-226 Principles of Management 5-0-0 32 IT-305 Data Mining & Data Warehousing 5-1-0 43 EC-307 Wireless Communication 5-1-0 44 IT-307 Multimedia Technologies 5-0-0 35 IT-355 Data Mining & Data Warehousing Lab 0-0-2 16 IT-357 Multimedia Technologies Lab 0-0-2 17PD-392/PD-393/PD-353Problem Solving Skills/Advanced Professional Development**/System & Network Administration Lab0-0-2 18 PD-391 Co-curricular Activities 1*20-2-6 (28) 17+1*SUMMER TERM – INDUSTRY TRAINING/FIELD TRAINING/INTERNSHIP-IFINAL EVALUATION IN GRADES(L-T-P-Cr) - Lectures-Tutorials-Practicals-Credits* One credit to be earned in Term-IX through Co-Curricular Activities outside contact hours. However, a studentis to register for this course in all the three terms of 3 rd year.** PD-393 is a Mandatory Learning Course.18

Department of Computer Science & EngineeringScheme of StudiesB. Tech. Degree Programme (Regular)(PROJECT MODE)4 th YearLingaya’s University, FaridabadTERM-XSN Course No. Course Name L-T-P Cr1 IT-402 Advanced Java 5-1-0 42 Dept. Elective – I 5-0-0 33 CS-401 Neural Networks 5-0-0 34 IT-452 Advanced Java Lab 0-0-2 15 CS-451 Neural Networks Lab 0-0-2 16 CS-491 Community Service Oriented Project (CSOP) # 0-0-2 17 CS-492 Project (including Seminar) 0-0-4 28 CS-493 Industrial Training/Field Training** 0-0-2 19 PD-453 Visual Programming Techniques Lab 0-0-2 110 PD-491 Co-curricular Activities 1*15-1-14 (30) 17TERM-XISN Course No. Course Name L-T-P Cr1 CS-402 Artificial Intelligence 5-0-0 32 Open Elective 5-0-0 33 CS-452 Artificial Intelligence Lab 0-0-2 14 CS-481 Major Project Phase-I*** 0-0-10 55 CS-494 Seminar – I**** 0-0-2 16 PD-491 Co-curricular Activities 1*10-0-14 (24) 13TERM-XIISN Course No. Course Name L-T-P Cr1 Dept. Elective-II 5-0-0 32 Dept. Elective-III 5-0-0 33 Dept. Elective-IV 5-0-0 34 CS-453 Department Lab 0-0-2 15 CS-482 Major Project Phase-II 0-0-6 36 CS-495 Seminar – II***** 0-0-2 17 PD-491 Co-curricular Activities 1*15-0-10 (25) 14+1*FINAL EVALUATION IN GRADES(L-T-P-Cr) – Lectures-Tutorials-Practicals-Credits# CSOP is a mandatory learning course.* One credit to be earned in Term-XII through Co-Curricular Activities outside contact hours. However, a studentis to register for this course in all the three terms of 4 th year.** To be evaluated based on the work done during Summer Term after Term-IX.*** Marks of Major Project Phase-I to be added to marks of Major Project Phase-II for award of final grade.**** To be based on Major Project Phase-I.***** To be based on Major Project Phase-II.19

B.Tech. Computer Science & Engineering (Regular)Department of Computer Science & EngineeringScheme of StudiesB. Tech. Degree Programme (Regular)(INTERNSHIP MODE)4 th YearTERM-XSN Course No. Course Name L-T-P Cr1 IT-402 Advanced Java 5-1-0 42 Dept. Elective – I 5-0-0 33 CS-401 Neural Networks 5-0-0 34 IT-452 Advanced Java Lab 0-0-2 15 CS-451 Neural Networks Lab 0-0-2 16 CS-491 Community Service Oriented Project (CSOP) # 0-0-2 17 CS-492 Project (including Seminar) 0-0-4 28 CS-483 Internship - I** 0-0-2 19 PD-453 Visual Programming Techniques Lab 0-0-2 110 PD-491 Co-curricular Activities 1*15-1-14 (30) 17TERM-XISN Course No. Course Name L-T-P Cr1 CS-494 Seminar - I*** 0-0-2 12 CS-484 Internship - II (in industry) 0-0-24 123 PD-491 Co-curricular Activities 1*0-0-26 (26) 13TERM-XIISN Course No. Course Name L-T-P Cr1 Dept. Elective-II 5-0-0 32 Dept. Elective-III 5-0-0 33 Dept. Elective-IV 5-0-0 34 CS-453 Department Lab 0-0-2 15 CS-485 Internship Documentation 0-0-6 36 CS-495 Seminar - II **** 0-0-2 17 PD-491 Co-curricular Activities 1*15-0-10 (25) 14+1*FINAL EVALUATION IN GRADES(L-T-P-Cr) - Lectures-Tutorials-Practicals-Credits# CSOP is a mandatory learning course.* One credit to be earned in Term-XII through Co-Curricular Activities outside contact hours. However, a studentis to register for this course in all the three terms of 4 th year.** To be evaluated based on the work done during Summer Term after Term-IX.*** To be based on Internship-II and to be given in the beginning of Term-XII.**** To be based on Internship Documentation.20

Lingaya’s University, FaridabadLIST OF DEPT. ELECTIVESStream 1: Software DevelopmentCode Course L-T-P Cr1 CS-421 Compiler Design 5-0-0 32 CS-422 Cryptography and Data Compression 5-0-0 33 IT-422 Computer Software Testing 5-0-0 34 IT-423 Introduction to E-commerce & ERP 5-0-0 35 IT-424 Mobile Computing 5-0-0 36 IT-425 Object Oriented Software Engineering & UML 5-0-0 3Stream 2: Research & DevelopmentCode Course L T P Credits1 CS-432 Natural Language Processing 5 0 0 32 CS-433 Computer Vision/Image Processing 5 0 0 33 CS-434 Expert Systems 5 0 0 34 CS-436 Speech Recognition & Generation 5 0 0 35 CS-437 Soft Computing 5 0 0 36 IT-431 Bioinformatics 5 0 0 37 IT-445 Human Computer Interaction 5 0 0 3Stream 3: Advanced ComputingCode Course L T P Credits1 CS-431 Advanced Computer Architecture 5 0 0 32 CS-435 Robotics 5 0 0 33 CS-441 Advanced Database Management Systems 5 0 0 34 CS-442 Digital Image Processing 5 0 0 35 CS-444 Real-time Operating Systems 5 0 0 36 EC-305 Embedded Systems Design 5 0 0 3Stream 4: IT Service ManagementCode Course L T P Credits1 CS-443 Distributed Computing 5 0 0 32 IT-441 Network Security & Management 5 0 0 33 IT-442 Information Security 5 0 0 34 IT-443 Information Storage & Management 5 0 0 35 IT-444 Pervasive Computing 5 0 0 321

B.Tech. Computer Science & Engineering (Regular)IMPORTANT NOTES1. Laboratory Courses are being offered as distinct courses (0-0-2) without being mixed with lecture components.2. Conduct of Lab Courses:a. At least ten experiments/programs/exercises are to be performed in a term.b. It is expected that more experiments/programs/exercises are designed and set as per the scope of thesyllabus, which may be added to the above list.c. One or more than one experiments/programs/exercises may be performed in one lab period in order toutilize the time properly.d. The scheme of operation is to be approved by HOD.3. Students admitted through Lateral Entry Scheme will be required to take a Bridge Course on Mathematics(5-0-0) as an Audit Course.4. Assessment of Industrial/Field Training and Internship-I will be based upon certificate of Industry/Field trainingobtained by the student, report, seminar and viva-voce examination. A student who is awarded 'FF' Grade isrequired to repeat Industry/Field training.5. The choice of the students for any elective shall not be a binding for the department to offer, if the departmentdoes not have expertise.6. For open elective, all students will be permitted to opt for any one elective run by another department. However,the departments will offer only those elective for which they have expertise. Further, the students will not beallowed to opt for any course under this category, which has already been done. An open elective opted duringthe end of tenth term, allotted list of which will be displayed on notice board and taught in the eleventh term.7. The choice of students for the Internship stream shall not be a binding for the department to offer.8. Elective-II is not required to be done by the students pursuing the degree through Internship Mode.9. Students are allowed in the examination the use of single memory, non-programmable calculator. However,sharing of calculator is not permitted.10. The B. Tech. degree programmes in Computer Science & Engineering and Information Technology constituteone group for the purpose of deciding core courses as these all are based on electrical sciences.11. For the students admitted in 2009-10 the sequence of PD Courses is given in the table below:Professional Development (PD) – Gen.PD-251 MATLAB 0-0-2 1PD-191 Co-curricular Activities 11 st YearPD-292 Effective Communication 0-0-2 1PD-393 Advanced Professional Development 0-0-2 1PD-151N* Basics of Computer Fundamentals 0-0-2 1PD-291 Co-curricular Activities 12 nd YearPD-192 Personality Skills 0-0-2 1PD-193 Entrepreneurial & Professional Skills 0-0-2 1PD-353 System & Network Administration Lab 0-0-2 1PD-391 Co-curricular Activities 13 rd YearPD-392 Problem Solving Skills 0-0-2 1PD-293 Intra & Inter-personal Skills 0-0-2 1PD-453 Visual Programming Techniques Lab 0-0-2 14 th YearPD-491 Co-curricular Activities 1* The contens for PD-151N are the same as for PD-151.22

Lingaya’s University, FaridabadDETAILED SYLLABUSGEN., BSM, ESTA, DEPT. CORE & ELECTIVEBA-225ECONOMICSL T P Cr5 0 0 3BA-226PRINCIPLES OF L T P CrMANAGEMENT 5 0 0 3OBJECTIVEThe purpose of this course is to• Acquaint the students in the basic economicconcepts and their operational significance and• Stimulate him to think systematically andobjectively about contemporary economicproblems.1. INTRODUCTION: Definition of economics;difference between micro and macro economics;central problems of economy including PP curve;factors of production2. UTILITY: concept and measurement of utility; Lawof Diminishing Marginal Utility (DMU); derivation ofLaw of Demand from Law of DMU; Law ofEquimarginal Utility (EMU) – its practicalapplications3. DEMAND: What is demand and supply; shift indemand and extension of demand; law of demandand law of supply; demand function; demandschedule; elasticity of demand; measurement ofelasticity of demand; factors affecting elasticity ofdemand; role of demand and supply in pricedetermination and effect of changes in demandand supply on prices4. PRODUCTION FUNCTIONS: Meaning ofproduction and production functions; Law ofVariable Proportion; returns to scale, internaland external economies and diseconomies ofscale.5. COSTS: Various concepts of costs: fixed cost,variable cost, average cost, marginal cost,opportunity cost; shape of average cost,marginal cost, total cost etc. in short run andlong run.6. MARKET STRUCTURES: What is market; mainfeatures of perfect competition; monopoly;oligopoly; monopolistic competition.7. MACRO ECONOMICS: Macro economics: briefconcepts of GDP, GNP, NI, per capita income;inflation; privatization; globalization (merits &demerits); elementary concepts of VAT, WTO,GATT and TRIPSTEXT BOOKHirshey M., “Managerial Economics”, ThomsonLearning, 2007REFERENCE BOOKS1. Monroe Kent B., “Pricing Making ProfitableDecisions”, McGraw Hill, New York, 20062. Keat Paul B., and Young Philip K. Y., “ManagerialEconomics - Economic Tools for Today’s DecisionMakers”, Pearson Education, 2003OBJECTIVETo acquaint the students with various concepts ofmanagement which will be very basic to appreciate thesubject.1. INTRODUCTION: Meaning of management,definitions of management, characteristics ofmanagement, management vs. administration;management: art, science and profession;importance of management; Fayol’s principles ofmanagement; the management functions;interrelationship of managerial functions.2. FORMS: Forms of organizational structure (line,line & staff, functional); delegation of authority;centralization & decentralization.3. GROUPS: Formal & informal groups; stages inteam development, empowerment concept,significance; changing nature of managerial work;outsourcing.4. CORPORATE SOCIAL RESPONSIBILITY:Corporate social responsibility – meaning;responsibility towards different stakeholders;ethics in management – meaning; factors effectingethical choices.5. STAFFING: Nature and significance of staffing;human resource management - functions ofhuman resource management; human resourceplanning; process of human resource planning;recruitment, selection; promotion-seniority vs.merit.6. MARKETING MANAGEMENT: Marketingmanagement – definition of marketing, marketingconcept, objectives and functions of marketing;marketing mix (basics of 4Ps of marketing);difference between goods and services; steps ofpersonal selling.7. FINANCIAL MANAGEMENT: Introduction offinancial management; objectives of financialmanagement; functions and importance offinancial management; brief introduction to theconcept of capital structure and various sources offinance.TEXT BOOKChhabra T. N., “Principles and Practice ofManagement”, Dhanpat Rai Publishers, 2008REFERENCE BOOKS1. Aggarwal R. D., “Organization and Management”,Tata McGraw Hill, 19952. Prasad L. M., “Principles and Practice ofManagement”, Sultan Chand & Sons, 20053. Harold, Koontz and O’Doneell Cyril,“Management”, McGraw Hill, 196823

B.Tech. Computer Science & Engineering (Regular)4. Sherlekar S. A., “Marketing Management”,Himalaya Publishing House, 20095. Pandey I. M., “Financial Management”, VikasPublishing House, New Delhi, 20056. Stoner James A. F. and Freemann R. Edward,“Management”, 6th Edition, Prentice Hall of India,20007. Prasad L. M., “Organizational Behavior”, SultanChand & Sons, 20088. Singh & Chhabra, “Business Organization &Management”, Dhanpat Rai PublishersCA-101DATABASE MANAGEMENT L T P CrSYSTEMS 5 1 0 4OBJECTIVETo provide knowledge about various organizations andmanagement information systems, keeping in view theaspects of shareability, availability, evolvability andintegrityPRE-REQUISITESKnowledge of data structures, discrete mathematicalstructures1. INTRODUCTION: Purpose of database system;characteristics of database approach; advantages ofusing DBMS; database concept and architecture;data abstraction; data models; instances andschema; data independence; schema architecture;database languages; database manager; databaseadministrator; database users.2. DATA MODELING: Entity sets attributes and keys,relationships (ER); database modeling using entity;type role and structural constraints, weak andstrong entity types; enhanced entity-relationship(EER), ER diagram design of an E-R databaseschema; object modeling, specialization andgeneralization; modeling of union types3. RELATIONAL MODEL: Introduction toHierarchical model and Network Model. Relationalmodel: relational model -basic concepts, enforcingdata integrity constraints, relational-algebraoperations, extended relational algebra operations,relational calculus, assertion and triggers,introduction on views, Codd's rules.4. DATABASE DESIGN: Database design process;relational database design, relation schema,anomalies in a database; functional dependenciesmembership and minimal covers normal forms,multi-valued dependencies, join dependencies,inclusion dependencies; reduction of an E-Rschema to tables; converting EER diagrams torelations; practical database design tuning; effectof de-normalization on database performance5. QUERY LANGUAGES: Query-by-example (QBE);introduction to SQL, basic queries in SQL,advanced queries in SQL, functions in SQL; basicdata retrieval, aggregation, categorization, updatesin SQLs; views in SQL, different types of views,theoretical updatability of views.6. FILE ORGANIZATION: Introduction, indexing andhashing, overview of file organization techniques;secondary storage devices, operations in files,heap files and sorted files; indexing and hashing-basic concepts, static hashing, dynamic hashingand extendible hashing; ordered indices, types ofsingle level ordered index, multi-level indexesbasics, multi-level indexes7. TRANSACTION PROCESSING: Desirableproperties of transactions, implementation ofatomicity and durability; reconsistent model, readonly and write only model; concurrent executions,schedules and recoverability; serializability ofschedules concurrency control; serializabilityalgorithms; testing for serializability; precedencegraph; concurrency control, deadlock handling -detection and resolutionTEXT BOOKSilberschatz A., Korth H. F. and Sudarshan S.,“Database System Concepts”,6th edition, McGraw-Hill,International Edition, 2010REFERENCE BOOKS1. Desai Bipin, “Introduction to DatabaseManagement System”, Galgotia Publications, 19912. Elmasri R. and Navathe S. B., “Fundamentals ofDatabase Systems”, 6th edition, Addison-Wesley,Low Priced Edition, 20103. Date C. J., “An Introduction to Database Systems”,8th edition, Addison-Wesley, Low Priced Edition,20034. Date C. J. and Darwen H., “A Guide to the SQLStandard”, 4th edition, Addison-Wesley, 20035. Hansen G. W. and Hansen J. V., “DatabaseManagement and Design”, 2nd edition, Prentice-Hall of India, Eastern Economy Edition, 19996. Majumdar A. K. and Bhattacharyya P., “DatabaseManagement Systems”, 5th edition, Tata McGraw-Hill Publishing, 19997. Looms, “Data Management & File Structure”,Prentice Hall of India, 1989CA-151DATABASE MANAGEMENT L T P CrSYSTEMS LAB 0 0 2 1LIST OF EXPERIMENTSWrite programs to carry out:1. Record operations:a) Creating a tableb) Add a record, delete a record, modify therecord in the databasec) Generate queriesd) Generate the report; listing all the records ofdatabase in ascending ordere) Create table from a given tablef) Insert the data into the table interactivelymeans by using & operator.2. Menu driven project for management of databasesystem3. Delete data from the given table.• Delete data from the table based on the givencondition.• Update the contents of the table• Modify the structure of the table.• Delete complete structure of the table4. Create Keys: Table with Primary Key; Table withForeign Key, Non Null and Unique Constraints;24

Lingaya’s University, FaridabadTable with Check and Default Constraints; Insertdata in the Tables created with constraints5. Use of operators: Scaler Operators, GroupOperators; Pattern matching operator6. Locking and unlocking the table, using differentmodes like Exclusive and Share, etc.7. Create View and see the relationship with table ithas been created from, and finally, drop the view8. Use command to save the already executedcommand• Change contents the most recently executedcommand.• Delete any line of the command.• Use Pseudo Columns in the Table.• Run the saved Command.• Edit using Word Processor and save thecommand or Program in the desired Drive9. Create cursor, fetch data and show application ofcursor10. Create a function and use cursor in the function11. Create Procedure.12. Create Package and use Procedure and Function13. Create a Trigger on a table14. Perform various table operations: Delete thestructure, use Delete command with conditions,Update records of the table with conditions, Alterstructure of the table, Add a new column into thetable, Change size of the existing column in thetable, etc.15. Create the view from the table, combine usingequi-join, retrieve data with left join, outer join andself joinREFERENCE BOOKS1. Date C. J. and Darwen H., “A Guide to the SQLStandard”, 4th edition, Addison-Wesley, 20032. Desai Bipin, “Introduction to DatabaseManagement System”, Galgotia Publications, 19913. Date C. J., “An Introduction to Database Systems”,8th edition, Addison-Wesley, Low Priced Edition,2003.CE-101ENVIRONMENTAL SCIENCE L T P CrAND ECOLOGY 5 0 0 3OBJECTIVEEnvironmental Studies is a multidisciplinary area, theissues of which every one should know. The aim of thecourse is to make everyone aware of environmentalissues like continuing problems of pollution, loss offorest, solid waste disposal, and degradation ofenvironment. Issues like economic productivity andnational security, global warming, the depletion ofozone layer and loss of biodiversity are other seriousconcerns before the mankind.1. THE MULTIDISCIPLINARY NATURE OFENVIRONMENTAL STUDIES: Basic definitionsrelated to environment; Scope, vis-à-visenvironmental science and environmentalengineering; Causes of environmentaldegradation, atmospheric composition andassociated spheres, habitat and climate; objective,goals and principles involved in environmentaleducation, environmental awareness,environmental ethics, environmental organizationand their involvement.2. NATURAL RESOURCES: Renewable and nonrenewableresources; forest resources, overexploitation,and deforestation / afforestation;water resources, impact of over-utilization ofsurface and ground water, floods, drought,conflicts over water, dams; mineral resources:dereliction of mines, environmental effects ofextracting and using mineral resources; Foodresources, modern agriculture and its impact,problem associated with fertilizer and pesticide,water logging, salinity ; energy resources,renewable, non-renewable energy sources, solarenergy, wind energy, hydro energy, biomassenergy, geothermal energy, nuclear energy and itsassociated hazards; land as a resource, landdegradation, man induced landslides, soil erosionand desertification.3. ECOSYSTEMS: Concept of an ecosystem,structure and function of an ecosystem, producers,consumers and decomposers, energy flow in theecosystem, ecological succession, food chains,food webs and ecological pyramids; characteristicfeatures, structure and function of the followingecosystem -forest ecosystem, grasslandecosystem desert ecosystem and aquaticecosystems.4. BIODIVERSITY AND ITS CONSERVATION: Biogeographicalclassification of India; biodiversity atglobal, national and local levels, India as a megadiversitynation, hot-spots of biodiversity; value ofbiodiversity-consumptive use, productive use,social, ethical aesthetic and option values; threatsto biodiversity; conservation of biodiversity: in-situand ex-situ conservation of biodiversity.5. ENVIRONMENTAL POLLUTION: Causes, effectsand control measures of air pollution, waterpollution, soil pollution, marine pollution, noisepollution, thermal pollution, solid wastemanagement, e-waste management; disastermanagement – floods, earthquake, cyclone andlandslides.6. SOCIAL ISSUES AND THE ENVIRONMENT:Water conservation, rain water harvesting,watershed management; climate change, globalwarming, acid rain, ozone layer depletion;Environmental Protection Act, Air (Prevention andControl of Pollution) Act, Water (Prevention andControl of Pollution) Act, Wildlife Protection Act,Forest Conservation Act.7. HUMAN POPULATION AND THEENVIRONMENT: Population growth, populationexplosion – family welfare programmes; role ofinformation technology in environment and humanhealth; case studies, Chipko movement, SaradarSarovar dam, mining and quarrying in Udaipur,salinity and water logging in Punjab, Haryana andRajasthan, Bhopal gas tragedy, Chernobyl nucleardisaster, arsenic pollution in ground water.TEXT BOOKKaushik, Anubha, and Kaushik, C.P., “Perspectives inEnvironmental Studies”, New Age InternationalPublishers, 200425

Lingaya’s University, FaridabadCH-151APPLIED CHEMISTRY LABL T P Cr0 0 2 1LIST OF EXPERIMENTS1. Determination of Ca++ and Mg++ hardness ofwater using EDTA solution.2. Determination of alkalinity of water sample.3. Find the melting and eutectic point for a twocomponent system by using method of coolingcurve.4. Determination of viscosity of lubricant by RedWood viscometer (No. 1 & No. 2).5. Prepare Phenol-formaldehyde and Ureaformaldehyde resin.6. Find out Saponification number of oil.7. Determination of concentration of KMnO 4 solutionspectro-photometerically.8. Determination of strength of HCl solution bytitrating it against NaOH solutionconductometerically.9. Determination of drop point of given lubricant usingdrop point apparatus.10. Estimate the sugar (Glucose) using Fehlingsolution method.11. Determine flash point and fire point of oil byPensky - Marten's flash point apparatus.12. Determine amount of sodium and potassium in agiven water sample by flame photometer.REFERENCE BOOKS1. Dara, S. S. “A Text Book on Experimental andCalculation – Engineering Chemistry”, S. Chand &Company.2. Chawla, Shashi, “Essential of ExperimentalEngineering Chemistry”, 2nd Edition, Dhanpat RaiPublishing Company, 20063. Virmani, O. P., and Narula, A. K., “Theory &Practice Applied Chemistry”, New AgePublications.CS-101COMPUTER PROGRAMMINGL T P Cr5 1 0 4OBJECTIVETo provide sound conceptual understanding of thefundamental concepts of computing hardware,software, networking and services; build programminglogic and developing skills in problem solving usingC/C++; Introduce the concept of object orientation andon how to handle data in different forms; Emphasizethe concepts and constructs rather than on languagefeatures.1. AN OVERVIEW OF COMPUTER SYSTEM:Anatomy of a digital computer; memory units; mainand auxiliary storage devices; input devices;output devices; classification of computers;computer hardware; computer software; datarepresentation – bits and bytes and operations ofdata; radix number system – decimal, binary,octal, hexadecimal numbers and their interconversions;representation of information insidethe computers.2. OPERATING SYSTEM BASICS: The userinterface; running programs; managing files;introduction to PC operating systems: Unix/Linux,DOS, MacOS and Windows, file system; fileformats.3. INTERNET BASICS: Introduction to computernetworks; what is internet and WWW; basic WWWconcepts; surfing the web; web multimedia;internet applications and features.4. PROGRAMMING LANGUAGES: Machine levellanguage; assembly level language; high levellanguage; system software: assembler, compiler,interpreters, linker and loader, and their interrelationship,debuggers, IDE; programmingfundamentals – problem definition, algorithms, flowcharts and their symbols.5. C PROGRAMMING LANGUAGE CONSTRUCTS:An overview of C; expressions – data types,identifiers names, variables, type qualifiers,storage class specifiers, operators, typeconversion in expression, type casting; consoleI/O: I/O functions; the C standard library; problemsolving process algorithm: pseudo code andflowchart; statements – true and false in C,selection statements, iteration statements, jumpstatements, expression statements and blockstatements; arrays – single dimensions arrays,generating a pointer to an array, passing 1D arrayto functions; string: 2D arrays, multidimensionalarray, indexing pointers, array initialization,variable-length array6. DATA HANDLING: Pointers – Pointer variables,pointer operators, pointer expressions, pointersand arrays, multiple indirection, initializing pointers,C's dynamic allocation functions, restrict-qualifiedpointers, problems with pointers; functions: thegeneral form of a function, scope of a function,function arguments, argc and argv — arguments tomain( ), the return statement, purpose of main( ),recursion, function prototypes, the ''implicit int"rule; structures, unions, enumerations, and typedef– structures, arrays of structures, passingstructures to functions, structure pointers, arraysand structures within structures, unions, bit-fields,enumerations, using sizeof to ensure portability,typedef; important differences between C and C++.7. ADVANCED DATA HANDLING: Basic file I/O – Cvs. C++ File I/O, standard C Vs. Unix file I/Ostreams and files, file system basics, fread() andfwrite(), fseek() and random-access, fprintf() andfscanf(); the preprocessor and comments – thepreprocessor, conditional compilation directives,using defined, the # and ## preprocessoroperators, predefined macro names, comments.TEXT BOOKSchildt, Herbert “The Complete Reference C”, 4thEdition, Tata McGraw Hill, 2004.REFERENCE BOOKS1. Balagurusamy, E., “Computing Fundamentals and CProgramming”, Tata McGraw Hill, 5 th Edition, 2010.2. Dennis, P. Curtin, Foley Kim, Sen Kunal and MorinCathleen, “Information Technology”, Tata McGrawHill, 17 Edition, 2005.3. Dennis, M. Ritchie and Brian, W. Kernigham, “TheC Programming Language, Prentice Hall of India,1988.27

B.Tech. Computer Science & Engineering (Regular)4. Nabajyoti, Barkakati, “Object OrientedProgramming in C++”, Prentice Hall of India, 3 rdEdition, 1995.5. Jack, B. Rochester, “Using Computers andInformation”, Prentice Hall of India, 1996.6. Byron, C. Gottfried, “Theory and Problem ofProgramming with C”, Tata McGraw Hill7. Press, Barry and Press, Marcia, “Teach Yourselfall About Computers”, IDG Books India, 2000.8. Schildt, Herbert, “C++: The Complete Reference”,Tata McGraw Hill, 4 th Edition, 20039. Liberty, Jesse, “Programming C#”, O’Reilly, 4 thEdition, 2005.WEB REFERENCES1. http://www.physics.drexel.edu/courses/Comp_Phys/General/C_basics/c_tutorial.html2. http://www.eskimo.com/~scs/cclass/notes/top.html3. http://www.lysator.liu.se/c/bwk-tutor.htmlCS-151COMPUTER PROGRAMMING L T P CrLAB 0 0 2 1LIST OF EXPERIMENTS/EXERCISES1. Basic/Simple logic building2. Handling mathematical data3. Use of control structures4. Use of Function5. Handling mathematical problems6. Array and Pointer7. Searching and Sorting8. String Manipulation9. Use of Structure and Union10. File handlingREFERENCE BOOKS1. Dennis, M. Ritchie and Brian, W. Kernigham, “TheC Programming Language”, Prentice Hall of India,1988.2. Byron, C. Gottfried, “Theory and Problem ofProgramming with C”, Tata McGraw Hill3. Barkakati, Nabajyoti, “Object OrientedProgramming in C++”, Prentice Hall of India, 2001.4. Schildt, Herbert, “C++: The Complete Reference”,Tata McGraw Hill, 4 th Edition, 2003CS-201DATA STRUCTURES & L T P CrALGORITHMS 5 1 0 4OBJECTIVETo relay the theoretical and practical fundamentalknowledge of most commonly used algorithms.PRE-REQUISITESKnowledge of basic computer programming1. INTRODUCTION TO DATA STRUCTURES:Definition of data structures and abstract datatypes; polymorphic data types; linear vs. non-lineardata types; primitive vs. non-primitive data types;static and dynamic implementations; arrays, 2, 3and multi-dimensional arrays; examples and reallife applications.2. RUNNING TIME: Time complexity; Big Ohnotation; running times; best case, worst case,average case; factors depends on running time;introduction to recursion; divide and conqueralgorithm; evaluating time complexity.3. STACKS AND QUEUES: Stacks: definition, arraybased implementation of stacks, linked list basedimplementation of stacks; examples: infix, postfix,prefix representation; conversions, applications;definition of queues; array based implementationof queues4. LINKED LISTS: Lists; linked list implementation ofstacks and queues; circular implementation ofqueues and singly linked lists; straight / circularimplementation of doubly linked queues; priorityqueues; applications.5. TREES: Definition of trees and binary trees;properties of binary trees and implementation;binary traversal pre-order, post-order, in-ordertraversal; binary search trees; implementations;threaded trees; balanced multi way search trees;AVL trees; implementations6. GRAPHS: Definition of undirected and directedgraphs and networks; array based implementationof graphs; adjacency matrix; path matriximplementation; linked list representation ofgraphs; shortest path algorithm, graph traversal:breadth first traversal, depth first traversal; hashtables, hash function; implementations andapplications.7. SORTING AND SEARCHING ALGORITHMS:Introduction, sorting by exchange, selection,insertions, bubble sort, straight selection sort,efficiency of above algorithms; shell sort,performance of shell sort, merge sort, merging ofsorted arrays and algorithms; quick sort algorithmanalysis, heap sort: heap construction, heap sort,bottom – up, top – down heap sort approach;searching algorithms: straight sequential search,binary search (recursive & non–recursivealgorithms)TEXT BOOKLangsam, Augentem M.J. and Tenenbaum A. M.,“Data Structures using C & C++”, Prentice Hall of India,2009.REFERENCE BOOKS1. Aho A. V., Hopcroft J. E. and Ullman T. D., “DataStructures and Algorithms”, Original Edition,Addison-Wesley, Low Priced Edition, 1983.2. Horowitz Ellis and Sahni Sartaj, “Fundamentals ofData Structures”, Addison-Wesley Pub, 1984.3. Horowitz, Sahni and Rajasekaran, “Fundamentalsof Computer Algorithms” 2007.4. Kruse Robert, “Data Structures and ProgramDesign in C”, Prentice Hall of India, 19945. Lipschetz Jr. Seymour, “Theory & Problems ofData Structures”, Schaum’s Outline, Tata McGrawHill6. Weiss Mark Allen, “Data Structures and AlgorithmsAnalysis in C”, Pearson Education, 20007. Cormen T. H. et al., “Introduction to Algorithms”,2nd Edition, Prentice Hall of India, 2001.8. Dasgupta Sanjay, Christos P. and Vazirani Umesh,“Algorithms”, Tata McGraw Hill, 200828

Lingaya’s University, FaridabadWEB REFERENCES1. http://www.cs.auckland.ac.nz/software/AlgAnim/ds_ToC.html2. http://en.wikipedia.org/wiki/Data_structure3. http://www.itl.nist.gov/div897/sqg/dads/4. http://www.brpreiss.com/books/opus4/html/book.htmlCS-202PROGRAMMING L T P CrLANGUAGES 5 0 0 3OBJECTIVEThis subject focuses on the fundamental concepts thatunderlie programming language syntax and semanticsthrough a comparative study of several languages andtheir features; to learn several new programminglanguage features and paradigms.PRE-REQUISITESKnowledge of data structures, microprocessors andinterfacing1. INTRODUCTION: Syntactic and semantic rules ofa Programming language; Characteristics of agood programming language; Programminglanguage translators compiler and 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.2. STRUCTURED DATA OBJECTS : Structured dataobjects & data types; specification &implementation of structured data types;Declaration & type checking of data structure;vector & arrays; records; Character strings;variable size data structures; Union, pointer &programmer defined data objects; sets; files.3. SUBPROGRAMS AND PROGRAMMERDEFINED DATA TYPES: Evolution of data typeconcept; abstraction, encapsulation & informationhiding; Subprograms; type definitions; abstractdata types.4. SEQUENCE CONTROL: Implicit & explicitsequence control sequence; control withinexpressions; sequence control within statement,Subprogram sequence control: simple call return,recursive subprograms; Exception & exceptionhandlers; co routines; sequence control.5. DATA CONTROL: Names & referencingenvironment; static & dynamic scope; blockstructure; Local data & local referencingenvironment; Shared data: dynamic & static scope;Parameter & parameter transmission schemes.6. STORAGE MANAGEMENT: Major run timeelements requiring storage; programmer andsystem controlled storage management & phases;Static storage management; Stack based storagemanagement; Heap storage management; variable& fixed size elements.7. PROGRAMMING LANGUAGES: Introduction toprocedural, non-procedural, structured, functionaland object oriented programming language;Comparison of C & C++ programming languages.TEXTBOOKPratt and Zelkowitz, “Programming Languages:Design and Implementation”, 4th edition, PrenticeHall, 2001REFERENCES1. Tucker Allen & Noonan Robert, “ProgrammingLanguages – Principles and Paradigms”, TataMcGraw Hill, 20062. Ellis Horowitz, “Fundamentals of Programminglanguages”, Galgotia Publications/ SpringerVerlag, 19843. Ghezzi C., “Programming Languages Concepts”,3 rd ed., Wiley Publications, 1997.WEB REFERENCES1. http://www.personal.kent.edu/~rmuhamma/Algorithms/algorithm.html2. http://www.fib.upc.edu/en/infoAca/estudis/assignatures/ADA.html3. http://algo.inria.fr/AofA/CS-203DISCRETE STRUCTURESL T P Cr5 1 0 4OBJECTIVETo lay mathematical foundation for the fundamentals ofvarious computational structures such as Booleanalgebra, propositional logic, graph and trees.PRE-REQUISITESKnowledge of Data Structure1. SET THEORY: Introduction to set theory; setoperations; algebra of sets: duality, finite andinfinite sets, classes of sets, power sets, multi sets,Cartesian product, representation of relations,types of relation, equivalence relations andpartitions, partial ordering relations and lattices;function and its types, composition of function andrelations; cardinality and inverse relations2. PROPOSITIONAL CALCULUS: Basic operations:AND (Λ), OR (V), NOT (~), truth value of acompound statement, propositions, tautologies,contradictions.3. TECHNIQUES OF COUNTING: Permutations withand without repetition, combination.4. RECURSION AND RECURRENCE RELATION:Polynomials and their evaluation; sequences,introduction to AP, GP and AG series, partialfractions; linear recurrence relation with constantcoefficients; homogeneous solutions, particularsolutions, total solution of a recurrence relationusing generating functions.5. ALGEBRIC STRUCTURES: Definition andexamples of a monoid, semigroup, groups andrings; homomorphism, isomorphism andautomorphism; subgroups and normal subgroups;cyclic groups, integral domain and fields; co-sets;Lagrange’s theorem6. GRAPHS: Introduction to graphs, directed andundirected graphs; homomorphic and isomorphicgraphs; subgraphs; cut points and bridges;multigraph and weighted graph; paths and circuits,shortest path in weighted graphs; Eulerian path29

B.Tech. Computer Science & Engineering (Regular)and circuits, Hamilton paths and circuits; planargraphs; Euler’s formula.7. TREES: Trees, spanning trees, binary trees and itstraversalsTEXT BOOKLiu C. L., “Elements of Discrete Mathematics”, McGrawHill, 1989REFERENCE BOOKS1. Johnson Bough R., “Discrete Mathematics”, 5thEdition, Pearson Education, 20012. Graham Ronald, Knuth Donald E. and PatashikOren, “Concrete Mathematics: A Foundation forComputer Science”, Addison-Wesley, 19893. Gersting Judith L., “Mathematical Structures forComputer Science”, Computer Science Press, 19934. Chtewynd A. and Diggle P., “DiscreteMathematics”, Modular Mathematics Series,Edward Arnold, London, 19955. Lipshutz S., “Schaums Outline series: Theory andproblems of Probability”, McGraw Hill Singapore,19826. Kolman B. and Busby R. C., “Discrete MathematicalStructures”, Prentice Hall of India, 19967. Trembley and Manohar, “Discrete MathematicalStructures with Applications to Computers”,McGraw Hill, 1995WEB REFERENCES1. http://www.cs.odu.edu/~toida/nerzic/content/web_course.html2. http://en.wikipedia.org/wiki/Discrete_mathematics3. http://business.vsnl.com/sasip/jaads_index.html4. http://www.stanford.edu/class/cs103x/CS-204COMPUTER ORGANIZATION L T P Cr& ARCHITECTURE 5 1 0 4OBJECTIVETo provide basic knowledge of internals ofmicroprocessor, its architecture, components,terminologies, etc. at minute level and ultimately aboutthe working of a digital computer hardware as a wholePRE-REQUISITESKnowledge of data structures, microprocessors andinterfacing1. GENERAL SYSTEM ARCHITECTURE: Functionsand block diagram of computer, store programcontrol concept, Flynn’s classification of computers(SISD, MISD, MIMD); multilevel viewpoint of amachine: digital logic, micro architecture, ISA,operating systems, high level language; structuredorganization; CPU, caches, main memory,secondary memory units & I/O; performancemetrics; MIPS, MFLOPS, GFLOPS and TFLOPS.2. DIGITAL LOGIC: Computer registers, basics oflogic design, accumulator logic, Boolean algebraand logic gates, combinational logic blocks(adders, multiplexers, encoders, de-coder),sequential logic blocks (latches, flip-flops,registers, counters).3. INSTRUCTION SET ARCHITECTURE: Instructioncodes, instruction set formats (fixed, variable,hybrid); types of instructions, memory reference,register reference, I/O reference; addressingmodes: register, immediate, direct, indirect,indexed; operations in the instruction set;arithmetic and logical, data transfer, control flow;types of interrupts; timing and control; instructionset based classification of processors (RISC,CISC, and their comparison).4. BASIC NON PIPELINED CPU ARCHITECTURE:CPU Architecture types (accumulator, register,stack, memory/ register) detailed data path of atypical register based CPU, fetch-decode-executecycle (typically 3 to 5 stage); micro-instructionformats, implementation of control unit: hardwiredand micro-programmed, control memory,microinstruction sequencing.5. MEMORY HIERARCHY & I/O TECHNIQUES:Need for a memory hierarchy (Locality ofReference Principle, memory hierarchy in practice:cache, main memory and secondary memory,memory parameters: access/ cycle time, cost perbit); main memory (semiconductor RAM & ROMorganization, memory expansion, static & dynamicmemory types); cache memory: associative &direct mapped cache organizations.6. INTRODUCTION TO PARALLELISM: Goals ofparallelism (exploitation of concurrency, throughputenhancement); Amdahl’s law; instruction levelparallelism (pipelining, super scaling-basicfeatures); processor level parallelism(multiprocessor systems overview).7. PROCESSOR ARCHITECTURE: Clock speed;processing power and buses of a microprocessor,components of microprocessor; I/O ports; 16-bit(80286) architecture, 32-bit (80486) architecture;super scalar architecture in Pentium processors;64-bit (Pentium dual-core) architecture.TEXT BOOKCarpinelli, “Computer Organization & Architecture”.Tata McGraw Hill, 2001REFERENCE BOOKS1. Stallings. W, “Computer Organization &Architecture: Designing For Performance”, 6thEdition, Prentice Hall of India, 2002/ PearsonEducation Asia, 20032. Mano M Morris, “Computer System Architecture”,3rd Edition, Prentice Hall of India Publication, 2001/ Pearson Education Asia, 20033. Jotwani, “Computer System Organisation”, TataMcGraw Hill, 2000.4. Rajaraman V. and Radhakrishnan T, “Introductionto Digital Computer Design”, 4th Edition, PrenticeHall of India 2004.5. Stalling William, “Computer Organization andArchitecture”, 7th Edition, Prentice Hall of India, 2005.6. Brey Barry, “Intel Micro Processors”, Pearson USImports & PHIPEs,1998WEB REFERENCES1. http://www.cs.umsl.edu/~sanjiv/classes/cs312/2. http://www.dlhoffman.com/classnotes/csci330-f03/3. http://www.cs.wvu.edu/~jdm/classes/cs455/30

Lingaya’s University, FaridabadCS-205ANALYSIS & DESIGN OF L T P CrALGORITHMS 5 1 0 4OBJECTIVETo relay the theoretical and practical aspects of designof algorithmsWEB REFERENCES1. http://www.personal.kent.edu/~rmuhamma/Algorithms/algorithm.html2. http://www.fib.upc.edu/en/infoAca/estudis/assignatures/ADA.html3. http://algo.inria.fr/AofA/PRE-REQUISITESKnowledge of fundamentals of basic computerprogramming for implementing algorithmsCS-251DATA STRUCTURES & L T P CrALGORITHMS LAB 0 0 2 11. BRIEF REVIEW: Graphs, sets and disjoint sets;union, sorting and searching algorithms and theiranalysis in terms of space and time complexity.2. DIVIDE AND CONQUER: General method; binarysearch; merge sort; quick sort; selection sort;Strassen’s matrix multiplication algorithms andanalysis of algorithms for these problems.3. GREEDY METHOD: General method; knapsackproblem, job sequencing with deadlines; minimumspanning trees; single source paths and analysisof these problems.4. DYNAMIC PROGRAMMING: General method;optimal binary search trees; O/I knapsack; thetraveling salesperson problem.5. BACK TRACKING: General method; 8 queens’problem; graph colouring; Hamiltonian cycles;analysis of these problems.6. BRANCH AND BOUND: Method; O/I knapsackand traveling salesperson problem; efficiencyconsiderations; Techniques for algebraic problems;some lower bounds on parallel computations.7. NP HARD AND NP COMPLETE PROBLEMS:Basic concepts; Cook’s theorem; NP hard graphand NP scheduling problems; some simplified NPhard problems.TEXT BOOKHorowitz Ellis and Sahni Sartaj, “Fundamental ofComputer Algorithms”, Galgotia Publications, 1978REFERENCE BOOKS1. Cormen Thomas H., Leiserson Charles E. andRivest Ronald L., “Introduction to Algorithms”, TataMcGraw Hill, 19902. Aho A. V. and Hopcroft J. E., “The Design andAnalysis of Computer Algorithm”, Addison Wesley,19743. Berlion P., and Bizard P., Algorithms – TheConstruction, Proof and Analysis of Programs,John Wiley & Sons, 1986.4. Bentley J. L., “Writing Efficient Programs”, PrenticeHall of India, June 1982.5. Goodman S. E. and Hedetnieni, “Introduction toDesign and Analysis of Algorithm”, McGraw Hill,19976. Trembley Jean Paul and Bunt Richard B.,“Introduction to Computers Science - AnAlgorithms Approach”, Tata McGraw Hill, 20027. Knuth Donald E., “Fundamentals of Algorithms:The Art of Computer Programming”, Vol. l, NareshPublications, 19858. Goodrich Michael T. and Roberto Tamassia,“Algorithm Design: Foundations, Analysis &Internet Examples”, Wiley Student Ed., 2002LIST OF EXPERIMENTS1. Search an element in a two-dimensional arrayusing linear search.2. Using iteration and recursion concepts writeprograms for finding the element in the array usingBinary Search Method3. Perform following operations on tables usingfunctions onlya) Addition b) Subtraction c) Multiplication d)Transpose4. Using iteration and recursion concepts write theprograms for quick sort technique5. Implement the various operations on string such aslength of string concatenation, reverse of a stringand copy of a string to another.6. Swap two numbers using ‘call by value’ and ‘callby reference’ strategies.7. Implement binary search tree. (Insertion andDeletion in Binary Search Tree)8. Create a linked list & perform operations such asinsert, delete, update, reverse in the link list9. Implementation of a file and performing operationssuch as insert, delete, update a record in the file.10. Create a linked list and perform the followingoperations on ita) Add a node b) Delete a node11. Simulate the various searching and sortingalgorithms and compare their timings for a list of1000 elements.12. Simulates the various tree traversal algorithms.13. Simulate various graph traversing algorithms.REFERENCE BOOKS1. Horowitz, Sahni and Rajasekaran, “Fundamentalsof Computer Algorithms”, 2007.2. Kruse Robert, “Data Structures and ProgramDesign in C”, Prentice Hall of India, 19943. Lipschitz Jr. Seymour, “Theory & Problems of DataStructures”, Schaum’s Outline, 2nd Edition, TataMcGraw HillCS-254COMPUTER L T P CrORGANIZATION &ARCHITECTURE LAB 0 0 2 1LIST OF EXPERIMENTS1. Check and measure various supply voltages ofPC.2. Make comparative study of motherboards.3. Observe and study various cables, connectionsand parts used in computer communication.4. Study various cards used in a system viz. displaycard, LAN card etc.5. Remove, study and replace floppy disk drive.31

B.Tech. Computer Science & Engineering (Regular)6. Remove, study and replace hard disk.7. Remove, study and replace CD ROM drive.8. Study various monitors, its circuitry and variouspresents and some elementary fault detection.9. Study printer assembly and elementary faultdetection of DMP and laser printers.10. Observe various cables and connectors used innetworking.11. Study parts of keyboard and mouse.12. Assemble a PC13. Troubleshooting exercises related to variouscomponents of computer like monitor, drives,memory and printers etc.REFERENCE BOOKS1. Mines Mark, “Complete PC Upgrade &Maintenance Guide”, BPB Publications, 20052. Zacker Craig & Rouske John, “PC Hardware: TheComplete Reference”, Tata McGraw Hill, 2000.3. Mueller Scott, “Upgrading and Repairing PCs”,Prentice Hall of India, 1999CS-301THEORY OF L T P CrCOMPUTATIONS 5 0 0 3OBJECTIVEThe goal of this course is to provide students with anunderstanding of basic concepts in the theory ofcomputation. At the end of this course students will beable to:• Construct finite state machines and the equivalentregular expressions.• Prove the equivalence of languages described byfinite state machines and regular expressions.• Construct pushdown automata and the equivalentcontext free grammars.• Prove the equivalence of languages described bypushdown automata and context free grammars.• Construct Turing machines and Post machines.• Prove the equivalence of languages described byTuring machines and Post machinePRE-REQUISITESKnowledge of mathematics and ProgrammingLanguages1. FINITE AUTOMATA AND REGULAREXPRESSIONS: Finite state systems; basicdefinitions non-deterministic finite automata(NDFA), deterministic finite automata (DFA),equivalence of DFA and NDFA finite automata withe-moves; regular expressions; equivalence of finiteautomata and regular expressions; regularexpression conversion and vice versa.2. INTRODUCTION TO MACHINES: Concept ofbasic machine; properties and limitations of FSM,Moore and Mealy machines; Equivalence of Mooreand Mealy machines; Conversion of NFA to DFAby Arden’s Method.3. PROPERTIES OF REGULAR SETS: ThePumping Lemma for regular sets; applications ofthe pumping lemma; closure properties of regularsets; Myhill-Nerode theorem and minimization offinite automata; minimization algorithm.4. CHOMSKY HIERARCHIES: Chomsky hierarchiesof grammars, unrestricted grammars; contextsensitive languages; relation between languagesof classes; computability: basic concepts, primitiverecursive functions.5. GRAMMARS: Definition, Context free and contextsensitive grammar; ambiguity regular grammar;reduced forms; removal of useless symbols andunit production; Chomsky Normal Form (CNF),Greibach Normal Form (GNF).6. PUSHDOWN AUTOMATA: Introduction topushdown machines; design of PDA; conversion ofPDA to CFG and vice versa, application ofpushdown machines7. TURING MACHINES: Deterministic and nondeterministicTuring machines; design of Turingmachines; halting problem of Turing machines;PCP problem.TEXT BOOKHopcroft, Ullman O. D. and Mothwani R., “Introductionto Automata Theory, Language & Computations”,Addison Wesley, 2001REFERENCE BOOKS1. Mishra K. L. P. and Chandrasekaran N., “Theory ofComputer Science - Automata, Languages andComputations”, Prentice Hall of India, 20002. Linz Peter, “Introduction to Formal Languages &Automata”, Narosa Publications, 20013. Greenlaw Ramond and Hoover H. James,“Fundamentals of the Theory of Computation -Principles and Practice”, Harcourt India Pvt. Ltd.,19984. Lewis H. R. and Papaditriou C. H., “Elements ofTheory of Computation”, Prentice Hall of India,19985. Martin John C., “Introduction to Languages andTheory of Computations”, Tata McGraw Hill, 2003WEB REFERENCES1. http://www.comp.nus.edu.sg/~sanjay/cs3231.html2. http://en.wikipedia.org/wiki/Theory_of_computation3. http://www.wisdom.weizmann.ac.il/~oded/tocbi.html.CS-302OPERATING SYSTEMSL T P Cr5 0 0 3OBJECTIVETo provide the knowledge of internals, different typesand purpose of operating systemsPRE-REQUISITESKnowledge of computer organization and architecture,programming skills1. INTRODUCTION: Introduction to operating systemconcepts (including multitasking,multiprogramming, multi user, multithreading, etc).;types of operating systems: batch operatingsystem, time-sharing systems, distributed OS,network OS, real time OS, embedded and smartcard OS; various operating system services,architecture, system programs and calls.32

Lingaya’s University, Faridabad2. PROCESS MANAGEMENT AND THREADS:Process concept, Life cycle and implementation ofprocess, Thread usage and implementation in userspace and in kernel, process scheduling, operationon processes; CPU scheduling, scheduling criteria,scheduling algorithms -First Come First Serve(FCFS), Shortest-Job-First (SJF), priority scheduling,Round Robin (RR), multilevel queue scheduling.3. MEMORY MANAGEMENT: Logical & physicaladdress space; swapping; contiguous memoryallocation, non-contiguous memory allocationpaging and segmentation techniques,segmentation with paging; virtual memorymanagement - demand paging & pagereplacementalgorithms; demand segmentation.4. FILE SYSTEM: Different types of files and theiraccess methods, directory structures; variousallocation methods; disk scheduling andmanagement and its associated algorithms;introduction to distributed file system.5. PROCESS-SYNCHRONIZATION &DEADLOCKS: Critical section problems, mutualexclusion with busy waiting, semaphores; methodsfor handling deadlocks: deadlock prevention,avoidance and detection; deadlock recovery;Classical IPC problems: dining philosophers’problem, readers-writers problem.6. I/O SYSTEMS: I/O hardware, device controllers,interrupt handlers, device drivers, application I/Ointerface, kernel, transforming I/O requests,performance issues.7. LINUX/UNIX SYSTEM: LINUX/UNIX architecture;UNIX system calls for processes and file systemmanagement; basic commands of LINUX/UNIX;shell interpreter, shell scripts.TEXT BOOKSilberchatz et al, “Operating System Concepts”, 5thedition, Addison-Wesley, 1998REFERENCE BOOKS1. Tanenbaum A., “Modern Operating Systems”,Prentice-Hall, 19922. Stallings William, “Operating Systems Internals andDesign Principles”, 4th edition, Prentice-Hall, 20013. Dhamdhere D. M., “Operating System”, 2ndEdition, Tata McGraw Hill, 19994. Kernighan Brian and Pike Rob, “The UnixProgramming Environment”, Prentice Hall of India,19845. Bach Maurich, “Design of the Unix OperatingSystem”, Prentice Hall of India, 19866. Muster John, “Introduction to UNIX and LINUX”,Tata McGraw Hill, 20037. Ritchie Colin, “Operating System IncorporatingUnix & Windows”, Tata McGraw Hill, 19748. Madnick Stuart and Donovan John, “OperatingSystems”, Tata McGraw Hill, 20019. Deitel, “Operating Systems”, Addison-Wesley, 199010. Singhal Mukesh and Shivaratri N.G., “OperatingSystems”, Tata McGraw Hill, 2003WEB REFERENCES1. http://en.wikipedia.org/wiki/Operating_system2. http://search.techrepublic.com.com/search/ibm+lotus+notes+and+operating+systems.html3. http://www.dmoz.org/Computers/Software/Operating_Systems/Mainframe/IBM/Software/4. http://www-03.ibm.com/systems/i/software/access/windows/supportedos.htmlCS-303COMPUTER GRAPHICSL T P Cr5 1 0 4OBJECTIVEStudents completing this course are expected to beable to:• Write programs that utilize the OpenGL graphicsenvironment.• Use polygonal and other modeling methods todescribe scenes.• Understand and be able to apply geometrictransformations.• Create basic animations.• Understand scan-line, ray-tracing, and radiosityrendering methodsPRE-REQUISITESKnowledge of computer programming, 2D and 3Dgeometry1. INTRODUCTION: What is computer graphics,computer graphics applications, computer graphicshardware and software, two dimensional graphicsprimitives: points and lines, line drawingalgorithms: DDA, Bresenham’s; circle drawingalgorithms: using polar coordinates, Bresenham’scircle drawing, mid point circle drawing algorithm;polygon filling algorithm, boundary filled algorithm,scan-line algorithm, flood fill algorithm.2. TWO DIMENSIONAL VIEWING: The 2-Dviewing pipeline, windows, viewports, window toview port mapping; clipping: point, clipping line(algorithms): 4 bit code algorithm, Sutherland-Cohen algorithm, parametric line clippingalgorithm (Cyrus Beck).3. POLYGON CLIPPING ALGORITHM: Sutherland-Hodgeman polygon clipping algorithm,homogeneous coordinates system, twodimensional transformations: transformations,translation, scaling, rotation, reflection, shearing,transformation, composite transformation.4. THREE DIMENSIONAL GRAPHICS: Threedimensional graphics concept, matrixrepresentation of 3-D transformations, compositionof 3-D transformation; viewing in 3D: projections,types of projections; the mathematics of plannergeometric projections; coordinate systems.5. HIDDEN SURFACE REMOVAL: Introduction tohidden surface removal; the Z- buffer algorithm,scan-line algorithm, area sub-division algorithm.6. REPRESENTING CURVES AND SURFACES:Parametric representation of curves: Beziercurves, B-Spline curves; parametric representationof surfaces; interpolation method.7. ILLUMINATION, SHADING, IMAGEMANIPULATION: Illumination models, shadingmodels for polygons, shadows, transparency; whatis an image, filtering, image processing, geometrictransformation of images.33

B.Tech. Computer Science & Engineering (Regular)TEXT BOOKFoley James D., van Dam Andeies, Feiner Stevan K.and Hughes Johb F., “Computer Graphics Principlesand Practices”, 2nd Edition, Addision Wesley, 2000REFERENCE BOOKS1. Hearn Donald and Baker M. Pauline, “ComputerGraphics”, 2nd Edition, Prentice Hall of India, 19992. Rogers David F., “Procedural Elements forComputer Graphics”, 2nd Edition, Tata McGrawHill, 20013. Watt Alan, “Fundamentals of 3-DimensionalComputer Graphics”, Addision Wesley, 19994. John Corrign, “Computer Graphics: Secrets andSolutions”, BPB Publications, 19945. Krishanmurthy N., “Introduction to ComputerGraphics”, Tata McGraw Hill, 2002WEB REFERENCES1. http://en.wikipedia.org/wiki/Computer_graphics2. http://www.cgw.com/ME2/Default.asp3. http://www.graphics.cornell.edu/online/tutorial/4. http://graphics.stanford.edu/CS-352OPERATING SYSTEMS L T P CrLAB 0 0 2 1LIST OF EXPERIMENTS1. Study of Windows 2003 Operating System,Various services available in Windows 2003 Serverand Internal/system commands for network andsystem monitoring in Windows 2003 Server,2. Difference between the Windows 2003 Server andWindows 2003 Client software.3. Study of Linux Operating System (Linux kernel,shell, basic commands like make, pipe and filterand Simple programs to display process group Ids:PID, PPID, GID), Internal/system commands fornetwork and system monitoring in Linux.4. Display "Linux Programming Lab" N times usinglibrary function calls and system calls5. Programs using system calls that provides errorchecking6. Programs using Processes.7. Administration of Linux Operating System(connecting users, connectivity across LAN andWAN; Mounting and un-mounting of devices,taking backups, restoring data from backups8. Writing of Shell Scripts9. AWK programming10. Study of MacOS features, Internal/system commandsfor network and system monitoring in MacOS11. Study of differences between Windows 2003Server, Linux and MacOS12. Programs using Command Line Arguments.13. Programs for Simple Shell and Complex Shell withcd command, editor command, etc.14. Programs for Primitive Communications.15. Programs using Pipes: Unnamed Pipes, NamesPipes16. Programs using Message Queues.REFERENCE BOOKS1. Bach Maurich, “Design of the Unix OperatingSystem”, Prentice Hall of India, 19862. Prato Stephen, “Advanced Unix Programmer’sGuide”, BPB Publications, 20063. Das Sumitabha, “Unix- Concept and Applications”,Tata McGraw Hill, 2002CS-353COMPUTER GRAPHICS L T P CrLAB 0 0 2 1LIST OF EXPERIMENTS1. 2D line as raster graphics display usingBresenhem line drawing algorithm2. 2D line drawing as raster graphics display usingDDA line drawing algorithm3. Circle drawing as raster graphics display using midpoint circle drawing algorithm4. Polygon filling as raster graphics display usingBoundary fill algorithm and Flood fill algorithm5. Line clipping6. Polygon clipping7. Display 3D object as 2D raster graphics displayusing perspective transformation8. Rotation for 3D object about arbitrary axis9. Hidden surface removal from a 3D object10. 2D transformations of a given object (triangle,rectangle, pentagon) for translating, scaling,rotating, reflecting, shearing11. Create a screen saver using inbuilt functions ofgraphics12. Zoom an object13. Reverse zooming14. Create a Bezier CurveREFERENCE BOOKS1. Hearn Donald and Baker M. Pauline, “ComputerGraphics”, 2nd Edition, Prentice Hall of India, 19992. Rogers David F., “Procedural Elements forComputer Graphics”, 2nd Edition, Tata McGrawHill, 2001CS-401NEURAL NETWORKSL T P Cr5 0 0 3OBJECTIVEThe goal is to relay the theoretical and practicalfundamental knowledge of neural networks andstudying its analogy to human brain.PRE-REQUISITESKnowledge of mathematics, computer architecture andorganization1. OVERVIEW OF BIOLOGICAL NEURONS:Structure of biological neurons relevant to ANNs.2. FUNDAMENTAL CONCEPTS OF ARTIFICIALNEURAL NETWORKS: Models of ANNs; Feedforward and feedback networks; learning rules:Hebbian learning rule, perception learning rule,delta learning rule, Widrow-Hoff learning rule,correction learning rule, Winner –lake all learningrule, etc.3. SINGLE LAYER PERCEPTION CLASSIFIER:Classification model, features and decisionregions; training and classification using discreteperceptron, algorithm, single layer continuous34

Lingaya’s University, Faridabadperceptron networks for linearly separableclassifications.4. MULTI-LAYER FEED FORWARD NETWORKS:linearly non-separable pattern classification; deltalearning rule for multi-perceptron layer; generalizeddelta learning rule, error back-propagation training;learning factors; examples.5. SINGLE LAYER FEED BACK NETWORKS: Basicconcepts; Hopfield networks; training andexamples.6. ASSOCIATIVE MEMORIES: Linear association,basic concepts of recurrent auto associativememory: retrieval algorithm, storage algorithm; bidirectionalassociative memory, architecture,association encoding and decoding, stability.7. SELF ORGANIZING NETWORKS: Unsupervisedlearning of clusters, winner-take-all learning, recallmode, Initialization of weights, separabilitylimitationsTEXT BOOKZurada Jacek M., “Introduction to Artificial NeuralSystems”, 5 th Edition, India Reprint 2003.REFERENCE BOOKS1. Haykin Simon, “Neural Networks: AComprehensive Formulation”, Addison Wesley,19982. Kosko, “Neural Networks”, Prentice Hall of India,19923. Bose N. K. and Liang P., “Neural NetworkFundamentals”, Tata McGraw Hill, 2002.4. Sivanandan, “Introduction to Neural Networks withMATLAB 6.0”, Tata McGraw Hill, 2005CS-402ARTIFICIAL INTELLIGENCEL T P Cr5 0 0 3OBJECTIVETo introduce about artificial intelligence approaches toproblem solving, various issues involved andapplication areasPRE-REQUISITESKnowledge of neural networks, data structures1. INTRODUCTION TO AI AND SEARCHTECHNIQUES: Foundation and history of AI; data,information and knowledge; AI problems andtechniques – AI programming languages, problemspace representation with examples; blind searchstrategies, breadth first search, depth first search,heuristic search techniques: hill climbing: best firstsearch, A * algorithm AO* algorithm, Means-endsanalysis.2. KNOWLEDGE REPRESENTATION ISSUES:predicate logic; logic programming; constraintpropagation; representing knowledge using rules.3. REASONING UNDER UNCERTAINITY:Reasoning under uncertainty, non monotonicreasoning; review of probability; Bayes’probabilistic interferences and Dempster Shafertheory; heuristic methods; symbolic reasoningunder uncertainty; statistical reasoning, fuzzyreasoning.4. PLANNING & GAME PLAYING: Minimax searchprocedure; goal stack planning; non linearplanning, hierarchical planning, planning insituational calculus; representation for planning;partial order planning algorithm5. LEARNING: Basic concepts; rote learning,learning by taking advices, learning by problemsolving, learning from examples, discovery aslearning, learning by analogy; explanation basedlearning; neural nets; genetic algorithms.6. OTHER KNOWLEDGE STRUCTURES: semanticnets, partitioned nets, parallel implementation ofsemantic nets; frames, common sense reasoningand thematic role frames; architecture ofknowledge based system; rule based systems;forward and backward chaining; frame basedsystems.7. APPLICATIONS OF ARTIFICIAL INTELLIGENCE:Principles of natural language processing; rulebased systems architecture; expert systems,knowledge acquisition concepts; AI application torobotics, and current trends in intelligent systems;parallel and distributed AI: psychological modeling,parallelism in reasoning systems, distributedreasoning systems and algorithmsTEXT BOOKRich Elaine and Knight Kevin, “Artificial Intelligence”,3rd Edition, Tata McGraw Hill, 1991REFERENCE BOOKS1. Nilson Nils J., “Artificial Intelligence”, McGraw-Hill,New York 19712. Russell Stuart and Norvig Peter, “ArtificialIntelligence: A Modern Approach”, Prentice Hall ofIndia, 19983. Negnevitsky, “Artificial Intelligence: A Guide toIntelligent System”, Pearson Education, 2004.4. Patterson O. W., “Introduction to ArtificialIntelligence & Expert Systems”, Prentice Hall ofIndia, 1996.5. Winston Patrick Henry, “Artificial Intelligence”, 3rdEdition, Addition Wesley, 19926. Clockson & Mellish, “Programming PROLOG”, 3rdEdition, Narosa Publications, 2002.WEB REFERENCES1. http://wwwformal.stanford.edu/jmc/whatisai/2. http://library.thinkquest.org/2705/3. www.imdb.com.CS-421COMPILER DESIGNL T P Cr5 0 0 3OBJECTIVETo lay adequate foundation for design anddevelopment of compiler and other system softwaretools such as linkers, debuggers, assemblers, etc.PRE-REQUISITESKnowledge of data structures, basic programmingconcepts, theory of computations and operating systems1. INTRODUCTION: Evolution of ComponentsSystems Programming, Assemblers, Loaders,35

B.Tech. Computer Science & Engineering (Regular)Linkers, Macros, Compilers, Software tools: Texteditors, Interpreters, program generators, Testingsoftware, Programming environment (such asIntegrated Development Editors)2. SYSTEM SOFTWARE SPECIFICS: Compiler:Brief overview of compilation process, Incrementalcompiler, structure of compiler: its different phases,Compiler construction tools. Assembler: Problemstatement, single phase and two phase assembler,symbol table; Loader schemes, compile and goLoader, general loader schemes, absolute loader,Subroutine linkage, Reallocating loader, Directlinkage Loader, Binders, Linking loader, overlays3. LEXICAL AND SYNTAX ANALYSIS: Role oflexical analyzer, design of lexical analyzer, regularexpressions, Specification and recognition oftokens, input buffering, a language specifyinglexical analyzer. Finite automata, conversion fromregular expression to finite automata, and viceversa, minimizing number of states of DFA,Implementation of lexical analyzer. SyntaxAnalysis: Role of parsers, context free grammars,definition of parsing4. PARSING TECHNIQUE: Shift- reduce parsing,operator precedence parsing, top down parsing,predictive parsing. LR parsers, SLR, LALR andCanonical LR parser5. SYNTAX DIRECTED TRANSLATIONS: Syntaxdirected definition, construction of syntax trees,syntax directed translation scheme,implementation of syntax directed translation, threeaddress code, quadruples and triples6. SYMBOL TABLE & ERROR DETECTION ANDRECOVERY: Symbol tables, its contents and datastructure for symbol tables; trees, arrays, linkedlists, hash tables. Errors, lexical phase error,syntactic phase error, semantic error7. CODE OPTIMIZATION AND CODEGENERATION: Code generation, forms of objectscode, machine dependent code, optimization,register allocation for temporary and user definedvariablesTEXT BOOKAlfred V. Aho, Ravi Sethi & J.D. Ullman, “CompilersPrinciple, Techniques & Tools”, Addison Wesley, 1998REFERENCE BOOKS1. Kakde O. G., “Compiler Design”, LaxmiPublications, 19952. Dhamdhere, “System Software”, McGraw Hill,19863. Trembley and Sorenson, “Theory and Practice ofCompiler Writing”, McGraw Hill, 19854. Aho Alfred V. And Ullman Jeffrey D “Principles ofCompiler Design”, Narosa Publication, 1989.WEB REFERENCES1. www.onesmartclick.com/engineering/compilerdesign.html2. www.cse.iitd.ernet.in/~sak/courses/cdp/slides.pdf3. www.holub.com/software/compiler.design.in.c.docs.pdf4. en.wikipedia.org/wiki/Principles_of_Compiler_Design5. www.holub.com/software/compiler.design.in.c.htmlCS-422CRYPTOGRAPHY AND L T P CrDATA COMPRESSION 5 0 0 3OBJECTIVEThe course will attempt to dispel some of the manymyths that surround the idea of cryptography.Cryptography is (and will continue to be) anincreasingly important area of IT and it is important thatpractitioners are aware of the realities of the subject.The course will provide a down-to-earth overview ofcryptographic techniques applicable in an ITenvironment, and outline the constraints and limitationsof realistic secure systems. A running theme is thetradeoff between usability and security of a system.Also covered are a number of compression techniques- data compression and data encryption are, in somerespects, closely related. A working knowledge of C isassumed and essential.PRE-REQUISITESKnowledge of cryptography, analysis & designalgorithms and mathematics1. INTRODUCTION: Basics of cryptography; history;usefulness of compression techniques2. COMPRESSION: Packing, Huffman coding, Runlength encoding, Lempel-Ziv-Welch, PKZIP, Deltamodulation, JPEG; latest compression techniques3. ERROR DETECTION AND CORRECTION: Parity,1, 2, n-dimensions; Hamming codes; p-out-of-qcodes4. CRYPTOGRAPHY: vocabulary; history;steganography - visual textual, cipher hiding, falseerrors; public key cryptography - authentication,signatures, deniability5. MATHEMATICS: Information; confusion; diffusion;modular arithmetic; inverses; Fermats littletheorem; Chinese remainder theorem; factoring;prime numbers; discrete logarithms6. ALGORITHMS: DES; AES (Rijndael); IDEA; Onetime pad; Secret sharing and splitting; RSA; Ellipticcurves; Modes; Random numbers7. ATTACKING SYSTEMS: Recognition; destroyingdata; cryptanalysis: differential cryptanalysis,cracking desTEXT BOOKSchneier B., “Applied Cryptography: Protocols,Algorithms and Source Code in C”, 2nd edition, Wiley,1996.REFERENCE BOOKS1. Desai Suhas, “Security in Computing”, PearsonsEducation 20102. “Integration of Data Compression andCryptography: Another Way to Increase theInformation Security”, IEEE Computer SocietyVolume 2 ,20073. Trappe W. and Washington L., “Introduction toCryptography”, 2nd edition, Pearson Education,2006WEB REFERENCES1. http://www.data-compression.com/index.shtml2. http://www.webopedia.com/TERM/D/data_compression.html36

Lingaya’s University, Faridabad3. http://en.wikipedia.org/wiki/Data_compression4. http://www.debugmode.com/imagecmp/CS-431ADVANCED COMPUTER L T P CrARCHITECTURE 5 0 0 3OBJECTIVETo introduce various technological aspects aboutparallelism in super computing, microprocessorssupporting such high scale computing, other hardwarearchitectures, ultimately leading to high performancecomputing through grid computing.PRE-REQUISITESKnowledge of digital electronics, digital system design,computer networks and computer organization &architecture1. PARALLEL COMPUTER MODELS: The state ofcomputing, multiprocessors and multicomputers;multi-vector and SIMD computers; architecturaldevelopment tracks.2. PROGRAM AND NETWORK PROPERTIES:Conditions of parallelism; data and resourcedependences; hardware and software parallelism;program partitioning and scheduling; grain sizeand latency; program flow mechanisms; controlflow versus data flow, data flow architecture;demand driven mechanisms; comparisons of flowmechanisms3. SYSTEMS INTERCONNECT ARCHITECTURES:Network properties and routing, staticinterconnection networks; dynamic interconnectionnetworks; multiprocessor system interconnects;hierarchical bus systems; crossbar switch andmultiport memory; multistage and combiningnetwork.4. PROCESSORS AND MEMORY HIERARCHY:Advanced processor technology; instruction-setarchitectures; CISC scalar processors; RISC scalarprocessors; superscalar processors, VLIWarchitectures; vector and symbolic processorsmemory technology: hierarchical memorytechnology, inclusion, coherence and locality,memory capacity planning, virtual memorytechnology5. BACKPLANE BUS SYSTEM: Backplane busspecification; addressing and timing protocols;arbitration transaction and interrupt; cacheaddressing models; direct mapping andassociative caches.6. PIPELINING: Linear pipeline processor; nonlinearpipeline processor; instruction pipeline design;mechanisms for instruction pipelining; dynamicinstruction scheduling; branch handlingtechniques; arithmetic pipeline design; computerarithmetic principles; static arithmetic pipeline,multifunctional arithmetic pipelines.7. VECTOR PROCESSING PRINCIPLES: Vectorinstruction types; vector-access memory schemes;synchronous parallel processing: SIMDarchitecture and programming principles; SIMDparallel algorithms; SIMD computers andperformance enhancementTEXT BOOKHwang Kai and Briggs A., “Advanced ComputerArchitecture”, Tata McGraw Hill, 2008REFERENCE BOOKS1. Hennessy John L. and Patterson David A.,“Computer Architecture: A Quantitative Approach”,3rd edition, 20022. Flynn Michael J., “Pipelined and Parallel ProcessorDesign”, Narosa Publications, Reprint 20093. Hwang Kai and Briggs A., “ComputerArchitecture and Parallel Processing”, McGraw-Hill, 19904. Sima Dezso, Fountain Terence and Kacsuk Peter,“Advanced Computer Architectures”, PearsonEducationWEB REFERENCES1. http://www.doc.ic.ac.uk/~phjk/AdvancedCompArchitecture/Lectures/2. http://www.ecs.syr.edu/faculty/ercanli/cse661/3. http://cs.binghamton.edu/~nael/classes/cs325/CS-432NATURAL LANGUAGE L T P CrPROCESSING 5 0 0 3OBJECTIVETo motivate understanding of issues related to naturallanguage understanding, generation and translation,which ultimately linked to machine learning, computervision and expert systems. This course provides anintroduction to the field of computational linguistics,also called natural language processing (NLP) - thecreation of computer programs that can understandand generate natural languages (such as English).Natural language understanding as a vehicle will beused to introduce the three major subfields of NLP:syntax (which concerns itself with determining thestructure of an utterance), semantics (which concernsitself with determining the explicit truth-functionalmeaning of a single utterance), and pragmatics (whichconcerns itself with deriving the context-dependentmeaning of an utterance when it is used in a specificdiscourse context). The course will introduce bothknowledge-based and statistical approaches to NLP,illustrate the use of NLP techniques and tools in avariety of application areas, and provide insight intomany open research problems.PRE-REQUISITESKnowledge of theory of computations1. INTRODUCTION TO NATURAL LANGUAGEUNDERSTANDING: The study of language;applications of NLP; evaluating languageunderstanding systems; different levels oflanguage analysis; representations andunderstanding; organization of natural languageunderstanding systems; linguistic background: anoutline of English syntax.2. GRAMMARS AND PARSING: Grammars andsentence structure; top-down and bottom-upparsers; transition network grammars; top-downchart parsing; feature systems and augmentedgrammars: basic feature system for English37

B.Tech. Computer Science & Engineering (Regular)3. MORPHOLOGICAL ANALYSIS AND THELEXICON: Brief review of regular expressions andautomata; finite state transducers; parsing withfeatures; augmented transition networks4. GRAMMARS FOR NATURAL LANGUAGE:Auxiliary verbs and verb phrases; movementphenomenon in language; handling questions incontext-free grammars; hold mechanisms in ATNs.5. HUMAN PREFERENCES IN PARSING: Encodinguncertainty; deterministic parser; word levelmorphology and computational phonology; basictext to speech; introduction to HMMs and speechrecognition, parsing with CFGs; probabilisticparsing; representation of meaning.6. AMBIGUITY RESOLUTION: Statistical methods;estimating probabilities; part-of- speech tagging;obtaining lexical probabilities; probabilistic contextfreegrammars; best first parsing.7. SEMANTICS AND LOGICAL FORM: Wordsenses and ambiguity, encoding ambiguity inlogical form, semantic analysis; lexical semantics;word sense; disambiguation; discourseunderstanding; natural language generation, Indianlanguage case studies.TEXT BOOKAllen James, “Natural Language Understanding”, 2ndedition, Pearson Education, 2003.REFERENCE BOOKS1. Winograd Terry, “Language as a CognitiveProcess”, Addison Wesley, 19832. Gazder G., “Natural Language Processing inProlog”, Addison Wesley, 19893. Arbib Mdlj and Kfaury, “Introduction of FormalLanguage Theory”, Springer Verlag, 19884. Jurafsky D. and Martin J. H., “Speech andLanguage Processing”, Pearson Education, 2002.5. Manning Christopher D. and Schütze Hinrich,“Foundations of Statistical Natural LanguageProcessing”, The MIT Press, Cambridge,Massachusetts.1999.WEB REFERENCES1. http://www.cse.unt.edu/~rada/CSCE5290/2. http://www.bowdoin.edu/~allen/nlp/3. http://www.encyclopedia.com/doc/1G1-160760429.htmlCOMPUTER VISION/ IMAGE L T P CrCS-433PROCESSING 5 0 0 3OBJECTIVETo introduce the student to computer vision algorithms,methods and concepts this will enable the student toimplement computer vision systems with emphasis onapplications and problem solving.PRE-REQUISITESIntroduction to image processing1. RECOGNITION METHODOLOGY: Conditioning;labeling; grouping; extracting, matching; edgedetection; gradient based operators; morphologicaloperators; spatial operators for edge detection;thinning, region growing, region shrinking; labelingof connected components.2. BINARY MACHINE VISION: Thresholding;segmentation; connected component labeling,hierarchal segmentation; spatial clustering; splitand merge; rule-based segmentation; motionbasedsegmentation3. AREA EXTRACTION: Concepts; data-structures;edge; line-linking; Hough transform; line fitting;curve fitting (least-square fitting); RegionAnalysis: Region properties, external points,spatial moments; mixed spatial; gray-levelmoments; boundary analysis: signature properties,shape numbers.4. FACET MODEL RECOGNITION: Labelling lines;understanding line drawings; classification ofshapes by labelling of edges; recognition ofshapes; consisting labelling problem; backtracking;perspective projective geometry; inverseperspective projection; photogrammetry – from 2Dto 3D, Image matching: Intensity matching of IDsignals, matching of 2D image, Hierarchical imagematching.5. OBJECT MODELS AND MATCHING: 2Drepresentation, Global vs. Local features. GeneralFrame Works For Matching: Distance relationalapproach, Ordered structural matching, View classmatching, Models database organization6. GENERAL FRAME WORKS: Distance –relationalapproach, Ordered –Structural matching, Viewclass matching, Models database organization.7. KNOWLEDGE BASED VISION: Knowledgerepresentation, Control-strategies, Informationintegration.TEXT BOOKForsyth David A. and Ponce Jean, “Computer Vision: AModern Approach”, Prentice Hall, 2003.REFERENCE BOOKS1. Jain R., Kasturi R. and Schunk B. G., “MachineVision”, McGraw-Hill, 1995.2. Sonka Milan, Hlavac Vaclav and Boyle Roger,“Image Processing, Analysis, and Machine Vision”, Thomson Learning, 20063. Haralick Robert and Shapiro Linda, “Computer andRobot Vision”, Vol. I and II, Addison-Wesley, 1993WEB REFERENCES1. http://www.umiacs.umd.edu/~ramani/cmsc426/2. http://www.cs.rochester.edu/~nelson/courses/vision/notes/notes.html3. http://www.cogs.susx.ac.uk/courses/compvis/index.htmlCS-434EXPERT SYSTEML T P Cr5 0 0 3OBJECTIVETo educate the students about theory behind Expertsystem and how they fit into the scope of computerscience; that is the logic, probability, data structures,AI, and other topic that form the theory of expertsystem.38

Lingaya’s University, FaridabadPREREQUISITESKnowledge of Artificial Intelligence and PROLOG1. INTRODUCTION TO EXPERT SYSTEM:Introduction; characteristics; development of expertsystem technology; applications and domains;languages, shells and tools; elements, productionsystems.2. THE REPRESENTATION OF KNOWLEDGE:Introduction; the meaning of knowledge;productions; semantic nets, object-attribute-valuetriples; frames; logic and sets; propositional logic;the first order predicate logic; quantifiers3. EXPERT SYSTEMS ARCHITECTURES:Introduction; rule based system architecture; nonproduction system architectures; dealing withuncertainty; knowledge acquisition and validation;knowledge system building tools4. METHOD OF INFERENCE: Introduction; trees,lattices and graphs; state and problem spaces;rules of inference; first order predicate logic; logicsystems; resolution; resolution systems anddeductions; forward and backward chaining5. REASONING UNDER UNCERTAINTY:Introduction; uncertainty; types of error; errors andinduction; probabilities; hypothetical reasoning andbackward induction; temporal reasoning andmarkov chains; uncertainty in inference chain6. INEXACT REASONING: Introduction; uncertaintyand rules; certainty factors; Dempster–ShaferTheory; approximate reasoning; the state ofuncertaint7. DESIGN OF EXPERT SYSTEM: Introduction;stages in the development of an expert system;errors in development stages; softwareengineering and expert system; the expert systemlife cycle; a detailed life cycle model.TEXT BOOKGiarratano Riley, “Expert Systems: Principles andProgramming”, 3rd Edition, Thomson Brooks/Cole,1989REFERENCE BOOKS1. Darlington K, “The Essence of Expert Systems”,Prentice Hall, 20002. Patterson Dan W., “Introduction to Artificial andExpert Systems”, Prentice Hall of India, 20023. Jean-Louis Ermine, “Expert Systems: Theory andPractice”, Prentice Hall of India, 20014. Waterman Donald A., “A Guide to ExpertSystems”, 1 st edition, Pearson Education, 1986.CS-435ROBOTICSL T P Cr5 0 0 3OBJECTIVEThe goal of the course is to familiarize the students withthe concepts and techniques in robot anipulator control,enough to evaluate, chose, and incorporate robots inengineering systems.PRE-REQUISITESExposure to linear algebra and matrix operations,programming in a high level language1. ROBOTIC MANIPULATION: Automation and robots;classification; application; specification; notations.2. DIRECT KINEMATICS: Dot and cross products,co-ordinate frames; rotations; homogeneous; coordinates;link co-ordination arm equation, (fiveaxisrobot, four axis robot, six axis robot).3. INVERSE KINEMATICS: General properties ofsolutions tool configuration; five axis robots, threefouraxis; six axis robot (inverse kinematics).4. WORKSPACE ANALYSIS AND TRAJECTORYPLANNING WORK: envelop and examples,workspace fixtures; pick and place operations;continuous path motion; interpolated motion,straight-line motion5. ROBOT VISION: Image representation, templatematching; polyhedral objects; Shane analysis,segmentation (thresholding, region labelling, shrinkoperators, swell operators, Euler numbers,perspective transformation, structured illumination,camera calibration).6. TASK PLANNING: Task level programming;uncertainty; configuration; space; gross motion;planning; grasp planning; fine-motion planning;simulation of planer motion; source and goalscenes; task planner simulation.7. MOMENTS OF INERTIA, PRINCIPLES OF NCAND CNC MACHINES.TEXT BOOKShilling Robert, “Fundamentals of Robotics-Analysisand Control”, Prentice Hall of India, 2009.REFERENCE BOOKS1. Fu,Gonzales and Lee, “Robotics”, McGraw Hill, 2009.2. Craig J.J., “Introduction to Robotics”, Prentice Hallof India, 19893. Ghoshal, “8051 Micro Controller & interfacing”,Pearson Education, 20084. Staughard, “Robotics and Artificial Intelligence”,Prentice Hall of India, 2009.5. Grover, Wiess, Nagel and Oderey, “IndustrialRobotics”, McGraw Hill, 2008.6. Stdder Walfram, “Robotics and Mechatronics”,Tata McGraw Hill7. Niku S. B., “Introduction to Robotics”, PearsonEducation, 20018. Klafter R. D., Chmielewski T. A. and Negin M.,“Robot Engineering”, Prentice Hall of India, 19949. Mittal R. K. and Nagrath I. J., “Robotics andControl”, Tata McGraw Hill, 2003WEB REFERENCES1. http://en.wikipedia.org/wiki/Robotics2. http://www.transitport.net/Lists/Robotics.in.Japan.html3. http://www-formal.stanford.edu/jmc/whatisai/4. http://library.thinkquest.org/2705/CS-436SPEECH RECOGNITION & L T P CrGENERATION 5 0 0 3OBJECTIVEDevelop an understanding of the relationship of vocaltract shapes and physical acoustics to the acousticspeech signal. Use a spectrum analyzer to relate theacoustic speech signal to acoustical processes. Design39

B.Tech. Computer Science & Engineering (Regular)and implement digital filters to synthesize speech andcode speech at a low bit rate. Implement speechanalysis and speech synthesis modules using objectorientedsoftware programs, using techniques such asclass derivation, the use of software objects ascomponents in a larger software system.PRE-REQUISITESKnowledge of artificial intelligence, natural languageprocessing, digital signal processing, neural networks1. FUNDAMENTALS OF SPEECH RECOGNITION:Introduction, the paradigm for speech, recognition,out line, brief history of speech recognitionresearch.2. SPEECH GENERATION: Formant frequencies inspeech, parametric source-filter synthesis,formant synthesizers, pitch detection, amplitudeanalyzer, vocabulary, text-to-speech conversion,vocoders3. THE SPEECH SIGNAL: Production, reception,and acoustic-phonetic characterization: the speechproduction system, representing speech in timeand frequency domains, speech sounds andfeatures; approaches to automatic speechrecognition by machine.4. SIGNAL PROCESSING AND ANALYSISMETHODS FOR SPEECH RECOGNITION: Thebank-of filters, front-end processor; linear predictivemodel for speech recognition; vector quantization;auditory based spectral analysis model.5. PATTERN COMPARISON TECHNIQUES:Speech detection, distortion measures:mathematical considerations, distortion measuresperceptualconsiderations, spectral-distortionmeasures, incorporation of spectral dynamicfeatures into distortion measures; time alignmentand normalization.6. SPEECH RECOGNITION SYSTEM DESIGN ANDIMPLEMENTATION ISSUES: Application ofsource coding techniques to recognition, templatetraining methods; performance analysis andrecognition enhancements; template adoption tonew talkers; discriminative methods in speechrecognition; speech recognition in adverseenvironment;THEORY AND IMPLEMENTATION OF HIDDENMARKOV MODELS: Discrete time Markovprocesses; extensions to hidden Markov models;the three basic problems for HMMs; types ofHMMs; implementation issues for HMMs; HMMsystem for isolated word recognition7. SPEECH RECOGNITION BASED ONCONNECTED WORDS MODELS: Generalnotations for the connected word-recognitionproblem; two level dynamic programming algorithm;level building algorithm; one pass algorithm; multiplecandidate strings; grammar networks for connecteddigit recognition; segmental k-means trainingprocedure; connected digit recognitionimplementation; task oriented applications ofautomatic speech recognition and generation.TEXT BOOKBernard Gold and Nelson Morgan, “Speech and AudioSignal Processing”, John Wiley & Sons, 2004REFERENCE BOOKS1. Rabiner Lawrence R. and Juang B.,“Fundamentals of Speech Recognition”, PearsonEducation,20042. Rabiner Lawrence R. and Schafer R. W., “DigitalProcessing of Speech Signals”, PearsonEducation, 20043. Rabiner Lawrence R. and Bernard Gold, “Theoryand Application of Digital Signal Processing”,Prentice Hall of India, 19754. Rich Elaine and Knight Kevin, “ArtificialIntelligence”, 3rd Edition, Tata McGraw Hill, 20065. Jurafsky D. and Martin J. H., “Speech andLanguage Processing”, Pearson Education, 2009.WEB REFERENCES1. http://pages.cs.wisc.edu/~dyer/cs540/notes/speech.html2. http://www.patentstorm.us/patents/6708150/claims.html3. http://www.thefreelibrary.com/Speech+Therapy:+A+new+generation+of+voicerecognition+technology+--...-a084072940CS-437SOFT COMPUTINGL T P Cr5 0 0 3OBJECTIVETo introduce about incorporating more mathematicalapproach (beyond conventional logic system) into theartificial intelligence approaches for problem solvingsuch as fuzzy logic, genetic algorithms, etc.PRE-REQUISITESKnowledge of mathematics, statistics and probability1. INTRODUCTION: Comparison of soft computingmethods: neural networks, fuzzy logic, geneticalgorithm with conventional artificial intelligence(hard computing).2. OPTIMIZATION: Least-Square methods forsystem identification, recursive least squareestimator, LSE for nonlinear models; derivativebased optimization: descent methods, Newton’smethod, conjugate gradient methods; nonlinearleast-squares problems: Gauss Newton method,Levenberg- Marquardt method.3. NEURAL NETWORKS: Different architectures;back-propagation algorithm; hybrid learning rule,supervised learning: perceptrons, adaline, backpropagationmultilayer perceptrons, radial basisfunction networks; unsupervised learning:competitive learning network, Kohonen selforganizingnetworks, Hebbian learning, Hopfieldnetwork.4. FUZZY SET THEORY: Basic definition andterminology; basic concepts of fuzzy logic; settheoretic operators; membership functions:formulation and parameterization; fuzzy union,intersection, and complement; fuzzy rules andfuzzy reasoning; fuzzy inference systems:Mamdani and Sugeno fuzzy models; fuzzyassociative memories.5. NEURO-FUZZY MODELLING: Adaptive neurofuzzyinference systems (ANFIS), neuro-fuzzy40

Lingaya’s University, Faridabadcontroller: feedback control, expert control, backpropagation through time and real-time recurrentlearning, reinforcement learning control; gradientfreeoptimisation.6. NEURO-FUZZY CONTROLLER INENGINEERING APPLICATIONS: Fuzzy logic incontrol engineering: Mamdani and Sugenoarchitecture for fuzzy control; analytical issues infuzzy logic control; applications: fuzzy logic inintelligent agents; fuzzy logic in mobile robotnavigation, fuzzy logic in database systems, fuzzylogic in medical image segmentation7. GENETIC ALGORITHMS: Basics of geneticalgorithms; design issues in genetic algorithm;genetic modeling; hybrid approach, GA basedfuzzy model identification; fuzzy logic controlledgenetic algorithm; neuro- genetic hybrids & fuzzy –genetic hybrids.TEXT BOOKRajasekharan S. and Vijayalakshmi Pai S. A., “NeuralNetworks, Fuzzy Logic & Genetic Algorithms”, Prentice-Hall of India, 2003REFERENCE BOOKS1. Goldberg David E., “Genetic Algorithms”, PearsonEducation, 2003.2. Goldberg David. E., “Genetic Algorithms in Search,Optimization & Machine Learning”, Addison-Wesley, 19893. Karray, “Soft Computing & Intelligence System,Pearson Education, 2004.4. Freeman James A. and Skapura David M., “NeuralNetworks”, Pearson Education, 2002.5. Jang J. S. R., Sun C. T. and Mizutani E., “Neurofuzzyand Soft Computing”, Prentice-HallInternational, Inc USA, 1997.6. Yen John and Langari Reza, “Fuzzy Logic,Intelligence, Control, and Information”, PearsonEducation, Delhi, 2003.7. Lin C. T. and Lee C. S. G., “Neural FuzzySystems”, Prentice-Hall, 1996.8. Zurada Jack N., “Introduction to NeuralNetworks”, Jaico Publishers, 5 th Edition, IndiaReprint 2003.9. Haykin Simon, “Neural Networks”, Prentice-Hall,1993/Pearson Education, 1999.10. Kecman Vojislav, “Learning and Soft Computing”,MIT Press, 200111. Koza J, “Genetic Programming”, MIT Press, 1993WEB REFERENCES1. en.wikipedia.org/wiki/Soft_computing2. www.springer.com/engineering/journal/5003. www.soft-computing.de4. www.softcomputing.es5. www-bisc.cs.berkeley.eduCS-441ADVANCED DATABASE L T P CrMANAGEMENT SYSTEMS 5 0 0 3OBJECTIVETo bring out various issues related to advancedcomputing with respect to database managementsystems such as parallelism in implementation, databackup and recovery management, intelligent datamining techniques, standards, etc.PRE-REQUISITES: Knowledge of databasemanagement systems1. DATA MODELS: EER model and relationship tothe OO model; object oriented data model andODMG standard; other data models - NIAM,GOOD, ORM2. QUERY OPTIMISATION: Query executionalgorithms; heuristics in query execution; costestimation in query execution; semantic queryoptimisation; database transactions andrecovery procedures: transaction processingconcepts, transaction and system concepts,desirable properties of a transaction, schedulesand recoverability, serializability of schedules;transaction support in SQL; recoverytechniques; database backup; concurrencycontrol, locking techniques for concurrencycontrol, concurrency control techniques;granularity of data items3. CLIENT/SERVER COMPUTING: Client/Serverconcepts; 2-tier and 3-tier client/server systems;client/server architecture and the internet; client/database server models; technology componentsof client/server systems; application developmentin client/server systems4. DISTRIBUTED DATABASES: Reliability andcommit protocols; fragmentation and distribution;view integration; distributed database design;distributed algorithms for data management;heterogeneous and federated database systems5. DEDUCTIVE DATABASES: Recursive queries;Prolog/Datalog notation; basic inferencemechanism for logic programs; deductive databasesystems; deductive object oriented databasesystems6. DATA WAREHOUSING: Basic concepts; datawarehouse architecture; data characteristics;reconciled data layer data transformations; deriveddata layer user interface.7. COMMERCIAL AND RESEARCH PROTOTYPES:Parallel database; multimedia database, mobiledatabase; digital libraries; temporal databaseTEXT BOOKRamakrishnan Raghu, “Database ManagementSystem”, McGraw Hill, 3rd Edition, 2003REFERENCE BOOKS1. Elmasri R. and Navathe S. B., “Fundamentals ofDatabase Systems”, 3rd Edition, Addison Wesley,Low Priced Edition, 2000.2. Tamer M. and Valduricz, “Principles of DistributedDatabase Systems”, 2nd Edition, LPE PearsonEdition.3. Silbershatz A., Korth H. F. and Sudarshan S.,“Database System Concepts”, 3rd Edition,McGraw-Hill, International Edition, 1997.4. Desai Bipin C., “An Introduction to DatabaseSystems”, Galgotia Publications.5. lioffer Feffray A., Prescotl Mary B.and McFaddenFred R., “Modern Database Management”, 6thEdition, Pearson Education.41

B.Tech. Computer Science & Engineering (Regular)WEB REFERENCES1. www.cse.iitb.ac.in/dbms2. www.idt.com/products3. www.developers.net/tsearch?searchkeys=database+management+system+tutorial4. www.pdf-word.net/5. www.slideshare.netCS-442DIGITAL IMAGE L T P CrPROCESSING 5 0 0 3OBJECTIVETo introduce the students about the basic concepts andanalytical methods of processing digital signals,especially, the images and imaging part; to understandthe properties of static and streaming images/video.PRE-REQUISITESKnowledge of data compression, discrete structures,digital signal processing, computer graphics1. INTRODUCTION AND DIGITAL IMAGEFUNDAMENTALS: Origins of digital imageprocessing; examples of fields that use digitalimage processing; fundamentals steps in imageprocessing; elements of digital image processingsystems; image sampling and quantization; somebasic relationships like neighbours; connectivity,distance measures between pixels; linear and nonlinear operations.2. IMAGE ENHANCEMENT IN THE SPATIALDOMAIN: Some basic gray level transformations;histogram processing; enhancement usingarithmetic and logic operations; basics of spatialfilters, smoothening and sharpening spatial filters,combining spatial enhancement3. IMAGE ENHANCEMENT IN THE FREQUENCYDOMAIN: Introduction to Fourier transform and thefrequency domain, smoothing and sharpeningfrequency domain filters; homomorphic filtering;image restoration: a model of the image degradation /restoration process, noise models, restoration in thepresence of noise only spatial filtering, periodic noisereduction by frequency domain filtering; linearposition-invariant degradations; estimation ofdegradation function; inverse filtering; Wiener filtering,constrained least square filtering, geometric meanfilter; geometric transformations.4. IMAGE COMPRESSION: Coding; inter-pixel andpsycho visual redundancy; image compressionmodels; elements of information theory; error freecompression; lossy compression; imagecompression standards.5. IMAGE SEGMENTATION: Detection ofdiscontinuities; edge linking and boundarydetection; thresholding; region orientedsegmentation; motion based segmentation6. REPRESENTATION AND DESCRIPTION:Representation, Boundary Descriptors, RegionalDescriptors, Use of Principal Components forDescription, Introduction to Morphology, Somebasic Morphological Algorithms.7. OBJECT RECOGNITION: Patterns and PatternClasses, Decision-Theoretic Methods, StructuralMethods.TEXT BOOKJain A. K., “Digital Image Processing”, Prentice Hall ofIndia, 1995REFERENCE BOOKS1. Gonzalez Rafael C. and Woods Richard E., “DigitalImage Processing”, 2nd edition, PearsonEducation, 20022. Jahne Bernd, “Digital Image Processing”, 5th Ed.,Springer, 20003. Pratt William K., “Digital Image Processing: PiksInside”, John Wiley & Sons, 2001.4. Forsyth D. A. and Ponce J., “Computer Vision: AModern Approach”, Prentice Hall, 20035. Horn Berthold, “Robot Vision”, MIT Press, McGrawHill, 19866. Jain R., Kasturi R. and Schunck B. G. , “MachineVision”, McGraw Hill, 1995WEB REFERENCES1. en.wikipedia.org/wiki/Digital_image_processing2. www.imageprocessingplace.com3. www.icaen.uiowa.edu4. www.uct.ac.za/depts/physics/laser/hanbury/intro_ip.html5. www.eng.auburn.edu/~sjreeves/Classes/IP/IP.htmlCS-443DISTRIBUTED COMPUTINGL T P Cr5 0 0 3OBJECTIVEThis course will introduce the algorithms andtechnologies of distributed systems. It will teach bothfundamentals as well as systems where thesefundamentals are applied in practice.PREREQUISITESKnowledge of databases, networking, operating systemand web technologies1. DISTRIBUTED COMPUTING: History, forms ofcomputing; strengths and weaknesses ofdistributed computing; OS basics; network basics;software engineering basics; CLIENT SERVERPARADIGM: issues, software engineering for anetwork service, connection oriented andconnectionless servers, iterative server andconcurrent server, stateful servers.2. INTERPROCESS COMMUNICATION: ArchetypalIPC program interface; event synchronization;timeouts and threading; deadlock and timeouts; datarepresentation, data encoding; text based protocols,request response protocols; event and sequencediagram; connection vs. connectionless IPC.3. DISTRIBUTED COMPUTING PARADIGMS ANDSOCKET API: Paradigms; abstraction; socketmetaphor; diagram socket API, stream modesocket API; sockets with non-blocking I/O; securesocket API4. GROUP COMMUNICATION: Unicasting;multicasting, archetypal multicast API; connectionoriented and connectionless; reliable, unreliablemulticast; Java basic multicast API.5. DISTRIBUTED OBJECTS: Message passing vs.distributed objects; archetypal distributed object42

Lingaya’s University, Faridabadarchitecture; distributed object systems; remoteprocedure calls; Java RMI architecture; API forJava RMI; Advanced RMI: Client callback, stubdownloading, RMI security manager; allowing forstub downloading6. SIMPLE OBJECT ACCESS PROTOCOL: SOAPrequest, SOAP response; Apache SOAP; invokingweb service; implementing web service7. ADVANCED DISTRIBUTED COMPUTINGPARADIGMS: Message queue system paradigm;mobile agents; network service; object spacesTEXT BOOKTanenbaum Andrew S. and van Steen Maarten,“Distributed Systems: Principles and Paradigms”,Prentice Hall, 2002.REFERENCE BOOKS1. Coulouris George, Dollimore Jean, Kindberg Tim,“Distributed Systems: Concepts and Design”, BookNews, Inc,2003.2. Garg Vijay K., “Elements of DistributedComputing”, Wiley, 2002.WEB REFERENCES1. http://en.wikipedia.org/wiki/Distributed_computing2. http://www.dhpc.adelaide.edu.au/education/dhpc/2000/lecture-notes.html3. http://www.eli.sdsu.edu/courses/spring99/cs696/notes/4. http://www.geocities.com/SiliconValley/Vista/4015/Chapter1.htmlCS-444REAL-TIME OPERATING L T P CrSYSTEMS 5 0 0 3OBJECTIVEThis course will first give an introduction into the basicconcepts of real-time computing and then treat the twomajor issues real-time scheduling and real-timekernels. Real-time scheduling will concentrateonpredictable scheduling algorithms and provide thescientific methodology required for the design of realtimesystems.Real-time kernels will address thechallenges and issues in the design andimplementation ofreal-time operating systems.PREREQUISITEKnowledge of operating systems1. INTRODUCTION: Concept of real time system;issues in real time computing; performancemeasures of real time system; hard and soft realtime systems; real time application.2. TASK ASSIGNMENT AND SCHEDULING:Different task model, scheduling hierarchy; offlinevs online scheduling; clock drives; inter-taskcommunicating and synchronization.3. MODEL OF REAL TIME SYSTEM: Processor,resources; temporal parameter; periodic taskmodel; sporadic task model; precedenceconstraints and data dependencies; schedulinghierarchy4. SCHEDULING OF PERIODIC TASK:Assumptions; fixed versus dynamic priorityalgorithms; schedulability test for fixed priority taskwith arbitrary deadlines.SCHEDULING OF APERIODIC AND SPORADICTASKS: Assumptions and approaches; deferrable;sporadic servers; slack stealing in deadline drivenand fixed priority systems; two level scheme forintegrated scheduling; Scheduling for applicationshaving flexible constrains.5. RESOURCES AND RESOURCE ACCESSCONTROL: Assumptions on resources and theirusage; resource contention; resource accesscontrol: priority ceiling protocol, priority inheritanceprotocol, slack based priority ceiling protocol,peremption ceiling protocol; real time memorymanagement.6. MULTI PROCESSOR SCHEDULING: Model of multiprocessor and distributed systems; schedulingalgorithms for end to end periodic tasks inhomogeneous/heterogeneous systems; predictabilityand validation of dynamic multiprocessor system.7. REAL TIME COMMUNICATION: Model of realtime communication; priority base service forswitched network; weighted round robin service;medium access control protocol; real time protocol;real time applications: air traffic control system,space launching system, etc.TEXT BOOKSJane .W. S. Liu “Real Time Systems” PearsonEducation, 2001REFERENCES1. Krishna C. M., “Real Time Systems” McGraw HillPublication, 19962. Tov Levi Shem and Agrawala Ashok K., “RealTime system Design”, McGraw Hill, 19903. Burns, Alan and Andy Welling, “Real TimeSystems and their Programming Language”,Addison Wesley, 19904. Proceedings of IEEE Special Issue on Real TimeSystems, Jan 19945. Blackman M., “The Design of Real TimeApplications”, John Wiley & Sons, 19756. Krishna C. M. and Shin K. G., “Real TimeSystems”, Tata McGraw Hill, 1997CS-451NEURAL NETWORKS LABL T P Cr0 0 2 1LIST OF EXPERIMENTS1. Demonstrate functioning of a neuron2. Implement a Hopfield neural network3. Implement back propagation network (BPN)4. Implement multi-layer perceptron (MLP)5. Implement k-means clustering6. Demonstrate unsupervised clustering capabilityusing Self Organizing Maps (SOM)7. Implement object recognition/image processing8. Demonstrate prediction ability using neuralnetworksREFERENCE BOOKS1. Haykin Simon, “Neural Networks: AComprehensive Formulation”, Addison Wesley,199843

B.Tech. Computer Science & Engineering (Regular)2. Bose N. K. and Liang P., “Neural NetworkFundamentals”, Tata McGraw Hill, 20023. Kevin Gurney, “An introduction to neural networks”,CRC Press, Reprint 20034. Chritosopher M Bishop, “Neural Networks forPattern Recognition”, Oxford University Press,Reprint 2004WEB REFERENCES1. http://neuron.eng.wayne.edu/software.ht2. http://www-ee.uta.edu/eeweb/ip/3. http://www.freewarepalm.com/utilities/neuralnetworklab.shtml4. http://www.egr.msu.edu/annweb/5. http://staff.aist.go.jp/utsugi-a/Lab/CS-452ARTIFICIALL T P CrINTELLIGENCE LAB 0 0 2 1LIST OF EXPERIMENTS1. Study of Prolog programming language2. Write programs to use iterative structures usingProlog (at least 3 programs)3. Write programs to demonstrate inferencing/deductive logic using Prolog (at least 3 programs)4. Write a program to solve 8 queens problem usingProlog.5. Solve any problem using depth first search usingProlog.6. Solve any problem using best first search usingProlog.7. Solve 8-puzzle problem using best first searchusing Prolog8. Solve Robot (traversal) problem using means EndAnalysis using Prolog.9. Solve traveling salesman problem using Prolog.10. Write program to exhibit the ability of building anExpert System using Prolog11. Study the properties and issues of NaturalLanguage Processing12. Study the grammar mapping issues in languagetranslation from English to Hindi and vice versaREFERENCE BOOKS1. Clockson & Mellish, “Programming PROLOG”,Narosa Publications, 3rd Edition, 2002.2. Winston Patrick Henry, “Artificial Intelligence”, 3rdEdition, Addition Wesley, 1992formulae of various organic and in-organicchemical reactions2. Develop a system for monitoring and analyzing theheart beat/pulse of a person. Connect the earlierrecorded data also for better analysis3. Use clustering techniques such as k-means, SOM,hierarchical clustering, etc. and group the details ofstudents into 5 groups based on 20 differentparameters (such as height, weight, hobbies, age,percentage, etc.)4. Use genetic algorithm to improve the efficiency of aset of data, image or audio signal5. Implement RSA cryptographic algorithm6. Automate the time table generation system for theUniversity7. Develop a parser for understanding naturallanguage8. Play out strategies to connect rural and illiteratepersons to the internet, from which they can obtainanswers to their queries. Implementation need notbe done, but all aspects such as how the userinterface would look like, database design,connectivity to database servers, method ofconnectivity for web mining, etc. may be workedout clearly9. Use MATLAB for image segmentation of a givenimage10. Use steganographic techniques to hide a givenmessage in an image or piece of audioCS-481MAJOR PROJECT L-T-P CrPHASE-I 0-0-10 5OBJECTIVEThe project involves in-depth study on the topic,design, development, analysis fabrication and/orexperimental work – Hardware and/or Software. It isintended to give an opportunity to a student to applyhis knowledge to solve real-life problem. The studenthas to select a project work based on a topic ofinterest.OPERATIONMajor Project shall comprise of Phase-I and Phase-II, spread over Term-XI and Terms-XII respectively.The students may work jointly (small group) orindividually.CS-453DEPTMENT LABL-T-P Cr0-0-2 1CS-482MAJOR PROJECT PHASE- L T P CrII 0 0 6 3OBJECTIVETo provide an opportunity to the students to take upexperiments/programs/exercises that would helpstrengthen their knowledge in the discipline in abroader sense.LIST OF EXPERIMENTS1. Plan and workout a method to implement asoftware system that connects chemists tocomputers, which can be used to bring outRefer to CS-481 for details.CS-483INTERNSHIP - IL T P Cr0 0 2 1OBJECTIVEThe Internship course is a formal method of linkinguniversity with the world of work and essentially takesthe class room for 20-22 weeks to a professionallocation where the student and faculty solve real-lifeproblems, of course, with the help of professional44

Lingaya’s University, Faridabadexperts. Resident University faculty will supervise theeducation of the students.OPERATIONThe Internship course has two components, namelyInternship-I of 6-8 weeks duration (Summer-termfollowing 9 th Term) and Internship-II of 13-14 weeksduration (11 th Term). After the Internship-II, in 12 th termthe student will document internship work in detail anddeliver colloquium. However, the student may contactindustry during this period.(a) Internship-I: Internship-I is conducted at largeindustrial complexes during Summer Term after Term-IX and exposes the students to real-life situations.(b) Internship-II: This component is conducted atvarious production and manufacturing units, Design,Development and Consulting Agencies, NationalLaboratories, R&D Centers, etc. The students solvereal-life problems of interest to the hostorganizations. The professional expert acts as aconsultant while resident University facultysupervises the work.major project. The project may be extended to MajorProject.INDUSTRIAL L T P CrCS-493TRAINING/FIELD TRAINING 0 0 2 1OBJECTIVETo carryout training for a period of two months i.e.Summer Term after Term-IX in industry (private orpublic)/ research laboratory/organization of repute, onplatforms learnt till the completion of 3 years ofbachelor degree.METHODOLOGYThe students shall demonstrate their ability tounderstand a given problem and to innovatively bringout solution.Students shall be free to select any operating system,programming language and database tools foraccomplishing the given problem successfully.Marks of this course shall be given in the marksmemorandum of next term.CS-484INTERNSHIP - IIL T P Cr0 0 24 12CS-494 SEMINAR –IL T P Cr0 0 2 1Refer to CS-483 for detailsINTERNSHIP L T P CrCS-485DOCUMENTATION 0 0 6 3The seminar is to cover the details regarding MajorProject Phase-I/Major Project Phase-II and Internship-IIviz. problem definition, literature survey, concepts andmethodology employed, analysis, design anddevelopment, conclusions and future work.OBJECTIVEThe students are required to prepare comprehensivereport on the problem(s) solved in industry and suitablyextend the work wherever required so as to help theindustry implement the solution. For this purpose thestudent can interact with the industry.CS-495SEMINAR-IIRefer to CS-494 for detailsL T P Cr0 0 2 1CS-491COMMUNITY SERVICE L T P CrORIENTED PROJECT 0 0 2 1EC-201ELECTRONICS L T P CrENGINEERING 5 1 0 4The student(s), either individually or in groups, areexpected to take up a project that uses engineeringand/or technological principles related to the field ofstudy and that should be useful for solving real lifeproblems in their neighbourhood.The student has to go through some process ofminimal level of evaluation and also the minimumattendance requirement, as stipulated by the CourseCoordinator/Instructor and approved by thecorresponding BOS, for getting the ‘U’ grade awardedin a course, failing which that course will not be listed inthe Grade Card.CS-492PROJECT (INCLUDING L T P CrSEMINAR) 0 0 4 2A student may perform experimental/design task ofrelatively minor intensity and scope as compare to theOBJECTIVEThe purpose of this course is to give basic electronicsconcept; their operational significance and its basicapplication.PRE-REQUISITESKnowledge of electricity, solid state physics1. HISTORICAL BACKGROUND: Vacuum tubes;working of vacuum tube and their characteristics;vacuum diode; triode; tetrode and pentode2. PN JUNCTION: Depletion layer; Barrier potential;Forward and reverse bias; Breakdown voltage;PIV; switching characteristics of p-n junction diode;knee voltage; load line; and operating Point Idealp-n junction diode; junction capacitance; zenerdiode.3. RECTIFIERS AND FILTERS: Half wave; centretap full wave and bridge rectifier; percentage ofregulation; PIV; ripple factor; C; RC; LC and PI45

B.Tech. Computer Science & Engineering (Regular)filter; voltage doubler; clipping and clampingcircuit; voltage regulation.4. BIPOLAR JUNCTION TRANSISTOR:Introduction; basic theory of operation of PNP adNPN transistor-l characteristics; CB; CE and CCconfiguration; different biasing techniques.5. FET: Introduction; Theory of operation; JFETParameters; and JFET Amplifiers. MOSFET:Introduction; theory of operation; MOSFETparameters; application; graphical analysis ofBJT and FET circuits; linear models of BJT andFET; pulse and large signal models of BJT andFET6. BIASING TECHNIQUES OF FET: Introductoryidea of multistage and feedback amplifiers; basebias; emitter feedback bias; collector voltagedivider bias; Load line and operating point.7. INTEGRATED CIRCUIT: Analysis of principle ofintegration. Introduction to Digital Integratedcircuits; THYRISTORS: Introduction to thyristorfamily; SCR theory of operation; SCRcharacteristics and triggering; TRIAC: Theory ofoperation; Characteristics and control by SCR andTRIAC Introduction to op-amp; UJT: Introduction;Basic theory of operation characteristics andstructure; Complementary and programmable UJTrelaxation oscillator.TEXT BOOKMillman and Halkias, “Electronic Devices and Circuits”,2nd Edition, Tata McGraw Hill, 2000REFERENCE BOOKS1. Millman and Halkias, “Integrated Electronic”, TataMcGraw Hill, 3rd Edition, 2001.2. Boylestad and Nashelsky, “Electronic Devices andCircuits”, 4th Edition, Pearson Education, 1999.3. Malvino, “Electronic Principles”, 5th Edition, TataMcGraw Hill, 2004.4. Bell David A., “Electronic Devices and Circuits”,3rd Edition, Prentice Hall of India, 20075. Bhargave N. N., “Basic Electronics and LinearCircuits”, Tata McGraw Hill, 20076. Salivahan, “Electronics Devices and Circuits”, TataMcGraw Hill, 3rd Edition, 2003.EC-208DIGITAL AND ANALOG L T P CrCOMMUNICATIONS 5 0 0 3OBJECTIVETo acquaint the students with the knowledge ofdifferent modes of communication techniques as wellas equipments and standard guiding suchcommunication.1. COMMUNICATION SYSTEM COMPONENTS:Introduction to Communication: definition & meansof communications; digital and analog signals: signwaves, square waves; properties of signals:amplitude, frequency, phase; theoretical basis fordata communication: Fourier analysis: Fourierseries and Fourier Transform (property, ESD, PSDand Raleigh) effect of limited bandwidth on digitalsignal.2. DATA ENCODING SCHEMES: Physicalconnections: modulation, amplitude-, frequency-,phase- modulation; Data encoding: binaryencoding (NRZ), Manchester encoding, differentialManchester encoding.3. DATA TRANSMISSION: Transmission Media:Twisted pair-, co-axial-, fiber optic-cables, wirelessmedia; transmission impairments: attenuation,limited bandwidth of the channels, delay distortion,noise, data rate of the channels (Nyquist theorem,Shannon limit)4. DATA COMMUNICATION INTERFACES:Physical layer interfaces: RS 232, X.21; parallelinterfaces: the telephone network: DDD network;private- line service; the telephone circuit; datamodems: synchronous modems; asynchronousmodems; modem synchronization5. STANDARDS IN DATA COMMUNICATIONS:Communication modes: simplex, half duplex, fullduplex; transmission modes: serial-, paralleltransmission;synchronizations: asynchronous-,synchronous-transmission; type of services:connection oriented-, connectionless-services; flowcontrol: unrestricted simplex protocol, simplexstop- and -wait protocol, sliding window protocol.6. SWITCHING SYSTEMS: Introduction: circuitswitching; packet switching: data gram, virtualcircuits, permanent virtual circuits. TelephoneSystems: PSTN, ISDN, asynchronous digitalsubscriber line. Multiplexing: frequency division-,time-, wave- division multiplexing7. SECURITY IN DATA COMMUNICATIONS:Transmission errors: feedback-, forward-errorcontrol approaches; error detection; parity check,block sum check, frame check sequences; errorcorrection: hamming codes, cyclic redundancycheck. data encryption: secret key cryptography,public key cryptograph; data compression: runlength encoding, Huffman encoding.TEXT BOOKHalsall Fred, “Data Communications, ComputerNetworks and Open Systems”, 4th Editon, Low Priceedition, Addison Wesley, 2000REFERENCE BOOKS1. Fitzgerald Jerry, “Business Data Communications”,7th Edition, John Wiley & Sons, 20012. Carlson Bruce A., Crilly Paul B., and RutledgeJanet C., “Communication Systems”, 4th Edition,Tata McGraw Hill, 2002.3. Proakiss J. G., “Digital Communications”, 4thEdition, McGraw Hill4. Stallings W., “Data & Computer Communications”,Prentice Hall of India5. Roden, “Digital & Data Communication Systems”,Prentice Hall of India, 19926. Forouzan Behrouz A., “Data Communications andNetworking”, 2nd Edition, Tata McGraw Hill, 2003EC-251LIST OF EXPERIMENTSELECTRONICS L T P CrENGINEERING LAB 0 0 2 146

Lingaya’s University, Faridabad1. Study V-I characteristics of diode; and its use as acapacitance.2. Study of the characteristics of transistor inCommon Base configuration.3. Study of the characteristics of transistor inCommon Emitter configuration.4. Study of V-I characteristics of a photo-voltaic cell.5. Study of characteristics of MOSFET/JFET is CSconfiguration.6. Plot characteristics of thyristor.7. Plot characteristics of UJT.8. Plot characteristics of diac and Triac.9. Introduction to Orcad PSPICE Software.10. Simulation of semiconductor device circuits usingOrcad PSPICE.REFERENCE BOOKS1. Boylestad and Nashelsky, “Electronic Devices andCircuits”, 4th Edition, Pearson Education, 1999.2. Bell David A., “Electronic Devices and Circuits”,3rd Edition, Prentice Hall of India, 20073. Bhargave N. N., “Basic Electronics and LinearCircuits”, Tata McGraw Hill, 20074. Salivahan, “Electronics Devices and Circuits”, TataMcGraw Hill, 3rd Edition, 2003.6. PROGRAMMABLE INTERRUPT CONTROLLER:8259 pin diagram; architecture; initializationcommand words; operational command wards.7. PROGRAMMABLE INTERVAL TIMER: 8253 pindiagram; architecture; modes.TEXT BOOKGaonkar Ramesh S., “Microprocessor Architecture:Programming and Applications with 8085”, 5th Edition,Prentice Hall of India, 1995REFERENCE BOOKS1. Brey,”The Intel Microprocessors 8086- PentiumProcessor”, 4th Edition, 20052. Hall, “Microprocessors and interfacing”, TataMcGraw Hill, 3nd Edition, 20033. Liu Yu-Chang and Gibson Glenn A.,“Microcomputer Systems: The 8086/8088 Family:Architecture, Programming and Design”, PrenticeHall of India, 20034. Ray A. K. and Burchandi, “AdvancedMicroprocessors and Peripherals Architectures,Programming and Interfacing”, Tata McGraw Hill,20025. Rafiquzzman, “Microprocessor based SystemDesign UBS” Wiley-Interscience, 5th Edition, 2005EC-302MICROPROCESSORS & L T P CrINTERFACING 5 0 0 3OBJECTIVEThis subject introduces the concept ofMicroprocessors to the students. It covers 8 bit(8085) and 16-bit (8086) Microprocessors: theirarchitecture, assembly language programming andinterfacing with peripheral devicesPRE-REQUISITESKnowledge of Boolean algebra, number systems andbasic digital circuitry1. THE 8085 PROCESSOR: Introduction tomicroprocessor; 8085 microprocessor:Architecture; Pin Diagram; instruction set; interruptstructure; Addressing modes and assemblylanguage programming.2. THE 8086 MICROPROCESSORARCHITECTURE: Architecture; block diagram of8086 with details of sub-blocks; memorysegmentation and physical address computations;program relocation; addressing modes; pindiagram and description of various signals;Interrupt Structure.3. INSTRUCTION SET OF 8086: Data transferinstructions; arithmetic instructions; branchinstructions; looping instructions; NOP and HLTinstructions; flag manipulation instructions; logicalinstructions; shift and rotate instructions;directives; programming examples.4. INTERFACING DEVICE: The 8255 PPI chip:Architecture; control words and modes; interfacingand programming with 8085.5. DMA: Introduction to DMA process; 8257 pindiagram; architecture; operation; command words;interfacing and programming with 8085.EC-304DIGITAL SYSTEM DESIGNL T P Cr5 1 0 4OBJECTIVETo impart knowledge of VHDL is useful in making thevarious Combinational and Sequential circuits fordesigning the design circuit can be implemented usingFPGA and CPLD Devices. These devices can beprogrammed according to our requirement by usingVHDL.PRE-REQUISITESKnowledge of digital electronics1. FUNDAMENTALS OF DIGITAL TECHNIQUES:Digital signal, logic gates: AND, OR, NOT, NAND,EX-XOR, EX-NOR; Boolean algebra; review ofnumber system; binary codes: BCD, Excess-3,Gray, EBCDIC, ASCII; Error detection andcorrection codes; combinational design usinggates: design using gates, Karnaugh map2. COMBINATIONAL DESIGN USING MSIDEVICES: Multiplexers and Demultiplexers andtheir use as logic elements, decoders, adders /subtractors, BCD arithmetic circuits, encoders,decoders/ drivers for display devices.3. SEQUENTIAL CIRCUITS: Flip-flops: S-R, J-K, T,D, master-slave, edge triggered, shift registers,counters, asynchronous and synchronous ringcounters and Johnson counter.4. PROGRAMMABLE LOGIC DEVICES: ROM, PLA,PAL, FPGA and CPLDs.5. INTRODUCTION TO VHDL: Data objects, classesand data types, operators, overloading, logicaloperators, types of delays entity and architecturedeclaration, introduction to behavioural, dataflowand structural models.47

B.Tech. Computer Science & Engineering (Regular)6. VHDL STATEMENTS: Assignment statements,sequential statements and process, conditionalstatements, generate statement, case statementarray and loops, resolution functions, packagesand libraries, concurrent statements,subprograms: application of functions andprocedures, structural modelling, componentdeclaration, structural layout and generics,configuration statements7. COMBINATIONAL CIRCUIT DESIGN: VHDLmodels and simulation of combinational circuitssuch as multiplexers, demultiplexers, encoders,decoders, code converters, comparators,implementation of Boolean functions, etc.SEQUENTIAL CIRCUITS DESIGN: VHDL modelsand simulation of sequential circuits flip flops, shiftregisters, counters, etc. design implementationusing CPLDs and FPGAsTEXT BOOKJain R. P., “Modern Digital Electronics”, 3rd Edition,Tata McGraw Hill, 2000.REFERENCE BOOKS1. Brown and Vranesic, “Fundamentals of DigitalLogic with VHDL Design”, Tata McGraw Hill, 20002. Taub and Schilling, “Digital Integrated Electronics”,McGraw Hill, 20083. Malvino A. P. and Leach D., “Digital Principles andApplications”, McGraw Hill, 19864. Mano Morris, “Digital Design”, 4th Edition, PrenticeHall of India, 20065. IEEE, “IEEE Standard VHDL Language ReferenceManual”, IEEE Computer Society Press, 19936. Chang K. C., “Digital Design and Modelling withVHDL and Synthesis”, IEEE Computer SocietyPress.7. Roth Charles H., “Digital System Design usingVHDL”, PWS, 19988. Navabi Z., "VHDL-Analysis & Modelling of DigitalSystems”, 2nd Edition. McGraw Hill, 19979. Perry, “VHDL”, 4th Edition, Tata McGraw Hill,2002EC-305EMBEDDED SYSTEM L T P CrDESIGN 5 0 0 3OBJECTIVEEmbedded computers are found everywhere fromhome appliances to automobiles to medical devices.Designing an embedded computing system is achallenging task because the requirements includemanufacturing cost, performance, power consumption,user interface, hard deadlines and rich functionality.The objective is to teach embedded system designprocess which includes requirements, specification,architecture, components and system integrationphases. The course will have real-life design examplesto illustrate the design process and the students areencouraged to design embedded systems to gainexperience.PRE-REQUISITESKnowledge of logic design, assembly languageprogramming, computer organization and architecture,microprocessors and interfacing, operating systems1. INTRODUCTION: Introduction, overview, designprocess; instruction set architecture; CISC andRISC instruction set; architecture; basicembedded processor/ microcontroller architecture;memory system architecture; I/O sub-system; coprocessorsand hardware accelerators; processorperformance enhancement; 16 & 32 bitmicroprocessor and micro-controller and DSPhardware with reference to embedded system.2. REAL TIME OPERATING SYSTEMS: Real timeoperating system overview; basic features of anoperating system, kernel features; processes andthreads, context switching; scheduling, interprocesscommunication; real-time memorymanagement; I/O processes; exposure to WindowsCE, QNX, micro kernels and μc/OS of introductionto process models; interrupt routines in an RTOsenvironment; encapsulating semaphores andqueues; hard real-time scheduling considerations;saving memory space.3. DESIGNING EMBEDDED COMPUTINGPLATFORM: Using CPU bus, memory devicesand their characteristics, I/O devices, componentinterfacing, memory interfacing; I/O deviceinterfacing, interfacing protocols, designing withprocessors: system architecture, hardware design,FPGA based design; implementation: developmentenvironment, debugging techniques, designexamples: data compressor, alarm clock.4. PROGRAMMING EMBEDDED SYSTEMS:Program design, programming languages, use ofhigh level languages, programming and run-timeenvironment, basic compilation techniques,analysis and optimization of execution time,analysis and optimization of energy and power,analysis and optimization of program size, programvalidation and testing5. NETWORK BASED EMBEDDEDAPPLICATIONS: Network fundamentals, layersand protocols, network architectures, distributedembedded architectures, elements of protocoldesign, high level protocol design languages,network based design, internet-enabled systems:protocols for industrial and control applications;internetworking protocols; wireless applications6. EMBEDDED CONTROL APPLICATIONS:Introduction, open-loop and closed loop controlsystems; PID controllers, fuzzy logic controller;application examples: washing machine, automotivesystems, auto-focusing digital camera, air-conditioner7. EMBEDDED SYSTEM DEVELOPMENT: Designmethodologies; architectural design; designexamples: telephone PBX, PDA, set-top box,elevator control system, ATM system, faulttolerancetechniques, reliability evaluationtechniquesTEXT BOOKSimon David E., “An Embedded System Primer”,Addison-Wesley, 1999REFERENCE BOOKS48

Lingaya’s University, Faridabad1. Marwedel Peter, “Embedded System Design”,Springer, 20062. Dreamtech Software Team, “Programming forEmbedded System”, John Wiley, 20023. Kamal Raj, Micro Controller ArchitectureProgramming Interfacing & System Designing”,Pearson Education, 2005.4. Bentham Jeremy, “TCP/IP Lean: Web servers forEmbedded Systems”, 20025. Grehan Rick, “Real–time Programming: A Guide to32 bit Embedded Development”, Addison-Wesley,19996. Vahid Frank and Givargis Tony D., “SystemDesign: A Unified Hardware/Software Introduction”,Addison Wesley, 2002.7. Barr Michael, “Programming Embedded Systemsin C and C++”, O'Reilly, 1999.8. Ganssle Jack, “The Art of Designing EmbeddedSystems”, Newnes, 2000.WEB REFERENCES1. http://www.technology.niagarac.on.ca/courses/ctec1630/2. http://www1.cs.columbia.edu/~sedwards/classes/2005/4840/index.html3. http://ece-www.colorado.edu/~mcclurel/4. http://www.eetasia.com/CAT_499495_embeddedsystems.htmEC-307WIRELESSL T P CrCOMMUNICATIONS 5 1 0 4OBJECTIVEThis subject covers the entire concept behind thecellular technology. It covers the standards like GSM,CDMA and various design parameters for wirelesssystem. Going through these topics will help thestudents to face telecom sector and softwarecompanies.PRE-REQUISITESPrior knowledge of Digital Communication, Probability,Basic Electromagnetic, Antenna and Wave Propagationand Computer Network1. INTRODUCTION TO WIRELESSCOMMUNICATION SYSTEMS: Evolution ofmobile radio communications; examples ofwireless communication systems, paging systems,cordless telephone systems; comparison of variouswireless systems.2. MODERN WIRELESS COMMUNICATIONSYSTEMS: Second generation cellular networks;third generation wireless networks; wireless in localloop; wireless local area networks; blue tooth andpersonal area networks.3. INTRODUCTION TO CELLULAR MOBILESYSTEMS: Spectrum allocation, basic cellularsystems; performance criteria; operation of cellularsystems; analog cellular systems, digital cellularsystems.4. CELLULAR SYSTEM DESIGNFUNDAMENTALS: Frequency reuse; channelassignment strategies, handoff strategies;interference and system capacity; tracking andgrade off service; improving coverage andcapacity.5. MULTIPLE ACCESS TECHNIQUES FORWIRELESS COMMUNICATION: Introduction tomultiple access; FDMA, TDMA, spread spectrummultiple access, space division multiple access,packet ratio; capacity of a cellular systems.6. WIRELESS NETWORKING: Difference betweenwireless and fixed telephone networks;development of wireless networks; fixed networktransmission hierarchy; traffic routing in wirelessnetworks; wireless data services; common channelsignaling, ISDN (Integrated Services digitalNetworks), advanced intelligent networks.7. INTELLIGENT CELL CONCEPT ANDAPPLICATION: Intelligent cell concept;applications of intelligent micro-cell systems; inbuildingcommunication; CDMA cellular radionetworks.TEXT BOOKRappaport Theodore S., “Wireless Communications”,Pearson Education, 2009.REFERENCE BOOKS1. Lee W. C. Y., “Mobile CellularTelecommunication”, McGraw Hill, 2009.2. Schiller Jochen, “Mobile Communications”,Pearson Education, 2003.WEB REFERENCES1. www.epanorama.net/links/tele_mobile.html2. www.scss.tcd.ie/~htewari/mobility.html3. www.populararticles.com/article4979.html4. www.docstoc.com/.../Wireless-Communication-Systems-and-Standards5. www.skydsp.com/publications/4thyrthesis/6. www.scribd.com/.../Ch3-the-Cellular-CoceptEC-352MICROPROCESSORS & L T P CrINTERFACING LAB 0 0 2 1LIST OF EXPERIMENTS1. Study of 8085 Microprocessor kit.2. Write a program using 8085 and verify for:a. Addition of two 8-bit numbers.b. Addition of two 16-bit numbers3. Write a program using 8085 and verify for:a. 8-bit subtraction (display borrow)b. 16-bit subtraction (display borrow)4. Write a program using 8085 for multiplication oftwo 8- bit numbersa. By Repeated additionb.By bit rotation5. Write a program using 8085 for division of two 8-bit numbersa. By Repeated additionb. By bit rotation6. Study of 8086 microprocessor kit7. Write a program using 8086 for division of adefined double word (stored in a data segment) byanother double Word49

B.Tech. Computer Science & Engineering (Regular)8. Write a program using 8086 for finding the squareroot of a given number and verify.9. Write a program using 8086 for copying 12 bytesof data from source to destination and verify.10. Write a program using 8086 and verify for:a. Finding the largest number from an array.b. Finding the smallest number from an array.11. Write a program using 8086 for arranging an arrayof numbers in descending order and ascendingorder12. Write a program for finding square of a numberusing look-up table and verify. .13. Write a program to interface a two digit numberusing seven-segment LEDs. Use 8085/8086microprocessor and 8255 PPI.14. Write a program to control the operation of steppermotor using 8085/8086 microprocessor and 8255PPI.15. Write a program to interface temperature controllerusing 8085/8086 microprocessor and 8255 PPI.16. Write a program to control the operation of trafficlight using 8085/8086 microprocessor and 8255PPI.REFERENCE BOOKS1. Gaonkar Ramesh S., “MicroprocessorArchitecture: Programming and Applicationswith 8085”, 5th Edition, Prentice Hall of India,19952. Brey,”The Intel Microprocessors 8086- PentiumProcessor”, 4th Edition, 2005EC-354DIGITAL SYSTEM DESIGN L T P CrLAB 0 0 2 1LIST OF EXPERIMENTS1. Design all gates using VHDL.2. Write VHDL programs for the following circuits,check the wave forms and the hardware generateda. half adderb. full adder3. Write VHDL programs for the following circuits,check the wave forms and the hardware generateda. multiplexerb. demultiplexer4. Write VHDL programs for the following circuits,check the wave forms and the hardware generateda. decoderb. encoder5. Write a VHDL program for a comparator and checkthe wave forms and the hardware generated6. Write a VHDL program for ALU.7. Write a VHDL program for a FLIP-FLOP and checkthe wave forms and the hardware generated8. Write a VHDL program for a counter and check thewave forms and the hardware generated9. Write VHDL programs for the following circuits,check the wave forms and the hardwaregenerateda. registerb. shift register10. Implement any three (given above) onFPGA/CPLD kitREFERENCE BOOKS1. Brown and Vranesic, “Fundamentals of DigitalLogic with VHDL Design”, Tata McGraw Hill,20002. Roth Charles H., “Digital System Design usingVHDL”, PWS, 19983. Navabi Z., "VHDL-Analysis & Modelling of DigitalSystems”, 2nd Edition. McGraw Hill, 1997L T P CrEL-101 ELECTRICAL ENGINEERING5 1 0 4OBJECTIVETo provide basic knowledge and understanding offundamental concepts of Electrical Technology,explaining various basic laws governing the circuitconfigurations and evaluation and its applications toelectrical circuits.1. DC NETWORKS: EMF, potential difference;current, resistance; Ohm’s law; effect oftemperature on resistance; source conversion;KCL, KVL; mesh analysis, nodal analysis; networktheorems – superposition, Thevenin’s, Norton,reciprocity, maximum power transfer theorem; stardeltaconversion.2. SINGLE PHASE AC CIRCUIT: Generation of ACvoltages, frequency, cycle, period, instantaneous,Peak, RMS and average value, peak factor, formfactor, phase and phase difference, polar,rectangular, exponential and trigonometricrepresentation of phasors; R, L and Ccomponents, behavior of these components inA.C. circuits, series and parallel A.C. circuits andtheir phasor diagrams, concept of impedance andadmittance, power and power factor, Complexpower; resonance-Series and parallel resonance,Q factor; bandwidth.3. THREE PHASE CIRCUITS: Phase and linevoltages and currents, balanced star and deltacircuits; phasor diagram, power equation,measurement of three phase power by twowattmeter method; comparison of single phase,three phase and DC system and their relativeadvantages.4. MAGNETIC CIRCUITS: Magnetic effect of electriccurrent; concept of MMF; flux, flux density,reluctance, permeability; B-H curve; hysterisisloop, hysterisis and eddy current loss; comparisonof electrical and magnetic circuits.5. TRANSFORMER: Construction, principle, workingof ideal and practical transformer; equivalentcircuit, phasor diagram; OC and SC tests,regulation and efficiency; autotransformer.6. ROTATING ELECTRICAL MACHINES: DCMACHINES – construction, principle of operationand classification of dc machines, EMF equationand characteristics of dc generator, starting andspeed control of dc motor.INDUCTION MACHINES: Construction andprinciple of operation of three phase inductionmotor, concept of slip and its importance.7. MEASURING INSTRUMENTS: Voltmeter;ammeter; wattmeter; energy meter.TEXT BOOKGupta, J.B. “Electrical Technology”, Katson Publication50

Lingaya’s University, FaridabadREFERENCE BOOKS1. Theraja, B.L. “Electrical Technology Vol I & II”, S.Chand Publications, 20052. Kothari and Nagarath, “Basic Electrical Engg.”, 2ndEdition, Tata McGraw Hill3. Theodore, Wildi “Electrical Machines, Drives andPower Systems”, 2nd Edition, Prentice Hall, 1991.4. Edward, Hughes (revised by Ian McKenzie Smith),“Electrical Technology”, 7th Edition, EnglishLanguage Book Society, Publication withLongman, 1995.5. Del Torro Vincent, “Electrical EngineeringFundamentals”, 2nd Edition, Prentice Hall of India,1994.6. Cathey, J.J. and Naser, S.A. “Basic Electrical Engg.”,2nd Edition, Schaum Series, McGraw Hill Publ.EL-151ELECTRICAL ENGINEERING L T P CrLAB 0 0 2 1LIST OF EXPERIMENTS1. To verify KCL and KVL.2. To verify Thevenin’s and Norton’s Theorems.3. To verify maximum power transfer theorem in D.CCircuit and A.C Circuit.4. To verify Reciprocity and Superposition theorems.5. To study frequency response of a series R-L-Ccircuit and determine resonant frequency and Q-Factor for various Values of R, L, C.6. To study frequency response of a parallel R-L-Ccircuit and determine resonant frequency and Q-Factor for various values of R, L, C.7. To perform direct load test of a transformer andplot efficiency Vs load characteristic.8. To perform open circuit and short circuit tests on asingle-phase transformer determine the losses andefficiency.9. To perform direct load test of a DC shunt generatorand plot load voltage Vs load current curve.10. To study various types of meters.11. Measurement of power by 3 voltmeter / 3 ammetermethod.12. Measurement of power in a 3 phase system by twowatt meter method.13. Connection and testing of a single-phase energymeter (unit power factor load only).Note: At least ten experiments are to be performed bythe students.REFERENCE BOOKS1. Theraja, B.L. “Electrical Technology Vol I & II”, S.Chand Publications, 20052. Kothari and Nagarath, “Basic Electrical Engg.”, 2ndEdition, Tata McGraw Hill3. Del Torro Vincent, “Electrical EngineeringFundamentals”, 2nd Edition, Prentice Hall of India,1994.4. Cathey, J.J. and Naser, S.A. “Basic Electrical Engg.”,2nd Edition, Schaum Series, McGraw Hill Publ.OBJECTIVEBy doing this course the students will be acquiringreasonable level of oral and in writing proficiency inEnglish language ultimately they will be able tocommunicate with their counter parts inbusiness/industry in the country and abroadeffectively.1. Vocabulary; Use of Words; Synonyms; Homophones;Homonyms; Forms and Functions of Words2. Sentence Structure; Verb patterns; Simple;Complex and Compound Sentences3. Remedial English Grammar; Common Errors andRules of Concord4. Phonetics; Basic Concepts; Vowels; Consonants;Syllables; Manner of Articulation and Place ofArticulation; Speech Sounds; Transcription ofWords ; Word Stress and Intonation5. Comprehension; Interpretation of Seen/UnseenPassages6. (A) Oral Communication: Practicing shortdialogues; Group Discussions; and Debates(B) Technical Writing:(i)Business Letters (Format of BusinessLetters and Business Letter Writing)(ii) Email Writing(iii) Reports and types of reports and Pressreports7. Book Review (for internal assessment)Language lab: Emphasis will be laid on accent,pronunciation, intonation, reading/ listeningcomprehensionTEXT BOOKBansal, R.K. and Harrison, J.B., “Spoken English forIndia”, Orient Longman, 2009REFERENCE BOOKS1. Tickoo M. L. and Subramanian, A. E.,“Intermediate Grammar, Usage and Composition”,Orient Longman, 19762. Thomson and Martinet, “A Practical EnglishGrammar”, Oxford University Press, 19863. Hornby, A. S., “Guide to Patterns and Usage inEnglish”, Oxford University Press4. Balasubramanian T, “A Textbook of EnglishPhonetics for Indian Students”, MacMillan5. D.O’Connor J, “Better English Pronunciation”Cambridge University Press6. McCarthy, “English Vocabulary in Use FoundationBooks”, Cambridge University Press7. Hashem Abul, “Common Errors in English”,Ramesh Publishing House8. Roach P., “English Phonetics & Phonology”,Cambridge University Press9. Ramesh M. S. and C.C. Pattanshetti, “BusinessCommunication”, R. Chand and Company10. Wood F. T., “Remedial English Grammar forForeign Students”, The Macmillan Press Ltd., 197511. Hari Mohan Prasad and Uma Rani Sinha,“Objective English”, Tata McGraw Hill Education,2005EN-101COMMUNICATION SKILLSL-T-P Cr5-0-0 3EN-151LANGUAGE LABL-T-P Cr0-0-2 151

B.Tech. Computer Science & Engineering (Regular)LIST OF EXPERIMENTS/EXERCISES1. Word accent based on stress: Cluster of words willbe repeated by the students on the basis ofrecorded voice.(a) 1 st syllable stress(b) 2 nd syllable stress(c) 3 rd syllable stress2. Sentence intonation: Simple day to day sentenceswill be repeated by the students3. Public speeches and debates: Recorded debatesand public speeches will be heard by the studentsto enhance their knowledge on the pitch and tone.4. Conversation: Regular conversations will be heardand later practiced in the lab.5. Listening comprehension: Students will hear thetext and answer the questions that follow.6. Reading comprehension: Text at par withinternational standard will be read by the students.Questions will than be answered.7. Speaking: Text conversation, debates & lecturerswill be heard by the students. The students will beused their aptitude and language to give their onthem8. Error correction: Grammatically incorrectsentences will be given to the students to correct.9. Listening and speaking exercises will be practicedfor the improvement of the language.10. Added exercise on reading comprehension.IT-202COMPUTER NETWORKSL T P Cr5 0 0 3OBJECTIVETo have a fundamental understanding of the design,performance and state of the art of wirelesscommunication systems, Topics covered include stateof the art wireless standards and research and thuschanges substantially form one offering of this courseto the nextPRE-REQUISITESKnowledge of computers hardware and software1. OSI REFERENCE MODEL AND NETWORKARCHITECTURE: Introduction to computernetworks, example networks: ARPANET, Internet,private networks; network topologies: bus-, star-,ring-, hybrid-, tree-, complete-, irregular –topology2. TYPES OF NETWORKS: Local area networks,metropolitan area networks, wide area networks;layering architecture of networks, OSI model,Functions of each layer, services and protocols ofeach layer3. TCP/IP: Introduction, history of TCP/IP; layers ofTCP/IP; Protocols: Internet Protocol, TransmissionControl Protocol, User Datagram Protocol; IPAddressing, IP address classes, subnetaddressing; Internet control protocols: ARP, RARP,ICMP; application layer, domain name system;Email – SMTP, POP, IMAP; FTP, NNTP, HTTP;Overview of IP version 6.4. LOCAL AREA NETWORKS: Introduction to LANs,Features of LANs, Components of LANs, Usage ofLANs; LAN standards, IEEE 802 standards;Channel Access Methods: Aloha, CSMA,CSMA/CD, Token Passing, Ethernet; Layer 2 & 3switching; fast Ethernet and gigabit Ethernet, tokenring; LAN interconnecting devices: hubs, switches,bridges, routers, gateways.5. WIDE AREA NETWORKS: Introduction ofWANs, routing, congestion control, WANTechnologies; Distributed Queue Dual Bus(DQDB); Synchronous Digital Hierarchy (SDH)/Synchronous Optical Network (SONET);Asynchronous Transfer Mode (ATM); framerelay; wireless links.6. INTRODUCTION TO NETWORK MANAGEMENT:Remote monitoring techniques: polling, traps,performance management; class of service, qualityof service; security management: firewalls, VLANs,proxy servers; introduction to network operatingsystems: client-server infrastructure, WindowsNT/2000.7. SOCKET PROGRAMMING: Introduction to socket,Client side and Sever side programming, byteordering, Implementation of socket, SocketInterface.TEXT BOOKTanenbaum Andrew S, “Computer Networks”, 4thEdition, Pearson Education/Prentice Hall of India,2003.REFERENCE BOOKS1. Forouzan Behrouz A., “Data Communications andNetworking”, Tata McGraw Hill 2006.2. Stallings William, “Data and ComputerCommunication”, 5th Edition, Prentice Hall of India,1997.3. Fred Halsall, “Data Communications, ComputerNetworks and Open Systems”, 4th edition, AddisonWesley, Low Price Edition, 20004. Fitzgerald Jerry, “Business Data Communications”,Wiley, 2009.5. Peterson Larry L. and Davie Bruce S., “ComputerNetworks – A System Approach”, 3rd Edition,Morgan Kaufmann, 2003.6. Tittel E. D., “Computer Networking”, Tata McGrawHill, 20027. Kurose James F. and Ross Keith W., “ComputerNetworking: A Top-Down Approach Featuring theInternet”, 2nd Edition, Pearson Education, 2003.8. Keshav S., “An Engineering Approach to ComputerNetworking”, Addison-Wesley, 1997.9. Comer D. E., “Internetworking with TCP/IP”,Volume 1, 3rd Edition, Prentice Hall of India, 1995.WEB REFERENCES1. http://en.wikipedia.org/wiki/Computer_network2. http://www.comsoc.org/dl/pcm/index.html3. http://compnetworking.about.com/od/basicnetworkingconcepts/Networking_Basics_Key_Concepts_in_Computer_Networking.htm4. http://www.protocols.com/hot.htmIT-252COMPUTER NETWORKS L T P CrLAB 0 0 2 1LIST OF EXPERIMENTS52

Lingaya’s University, Faridabad1. Overview of network programming.2. To discover network topology inUNIX/Linux/Windows environment.3. Study of network cables, connectors, cablingoptions, hubs, switches etc.4. Write a program to create sockets for sending andreceiving data; handling multiple connections5. Write a program to obtain the local and remotesocket address and to obtain information about the(A) Host (B) Network (C) Protocols (D) Domains6. Write a program to manipulate the IP Address7. Building a small Ethernet LAN.8. Write a program to make a Telnet Client and anFTP Client9. Write a program to implement checksum methodfor proper data transmission10. Write a program to implement RSA and SHAalgorithm for security of a network11. Types of Optical fibers and study of connectivity ofoptical modules12. Study of (a) Wireless Connectivity and (b) Differentnetworking commands13. Study of Ethernet Switch configuration (Simulatorto be decided)14. Configuring IPv4 and IPv6 addresses.15. To configure a Linux/Windows Server Box as an IPRouter16. Setting up and configuring an IP Router using (a)Distance Vector Routing Protocol, (b) Link StateRouting Protocol, and (c) Border Gateway Protocol(BGP)17. Analysis of Transport Layer Protocols using IPutilities like TCP Dump, etc.18. Setting up of any one (a) Web Server and a ftpserver or (b) DNS Server and a DHCP serverREFERENCE BOOKS1. Tanenbaum Andrew S., “Computer Networks”, 4thedition, Prentice Hall of India, 2003.2. Halsall Fred, Data Communications, ComputerNetworks and Open Systems, 4th edition, AddisonWesley, Low Price Edition, 20003. Peterson Larry L. and Davie Bruce S., “ComputerNetworks – A System Approach”, 3rd Edition,Morgan Kaufmann, 2003IT-301WEB DEVELOPMENTL T P Cr5 1 0 4OBJECTIVETo impart knowledge of basic terms of Internet, variousstandards like HTML, XML etc., client side and serverside programming.PRE-REQUISITESKnowledge of Web Designing and Computer Network1. INTRODUCTION TO THE INTERNET, THEWORLD WIDE WEB: The idea of hypertext andhyper media; how the web works: HTTP, HTMLand URLs; how the browser works: MIME types,plug-ins and helper applications; standards: HTML,XML, XHTML and the W3C; functionality ofMacroMedia DreamWeaver.2. HYPERTEXT MARKUP LANGUAGE: Theanatomy of an HTML document; marking up forstructure and style: basic page markup, absoluteand relative links, ordered and unordered lists,embedding images and controlling appearance,table creation and use, frames, nesting andtargeting; descriptive markup: meta tags forcommon tasks, semantic tags for aiding search,the doubling code and RDF.3. SEPARATING STYLE FROM STRUCTURE WITHSTYLE SHEETS: Internal style specificationswithin HTML; external linked style specificationusing CSS, page and site design considerations.4. CLIENT SIDE PROGRAMMING: Introduction toJavaScript syntax; JavaScript object model, eventhandling; output in JavaScript; Forms handling;miscellaneous topics such as cookies, hiddenfields and images; applications.5. SERVER SIDE PROGRAMMING: Introduction toserver side technologies: ASP/JSP, programminglanguages for server side scripting; configuring theserver to support ASP/JSP; applications; input/output operations on the WWW; forms processing,(using VBScript/JavaScript)6. OTHER DYNAMIC CONTENT TECHNOLOGIES:Introduction to ASP & JSP, Delivering multimediaover web pages; the VRML idea; the Javaphenomenon: applets and servelets; issues andweb development.7. INTRODUCTION TO MICROSOFT .NETTECHNOLOGY AND ITS COMPARISON WITHTHE COMPETING TECHNOLOGIES.TEXT BOOKBoumpery Frank, Greer Cassandra, Raggett Dave,Raggett Jenny, Schnitzenbaumer Sebastian &Wugofski Ted, “Beginning XHTML”, 1st edition, WROXPress/Shroff Publication, 2000REFERENCE BOOKS1. Musciano Chuck, “HTML & XHTML: The DefinitiveGuide”, Bill Kennedy, 4 th Edition, 20002. Holzner Steven, “XHTML Black Book”, ParaglyphPress, 20003. Shishir Gundavaram,“CGI Programming on theWorld Wide Web”, O’Reilly Associates,1 stedition,19964. Godbole Achyut S. and Kahate Atul, “WebTechnologies, Tata McGraw Hill, 20035. Guelich Scott, Gundararam Shishir and BirzniekGunther, “CGI Programing with Perl”, 2nd Edition,O’Reilly6. Tidwell Doug, Snell James and Kulchenko Pavel,“Programming Web Services”, O’Reilly, Dec 20017. Kamal Raj, “Internet and Web Technologies”, TataMcGraw Hill, 2002WEB REFERENCES1. http://www.web-source.net/2. http://www.uniweb.be/3. http://www.sagaciousindia.com/IT-302OPEN SOURCE BASED L T P CrRAPID APPLICATIONDEVELOPMENT 5 1 0 453

B.Tech. Computer Science & Engineering (Regular)OBJECTIVEThe course on RAD focuses on building applicationswithin a very short time period. After successfulcompletion of this course the students will be able toobtain a firm foundation on RAD concepts andmethodologies and acquire sufficient workingknowledge in RAD tools.PRE-REQUISITESKnowledge of programming in C, C++, JAVA1. INTRODUCTION TO RAPID APPLICATIONDEVELOPMENT: Definition, history; effect ofmistakes on development schedule; importance;modern rapid life cycle model; modern RAD.2. ISSUE IN RAPID APPLICATIONDEVELOPMENT: Characteristics; strategy;constraints; advantages and disadvantages;customer oriented development; different RADtools: open source versus licensed softwarebuilder; Easy Eclipse, Net Beans, Anjuta, Glade,Visual Studio .Net, etc.3. RAPID APPLICATION DEVELOPMENTPROJECT ESTIMATION: Estimation processes;size estimation; effort estimation; scheduleestimation; estimation refinement.4. SCHEDULING A RAPID APPLICATIONDEVELOPMENT PROJECT: overlay optimisticscheduling, schedule pressure: beating schedulepressure; invent option for mutual option.5. TEAM WORK: Importance to RAD; effective teambuilding; reason for failure; long term team buildingteam structure.6. RAPID APPLICATION DEVELOPMENT BESTPRACTICES: Daily build & smoke test; Agilemethods, reuse; miniature milestones; throwawayprototyping; goal setting; managing out sourcedprojects; developing full Project using RAD.7. APPLICATION DEVELOPMENT: Installing aFOSS based IDE; configuration; GUI building,integrating application with a database; XML; webbased application development; debugging.TEXT BOOKMcConnell Steve, “Rapid Development”, WB Publishersand Distributers, 1996REFERENCE BOOKS1. Mark Mitchell, Jeffrey Oldham, Alex Samuel,Jeffery Oldham, "Advanced Linux Programming",New Riders, ISBN 07357104302. Rochkind Marc J., "Advanced UNIX Programming",2nd Edition, Addison-Wesley ProfessionalComputing Series, ISBN 01314115433. Stevens W. Richard, "Advanced Programming inthe UNIX Environment", First Edition, Addison-Wesley Professional Computing Series, ISBN02015631774. McConnell Steve, "Code Complete: A PracticalHandbook of Software Construction", MicrosoftPress, ISBN 0735619670,5. Stevens W. Richard, Bill Fenner, Andrew M.Rudoff, Richard W. Stevens, "UNIX NetworkProgramming, Volume 1: Sockets NetworkingAPI", 3rd Edition, Addison-Wesley, ISBN0131411551, 20036. Stevens W. Richard, "UNIX Network Programming,Volume 1: Networking APIs - Sockets and XTI",2nd Edition, Prentice Hall PTR, ISBN 013490012X7. Stevens W. Richard, "UNIX Network ProgrammingVolume 2: Interprocess Communications",Prentice Hall PTR, ISBN 01308108198. Griffith Arthur, "Gnome/Gtk+ Programming Bible",Hungry Minds, Inc, ISBN 07645464069. Gay Warren W., "Advanced Unix Programming",Sams White Book Series, ISBN 067231990X10. Logan Syd, "Gtk+ Programming in C", 1st edition,Prentice Hall PTR11. Pennington Havoc, "GTK+/Gnome ApplicationDevelopment", 1st edition, Pearson Education,ISBN 073570078812. Harlow Eric, "Developing Linux Applications withGTK+ and GDK", 1st edition, Pearson Education,ISBN 0735700214WEB REFERENCES1. http://anjuta.org2. http://gtk.org3. http://gbdc.org4. http://netbeans.orgIT-304SOFTWARE ENGINEERINGL T P Cr5 0 0 3OBJECTIVETo provide basic knowledge of properties of softwareand its development processes, software quality, CASEtools, etc.PRE-REQUISITESKnowledge of computer programming, principles ofmanagement1. INTRODUCTION: Definition and Emergence ofSoftware Engineering, Evolving Role of Software,Software Life Cycle Models, SoftwareCharacteristics, Applications, Software Product,Software Process, Software Crisis, SoftwareMyths.2. SOFTWARE PROJECT MANAGEMENT: Projectmanagement concepts, software process andproject metrics project planning, project sizeestimation metrics, project estimation techniques,empirical estimation techniques, COCOMO- aheuristic estimation techniques, staffing levelestimation, team structures, staffing, risk analysisand management, project scheduling and tracking.3. REQUIREMENTS ANALYSIS ANDSPECIFICATION: Requirements engineering,system modeling and simulation, analysisprinciples: modeling, partitioning software,prototyping: methods and tools; specificationprinciples, representation, the softwarerequirements specification and reviews analysismodeling: data modeling, functional modeling andinformation flow: data flow diagrams, behavioralmodeling; the mechanics of structured analysis:creating entity/ relationship diagram, data flowmodel, control flow model, the control and processspecification; the data dictionary.54

Lingaya’s University, Faridabad9. Write a program to create a file and performdifferent operations on a file.10. Write a program to design a calculator.11. Write a program to show the different layoutsavailable in java.12. Write a program to design an applet to (a) displaya face,(b)analog clock.13. Write a program to design an applet for thestudents detail entry.14. Write a program to show the Client-Servercommunication15. Develop a website for the college16. Develop a website for a the newspaper agencyREFERENCE BOOKS1. Holzner Steven, “XHTML Black Book”, 20002. “CGI Programming on the World Wide Web”,O’Reilly Associates3. Godbole Achyut S. and Kahate Atul, “WebTechnologies”, Tata McGraw Hill, 2003IT-352OPEN SOURCE BASED L T P CrRAPID APPLICATIONDEVELOPMENT LAB 0 0 2 1LIST OF EXPERIMENTSList of Practcials for Rapid Application Development1. Study of development environment on Linux usingGTK+/QT toolkit using Anjuta/Glade/KDevelop2. Create a GUI for finding the types of roots of aquadratic equation, using GTK/QT3. Create a GUI for finding the Income tax for currentfinancial year, using GTK/QT. The given values areBasic Salary (BS), Dearness Allowance (DA),House Rent Allowance (HRA), City CompensatroyAllowance (CCA) and Other Allowances (OA).4. Write a simple program to build a GTK/QT basedGUI to read and display the data picked up from aplain text file/XML/any database includingopenoffice/postgresql/mysql/msql5. Write a simple program to build a GTK/QT basedGUI that has a preferences window with twotabs(color/font) and an alternate window that cancome up(showing “Exiting from the application” intitle and “welcome to GUI programming in linux”using the select font and color) when the userexits..6. Write a simple program to build a GTK/QT basedGUI for accepting a text and change its font/fontsize/color as selected by the user from differentoptions contained in the list.7. Write a simple program to build a GTK/QT basedGUI to provide functionality of paint brush.8. Write a simple program to build a GTK/QT basedGUI to apply following functions on a photographloaded from file system: blur, sharpen, changecontrast/brightness/color values.9. Write a simple program to build a GTK/QT basedcalculator.10. Write with the help of GTK+/QT a program todisplay an error message, whenever an illegaloperation is performed11. create a simple database using any RDBMS andconnect with a GUI based frontend to manipulatethe data values.12. Write a simple program to build a GTK/QT basedGUI for showing the calender and managing themeetings13. Write a simple program to build a GTK/QT basedGUI for displaying the chess board / snake andladder game14. Write a simple program to build a GTK/QT basedGUI for playing the .mov files15. Write a simple program to build a GTK/QT basedGUI for accepting a text file and show the followingcounts: no. of lines, words, characters, whitespaces, special characters, numbers.16. Write a simple program to build a GTK/QT basedGUI which will show randomly generatedletters/characters and accept them in an adjacenttext box. at the end of one minute it will show thetotal number of correct words entered.REFERENCE BOOKS1. Mark Mitchell, Jeffrey Oldham, Alex Samuel,Jeffery Oldham, "Advanced Linux Programming",New Riders, ISBN 07357104302. Rochkind Marc J., "Advanced UNIX Programming",2nd Edition, Addison-Wesley ProfessionalComputing Series, ISBN 01314115433. "Advanced Programming in the UNIXEnvironment" First Edition by W. Richard StevensISBN # 0201563177, Addison-Wesley ProfessionalComputing Series4. McConnell Steve, "Code Complete: A PracticalHandbook of Software Construction", MicrosoftPress, ISBN 07356196705. Stevens W. Richard, Bill Fenner, Andrew M.Rudoff, "UNIX Network Programming, Volume 1:Sockets Networking API", 3rd Edition, Addison-Wesley, 2003, ISBN 0131411551IT-355DATA MINING & DATA L T P CrWAREHOUSING LAB 0 0 2 1LIST OF EXPERIMENTS1. Schematic implementation of a University DataWarehouse (Virtual Data Warehouse)2. Experiment to include elements of an ETL tool likedata scrubbing and loading3. Implementation of a popular algorithm like Apriorito find association from any market basket dataset4. Implementation of an Outlier detection mechanismbased on any of the standard methods(distance/density, etc.) and demonstration ofoutliers detected from a standard dataset5. Use of Regression techniques in making effectiveprediction6. How to design effective classifiers using trainingand testing data7. Implementation of a popular clustering algorithm likeK-Mean, K Medoid or DBSCAN and determination ofresultant clusters of a standard dataset like Iris.8. Methodology to find Principal Components in adataset9. Implementation of Kohonen Self Organising Mapand how it categorises data57

B.Tech. Computer Science & Engineering (Regular)10. Computation of Decision Trees and Splitting pointsfor a suitable dataset11. Implementation of a popular fuzzy clusteringalgorithm like FCM and determination of resultantclusters of a standard dataset like Iris.12. A simple experiment to highlight the usefulness ofsampling in large scale data mining13. An experiment to highlight the use of GeneticAlgorithms in rule mining or clustering14. An experiment to highlight the use of Rough Setsin Data MiningREFERENCE BOOKS1. Anahory Sam and Murray Dennis, “DataWarehousing In the Real World”, PearsonEducation, 19972. Han Jiawei and Kamber Micheline, “Data Mining -Concepts & Techniques”, Morgan Kaufmann, 20013. Berson Alex, “Data Warehousing, Data Mining andOLTP”, Tata McGraw Hill, 19974. Pujari Arun K., “Data Mining Techniques”,University Press, 20015. Adriaans Pieter and Zantinge Dolf, “Data Mining”,Pearson Education, 1997IT-357MULTIMEDIA L T P CrTECHNOLOGIES LAB 0 0 2 1LIST OF EXPERIMENTS1. Write a program to justify a text entered by theuser on both the left and right hand side. Forexample, the test “An architect may have agraphics program to draw an entire building but beinterested in only ground floor”, can be justified in30 columns as shown below. An architect mayhave a Graphics programs draw an entire buildingbut be interested in only ground floor.2. Study the notes of a piano and stimulate themusing the key board and store them in a file.3. Write a program to read a paragraph and store it toa file name suggested by the author.4. Devise a routine to produce the animation effect ofa square transforming to a triangle and then to acircle.5. Write a program to show a bitmap image on yourcomputer screen.6. Create a web page for a clothing company whichcontains all the details of that company and atleastfive links to other web pages.7. Write a program by which we can split mpeg videointo smaller pieces for the purpose of sending itover the web or by small capacity floppy diskettesand then joining them at the destination.8. Write a program to simulate the game of pooltable.9. Write a program to simulate the game MineSweeper.10. Write a program to play “wave” or “midi” formatsound files.REFERENCE BOOKS1. Elisabeth Robson and Eric T Freeman, “Head FirstHTML with CSS & XHTML”, 1st Edition, O’ReillyMedia, 20052. Andy Harris and Chris McCulloh, “HTML, XHTML,and CSS All-in-One Desk Reference ForDummies”, For Dummies, 20083. Adobe Creative Team, “Adobe Flash CS4Professional Classroom in a Book”, Adobe Press,20084. Adobe Creative Team, “Adobe Photoshop CS4Classroom in a Book”, Adobe Press, 20085. Adobe Creative Team, “Adobe Dreamweaver CS4Classroom in a Book”, Adobe Press, 20086. Fred Gerantabee and Aquent Creative Team,“Flash CS4 Professional Digital Classroom”, Wiley,20087. Jennifer Smith and Aquent Creative Team,“Photoshop CS4 Digital Classroom”, Wiley, 20088. Jeremy Osborne and Aquent Creative Team,“Dreamweaver CS4 Digital Classroom”, Wiley, 2008IT-402ADVANCED JAVAL T P Cr5 1 0 4OBJECTIVETo relay the theoretical and practical knowledge ofAdvanced Java programming languagePRE-REQUISITESBasic knowledge of programming language and objectoriented programming1. CORE JAVA: Introduction to Java; data types;variables; operators; arrays; control statements;classes and methods; inheritance; exceptionhandling; multithreading; collections; I/O streams;AWT and applet programming; swings2. NETWORKING: Networking basics, socket, port,proxy servers, internet addressing and URL,java.net – networking classes and interfaces,implementing TCP/IP based server and client;classes to be covered: Socket, ServerSocket, IPAddress, URL connections3. JDBC: Types of JDBC Drivers, Writing JDBCapplications using select, insert, delete, update;Types of Statement objects (Statement, PreparedStatement and Callable Statement); ResultSet,ResultsetMetaData; Inserting and updatingrecords, connection pooling.4. RMI AND JAVA BEANS: Introduction of RMI andarchitecture; implementing RMI methods;Introduction to Java Bean; rules for writing a simplebean, using beans to build an application; Javanaming directory interface concepts5. SERVLETS: Configuring directory structure for aweb application; servlet API overview; writing andrunning simple servlet; servlet life cycle;GenericServlet and HTTPServlet, ServletConfig &ServletContext; writing servlet to handle get andpost methods, reading user request data; writingthread safe servlets; HTTP Tunneling; concept ofcookie, reading and writing cookies6. JSP: Why JSP? JSP directives, writing simple JSPpage; scripting elements; JSP & Java Beans; JSPactions: include, forward and plug-in, managingsessions using JSP; JSP & databases; errorhandling in JSP; writing custom tags; Differentscopes in a JSP page; Using JDBC in JSP; study58

B.Tech. Computer Science & Engineering (Regular)3. www.onestoptesting.com/introduction4. www.developers.net5. www.wiziq.com/tutorials/Software-Testing6. www.softwaretestinggenius.comIT-423INTRODUCTION TO L T P CrE-COMMERCE & ERP 5 0 0 3OBJECTIVETo provide knowledge about the protocols, methods,security issues in electronic commerce as well as aboutenterprise resource planning tools, models and techniquesPRE-REQUISITESKnowledge of internet and web development, datamining, computer networks, software engineering1. INTRODUCTION AND CONCEPTS: Networks andcommercial transactions – Internet and othernovelties, networks and electronic transactionstoday, Model for commercial transactions, Internetenvironment – internet advantage, worlds wideweb and other internet sales venues, Onlinecommerce solutions.2. ELECTRONIC PAYMENT METHODS: Updatingtraditional transactions, Secure online transactionmodels, Online commercial environments, digitalcurrencies and payment systems, Offline secureprocessing, private data networks, Securityprotocols, Electronic Payment Systems: Digitalpayment systems3. DIGITAL CURRENCIES: Operational process ofDigicash, Ecash Trail, Using Ecash, Smart cards,Electronic Data Interchange: basics, EDI versusInternet and EDI over Internet. Strategies,Techniques and Tools, Shopping techniques andonline selling techniques.4. ERP- AN ENTERPRISE PERSPECTIVE:Production Finance, Personnel disciplines andtheir relationship, Transiting environment, MISIntegration for disciplines, Information/Workflow,Network Structure, Client Server IntegratorSystem, Virtual Enterprise.5. ERP – RESOURCE MANAGEMENTPERSPECTIVE: Functional and Process ofResource. Management, Introduction to basicModules of ERP System: HRD, PersonnelManagement, Training and Development, SkillInventory, Material Planning and Control,Inventory, Forecasting, Manufacturing, ProductionPlanning, Production Scheduling, ProductionControl, Sales and Distribution, Finance, ResourceManagement in global scenario.6. ERP - INFORMATION SYSTEM PERSPECTIVE:Introduction to OLAP (Online Analysis andProcessing), TP, OAS, KBS, MRP, BPR, SCM, REP,CRM, Information Communication Technology.7. ERP-KEY MANAGERIAL ISSUES: ConceptSelling, IT Infrastructure, Implication, of ERPSystems on Business Organization, Criticalsuccess factors in ERP System, ERP CultureImplementation Issues, Resistance to change,ERP Selection issues, Return on Investment, Preand Post Implementation Issues.TEXT BOOKRavi Kalakota and Andrew Whinston, “Frontiers ofElectronic Commerce”, Addison Wesley, 1996REFERENCE BOOKS1. V. K. Garg and N. K. Venkita Krishna, “EnterpriseResource Planning – Concepts and Practice”,Prentice Hall of India, 1998,2. Motiwala, “Enterprise Resource & Planning”, 1stedition, Pearson Education3. John Antonio, Fernandez, “The SAP/3 Handbook”,Tata McGraw Hill4. Denial Amor, “The E-Business Revolution”,Addison Wesley5. Sokol, “From EDI to E-Commerce: A BusinessInitiative”, Tata McGraw Hill6. Greenstein and Feinman, “E Commerce”, TataMcGraw Hill7. Rajan and Nag, “E Commerce: The Cutting Edgeof Business”, Tata McGraw Hill8. Jaffrey F. Rayport , Bernard J. Jaworski, “E-Commerces”, Tata McGraw Hill, 20029. Greenstein and Feinman, “Electronic Commerce –Security, Risk Management and Control”, TataMcGraw Hill, 200210. Hendry Chan, Raymond Lee, Tharam Dillon andEllizabeth Cang, “E-Commerce Fundamentals andApplications”, John Wiley.WEB REFERENCES1. www.exforsys.com/tutorials/erp/erp-and-ecommerce.html2. www.bizautomation.com3. itmanagement.earthweb.com/erp4. www.e2-llc.com/e2_ecommerce_erp.aspx5. e-comm.webopedia.com/TERM/e/ERP.htmlIT-424MOBILE COMPUTINGL T P Cr5 0 0 3OBJECTIVERecent developments in portable devices and highbandwidth,ubiquitous wireless networks has mademobile computing a reality. Indeed, it is widelypredicted that within the next few years’ access toInternet services will be primarily from wireless devices,with desktop browsing the exception. Such predictionsare based on the huge growth in the wireless phonemarket and the success of wireless data services. Thiscourse will help in understanding fundamentalconcepts, current developments in mobilecommunication systems and wireless computernetworks.PRE-REQUISITESComputer Networks and wireless communication1. INTRODUCTION TO WIRELESSTRANSMISSION: Applications, A short history ofwireless communication, Frequency for radiotransmission, Signals, Antennas, Signalpropagation, Multiplexing, Modulation, Spreadspectrum, Cellular systems.2. MEDIUM ACCESS CONTROL: Motivation for aspecialized MAC: Hidden and Exposed terminals.Near and Far terminals; SDMA, FDMA, TDMA:60

Lingaya’s University, FaridabadFixed TDM, Classical Aloha, Slotted Aloha, Carriersense multiple access, Demand assigned multipleaccess, PRMA packet reservation multiple access,Reservation TDMA, Multiple access with collisionavoidance, Polling, Inhibit sense multiple access;CDMA: Spread Aloha multiple access3. TELECOMMUNICATION SYSTEMS: GSM:Mobile services, System architecture, Radiointerface, Protocols, Localization And Calling,Handover, Security, New data services; DECT:System architecture, Protocol architecture; TETRA,UMTS and IMT-2000: UMTS Basic architecture,UTRA FDD mode, UTRA TDD mode4. SATELLITE & BROADCAST SYSTEMS: History,Applications, Basics: GEO, LEO, MEO; Routing,Localization, Handover, Examples, Cyclicrepetition of data, Digital audio, broadcasting:Multimedia object transfer protocol; Digital videobroadcasting5. WIRELESS LAN: Infrared vs. Radio transmission,Infrastructure and Ad hoc Networks, IEEE 802.11:System architecture, Protocol architecture,Physical layer, Medium access control layer, MACmanagement, Future development; HIPERLAN:Protocol architecture, Physical layer, Channelaccess control. Sublayer, Medium access controlSublayer, Information bases And Networking;Bluetooth: User scenarios, Physical layer, MAClayer, Networking. Security, Link management.6. MOBILE NETWORK LAYER: Mobile IP: Goals,assumptions and requirements, Entities andTerminology, IP packet delivery, Agentadvertisement and discovery, Registration,Tunnelling and Encapsulation , Optimizations,Reverse tunnelling, Ipv6; Dynamic hostconfiguration protocol, Ad hoc networks: Routing,Destination sequence distance vector, Dynamicsource routing, Hierarchical algorithms, Alternativemetrics,7. MOBILE TRANSPORT LAYER: Traditional TCP:Congestion control, Slow start, Fastretransmit/fast recovery, Implications on mobility;Indirect TCP, Snooping TCP, Mobile TCP, Fastretransmit/fast recovery, Transmission/time-outfreezing, Selective retransmission, Transactionoriented TCPTEXT BOOKJochen Schiller, “Mobile Communications”, AddisonWesley/Pearson Education, 2005REFERENCE BOOKS1. Garg Kumkum, ”Mobile Computing”, PearsonEducation, 20062. Talukder Asoke K. and Yavagal R. R., “MobileComputing”, Tata McGraw-Hill, 2005.3. Uwe Hansman, Lothar Merk, Martin S. Nicklousand Thomas Stober, “Principles of MobileComputing”, 2nd Edition, Springer-Verlag, 2003,ISBN 81-7722-468-94. Dharma Prakash Agrawal and Qing-An Zeng,“Introduction to Wireless and Mobile Systems”, 2ndedition, 20065. Stallings William, “Wireless Communications andNetworks”, Pearson Education, 20096. Yi-Bing Lin and Imrich Chlamtac, “Wireless andMobile Network Architectures”, John Wiley & Sons,2004, ISBN 9971-51-366-87. Rappaport, “Wireless Communications Principlesand Practices” Prentice Hall, 2nd edition, 2006.8. Nicopolitidis P., “Wireless Networks”, John Wileyand Sons, 2003.9. Pahlavan K and Krishnamurthy P., “Principles ofWireless Networks” Prentice Hall, 2002.10. Richharia M., “Mobile Satellite Communication:Principles and Trends”, Pearson Education, 2000.WEB REFERENCES1. http://www.it.iitb.ac.in/~it601/dep/?id=32. http://www.onesmartclick.com/engineering/digitalcommunications.html3. http://www.nd.edu/~surendar/teach/spr02/ubicomp/lecture.shtml4. http://es.fbk.eu/people/murphy/classes/290e/notes/index.htmlIT-425OBJECT ORIENTED L T P CrSOFTWARE ENGINEERINGAND UML 5 0 0 3OBJECTIVETo provide adequate knowledge about the differenttypes of system software available and to introducethe object oriented concepts to the programmingskills.PRE-REQUISITESUnderstanding of object orientation and knowledge ofsoftware engineering1. REVIEW OF OBJECT ORIENTED SYSTEMS:Design objects, class hierarchy, inheritance,polymorphism, object relationships andassociations, aggregations and objectcontainment, object persistence, meta classes,object oriented systems development life cycle,Software development process, object orientedsystems development: a use case drivenapproach.2. OBJECT ORIENTED ANALYSIS: Analysisprocess, use case driven object oriented analysis,use-case model, object classification, theory,different approaches for identifying classes,classes, responsibilities and collaborators,identifying object relationships, attributes andmethods, super sub class relationships, A- part ofrelationships aggregation, class responsibilities,object responsibilities.3. OBJECT ORIENTED DESIGN: Object orienteddesign process, corollaries, design axioms, designpatterns, object oriented design philosophy4. METHODOLOGY FOR OBJECT ORIENTEDDESIGN: Object modeling technique as softwareengineering methodology, Rumbaughmethodology, Jacobson Methodology, BoochMethodology5. UNIFIED APPROACH FOR OBJECT ORIENTEDDESIGN: Patterns, Frameworks, the unifiedapproach, unified modeling language (UML).61

B.Tech. Computer Science & Engineering (Regular)6. UML: Why we model, types of models, principlesof modelling, object oriented modelling, objectoriented concepts, UML notation, object orientedanalysis: use case diagrams, interaction diagrams,activity diagrams, object oriented design: classdiagrams, object diagrams, state diagrams,collaboration diagrams, post-testing: deploymentdiagrams, patterns, frameworks7. USING UML FOR OOD: UML object constraintlanguage, designing classes: the process, classvisibility, refining attributes, designing methods adprotocols, packages and managing classes,designing interface objects, view layer interfacedesign, macro and micro level interface designprocessTEXT BOOKJacobson Ivar, “Object Oriented Software Engineering”,Addison Wesley, 1997.REFERENCE BOOKS1. Bennett, “Object Oriented System Analysis andDesign using UML”, Tata McGraw Hill, 20092. Deacon,” Object Oriented Analysis and Design”,Pearson Education, 20093. Ali Bahrami, “Object Oriented SystemsDevelopment”, McGraw Hill, 19994. Rumbaugh et al, ”Object Oriented Modeling andDesign”, Prentice Hall of India, 20075. Booch Grady, “Object Oriented Analysis andDesign with applications”, 3rd edition, AddisonWesley, 20076. Mehta Subhash and Basandra Suresh K., “ObjectOriented Software Engineering”, GalgotiaPublications,1995WEB REFERENCES1. www.objectmentor.com/resources/articles/umlClassDiagrams.pdf2. uml-tutorials.trireme.com3. www.smartdraw.com/tutorials/software/oose/tutorial_01.htm4. www.iconixsw.com5. www.rspa.com/spi/analysismodeling.htmlIT-431BIOINFORMATICSL T P Cr5 0 0 3OBJECTIVEBioinformatics is a rapidly growing field that integratesmolecular biology, biophysics, statistics, and computerscience. Fundamentally it is a field focused oncomparison: how similar are two given proteins? Whatare the differences between various DNA sequences?How is the data from one microarray assay differentfrom another? Furthermore, bioinformatics is concernedwith quantifying the significance of these differences. Inany of the examples above, once a metric for similarityis obtained, it must also be statistically characterized todetermine the likelihood that such a relationship couldoccur by chance. In this course, you will learn many ofthe popular tools for performing bioinformatics analysisand you will be introduced to the thinking that drives thealgorithms.PRE-REQUISITESKnowledge of fundamentals of biology, genetics, datastructures and statistics1. INTRODUCTION TO MOLECULAR BIOLOGY:Gene structure and information content; molecularbiology tools, genomic information content2. COMPUTATIONAL BIOLOGY: Data searches andpairwise alignments; gaps; scoring matrices;Needleman and Wunsch algorithm; global andlocal alignments; database searches.3. PHYLOGENETICS: Molecular phylogenetics;phylogenetic trees; distance matrix methods;character-based methods of phylogenetics;parsimony.4. GENOMICS: Patterns of substitution within genes;estimating substitution numbers; molecular clocks;ancestral sequences; searches; consensus trees;tree confidence; genomics; prokaryotic genestructure; gene density; eukariotic genomes; geneexpression.5. PROTEOMICS: Protein and RNA structureprediction, polypeptic composition, secondary andtertiary structure; algorithms for modeling proteinfolding; structure prediction; proteomics; proteinclassification; experimental techniques; ligandscreening; post-translational modificationprediction.6. GENE EXPRESSION DATA: Microarrays andgene expression data; microarray design; analysisof data; application; microarray standards;clustering (SOM, PCA/SVD, k-means,hierarchical); classification (LVQ, SVM);processing gene expression data using decisiontree based methods (ID3, ASSISTANT, C5.0)7. NEW AREAS OF BIOINFORMATICS:Metabolmics: metabolic pathways; drug targetidentification; biological systems: systems ofmolecular network; eco-systems, elements ofsystems modeling; nutrigenomics;palenteoinformatics; toxicogenomics, systemsbiology; pharmacogenomics, synthetic biology, bioterrorism,biological and chemical warefare, datasecurity issues in bioinformatics, bio-ethics,cloning, transgenic organisms, bio-ethics inagriculture, ontology, standardsTEXT BOOKMount David, “Bioinformatics: Sequence and GenomeAnalysis”, 2008REFERENCE BOOKS1. Attwood T. K. and Parry-Smith D. J., “Introductionto Bioinformatics”, Pearson Education, 20032. Krane D. E. and Raymer M. L., “FundamentalConcepts of Bioinformatics”, Pearson Education,2003.3. Gibas Cynthia, Jambeck Per, “DevelopingBioinformatics Computing Skills”, O’Reilly, 20014. Zar J. H., “Biostatistical Analysis”, 4th edition,Pearson Education, 1999.5. Baldi Pierre and Brunak Søren, “Bioinformatics:The Machine Learning Approach”, 2nd edition, MITPress, 20016. Westhead D. R. et al, “Instant Notes Series:Bioinformatics”, Viva Books Pvt. Ltd., 200362

Lingaya’s University, Faridabad7. Baxenavis Andreas and Ouellette B. F. Francis(eds), “Bioinformatics: A Practical Guide to theAnalysis of Genes and Proteins”, John Wiley, 1998WEB REFERENCES1. http://bioinfo.ernet.in/2. http://www.ibioinformatics.org/3. http://www.bioinfbook.org/4. http://www.bioplanet.com/bioinformatics_tutorial.htmIT-441NETWORK SECURITY & L T P CrMANAGEMENT 5 0 0 3OBJECTIVEThe main objective behind this course is to learn aboutthe various network attacks and preventing attacks.This course is designed to cover Application security,Operating system security, Network security, Websecurity etc.PRE-REQUISITESKnowledge of data communications and computernetworks, computer programming, data structures,mathematics, telecom network. Knowledge of digitalsignal processing is desirable1. INTRODUCTION: Codes and ciphers; someclassical systems; statistical theory of ciphersystems: complexity theory of crypto systems;stream ciphers, block ciphers.2. STREAM CIPHERS: Rotor based system; shiftregister based systems; design considerationsfor stream ciphers, crypt-analysis of streamciphers; combined encryption and encoding;block ciphers: DES and variant, modes of use ofDES; public key systems: knapsack systems,RSK, Diffie Hellman exchange; authenticationand digital signatures; elliptic curve basedsystems.3. SYSTEM IDENTIFICATION AND CLUSTERING:Cryptology of speech signals: narrow band andwide band systems; analogue and digital Systemsof speech encryption.4. SECURITY: HASH FUNCTION –AUTHENTICATION: Protocols; digital signaturestandards; electronic mail security: PGP (PrettyGood Privacy), MIME; data compressiontechnique; IP security: architecture, authenticationleader, encapsulating security; payload: keymanagement; web security: secure socket layer &transport layer security, secure electronicstransactions; firewalls design principle; establishedsystems.5. TELECOMMUNICATION NETWORKARCHITECTURE: TMN management layers,management information model; managementservicing and functions; structure of managementinformation and TMN information model; SNMP v1,SNMP2 & SNMP3, RMON1 & 2; BroadbandNetwork Management (ATM, HFC, DSL); ASN6. SECURITY IN NETWORKS: Threats in networks,Network security control, Firewalls, Intrusiondetection systems, Secure e-mail, Networks andcryptography, Example protocols: PEM, SSL,IPsec, Administrating Security: Securityplanning, Risk analysis, Organizational securitypolicies, Physical security.7. LEGAL, PRIVACY, AND ETHICAL ISSUES INCOMPUTER SECURITY: Protecting program anddata; information and law; rights of employees andemployers; software failures; computer crime,privacy; ethical issues in computer society; casestudies of ethicsTEXT BOOKStallings William, “Cryptography and Network Security”,4th Edition, Prentice-Hall, Englewood Cliffs, 2006REFERENCE BOOKS1. “Cryptography and Network Security: Principal &Practices”, 3rd Edition, Prentice Hall of India, 20022. Mani Subramanian, “Network ManagementPrinciples & Practices”, Addison Wesley, 19993. Burke J. Richerd, “Network Management Conceptsand Practice A Hand-on Approach, PearsonEducation, Reprint 20044. Kauffman C., Perlman R. and Spenser M.,“Network Security”, 2nd Edition, Prentice Hall,2002.5. Stallings William, “SNMP”, Addison Wesley, 19996. “SNMP: A Guide to Network Management”,McGraw Hill, 20057. Wang H. H., “Telecom Network Management”, 3rdEdition, McGraw Hill, 19978. Dlack U., “Network Management”, 3rd Edition,McGraw Hill, 19979. Menezes Alfred, van Oorschot Paul, and VanstoneScott, “Handbook of Applied Cryptography”, CRCPress, NY, 2004.10. Bellovin S. and Chesvick W., “Internet Security andFirewalls”, 2nd Edition, Addison Wesley, 1998.11. Schneier Bruce, “Applied Cryptography”, WileyStudent Edition, 2nd Edition, Singapore, 1996.WEB REFERENCES1. www.londonexternal.ac.uk2. crypto.stanford.edu/cs155/3. www.skillstrainuk.com/network-security4. www.networkcomputing.com5. www.foundstone.com/us/resources-free-tools.aspIT-442INFORMATION SECURITYL T P Cr5 0 0 3OBJECTIVETo impart knowledge about the information securitytools, techniques, procedures, standards, etc. that areessential for protection of information in an organization1. INTRODUCTION TO COMPUTER SECURITY:Protocols; passwords; access control; distributedsystems security; multilevel security; multilateralsecurity; monitoring systems; biometrics; physicaltamper resistance; network attack and defense;protecting e-commerce systems; copyright andprivacy protection.2. CRYPTOGRAPHY: Basic mathematicalbackground to cryptography; symmetric andasymmetric cryptographic algorithms; hashes;63

B.Tech. Computer Science & Engineering (Regular)randomness; signatures; simple cryptographicprotocols.3. SOFTWARE SECURITY: What is softwaresecurity?; Common software vulnerabilities: lack ofinput validation (buffer overflows, SQL injections,race conditions, access control, etc.; flaws: designflaws, implementation flaws; deployment flaws;case studies; Language level security: typing;tainting input data; untrusted code security;application level security: runtime monitoring; staticanalysis; verification; JML, Spec; softwareevaluation; case studies.4. VERIFICATION OF SECURITY PROTOCOLS:Modelling of black box security protocols; intrudermodel; security requirements; BAN logics andother security protocol logics; process algebraicapproach to security protocol verification; modelchecking; Spi calculus; strand spaces; operationalmodels; security protocols in action.5. SECURITY IN ORGANISATIONS: Securitypolicies; Roles; Classifications; Assets and threats;Risk, vulnerability; control; attack; damage; Riskanalysis; Methods/tools for risk analysis; CERTs;Risk assessment and risk management6. INFORMATION SECURITY STANDARDS: Codeof Practice for Information Security (BS7799 andISO 27001); evaluation of information security, likeITSEC and the Common Criteria; Security plan;attack trees; business continuity planning/incidentrecovery; Legal issues: patents and copyright.7. NETWORK SECURITY: Principles behind networksecurity; their main protocols as well as networksecurity mechanisms and techniques; wired andwireless networks: IP security, Email security, Websecurity, secure management, Intruders, Viruses,Firewalls and Privacy.TEXT BOOKWilliam Stallings, “Network Security Essentials -Applications and Standards”, 2nd Edition, Prentice Hall,ISBN 0-13-120271-5REFERENCE BOOKS1. Anderson R. J., “Security Engineering: A guide toBuilding Dependable Distributed Systems”, JohnWiley & Sons Inc, New York, 2001, ISBN 0-471-38922-62. van Tilborg H. C. A., “Fundamentals of Cryptology:A Professional Reference and Interactive Tutorial”,Kluwer Academic Publishers, 2000.3. Kurose James F. and Ross Keith W., “ComputerNetworking: A Top-Down Approach Featuring theInternet”, Addison Wesley, 2005, ISBN 0-321-26976-4WEB REFERENCES1. https://www.securityforum.org2. www.freetechbooks.com/information-securityf52.html3. csrc.nist.gov/4. www.infsec.ethz.chIT-443INFORMATION STORAGE & L T P CrMANAGEMENT 5 0 0 3OBJECTIVEUsing a “building block” approach, the ISM curriculumprovides a core understanding of storage technologiesand progresses into system architectures, introductionto networked storage, and introduction to informationavailability. The course provides a comprehensiveintroduction to data storage technology fundamentals.Students will gain knowledge of the core logical andphysical components that make up a storage systemsinfrastructure.PRE-REQUISITESKnowledge of computer networks1. INTRODUCTION: Meeting today's data storageneeds - data creation; data creation: individuals,business; categories of data; data storage models;common data storage media and solutions - tapestorage systems, optical data storage, disk basedstorage2. DATA CENTER INFRASTRUCTURE: Example;key requirements of storage systems managementactivities3. STORAGE SYSTEMS ARCHITECTURE: Storagesystem environment; components of a host;connectivity; physical disks; RAID array; diskstorage systems; data flow exercise4. NETWORKED STORAGE: Direct AttachedStorage (DAS), Network Attached Storage (NAS),Fiber Channel Storage Area Network (FC SAN), IPStorage Area Network (IP SAN), ContentAddressed Storage (CAS)5. BUSINESS CONTINUITY: Introduction, overview,backup and recovery, local replication, remotereplication.6. MONITORING AND MANAGING THE DATACENTER: Areas of the data center to monitor;considerations for monitoring the data center;techniques for managing the data center.7. SECURING STORAGE AND STORAGEVIRTUALIZATION: Securing the storageinfrastructure; virtualization technologies.TEXT BOOKOsborne Marc Farley, “Building Storage Networks”,Tata McGraw HillREFERENCE BOOKS1. Spalding Robert, “Storage Networks: TheComplete Reference“, Tata McGraw Hill2. Gupta Meeta, “Storage Area NetworkFundamentals”, Pearson Education Limited3. Kowalski Gerald J. and Maybury Mark T.,“Information Storage & Retrieval Systems Theory& Implementation”, BS Publications4. Thejendra B. S., “Disaster Recovery & BusinessContinuity”, Shroff Publishers & Distributors, EMC– Students Kit.WEB REFERENCES1. http://www.cs.cmu.edu/~fp/courses/03-312/handouts/18-storage.pdf2. http://www.freedownloadscenter.com/Information_Management/64

Lingaya’s University, FaridabadIT-444PERVASIVE COMPUTINGL T P Cr5 0 0 3TEXT BOOKAgrawal Dharma Prakash and Zeng Qing-An,“Introduction to Wireless and Mobile Systems”, 2ndEdition, 2006OBJECTIVEThis course will study the mechanisms andenvironments of pervasive computing. This coursewill cover many of the maturing technologies ininput/output, networking, information infrastructure,and ease-of-use that will become necessary ascomputers become small, pervasive, and in constantconnection with each other. Some of the I/Ointerfaces that will be investigated include speech,vision, gestures, combinations of sensors, andlocation sensors.PRE-REQUISITESKnowledge of networking and mobile computing1. INTRODUCTION: The Computer for the 21stcentury; wireless technologies, signal propagation,multiplexing, modulation, and spread spectrumtechniques; challenges and issues in ubiquitouscomputing: disconnected operation, updatepropagation, update conflicts, synchronization,replication, bandwidth adaptation, poweradaptation, context awareness, location tracking,migration, system support, security, smart spaces,invisibility, localized scalability, unevenconditioning2. DEVICE TECHNOLOGY: Compaq iPAQ 5400series, iPAQ 5450 sSpecs, Tiqit Eightythree,Eighty three specs, Palm Tungsten-T, Tungsten-Tspecs, Bluetooth qualified products.3. WIRELESS NETWORKING AND SATELLITESYSTEMS: Overview of the IEEE 802.11b wirelessEthernet standard. The Bluetooth radio system,Wi-Fi (802.11b), General Packet Radio Service inGSM, 802.11 a, b & g Comparison, 802.11 a & bComparison, 802.11a Official Standard, WAP andWML, Satellite Systems: basic routing, localization,and handoff issues4. MOBILE NETWORKING: Mobile IP; Ad-HocNetworks: AODV, DSR, DSDV routing; WirelessTCP: indirect TCP, Snooping TCP, Mobile TCP5. SENSOR NETWORKS AND AD HOC ROUTING:System architecture for networked sensors;making sharing pervasive: Ubiquitous computing,multi-hop wireless ad hoc network routingprotocols; TAG: tiny aggregation service.6. LANGUAGES, PROTOCOLS ANDINFORMATION MANAGEMENT: Jini, Sync,UDDI, Universal Plug-and-Play (UPnP), SimpleObject Access Protocol (SOAP) 1.1, MobileIP andTCP over wireless, information management:location-independent and location-dependentcomputing models7. USER INTERFACES AND APPLICATIONEXAMPLES: Coordination infrastructure forinteractive workspaces; ICrafter: a serviceframework for ubiquitous computing environments,The Interactive Workspaces project, UbiquitousComputing Rooms; context-aware design andinteraction; fluid Interaction; overview of thePARCTAB ubiquitous computing experiment.REFERENCE BOOKS1. Talukder Asoke K. and Yavagal R. R., “MobileComputing”, Tata McGraw-Hill, 2005.2. Burkhardt Jochen, Horst Henn, Hepper Stefan,Schaec Thomas and Rindtorff Klaus, “PervasiveComputing: Technology and Architecture of MobileInternet Applications”, Pearson Education, 2007.3. Adelstein Frank, Gupta S. K. S., Richard G. G. andSchwiebert L., “Fundamentals of Mobile andPervasive Computing”, Tata McGraw-Hill, 2005.4. Foster Ian and Kesselman Carl, “The Grid 2:Blueprint for a New Computing Infrastructure”,Morgan Kaufmann Publishers, 2004, ISBN 1-55860-933-45. Amor Daniel, “Internet Future Strategies: HowPervasive Computing Services Will Change theWorld”, Prentice-Hall PTR, 2008.6. Hansman Uwe, Merk Lothar, Nicklous Martin S.and Stober Thomas, “Principles of MobileComputing”, 2nd Edition, Springer-Verlag, 2003,ISBN 81-7722-468-97. Lin Yi-Bing and Chlamtac Imrich, “Wireless andMobile Network Architectures”, John Wiley & Sons,2004, ISBN 9971-51-366-88. Nicopolitidis P., Obaidat M. S., Papadimitriou G. I.and Pompportsis A. S., “Wireless Networks”, JohnWiley & Sons, 2003, ISBN 9812-53-033-99. Saulpaugh Tom and Mirho Charles, “Inside theJavaOS Operating System”, Addison-Wesley,Reading, 1999, ISBN 0-201-18393-510. Graham Steve, Simeonov Simeon, Boubez Toufic,Daniels Glen, Davis Doug, Nakamura Yuichi andNeyama Ryo, “Building Web Services with Java:Making Sense of XML, SOAP, WSDL and UDDI”,ISBN: 0-672-32181-5, 2001WEB REFERENCES1. Jini Technology Core Platform Specification, v. 2.0,Sun Microsystems, June 2003;www.sun.com/software/jini/specs/core2_0.pdf.2. UPnP Device Architecture 1.0, UPnP Forum, Dec.2003;www.upnp.org/resources/documents/CleanUPnPDA10120031202s.pdf.3. R. Chinnici et al., Web Services DescriptionLanguage (WSDL) Version 2.0," W3C workingdraft, Aug. 2004; www.w3.org/TR/2004/WDwsdl20-20040803.4. UDDI Version 2.04 API Specification, OASISstandard, July 2002;http://uddi.org/pubs/ProgrammersAPI-V2.04-Published-20020719.pdf5. http://www.iswpc.org/2007/cfp.html6. http://www.parliament.uk/documents/upload/postpn263.pdf7. http://searchnetworking.techtarget.com/sDefinition/0,,sid7_gci759337,00.html1. http://www.isoc.org/inet2000/cdproceedings/3a/3a_1.htmIT-445 HUMAN COMPUTER L T P Cr65

B.Tech. Computer Science & Engineering (Regular)INTERACTION 5 0 0 3OBJECTIVETo acquaint with the analysis, design and developmentaspects of enhancing interactions between human andcomputer system keeping in view the behavioural andpsychological factors of any humanPRE-REQUISITESKnowledge of computer organization and architecture,software engineering, computer graphics andmultimedia technologies1. INTRODUCTION: Introduction to Human-Computer Interaction (HCI); history; human factorsof interactive software – goals of softwareengineering, goals of user interface design;motivation for human factors in design;accommodation of human diversity.2. HUMAN INFORMATION PROCESSING: Humanmemory; thinking – reasoning and problem solving;skill acquisition; mental models; decision making;computer system interfaces: mechanics of inputand output devices, review of computerarchitecture; performance characteristics ofhumans and systems; review of computer graphics3. PRINCIPLES BEHIND HUMAN – SYSTEMINTERACTION: Paradigms of interaction;principles to support usability4. USER CENTERED DESIGN OVERVIEW:Software development life cycle – actual, threepillars of design; usability engineering; iterativedesign and prototyping; design rationale; usabilitytesting5. TASK ANALYSIS: Basic concepts, taskdecomposition; knowledge based analysis; entityrelationshipbased analysis; sources ofinformation; uses of task analysis6. SYSTEM DESIGN: Use cases; scenarios;structuring information; information architecture;process flows, wireframes, mock-ups, comps.7. DESIGN FOR UNIVERSAL ACCESS: Accessconcepts; accessible software; factors drivingsoftware accessibility; universal accessibilityprinciples, guidelines and recommendations; casestudiesTEXTBOOKDix Alan, “Human Computer Interaction”, PearsonEducation, 2002.REFERENCE BOOKS1. Carroll John, “HCI Models, Theories, andFrameworks: Toward a Multidisciplinary Science”,Morgan Kaufmann, 20032. Clark Ruth Colvin and Mayer Richard Pfeiffer, “e-Learning and the Science of Instruction: ProvenGuidelines for Consumers and Designers ofMultimedia Learning”, 20023. Fulleton Tracy, Swain Christopher, and HoffmanSteve, “Game Design Workshop: Designing,Prototyping, and Playtesting Games”, CMP Books,USA, 20044. Garrett Jesse James, “A Visual Vocabulary forInformation Architecture”, JJG.Net, USA, 20025. Garrett Jesse James, “The Elements of UserExperience”, New Press Riders, USA, 20026. Krug Steve, “Don't Make Me Think: A CommonSense Approach to Web Usability”, New PressRiders, USA, 20007. Meigs Tom, “Ultimate Game Design”, TheMcGraw-Hill Companies, USA, 20038. Nielsen Jakob, “Designing Web Usability: ThePractice of Simplicity”, New Press Riders, USA,19999. Salen Katie and Zimmerman Eric, “Rules of Play:Game Design Fundamentals”, The MIT Press,USA, 2003WEB REFERENCES1. http://www.cc.gatech.edu/classes/AY2003/cs6750b_fall/syllabus.html2. http://en.wikipedia.org/wiki/Humancomputer_interaction3. http://hci-journal.coL T P CrIT-452 ADVANCED JAVA LAB0 0 2 1LIST OF EXPERIMENTS1. Program to Program for printing Hello World andfind the sum of odd integers between 1 and 99.2. Program from getting input from keyboard.3. Program for calling a method using classinstance, and create a class fruit with thefollowing attributes:• Name of the fruit• Single fruit or bunch fruit• PriceDefine a suitable constructor and displayFruit()method that displays values of all the attributes.Write a program that creates 2 objects of fruit classand display their attributes.4. Program that calculates and prints the simpleinterest using the formula: simpleinterest=PNR/100 Input values P, N, R should beaccepted as command line input as below, e.g.java Simple interest 5 10 155. Program (a) that prints prime numbers between 1to n. Number n should be accepted as commandline input,(b) for getting address and name of thecomputer.6. Program to sort the elements of an array inascending order.7. Program that will contain two arrays on containingthe products and the other containing the pricesand to display the same8. Create a user-defined exception class using theextends keyword. Write a constructor for this classthat takes a string argument and stores it insidethe object with a string handle. Write a method thatprints out the stored string. Create a try-catchclause to exercise the created exception.9. Create a Java program using thread10. Program to accept two names as command lineparameters. Check whether each of them exist inc:\java directory. If it exists, display its name andsize, else, display the message that it does notexist. Further, if the extension of the file is “html”then it has to be deleted.11. Create an Applet to display a string “I am in thecentre” in Courier font, with size 30 and style and66

Lingaya’s University, Faridabaditalic. This text should be centered bothhorizontally and vertically.12. Create a simple, non-editable combo box with a listof items, when selected one of the items, willdisplay the string to the console and also printingthe string which is being deselected, i.e., the stringwhich already been selected.13. Program through which the insert statement canbe given at runtime. Use it to insert the followingtest data in the master and details tables.14. Write a Echoserver and Echoclient program thatdisplays whatever is typed in the server on to theclient using sockets.15. Use socket programming to design a client/serverapplication that takes the password as input andchecks whether it is correct. The program shouldprint the appropriate message.16. Using servlet develop a Java program (databaseconnectivity)17. Using RMI develop a client-server frameREFERENCE BOOKS1. Horstmann Cay and Cornell Gary, “Core Java”,Volume I - Fundamentals, 8th Edition, PearsonEducation, 20072. Callway Dustin R., “Inside Servlets”, 2nd Edition,Addison-Wesley Professional, 20013. Goodwill James and Bryan Morgan, “DevelopingJava Servlets”, 2nd Edition, Techmedia, 2001MA-101 APPLIED MATHEMATICS–IL T P Cr5 1 0 4OBJECTIVETo acquaint the students with the various concepts andtools of applied mathematics which will be very basic andthe very soul and guide of various engineering subjects.1. MATRICES & ITS APPLICATIONS: Rank of amatrix; elementary transformations; elementarymatrices; inverse using elementarytransformations; normal form of a matrix; lineardependence and independence of vectors;consistency of linear system of equations; linearand orthogonal transformations; Eigen values andEigen vectors; properties of Eigen values; Cayley -Hamilton theorem and its applications.2. INFINITE SERIES: Convergence and divergence;comparison; D' Alembert's ratio; Integral; Raobes;De Morgan’s & Bertrand’s; logarithmic and Cauchyroot tests; alternating series; absolute andconditional convergence.3. APPLICATIONS OF DIFFERENTIATION: Taylor'sand Maclaurin's series; asymptotes; curvature.4. PARTIAL DIFFERENTIATION: Functions of two ormore variables; partial derivatives; total differentialand differentiability; derivatives of composite andimplicit functions; Jacobian’s; higher order partialderivatives.5. APPLICATION OF PARTIAL DIFFERENTIATION:Homogeneous functions; Euler's theorem; Taylor'sseries for functions of two variables (without proof);maxima-minima of function of two variables;Lagrange's method of undetermined multipliers;differentiation under integral sign.6. FOURIER SERIES: Euler’s formula; conditions fora Fourier expansion; change of interval; Fourierexpansion of odd and even function; Fourierexpansion of square wave; rectangular wave; sawtoothedwave; half and full rectified wave functions;half range sine and cosine series.7. ORDINARY DIFFERENTIAL EQUATIONS & ITSAPPLICATIONS: Exact differential equations;equations reducible to exact differential equations;applications of differential equations of first orderand first degree to simple electric circuits;Newton's law of cooling; heat flow and orthogonaltrajectories.TEXT BOOKKreyszig F., "Advanced Engineering Mathematics", 9thEdition, John Wiley, 2006REFERENCE BOOKS1. Jeffery, “Engineering Mathematics”, AcademicPress/Elsevier.2. Sastry, S. S., “Engineering Mathematics Part-I”,2nd Edition, Prentice Hall of India3. Jain, R. K. and Iyengar, S. R. K., “AdvancedEngineering Mathematics” 3rd Edition, NarosaPublishing House4. Greenberg, D., Michael., “Advanced Engg.Mathematics”, 2nd Edition, Dorling Kindersley IndiaPvt. Ltd.MA-102APPLIEDL T P CrMATHEMATICS-II 5 1 0 4OBJECTIVETo acquaint the students with the various concepts andtools of applied mathematics which will be very basic andthe very soul and guide of various engineering subjects.1. DIFFERENTIAL EQUATIONS OF HIGHERORDER AND ITS APPLICATION: Lineardifferential equations of second and higher order;complete solution; complementary function andparticular integral; method of variation ofparameters to find differential particular integral;Cauchy's and Legendre's linear equations;simultaneous linear equations with constantcoefficients; applications of linear differentialequations to simple pendulum; oscillatory electriccircuits.2. LAPLACE TRANSFORMS AND ITSAPPLICATIONS: Laplace transforms ofelementary functions; properties of Laplacetransforms; existence conditions; transforms ofderivatives; transforms of integrals; multiplicationby t; division by t.3. EVALUATION OF INTEGRALS BY LAPLACETRANSFORMS: Laplace transform of unit stepfunction; unit impulse function and periodicfunction; Inverse transforms; convolution theorem;application to linear differential equations andsimultaneous linear differential equations withconstant coefficients.4. FOURIER TRANSFORMS: Fourier integraltransforms; shifting theorem (both on time andfrequency axes); Fourier transforms of derivatives;67

B.Tech. Computer Science & Engineering (Regular)Fourier transforms of integrals; convolutiontheorem; Fourier transform of Dirac-delta function.5. CURVE TRACING: Applications of singleintegration to find volume of solids and surfacearea of solids of revolution; double integral; changeof order of integration; double integral in polarcoordinates.6. APPLICATIONS OF MULTIPLE INTEGRALS:Applications of double integral to find areaenclosed by plane curves and volume of solids ofrevolution; triple integral; volume of solids; changeof variables; beta and gamma functions andrelationship between them.7. VECTOR CALCULUS: Differentiation of vectors;scalar and vector point functions; gradient of ascalar field and directional derivative; divergenceand curl of a vector field and their physicalinterpretations; integration of vectors; line integral;surface integral; volume integral; Green’s, Stoke'sand Gauss’ theorems (without proof) and theirsimple applications.TEXT BOOKKreyszig F., "Advanced Engineering Mathematics", 9thEdition, John Wiley, 2006REFERENCE BOOKS1. Ross, S. L., “Differential Equation”, Wiley IndiaPublishers2. Piaggio, H. T. H., “Differential Equations”, 1stEdition, CBS Publishers and Distributors,3. Jain, R. K. and Iyengar, S. R. K. “AdvancedEngineering Mathematics”, 3rd Edition, NarosaPublishing House4. Greenberg, D., Michael “Advanced Engg.Mathematics”, 2nd Edition, Dorling Kindersley IndiaPvt. Ltd.MA-201APPLIEDL T P CrMATHEMATICS – III 5 1 0 4OBJECTIVETo acquaint the students with the various concepts andtools of applied mathematics which will be very basic andthe very soul and guide of various engineering subjects.PRE-REQUISITESKnowledge of mathematical operations such asintegration, differentiation1. PARTIAL DIFFERENTIAL EQUATIONS:Formation of partial differential equations;Lagrange’s linear partial differential equations; firstorder non-linear partial differential equation;Charpit’s method; method of separation ofvariables and its applications to wave equation andone dimensional heat equation, two dimensionalheat flow, steady state solutions only.2. SPECIAL FUNCTIONS: Special functions,Bessel’s equation and Legendre’s equation and itsrecurrence formulae.3. TESTING OF HYPOTHESIS: Testing ofhypothesis; tests of significance for largeformulation; Student’s t-distribution (applicationonly); Chi-Square test of goodness of fit.4. LIMIT AND CONTINUITY: Limit and continuity of acomplex function, differentiability and analyticity;Cauchy-Riemann equations, necessary andsufficient conditions for a function to be analytic;polar form of Cauchy-Riemann equations;harmonic functions; application to flow problems.5. COMPLEX FUNCTIONS: Integration of complexfunction; Cauchy-Integral theorem and formula;power series; radius and circle of convergence;Taylor’s, Maclaurin’s and Laurent’s series; zerosand singularities of complex functions.6. RESIDUE THEOREM: Residue theorem,evaluation of real integrals using residues (aroundunit and semi circle only); bilinear transformationand conformal mapping.7. LINEAR PROGRAMMING: Formulation of linearprogramming problems; solving linearprogramming problems using (i) graphical method(ii) simplex method (iii) dual simplex method.TEXT BOOKKreyszig F., "Advanced Engineering Mathematics", 9thEdition, John Wiley, 2006REFERENCE BOOKS1. Grewal B. S., “Higher Engineering Mathematics”,38th Edition, Khanna Publisher, 20052. Sastry S. S., “Engineering Mathematics Part-I”,2nd Edition, Prentice Hall of India3. Jain R. K. and Iyengar S. R. K., “AdvancedEngineering Mathematics”, 3rd Edition, NarosaPublishing House4. Greenberg Michael D., “Advanced Engg.Mathematics”, 2nd Edition, Dorling Kindersley IndiaPvt. Ltd.MA-202APPLIED NUMERICAL L T P CrMETHODS 5 1 0 4OBJECTIVETo provide a foundation for numerical computing forscientific and engineering applicationsPRE-REQUISITEKnowledge of Basic Mathematics involving differentiation,integration, differential equations, linear equations, etc.1. ERRORS IN NUMERICAL CALCULATIONS:Introduction; numbers and their accuracy;absolute; relative and percentage errors and theiranalysis; truncation errors; general formula; errorcalculation for inverse problem.2. SOLUTION OF NON-LINEAR EQUATIONS:Bisection method; Regula-Falsi method; Secantmethod; Newton-Raphson method; fixed pointmethod; initial approximation and convergencecriteria.3. SOLUTION OF LINEAR SYSTEMS: Gausselimination method; Gauss-Jorden method; UVfactorization, Jacobi’s method; Gauss-Seidalmethod.4. INTERPOLATION & CURVE FITTING:Introduction to interpolation; Newton’s forward andbackward formula; Sterling formula; Lagrangianpolynomials; divided differences; least squaresmethod.68

Lingaya’s University, Faridabad5. NUMERICAL DIFFERENTIATION ANDINTEGRATION: Derivatives from differences tables;numerical differentiation formulas, Newton-Cotesintegration formulae; trapezodial rule; Simpson’s rule;Bool’s rule; Weddle’s rule; Romberg’s rule.6. SOLUTION OF DIFFERENTIAL EQUATIONS:Taylor’s series method; Euler and modified Euler’smethod; Runge-Kutta method; Milne’s predictioncorrector method, Adams–Bashforth method.7. SOLUTION OF PARTIAL DIFFERENTIALEQUATIONS: Finite difference approximation;solution of Laplace equation (standard 5 pointformula) one-dimensional heat equation (Schmidtmethod, Cranck-Nicolson method; Dufort & Frankelmethod and wave equation.TEXT BOOKGrewal B. S., “Numerical Methods in Engineering andSciences”, Khanna PublisherREFERENCE BOOKS1. Curtis F, Gerald and Patrick, “Applied NumericalAnalysis”, 7th Edition, Addison Wesley2. Balagurusamy E., “Numerical Methods”, TataMcGraw Hill3. Sastry S. S., “Introductory Methods of NumericalAnalysis”, Prentice Hall of India4. Jain M. K., Iyenger S. R. K. and Jain R. K.“Numerical Methods for Scientific and Engg.Computations”, Wiley Eastern5. Rao S. S., “The Finite Element Method in Engg.”,2nd Edition, Pregamon Press/McGraw Hill, 1989MA-252APPLIED NUMERICAL L T P CrMETHODS LAB 0 0 2 1LIST OF EXPERIMENTS1. To find the roots of non-linear equation usingBisection method.2. To find the roots of non-linear equation usingSecant method.3. To find the roots of non-linear equation usingNewton’s method.4. To solve the system of linear equations usingGauss-Elimination method.5. To solve the system of linear equation usingGauss-Seidal iteration method.6. To find the values of function at a particular pointusing Newton’s forward formula.7. To find the values of function at a particular pointusing Newton’s backward formula.8. To find the values of function at a particular pointusing Lagrange’s interpolation formula.9. To integrate numerically using Trapezoidal rule.10. To integrate numerically using Simpson’s rule.11. To find the solution of o.d.e (ordinary differentialequation) by Euler’s method.12. To find the solution of o.d.e by Runge-Kuttamethod.13. To find the numerical solution of Laplace equation.14. To find the numerical solution of heat equation.15. To find the numerical solution of wave equation.REFERENCE BOOKS1. Curtis F, Gerald and Patrick, “Applied NumericalAnalysis”, 7th Edition, Addison Wesley2. Balagurusamy E., “Numerical Methods”, TataMcGraw Hill3. Sastry S. S., “Introductory Methods of NumericalAnalysis”, Prentice Hall of India4. Jain M. K., Iyenger S. R. K. and Jain R. K.“Numerical Methods for Scientific and Engg.Computations”, Wiley EasternME-101ENGINEERING MECHANICSL T P Cr5 1 0 4OBJECTIVEEngineering Mechanics is one of the core subjects thatintroduces the student to analysis of forces and motionand prepares the student for studying strength ofmaterials and theory of machines.1 FORCE SYSTEMS: Basic concepts of space,time, mass, force, particle and rigid body; scalarsand vectors; conventions for equations anddiagrams; external and internal effects of a force;principle of transmissibility; force classification;rectangular components of two and threedimensional force systems; resultant of two andthree dimensional and concurrent force systems;moment about a point and about an axis;Varignon’s theorem; resultant of non-concurrentforce systems; couple; equivalent couples; forcecouple systems.2 EQUILIBRIUM: Equilibrium in two and threedimensions; system isolation and the free-bodydiagram;modeling the action of forces; equilibriumconditions; applications including plane trusses;frames and machines.3 PROPERTIES OF SURFACES/CROSSSECTIONS: Centre of mass; determining thecentre of gravity; centre of mass versus centre ofgravity; centroids of lines, areas and volumesincluding composite sections; moments of inertia;MI of plane figures; MI with respect to axis in itsplane and with respect to an axis perpendicular tothe plane of figure; parallel axis theorem; momentof inertia of a rigid body – of a lamina and of threedimensional body; MI of composite figures.4 SIMPLE STRESSES AND STRAINS: Resistanceto deformation; Hook’s law and stress-straindiagram; types of stresses; stresses and strains inbars of varying sections; stresses in compositebars; lateral strain and Poisson’s ratio; volumetricstrain, modulus of rigidity and bulk modulus;relation between elastic constants.5. TORSION OF CIRCULAR SHAFTS, TORSIONFORMULA POWER TRANSMISSION6. SHEAR FORCE AND BENDING MOMENTS:Definitions: SF and BM diagrams forcantilevers, simply supported beams with orwithout overhang and calculation of max. BMand SF and point of contra-flexture under i)concentrated loads, ii) uniformly distributedloads over whole span or part of it iii)combination of concentrated and uniformlydistributed loads, iv) uniformly varying loads andapplication of moments; relationship between69

B.Tech. Computer Science & Engineering (Regular)rate of loading, shear force and bendingmoments.7. KINEMATICS / KINETICS OF PARTICLES:Velocity and acceleration under rectilinear andcircular motion; Newton’s Second Law; D’Alembertprinciple; Inertial system; Newton’s Second Lawapplied to bodies under rectilinear and circularmotion; solutions of problems using D’AlembertPrinciple and free-body diagrams.TEXT BOOKMeriam, J. L. “Engineering Mechanics”, John Wiley &Sons.REFERENCE BOOKS1. Beer, F.P. and Johnston, E.R. “Mechanics ofMaterials”, Tata McGraw Hill2. Shames, I.H. “Engineering Mechanics”, 4thEdition, Pearson Education, 20033. Pytel, A and Kiusalaas, J. Thomsom, “Mechanicsof Materials”, Brooks & Cole, 2003WEB REFERENCESwww.eCourses.ou.eduENGINEERING L T P CrME-151MECHANICS LAB 0 0 2 1LIST OF EXPERIMENTS1. To study various forces and moments.2. Prove polygon law of coplanar forces, experimentswith pulley systems.3. Find support reactions for simply supported beam4. Find Forces in Truss elements5. Measuring forces in members of jib crane.6. Finding C.G. and MOI of various parts likeconnecting rod. Flywheel using various methods7. To find mechanical advantage and mechanicalefficiency of compound screw jack.8. To study various simple machines including geartrains e.g. Wedge; clock; sewing machine, etc.9. To conduct tensile test and determining ultimatetensile strength percentage elongation of steelspecimen10. To conduct compression test and determinecompressive strength of specimen11. To calculate VR, MA and efficiency of single,doubles and triple start worm and worm wheel12. To study slider crank mechanism of 2 stroke and 4stroke IC engine models13. To study and analyze gear trainsNote: At least ten experiments are to be performed bythe students.ME-152WORKSHOP PRACTICEL T P Cr0 0 4 2OBJECTIVETo provide an overview of the basic productiontechniques and allied / supporting techniques used toproduce finished products from raw materials. In additionto theory, students will be given practical training onvarious basic production techniques. After going throughthis course, the students will be in a position tounderstand the working of a mechanical workshop.1. INTRODUCTION: Basic manufacturing processesand safety in workshop.2. ENGINEERING MATERIALS: Classification ofmaterials–their general mechanical properties andtheir selection3. CASTING PROCESSES: Sand casting process;pattern making; types of moulding sands, cores,mould making, melting and pouring of metal;Casting defects.4. MACHINING PROCESSES: Production ofcomponents involving turning; facing; taper turning;milling; shaping; planning and drilling operations.5. METAL FORMING PROCESSES: Sheet metalforming operations; shearing, bending, punchingand blanking, forging processes as upsetting,drawing down, bending etc.6. JOINING PROCESSES: Metal arc welding; gaswelding; resistance welding; soldering andmechanical fastening processes.7. FITTING AND MAINTENANCE: Study of fittingtools, marking tools and measuring instrumentslike micrometer, vernier calipers and height gauge;introduction to some basic maintenancetechniques/processes.TEXT BOOKRaghuwanshi, B.S., “A course in WorkshopTechnology, Vol. I & II”, Dhanpatrai & Co.REFERENCE BOOKHazra & Chaudhary, “Workshop Technology Vol. I & II”,Asian Book Co.NOTES1. In all sections of workshop, students will studyabout the tools used, different operationsperformed and main parts of the machine2. Term final evaluation will be done on the basis ofdoing a practical job and viva-voce. There will beno theory paper on this subject.JOBS TO BE DONEA. Machine Shop1. To prepare a job on a lathe involving facing,turning, taper turning, step turning, radiusmaking and parting off.2. To prepare horizontal surface/ vertical surface/ curved surface/ slot or v-grooves on ashaper / planer.3. To prepare a job involving side and facemilling on a milling machine.4. To prepare a job involving drilling and tappingof holes.B. Sheet Metal Work1. To draw layout, do marking and prepare arectangular tray of sheet metal.2. To draw layout, do marking and prepare afunnel of sheet metal.C. Foundry1. To prepare a single piece pattern mould, putmetal in the mould and fettle the casting.2. To prepare a split piece pattern mould.D. Welding1. To prepare joints (Lap and butt) by metal arcwelding2. To prepare welded joint by resistance weldingE. Fitting and Maintenance Jobs70

Lingaya’s University, Faridabad1. Fitting jobs involving, chipping, filing, markingand measuring with precision instruments.2. Maintenance and repair of common domesticappliances such as desert cooler, LPG stove,room heater, water tap, flush system, electriciron, scooter etc.ME-153 ENGINEERING GRAPHICSL T P Cr0 0 6 3OBJECTIVEEngineering graphics is the primary medium fordevelopment and communicating design concepts.Through this course the students are trained inengineering Graphics concepts through manualdrafting. The ISI code of practice is followed. With thiscourse students can improve the visual concepts in allengineering streams.1. INTRODUCTION: Need drawing instruments;geometrical drawing, conventional representation–indicating welds, Joints, surface texture, structuralwork etc.; various types of projections; first andthird angle systems of orthographic projections.2. SIMPLE PROJECTS: Projection of points indifferent quadrants; projections of, lines parallelto or inclined to one or both reference planes,true length of a line and its inclination withreference planes; traces of a line; concept ofauxiliary plane.3. PROJECTIONS OF PLANES: Parallel to onereference plane; inclined to one plane butperpendicular to the other, inclined to bothreference planes.4. PROJECTIONS OF SOLIDS AND SOLIDS OFREVOLUTION: In simple positions with axisperpendicular to a plane; with axis parallel to bothplanes; with axis parallel to one plane and inclinedto the other.5. SECTIONS OF SOLIDS: Prisms; pyramids;cylinders and cones; section plane is parallel,perpendicular and inclined to both referenceplanes; true shape of sections.6. DEVELOPMENT OF LATERAL SURFACES OFREGULAR SOLIDS: Rectangular block; cylinder;cone; pyramid.7. ISOMETRIC VIEWS OF PLANES: circle, square,rectangle; Isometric views of solids- prisms,pyramids and cylinders; principle of perspectiveprojection, perspective of planes and solids.TEXT BOOKBhatt, N.D., and Panchal, V.M., “Engineering DrawingPlane and Solid Geometry”, Forty-Fourth Edition,Charotar Publishing House, 2002.REFERENCE BOOKS1. Gill, P. S., “Engineering Graphics and Drafting”,Millennium Edition, S. K. Kataria and Sons2. Mathur, S.B., “A Text Book of EngineeringDrawing”, Second Revised and Enlarged Edition,Vikas Publishing House, 2000.3. SP 46-1988, Bureau of Indian Standards (BIS),New DelhiWEB REFERENCES1. www.technologystudent.com2. www.animatedworksheets.co.uk3. www.ider.herts.ac.uk/school/coursewareLIST OF SHEETS TO BE MADE:Sl.Details of the sheetNo.Basic Geometrical Constructionsincluding the curves, ellipse,1.parabola, Hyperbola, and cycloidalcurves.Projection of Lines including2.No. ofsheetstraces.3. Projection of Planes. 14. Projection of Solids. 25. Section of solids. 26. Developments of surfaces 17. Isometric and Perspective views. 2Notes:The students will Practice/Draw at least one sheetfrom each Unit. The Examiner will set one questionfrom each unit and the student will attempt fourquestions in all.L T P CrPH-101PHYSICS5 1 0 4OBJECTIVETo educate the students with the present day physicalsciences through concepts like optics, acoustics, EMtheory, etc.1. INTERFERENCE: Interference by division of wavefront; Fresnel's biprism and its application to findwavelength; interference by division of amplitude;Newton's rings and its applications; determinationof wavelength and refractive index of liquids;Michelson interferometer and its applications;determination of wavelength; resolution of spectrallines (difference in wavelength); determination ofrefractive index of thin sheet.2. DIFFRACTION: Difference between Interferenceand diffraction; difference between Fraunhofer andFresnel diffraction; Fraunhofer diffraction throughsingle slit; variation of intensity (analytical); planetransmission diffraction grating; absent spectra;maximum order spectra; dispersive and resolvingpower of grating.3. POLARIZATION: Polarised and unpolarized light;double refraction; Nicol prism; quarter and halfwave plates; optical activity; Dextro and Leavorotatory; specific rotation; biquartz and Laurent'shalf-shade polarimeters.4. LASER AND FIBRE OPTICS: Spontaneous andstimulated emissions; laser action (pumping andpopulation inversion); characteristics of laserbeam-concepts of coherence; solid state (Ruby)laser; gas (He-Ne) laser; applications; basicprinciples; fiber construction; propagation of light infibers; numerical aperture; single mode and multimode fibers; applications of optical fibers.5. SPECIAL THEORY OF RELATIVITY: Inertialframes of reference; Galilean transformations; noninertialframes of reference; Michelson-Morleyexperiment; postulates of special theory ofrelativity; Lorentz’s transformations; length1271

B.Tech. Computer Science & Engineering (Regular)contraction; time dilation; variation of mass withvelocity; mass energy equivalence.6. ELECTRO MAGNETIC THEORY andELECTROSTATICS : Review of basic concepts ofelectrodynamics; Maxwell’s modification ofAmpere’s law, equation of continuity; Maxwell'sequations and its simple plane wave solution infree space; Poynting’s theorem; dielectricpolarization; electric displacement; susceptibilityand permittivity and various relations betweenthese; Gauss law in dielectrics; electrostatic energystored in dielectrics; behaviour of dielectrics in A.C.field: simple concepts; dielectric losses.7. ULTRASONICS: Production of ultrasonics bymagnetostriction and piezoelectric oscillatormethods; detection of ultrasonics by Kundt’s tubeand acoustic grating method.TEXT BOOKAvadhunulu and Kshirsagar, “A Text Book ofEngineering Physics”, S. Chand & Co.REFERENCE BOOKS1. Sears, F.W., “Electricity and Magnetism”, Narosa2. Arthur Beiser, “Perspectives of Modern Physics”,Tata McGraw Hill3. Vasudeva, A.S., “Modern Engineering Physics”, S.Chand & Co.4. Resnick and Halliday, “Physics Vol. I-II”, WileyEastern5. Brij Lal and Subramanyam, “A Text Book of Optics”S. Chand & Co.6. Brij Lal and Subramanyam, “A Text Book ofSound” S. Chand & Co.7. Wehr, Richards and Adair, “Physics of the Atom”,NarosaPH-102APPLIED PHYSICSL T P Cr5 1 0 4OBJECTIVETo educate the students with the present day physicalsciences through concepts like nanotechnology, quantumphysics, thermal physics, super conductivity, etc.1. CRYSTAL STRUCTURE: Space lattice; unit celland translation vector; Miller indices; simple crystalstructure(sc; bcc; fcc; hcp); principle of X- raydiffraction; Bragg’s law; experimental X-raydiffraction methods: Laue method and Powdermethod; point defects in solids; concentration ofFrenkel defects and Schottky defects.2. QUANTUM PHYSICS: Failure of classicalconcepts; black body radiation; Planck’s radiationlaw; wave packets; group velocity and phasevelocity; Schrödinger wave equations: timedependant and time independent equations;significance of wave function; wave function for aparticle in a box.3. FREE ELECTRON THEORY: Elements ofclassical free electron theory and its limitations;Drude’s theory of conduction; quantum theory offree electrons; Fermi level; Density of states (3D);⎛ 3 ⎞⎜ = EF ⎟average kinetic energy ⎝ 5 ⎠ of free electrons(3D); Fermi-Dirac distribution function; thermionicemission; Richardson’s equation.4. BAND THEORY and NANO TECHNOLOGY:Origin of energy bands; classification of solids intometals; semiconductors and insulators; KronigPenney model (Qualitative); E-K diagrams;Brillouin zones; concept of effective mass andholes; hall effect and its application,nanotechnology (basic concept only) and itsapplication.5. THERMAL PHYSICS: Gas law; iso-thermal andisentropic process; Rankin cycle; Carnet cycle;principal of equipartition of energy; specific heat ofmonoatomic gases; Maxwell’s velocity distribution;mean velocity; RMS velocity; most probable speed;Joule Thomson’s expansion; liquification of He Iand He II Stefan Boltzmann’s law; Newton’s law ofcooling.6. MAGNETIC PROPERTIES OF SOLIDS: Atomicmagnetic moments; orbital diamagnetism; classicalLangevin’s theory of dia–magnetism and paramagnetism;ferro-magnetic domains;antiferromagnetism; ferrimagnetism (simple ideas).7. SUPERCONDUCTIVITY: Introduction(experimental survey); Meissner effect; Type I andType II superconductor; London equation.TEXT BOOKAvadhunulu and Kshirsagar, “A Text Book ofEngineering Physics”, S. Chand & Co.REFERENCE BOOKS1. Kittel, Charles “Introduction to Solid State Physics”,John Wiley Powell and Crasemann, “QuantumMechanics”, Oxford and IBH2. Aggarwal, R.S., “Thermal Physics and StatisticalPhysics”, MTG Books.3. Saxena, B.S., and Gupta, R.C., “Fundamentals ofSolid State Physics”, Pragati Prakashan.4. Pillai, “Solid State Physics”, New Age5. Ghatak and Loknathan, “Quantum Mechanics”,McMillan6. Beiser, Arthur, “Modern Physics”, Tata McGrawHill.PH-151PHYSICS LABL T P Cr0 0 2 1LIST OF EXPERIMENTSThe experiments in 1 st term will be based mainly uponoptics, electrostatics, wave and oscillations which arethe parts of the theory syllabus of 1 st term.1. To find the wavelength of sodium light by Newton’srings experiment.2. To find the wavelength of sodium light by Fresnel’sbiprism experiment.3. To find the wavelength of various colours of whitelight with the help of a plane transmissiondiffraction grating.4. To find the refractive index and Cauchy’s constantsof a prism by using spectrometer.72

Lingaya’s University, Faridabad5. To find the wavelength of sodium light byMichelson interferometer.6. To find the resolving power of a telescope.7. To find the pitch of a screw using He-Ne laser.8. To find the specific rotation of sugar solution byusing a polarimeter.9. To compare the capacitances of two capacitors byDe’Sauty bridge and hence to find the dielectricconstant of a medium.10. To find the flashing and quenching potentials ofArgon and also to find the capacitance of unknowncapacitor.11. To study the photoconducting cell and hence toverify the inverse square law.12. To find the temperature co-efficient of resistanceby using platinum resistance thermometer andCallender and Griffith bridge.13. To find the frequency of A.C. mains by usingsonometer.14. To find the velocity of ultrasonic waves in nonconductingmedium by piezo-electric method.REFERENCE BOOKS1. Worshnop, B. L. and Flint, H. T. “AdvancedPractical Physics”, KPH2. Gupta, S. L. & Kumar, V. “Practical Physics”,Pragati Prakashan3. Chauhan & Singh, “Advanced Practical Physics Vol.I & II”, Pragati Prakashan.PH-152APPLIED PHYSICS LABL T P Cr0 0 2 1LIST OF EXPERIMENTS1. To find the low resistance by Carey – Foster’sbridge.2. To find the resistance of a galvanometer byThomson’s constant deflection method using apost office box.3. To find the value of high resistances bySubstitution method.4. To find the value of high resistances by Leakagemethod.5. To study the characteristics of a solar cell and tofind the fill factor.6. To find the value of e/m for electrons by Helicalmethod.7. To find the ionization potential of Argon/Mercuryusing a thyratron tube .8. To study the variation of magnetic field withdistance and to find the radius of coil by Stewartand Gee’s apparatus.9. To study the characteristics of (Cu-Fe, Cu-Constantan) thermo couple.10. To find the value of Planck’s constant by using aphoto electric cell.11. To find the value of co-efficient of self-inductanceby using a Raleigh bridge.12. To find the value of Hall co-efficient of semiconductor.13. To study the V-I characteristics of a p-n diode.14. To find the band gap of intrinsic semi-conductorusing four probe method.15. To calculate the hysteresis loss by tracing a B-Hcurve.Note: At least ten experiments are to be performed bythe students.[REFERENCE BOOKS1. Worshnop, B.L. and Flint, H.T. “AdvancedPractical Physics”, KPH2. Gupta, S.L. and Kumar, V. “Practical Physics”,Pragati Prakashan.3. Chauhan and Singh, “Advanced Practical PhysicsVol. I & II”, Pragati Prakashan.* * * * * *73

B.Tech. Computer Science & Engineering (Regular)ADDITIONAL/BRIDGE COURSESOBJECTIVEA student found deficient in any area of knowledge/skill needed for programmes of study e.g. Communication Skill,Mathematics, etc. may be required to do suitable additional course(s) on audit basis which will not be shown on hisGrade Card. However if a bridge course(s) is (are) required for those students admitted to second year the samewill be shown on the Grade Card as an audit course.Note: These Courses are made for a specific purpose and are available only for the intended purpose.EN-291ESSENTIALS OFCOMMUNICATIONOBJECTIVE(BRIDGE COURSE)L T PCr5 0 0 3OBJECTIVEThe objective of bridge course is to bring some of thestudents who are not up to the mark and are not able topursue the technical education like their counter parts.This course has been devised to bring the students tothat level from where they can do justice to thetechnical education they are going to pursue.1. Advertisements; notices; formal and integralinvitations.2. Report writing; or factual description based onverbal input provided.3. Letter writing: business letter; enquires; registeringcomplaints; asking and giving information; placingorders and sending replies; letter to editor.4. Parts of speech: noun; pronoun; verb; adverb;adjective; proposition; conjunction; exclamationand general English grammar.5. Verb patterns and sentences structure and tense.6. Foreign words; one word substitutions and wordformation.7. Group discussion and debate on various currentaffairs.TEXT BOOKWren & Martin, “A High School Grammar &Composition”REFERENCE BOOKS1. Wood F. T., “Remedial English Grammar forForeign Students”, The Macmillan Press Ltd., 19752. Tikku M. C., “An Intermediate Grammar Book”3. “English for Engineers and Technologists: A SkillApproach”, Vol. 2, Orient Longman4. Ramesh M. S. and Pattanshetti C. C., “BusinessCommunication”, R.Chand and Company, Delhi5. “Group Discussion”, Sudha Publications/RameshPublishing House, New Delhi.1. BASIS OF CURVES: Important equations fordifferent types of curves in plane includingCartesian, Parametric forms; Concept of polarcoordinates and important curves in polarcoordinates.2. SEQUENCE AND SERIES: Sequences, A.P, G.P.,n n n2 3H.P; Special sequences∑n,∑ n , ∑ nn=1 n=1 n=1 ;Expansions of important functions.3. DIFFERENTIAL CALCULUS: Definition ofderivatives and concepts of partial derivatives,Differentiation of parametric curves up to secondorder; Successive differentiation including Leibnitizrule; analytical and geometrical significance ofdifferentiation.4. INTEGRAL CALCULUS: Formulae of indefiniteintegrals; Properties of definite integrals; Integrationby parts and continued integration by parts.5. THREE DIMENSIONAL GEOMETRY:Dimensional coordinates and important equation ofplanes and surfaces (including sphere, cone,cylinder and ellipsoid); cylindrical and sphericalcoordinates in three dimensions.6. VECTORS: Representation of vectors in two andthree dimensions; operations on vectors includingdot and cross product of three vectors and fourvectors.7. PROBABILITY THEORY: Permutation;Combination; Binomial theorem.TEXT BOOKNCERT, “Mathematics for XI and XII”, NCERT, NewDelhiREFERENCE BOOKS1. Sharma R. D., “Text Book of Mathematics forClass XI”, 10th Edition, Dhanpat Rai & Sons2. Sharma R. D., “Text Book of Mathematics forClass XII”, 10th Edition, Dhanpat Rai & Sons3. Grewal B. S., “Higher Engineering Mathematics”,38th Edition, Khanna Publisher, 2005MA-191MATHEMATICS L T P Cr(MAKEUP COURSE) 5 0 0 3MA-291MATHEMATICS L T P Cr(BRIDGE COURSE) 5 0 0 3OBJECTIVEMathematics is a very essential part of all engineeringcourses. The students entering in the first year who aresome how weak in concepts of Mathematics need upgradation in their level of Mathematics. This course isdesigned keeping in view such students.OBJECTIVEThe students, who join the University after diplomacourse, are deficient in mathematics. This course isdesigned to upgrade and update their knowledge inmathematics so that they are at par with second yearstudents.74

Lingaya’s University, Faridabad1. PARTIAL DIFFERENTIATION: Functions of two ormore variables; Partial derivatives; Total differentialand differentiability; Derivatives of composite andimplicit functions; Jacobians; Higher order partialderivatives; Homogeneous functions; Euler’stheorem.2. MULTIPLE INTEGRALS: Double integrals;Change of order of integrations; Double integrals inpolar co-ordinates; Applications of double integralto find area enclosed by plane curves and volumeof solids of revolution; triple integrals; Volume ofsolids; Change of variables.3. SPECIAL INTEGRALS: Differentiation underintegral sign; Beta and gamma functions andrelationship between them.4. LAPLACE TRANSFORMS: Laplace transformsand its elementary properties; Inverse transforms;Convolution theorem.5. FOURIER SERIES AND FOURIER TRANSFORMS:Euler’s formulae; Change of intervals; Fourier seriesof odd and even functions; Half range sine andcosines series; Fourier integrals; Fourier transforms;Elementary properties.6. DIFFERENTIAL EQUATIONS: Formations ofordinary differential equations; Solutions ofordinary linear differential equations includingsolutions by Laplace transform.7. PARTIAL DIFFERENTIAL EQUATIONS:Formations of partial differential equations;Solutions of linear and non-linear partial differentialequations.TEXT BOOKGrewal B. S., “Higher Engineering Mathematics”, 38thEdition, Khanna Publisher, 2005REFERENCE BOOKS1. Kreyszig F., "Advanced Engineering Mathematics",9th Edition, John Wiley, 20062. Jain R. K. and Iyengar S. R. K., “AdvancedEngineering Mathematics”, 3rd Edition, NarosaPublishing House3. Greenberg Michael D., “Advanced EngineeringMathematics”, 2nd Edition, Dorling Kindersley IndiaPvt. Ltd., New Delhi* * * * * *75

B.Tech. Computer Science & Engineering (Regular)PROFESSIONAL DEVELOPMENT COURSESOBJECTIVETo meet the corporate requirements bridge the gap between technological skills and soft skills, by improvingcommunication, behavioural, analytical skills, etc.METHODOLOGYTo enable students become competent professionals and good citizens with moral and ethical values, a set of 14courses of one credit each will be provided covering(i) Value Added Courses,(ii) Professional Development Courses, and(iii) Co-curricular Activities.PD-151BASICS OF COMPUTER L T P CrFUNDAMENTALS 0 0 2 1proof-carrying code, hardware protection, othertechnical attacks.OBJECTIVETo understand fundamentals of computer applications,networking and building projects.1. MS-WORD: Introduction to MS-Word: Menus,toolbars, ruler, scroll bars, creating, saving,importing, exporting and inserting files, formation,indents/out dents, lists, tabs, styles, working withframes, columns, pictures, chart/graphs, forms,tools, equations and macros.2. MS-EXCEL: Worksheet overview: rows, columns,cell, menus, creating worksheets; opening andsaving worksheet; formatting, printing, charts,window, establishing worksheet links, macros,database, tables, using files with other programs.3. MS-POWERPOINT: Overview of MS-PowerPoint,creating slides and presentations, rehearsingpresentation, insert, tools, format, slide-show,Window options.4. MS-PROJECT: Starting a Project, StartingMicrosoft Project 2000, planning a project, definingthe project scope, outlining and task relationships,outlining the project, developing the schedule,changing task relationships and constraints,adding and assigning resources, developing theproject calendar, assigning project resources,determining project costs, adjusting projectresources and timelines, analyzing the project,using different views and reports, displayingproject data, organizing project information, sortingand filtering project data, creating custom filters.5. NETWORKING: Basics of networking, study oftopology: LAN, WAN, MAN, Connecting devices:passive hub, repeater, active hub, bridges, twolayer switches, routers, three layer switches,gateway, network attack and defense: mostcommon attacks.6. TROUBLESHOOTING: Ping command, TRACERTor TRACEOUT, IP configuration, NETSTAT, NET,recovery commands DISKPART etc., setting uplocal security policies, installation of servers.7. FUNDAMENTALS OF CYBER LAW: Overview ofcomputer and web technology, access control:operating system access controls, group and roles,access control lists, Unix operating systemsecurity, Windows NT, capabilities, added featuresin Windows 2000, granularity, sandboxing andREFERENCE BOOKS:1. Habraken, “MS-Office 2000 8 in 1”, Prentice Hall2. Taxali R. K., “PC Software for Windows MadeSimple”, Tata McGraw3. Sandler, “Teach Yourself MS Office”, BPBPublications4. Bangia R., “Learning MS Office 2000”, KhannaBook Co5. Wang W. and Parker R. C., “MS Office 2000Windows for Dummies”, IDG Books India (P ) Ltd6. Peter Dyson, “Undertaking PC Tools”, Sybex /Tech Asian Edition Tech Publications.7. Bansal S. K., “Cyber Crime”8. Ahmand Tabrez, “Cyber law , E-commerce & M-Commerce”9. Carl Chatfield and Timothy Johnson, “MicrosoftOffice Project 2007 Step by Step”PD-191CO-CURRICULAR L T P CrACTIVITIES 1OBJECTIVETo help the students in their all round growth andacquire attributes like team spirit, organizational ability,leadership qualities, etc.OPERATIONThe students are to take part in Co-curricular activitiesoutside contact hours through clubs/ societies spreadover all the three terms of the year. They are requiredto register for this course in each term and theirperformance will be evaluated in last term of the year.PD-192PERSONALITY SKILLSL T P Cr0 0 2 1OBJECTIVETo equip the students with the understanding of humanbehavior, develop time management skills, andenhance personality.1. TRANSACTIONAL ANALYSIS: Winners andlosers; ego states; OK states; positive andnegative strokes; life scripts; exercises.2. CREATIVE THINKING: What is creativity; 6thinking hats; mental blocks; exercises.76

Lingaya’s University, Faridabad3. SELF DISCOVERY: Importance of knowingyourself; SWOT analysis; benefits; strengths andweaknesses; exercises.4. DEVELOPING POSITIVE ATTITUDE: Meaning;changing attitudes; power of positive thinking;overcoming negative attitude; exercises.5. TIME MANAGEMENT: Features, timemanagement matrix; tips for time management;effective scheduling; time wasters; time savers;exercises and time bound tasks.6. STRESS MANAGEMENT: What is stress; causes;positive and negative stress; effects; signs; tips toovercome stress; stress busters; exercises7. DECISION MAKING: Definition; models and types;skills and techniques; courses of action; stepsinvolved in decision making; individual decisionmaking and group decision making; exercisesREFERENCE BOOKS1. Muriel, James and Jongeward, Dorothy, “Born toWin”, Signet Publishers, 19782. Harris, Thomas Anthony, “I’m OK, You’re OK”,Galahad Books, 20043. Dr. Alex, K., “Soft Skills”, 2009, S. Chand, 20094. Adams Scott , “Positive Attitude”, Andrews McbeelPublishing, 20045. Newton Tim, “Managing Stress – Emotion andPower at Work”, Sage Publications Ltd., 19956. Koch Richard, “The 80/20 Principle :The Secret toSuccess by Achieving with Less”, BroadwayBusiness, 19997. Covey Stephen R., “The 7 Habits of HighlyEffective People”, Simon & Schuster UK, 2004NOTE: One trainer per lecture and two trainers perpractical session. Classroom with board/projector forPPT and video clips will be required.PD-193ENTREPRENEURIAL & L T P CrPROFESSIONAL SKILLS 0 0 2 1OBJECTIVETo empower the students with entrepreneurial skills,behaviour, grooming and effective interaction at thework place.1. GOAL SETTING: Types of goals; setting smartgoals; personal goal setting; business goal setting;goal setting techniques.2. ENTREPRENEURIAL SKILLS: Meaning;entrepreneurial competencies; advantages; risksinvolved, avenues and opportunities; support fromGovt.; basic and significant personality traits;venture project planning and entrepreneurshipcycles; planning the project; entrepreneurship indaily life; case studies in entrepreneurship;exercises.3. CORPORATE DRESSING: The corporate fit;corporate culture; dress codes; dressing forinterviews; clothing do’s and don’ts.4. CORPORATE GROOMING: Making a goodimpression at work; grooming check list;accessories, do’s and don’ts for men and women;hygiene and skin care; hands and feet; make upand hair accessories.5. ETIQUETTE & MANNERS: Social etiquette; diningetiquette; party and wedding etiquette; sensitivitytowards diverse cultures; respecting religions andtraditions.6. BUSINESS ETIQUETTE: Dealing with people atwork place (peers, subordinates and superiors);international business; etiquette at meetings andconferences.7. COMMUNICATION MEDIA ETIQUETTE:Telephone etiquette; email etiquette; mediaetiquette.REFERENCE BOOKS1. Miner, B. John, “The 4 Routes to EntrepreneurialSuccess”, Berrett-Koehler, 19962. Ellis, Keith, “The Magic Lamp”, Three RiversPress, 19983. Blair, Gary Ryan, “The Ten Commandments ofGoal Setting”, Goalsguy Learning Skills Inc., 20054. Gupta, Seema, “Correct Manners and Etiquette”,Pustak Mahal, 19925. Soundararaj, Francis, “Speaking and Writing forEffective Business Communication”, MacMillan, 1995NOTE: One trainer per lecture and two trainers perpractical session. Classroom with board/projector forPPT and video clips will be required.PD-251MATLABL T P Cr0 0 2 1OBJECTIVEMATLAB is a powerful language for technicalcomputing. It is widely used in universities and collegesfor courses in mathematics, science and especially inengineering. In industry the software is used inresearch, development and design. This course isintended for students who are using MATLAB for thefirst time and have little or no experience in computerprogramming.1. BASIC STRUCTURE and FEATURES OFMATLAB: Command window; figure window;editor window and help window; arithmeticoperations with scalars, order of precedence; usingMATLAB as a calculator; display formats;elementary math built-in functions; scalarvariables, assignment operator; predefinedvariables; useful commands for managingvariables; applications in problem solving.2. CREATING ARRAYS – one dimensional, twodimensional;array addressing; built-in functions forhandling arrays; mathematical operations withmatrices; strings and strings as variables;generation of random numbers; examples ofMATLAB applications.3. SCRIPT FILES: Creating and saving a script file,current directory; output commands.4. TWO – DIMENSIONAL PLOTS: Plot command;line specifiers plot of a given data; plot of afunction; plotting multiple graphs in the same plot.5. FUNCTIONS AND FUNCTION FILES: Creating afunction file; input and output arguments; functionbody; comment lines; saving a function files; usinga function file; programming in MATLAB.77

B.Tech. Computer Science & Engineering (Regular)TEXT BOOKGilat Amos, “MATLAB: An Introduction withApplications”, John Wiley & Sons, Inc (Wiley StudentEdition), 2008REFERENCE BOOKHerniter, E. Marc, “Programming in MATLAB”,Brooks/Cole, Thomson LearningPD-291Refer to PD-191 for details.PD-292CO-CURRICULAR L T P CrACTIVITIES 1EFFECTIVEL T P CrCOMMUNICATION 0 0 2 1OBJECTIVETo acquaint the students with the basics of effectivespoken and written English and enhance their reading,listening, and communication skills.1. COMMUNICATION: Importance; barriers andtypes of communication; methods to developeffective communication skills.2. GRAMMAR: Parts of speech; subject/verbagreement; tenses; error correction; businessidioms; Indianism in English; frequentlymispronounced words; exercises.3. SPOKEN ENGLISH: Vowel and consonantsounds; syllables and syllabic stress;conversational skills; extempore; JAM.4. READING & LISTENING SKILLS: Reading withcomprehension; story reading; passage reading;newspaper reading; listening and active listening;barriers to listening; effective listening and types oflistening; exercises.5. WRITING SKILLS: Importance of writing skills;how to develop writing skills; writing exercises i.e.,essay writing, reviews, reports, etc.6. NON VERBAL COMMUNICATION: History;kinesics; postures; gestures; functions; importanceand challenges of non verbal communication.7. BUSINESS COMMUNICATION: Business lettersand messages; business reports; presentationskills; do’s & don’ts; personal journal.REFERENCE BOOKS1. Wren and Martin, “High School Grammar”,Paperback, 20002. Condrill Jo, & Bough, Bennie, “101 Ways toImprove Your Communication Skills Instantly”, 4thEdition, Paperback, 20053. Rai S. M., Rai Urmila, “Communication Skills”,Students Edition, Himalaya, 2007.4. Connor J. D. O, “Better English Pronunciation”Cambridge. 2nd Edition, Paperback, CambridgeUniversity Press, 20085. Raina Arjun, ”Speak Easy Voice And AccentTraining Manual”, Paperback (Special IndiaEdition, Full Circle6. Guffey Mary Ellen, “Business Communication” 3rdEdition, South – Western College Publishing, 2000NOTE: One trainer per lecture and two trainers perpractical session. Classroom with board/projector forPPT and video clips will be required.PD-293INTRA & INTER-PERSONAL L T P CrSKILLS 0 0 2 1OBJECTIVETo acquaint the students with the understanding of selfdevelopment through good inter-personal skills foreffective social communication in order to succeed inmaintaining relationships in professional and socialenvironments. This module will also help at learninggroup discussions and interview skills to enableemployability and professional fit.1. SELF AWARNESS: Development of our selfimage; social comparison; significant others; selfesteem; self confidence.2. ASSERTIVENESS & CONFIDENCE:Assertiveness; being confident; strategies to makeassertive NO easier; dealing with emotions;difference between being aggressive and beingassertive.3. TEAM BUILDING & TEAM WORK: The teamconcept; elements of team work; stages of teamformation; effective team; essential building blocksof effective teams; team player’s style; team tasks;exercises.4. LEADERSHIP SKILLS: Leadership skills andstyles; motivating people; understanding abilities;delegating tasks; managing people; overcominghurdles; exercises.5. INTERVIEW SKILLS: Why an interview; the firststep to a successful interview; resumes that makean impact; the interview process; the interviewpreparation checklist; interviewing skills; puttingyour best foot forward; common interviewmistakes; one on one HR interviews (two for eachstudent).6. GROUP DISCUSSION SKILLS: Meaning of a GD;types; role of a moderator; do’s and don’ts; mockGDs on general, knowledge based and abstracttopics.7. THE ART OF CONVERSATION: Skills to strike aconversation; sustaining conversation;communicating across cultures; conflictmanagement.REFERENCE BOOKS1. Haddon, F. Peter, ”Mastering Personal andInterpersonal Skills”, Viva Books Pvt. Ltd., 20032. Schuller, Robert H., “Tough Times Never Last ButTough People Do”, Orient Paperbooks, 19883. Bolton, Robert, “People Skills”, Touchstone Books,19864. Jansaz, De Suzanne, ” Interpersonal Skills inOrganizations”, 3 rd Edition, McGraw Hill Education(Asia), 20095. Fontana, David, “Social Skills at Work”,Universities Press, 20006. Burns, James Mac Gregor, “Leadership”, HarperPerennial, 19827. Harris, Godfrey, ”Art of Conversation”, JaicoPublishing House, 20028. Ganguly, Anand, ”Group Discussions andInterviews”, Ramesh Publishing House, 200878

Lingaya’s University, FaridabadNotes: One trainer per lecture and two trainers perpractical session. Classroom with board/projector forPPT and video clips will be required.PD-353SYSTEM & NETWORK L T P CrADMINISTRATION LAB 0 0 2 1OBJECTIVEThe main objective behind this course is to learn thedetailed information about the system administrationservices, various network attacks and preventingattacks, application security, installation process,operating system security, network security, websecurity, etc.LIST OF EXPERIMENTS1. Installation of Win XP O.S.2. Installation of Win2000 Server.3. Management of FTP Server4. Management of IIS Server.5. Use of Utilities:(a)Ping (b) Tracert (c) Net Stat (d) IP Config (e)Route6. Setting up of Local Area Network.7. Management of User & Domain.8. Start & Stop services from User Window &Command prompt.9. Setting Up the local security policy10. Configuring DHCP.11. Setting up of a DNS Server.12. Configuration of Linux server.13. Management of TELNET Server.14. Scope of duties statement.15. Setting up of Router in Window 2003 server.REFERENCE BOOKJan Bergstra andMark Burges, “Handbook of Networkand System Administration”, Elsevier, 2007PD-391Refer to PD-191 for details.CO-CURRICULAR L T P CrACTIVITIES 1PD-392 PROBLEM SOLVING SKILLSL T P Cr0 0 2 1OBJECTIVETo train and enhance the students’ problem solvingskills, reasoning ability, quantitative ability, and readingcomprehension skills.1. LOGICAL REASONING: Logical deductions(Syllogism & Venn Diagrams); logical connectives.2. ANALYTICAL REASONING: Seatingarrangements; combinations; selections;comparisons; blood relations; directions, etc.3. NON-VERBAL REASONING (ALPHA-NUMERIC& VISUAL PUZZLES): To solve problems onnumbers, alphabet, symbols and visuals; problemtypes are series, analogies, odd man out, codingdecoding, and symbols & notations.4. BUSINESS MATHS: Number system; ratios;averages; time & work; time & distance;percentages; profit & loss; simple & compoundinterest.1. HIGHER MATHS: Algebra; Mensuration.6. DATA INTERPRETATION & SUFFICIENCY:Tables, Bar chart, line graph, pie charts; to enablestudent assess whether the given data is sufficientto solve a question; for both reasoning based andquant based problems.7. READING COMPREHENSION: To enable astudent comprehend short and long passages fromthe perspective of solving questions based on thepassage.REFERENCE BOOKS1. Aggarwal R. S., “Verbal & Non-Verbal Reasoning”,2008, S. Chand, 19942. Aggarwal R. S., “Quantitative Aptitude forCompetitive Examinations”, S. Chand, 20083. Gulati, SL, “Quantitative Ability”, Bookhive India, 20064. “GRE Barron’s”, 13 th Edition, Barron’s EducationalSeries, 20095. Devi Shakuntla, “Book of Numbers”, 19846. Summers George J., “The Great Book of Puzzles& Teasers”, Jaico Publishing House, 1989ADVANCED PROFESSIONAL L T P CrPD-393DEVELOPMENT 0 0 2 1OBJECTIVETo equip the students with the basics of law,accounting, corporate policies, and ethics; the generalawareness useful in leading a well informed life.1. LAW FOR THE LAYMAN: Indian JudiciarySystem; Intellectual Property Rights (IPR); labourlaws; employee rights; human rights; criminal laws,civil rights.2. BASICS OF ACCOUNTING: Credit-Debittransactions; balance sheet; ledgers; receipts &vouchers; P & L statement; exercises.3. MONEY MANAGEMENT: Types of taxes; how tomanage taxes; investment options; an overview ofstocks & shares; savings options; understandingimportant terms (depreciation, VAT, educationcess).4. CORPORATE RULES & POLICIES: The need;advantages; illustrations of certain rules & policiesfollowed by selected corporate; code of conduct.5. RIGHTS & DUTIES: An overview of the Indianconstitution; fundamental rights & duties; directiveprinciples of state policy; societal values;ideologies of some famous personalities.6. TECHNOLOGY, POLITICS & RELIGIONS ININDIA: various religions and their teachings;political developments in India; history of science &technology.7. HUMAN VALUES: Ethics at work place; humanvalues; morals & ethics; professional ethics; casestudies.REFERENCE BOOKS1. Anthony M.J, “Law for the Layman”, Hind PocketBooks, 200379

B.Tech. Computer Science & Engineering (Regular)2. Mathur Reeta, “Recent Trends in Indian Economy”,3 Vol set, Sublime Publication, 20033. Eisen J. Peter, “Accounting - The Easy Way”,Barron’s Educational Series, 20034. Kiyosaki Robert, and Lechter Sharon, “Rich Dad,Poor Dad”, Warner Books, 20015. Lakhotia R. N, “Income Tax Guide for theTaxpayer”, Vision Books, 2009NOTE: One trainer per lecture and two trainers perpractical session. Classroom with board/projector forPPT and video clips will be required.PD-453VISUAL PROGRAMMING L T P CrTECHNIQUES LAB 0 0 2 1OBJECTIVEThis course offers the modern programming languagesto create programs by manipulating programsgraphically rather than by specifying them textually. Itincludes VC++ to implement the various concepts ofobject orientation graphically and VB has been highlyoptimized to support rapid application development.LIST OF EXPERIMENTS1. Write a program to create calculator using C++.2. Write a program to show the usage of constructorand destructor using C++.3. Write a program to implement function overloadingand operator overloading using C++.4. Write a program to implement inheritance usingC++.5. Write a program to read the keystrokes.6. Write a program for the centering of the text.7. Write a program for caret.8. Write a program for mouse handling.9. Write a program for creating a menu.10. Write a program for creating a full menu.11. Write a program for creating a dialog box bycreating a new class.12. Write a program for creating a dialog box withoutcreating our own class.13. Write a program for check boxes in VC++derivedfrom a standard control.14. Write a program for radio buttons in VC++ derivedfrom a standard control.15. Write a program for List box in VC++ derived froma standard control.16. Write a program for combo box in VC++ derivedfrom a standard control.17. Write a program for slider in VC++ derived from astandard control.18. Create an application in VC++ that shows howmenu items can be grayed, disabled andappended at run time.19. Write a program in VB to implement a simplecalculator.20. Write a program in VB to create a notepad.21. Write a program for creating a web browser.22. Write a program for reaching the Internet withHTTP.23. Write a program for reaching the Internet withFTP.REFERENCE BOOKS1. Steven Holzner, “Visual C++ 6”, Sybex Inc,19982. Ivor Horton, “Beginning Visual C++ 6”, Wrox PressLtd., 19983. Deitel, “C++: How to Program and Get Started withVisual C++”, Prentice Hall, 2000PD-491Refer to PD-191 for details.CO-CURRICULAR L T P CrACTIVITIES 1* * * * * *80

OPEN ELECTIVE COURSESLingaya’s University, FaridabadOBJECTIVEThe idea of open elective is to expand the application horizon of the knowledge acquired beyond the boundaries ofone’s own disciplineMETHODOLOGYThe student may enroll for one course from the list provided in the Scheme of Studies & Syllabus. The course shallstrictly be from any other discipline. Selection of course from the same discipline of study is not allowed.AE-411TRANSPORT MANAGEMENTL T P Cr5 0 0 3OBJECTIVEThe course has been designed such that the studentcan own a fleet of buses; trucks etc and manage thesame; He also gets familiar with provisions of motorvehicle act and vehicle insurance.1. INTRODUCTION: Necessity for making acts andrules on motor vehicles; Procedure for enactmentand implementation of these acts by central andstate Govts; Formats of the acts; rules and titles;Definitions – articulated vehicle; axle weight;certificate of registration; driver; conductor; licence;contract carriage; stage carriage; dealer;educational institution bus; goods; goods carriage;gross vehicle weight; heavy goods vehicle; invalidcarriage; learners licence; HMV; LMV; motor cabsetc.2. DRIVING LICENCE: Necessity; age limit to obtainD.L. learners D.L permanent D.L grant;restrictions; renewal; endorsement; disqualification;suspension; fees; documents; educationalqualifications required for driving trucks; buses; oiltankers; missile carriers; driving on hills; Drivingschools:requirements; Effectiveness of differentDLs; Maintenance of state registers of D;L.conductors licence – necessity; grant; age limit;disqualifications; revocation; disqualification;uniforms.3. VEHICLE REGISTRATION: Necessity; area ofregistration; time given for registration; format anddocuments to be attached and fees; period ofregistration; renewal; suspension; Temporary andpermanent registration; vehicle fitness; refusal;NOC; registration for embassy vehicles; productionof vehicle at the time of registration; Migration ofvehicle from one state to other; Hire purchase;lease or hypothecation; transfer of registration onsale; removal of hypothecation clause; Transfer ofownership; Change of residence or place ofbusiness; death of owner; sale or purchase;Alteration in motor vehicle; age limit of vehicles;attachment of trailers; Maintenance of stateregisters of motor vehicles;4. PERMITS: Necessity; route allotments; stateGovts; powers; provisions for application ofpermits; Procedure of R;T;A to grant permits; limitsof issuance of permits and rules; documents to beattached; preferences while issuing permits; Typesof permits – Private service; all India goodscarriage; temporary; national; composite etc;Renewal; duration; cancellation; suspension ofpermits and transfer of permits; Rules forreplacement of vehicles; colour schemes; generalconditions attached; Validation of permits for use inoutside region; Issue of permits to state transportundertakings : restrictions5. CONSTRUCTION; EQUIPMENT;MAINTENANCE AND TRAFFIC REGULATION:General provisions; Central Govt; rules andprovisions regarding construction; maintenance ofvehicle; emissions and safety provisions; Control oftraffic: limits of speed; weight; length and height;power to restrict and erect traffic signs; design oftraffic signs and its colour scheme; Signals; drivingtest; Driving regulations; signaling devices;Definitions– Pass; ticket; removal of vehicleobstructing traffic; Safety measures for drivers andpillion riders; Precautions at unguarded railwaycrossings; Schemes for investigation of accidentsand wayside amenities; Traffic navigation; globalpositioning system.6. LOGISTICS: Definition of fleet; types of fleet-luxurycars; buses; trucks; cash vans; fire-fightingvehicles etc; Management; supervisory; trainingand staffing; Driver; conductor and Mechanicshiring: duties; Vehicle operations-productivity andcontrol; Fleet maintenance programs; tyremaintenance; productivity and control; Budgetactivity; Fleet management and data processing;Procurement and disposal; labour relations; energymanagement; Loss prevention management;control and predicting costs; Fitness of vehicles;Stores; definition; management; storing methods;inventory control; Duties and responsibilities ofstore manager; purchase manager; Storingmethods;Bin card; requisition card; Inventorycontrol procedures; Vendor development; Storeslayout;spare parts flow chart; Storedocumentation; store organization.7. MOTOR INSURANCE: Types; scope; limitations;liability of insurance Cos; insurance documentsclaimform; estimate and bills; Necessity forinsurance against third party risk; Requirementsand limits of liability of insurance polices;Procedure to be followed for settlement of a claimafter an accident; Surveyor and loss assessor;Surveyors report; Certificate of insurance transfer;Compensation to third party deaths; Motoraccident claims tribunal (MACT); Transit insuranceTEXT BOOKThe Motor Vehicle Act, 1988; Govt. of India Publication.REFERENCE BOOKS1. Patankar P. G., “Road Passenger Transport inIndia”; CIRT Pune, March 2007.81

B.Tech. Computer Science & Engineering (Regular)2. Srivastav S. K., “Economics of Transport”, SChand & Co., 1981.4. Dale Yoder, “Personnel Management & IndustrialRelations”, Tata McGraw HillBA-271HUMAN RESOURCE L T P CrMANAGEMENT 5 0 0 3BA-272ENTREPRENEURSHIP L T P CrDEVELOPMENT 5 0 0 3OBJECTIVEThe course aims to provide the insights into effectivemanagement of human resources to enable thestudents to meet the HR challenges in the presentscenario.1. INTRODUCTION: Meaning, scope, objective,functions, policies & roles and importance ofHuman Resource Management; Interaction withother functional areas; HRM & HRD - acomparative analysis, organizing the HumanResource Management department in theorganization; Human Resource Managementpractices in India.2. HUMAN RESOURCE PLANNING: Definition,objectives; process and importance job analysis;Description, specification and job evaluation.3. DEVELOPING EFFECTIVE HUMAN RESOURCE:Recruitment; selection; placement and introductionprocess; human resource development: concept,employee training & development, career planning& development4. PERFORMANCE MANAGEMENT: concept andprocess, performance appraisal, Potentialappraisal Job Compensation: Wage & salaryadministration, incentive plans & fringe benefits;Promotions, demotions, transfers, separation,absenteeism and turnover; Quality of work life(QWL): Meaning, origin, development and variousapproaches and; to QWL, techniques for improvingQWL; Quality circles: concept, structure, role ofmanagement QC in India5. JOB SATISFACTION AND MORALE: Health,safety & employee welfare; counseling foreffective; enforcing equal employment opportunitylegislation; fair employment; fair practice laws,6. HUMAN RESOURCE DEVELOPMENT: HumanResource: definition, objectives & approaches tohuman relations; Employee grievances anddiscipline; participation & empowerment;Introducing to collective bargaining; HR Audit.7. HIGH PERFORMANCE WORK SYSTEM:Fundamental principles-Principle of shared info;principle of knowledge development; principle ofperformance reward linkage; principle ofEgalitarianism; Testing alignment of the HRsystem-HR deliverablesTEXT BOOKRao V. S. P., “Human Resource Management”, ExcelPublicationsREFERENCE BOOKS1. C. B. Memoria “Personal Management”, HimalayaPublications, New Delhi2. Edwin B. Flippo, “Personal Management” TataMcGraw Hill3. Aswathappa K., “Human Resource Management”,Tata McGraw HillOBJECTIVETo acquaint the students with the challenges of startingnew ventures and enable them to investigate,understand and internalize the process of setting up abusiness.1. CONCEPT OF ENTREPRENEURSHIP: meaningand characteristics of entrepreneurship,entrepreneurial culture, socio-economic origin ofentrepreneurship, factors affectingentrepreneurship, conceptual model ofentrepreneurship, traits of a good entrepreneur,entrepreneur, intra-preneur and manager2. ENTREPRENEURIAL MOTIVATION: motivating,compelling and facilitating factors, entrepreneurialambition, achievement motivation theory andkakinada experiment3. ESTABLISHMENT OF ENTREPRENEURIALSYSTEMS: search, processing and selection ofidea, Input requirements4. SMALL SCALE INDUSTRY: meaning, importance,characteristics, advantages and problems of SSIs.Steps for starting a small industry, guidelines forproject report, registration as SSI.5. ASSISTANCE TO SSI: need for incentives &subsidies, need for institutional support, role ofgovernment and other institutions.6. FUNCTIONAL PLANS: Marketing plan- marketingresearch for the new venture, steps in preparingmarketing plan, contingency planning;Organizational plan- Forms of ownership,designing organizational structure, job design,manpower planning; Financial plan- cash budget,working capital, proforma income statement,Proforma cash flow, proforma balance sheet, breakeven analysis.7. SOURCES OF FINANCE: Debt or Equityfinancing, commercial banks, venture capital;financial institutions supporting entrepreneurs;legal issues- intellectual property rights, patents,trade marks, copy rights, trade secrets, licensing,franchising.TEXT BOOKGupta C. B. and Srinivasan N. P., “EntrepreneurialDevelopment”, Sultan Chand & SonsREFERENCE BOOKS1. Vasant Desai, “Management of a Small ScaleIndustry”, Himalaya Publishing HouseCE-471ADVANCED TRAFFIC L T P CrENGINEERING 5 0 0 3OBJECTIVETo introduce the students about various modern trafficengineering and management problems and theirsolutions.82

Lingaya’s University, Faridabad1. INTRODUCTION AND TRAFFICCHRACTERISTICS: Objectives and scope oftraffic engg. Organisational set up of traffic enggdepartment in India; Importance of trafficcharacteristics; Road user characteristics;Vehicular characteristics; Max dimensions andweights of vehicles allowed in India. Effects oftraffic characteristics on various design elements ofthe road.2. TRAFFIC SURVEYS: Methods of conducting thestudy and presentation of the data for trafficvolume study; speed study and origin anddestination study. Speed and delay study. Parkingsurveys; On street parking; off street parking.Accident surveys. Causes of road accidents andpreventive measures; Use of photographictechniques in traffic surveys.3. HIGHWAY CAPACITY: Importance. Space andtime headway. Fundamental diagram of traffic flow.Relationship between speed; volume and density.Level of service. PCU. Design service volume.Capacity of non-urban roads. IRCrecommendations. Brief review of capacity ofurban roads.4. TRAFFIC CONTROL: Types of traffic controldevices. Traffic signs; general principles of trafficsigning; types of traffic signs. Road markings;types; general principles of pavement markings.Design of rotary. Grade separated intersections.Miscellaneous traffic control aids and streetfurniture.5. Signal Design: Types of signals. Linked orcoordinated signal systems. Design of signaltimings by trial cycle method; approximate method;Webstor’s method and IRC method6. Traffic Regulation And Management: Need andscope of traffic regulations. Regulation of speed;vehicles and drivers. General traffic regulations.Motor vehicle act. Scope of traffic management.Traffic management measures: restrictions onturning movements; one way streets; tidal flowoperations; exclusive bus lanes; traffic restraint;road pricing.7. TRAFFIC AND ENVIRONMENT COMPUTERAPPLICATION; TRAFFIC SIMULATION:Detrimental effects of traffic. Vehicular air pollution.Situation in India. Vehicular emission norms inIndia and abroad. Alternate fuels. Factors affectingfuel consumption. Arboricultur.Computer application in traffic engg.; transportplanning and public transport. Traffic simulation;advantages. Steps in simulation. Scanningtechniques. Introduction to Intelligent vehiclehighway system. Various types of IVHS.TEXT BOOKKhanna S. K. and Justo C. E. G., “HighwayEngineering”, Nem Chand Bros., RoorkeeREFERENCE BOOKS1. Kadiyali L. R., “Traffic Engg. and TransportPlanning”, Khanna Publishers2. Matson T. M., Smith W. S. and Hurd F. W., “TrafficEngineering”, McGraw Hill, New York.3. Drew D. R., “Traffic Flow Theory”, McGraw Hill,New York.WEB REFERENCES1. syllabus.icbse.com/jntu/19-TRANSPORTATION%20ENGINEERING.pdf2.2. www.nitkkr.ac.in/WebCivil/Civil_syllabus.doc3. www.uniqueinstitutes.org/kuk/civilengg/38civilf.pdf4. worldinfo.org/wpcontent/uploads/.../Ecology.Enquirer.August.2009.pdfCE-472ELEMENTS OF TOWN L T P CrPLANNING ANDARCHITECTURE 5 0 0 3OBJECTIVETo impart knowledge on various aspects of townplanning and architecture, historical structures,planning development of habitats.1. INTRODUCTION TO ARCHITECTURE: Origin &definition; factors influencing architecture –climate; topography; metarials; socio – culturalconditions; economic and technological factors etc.components of architecture – functional; aestheticand structural.2. BASIC ELEMENTS OF ARCHITECTURE:Principles of architectural composition - concept ofbeauty; unity; balance; proportion scale; rhythem;harmony; contract; symmetry; character;integration etc. aesthetic responses to colour;texture; light & shade; formal and informalorganizations of solids and void3. INTRODUCTION OF TOWN PLANNING: GeneralPlanning concepts in town planning; ancient townplanning Greak; Roman; Medieval & Renaissancetowns; history of town planning in India; moderntown planning – industrial revaluation and itsimpact ; garden city concept new town and satellitetowns.4. TOWN PLANNING LEGISLATIONS: Urbanisationtrends in India ; classification of town; Evolution ofplanning legislation in India; organizations andadministration of planning agencies at Nationalstate; regional level and metropolitan level ;building bye laws; provision of building regulation;function of local authorizes.5. DEVELOPMENT PLANS: Need; objective; scopeand content of master plan; regional plan;structural plan; zonal development plan etc;Planning of land uses – residential; industrial;commercial; principles of planning for traffic &transportation; utility and services ; zoningregulation; sub division regulation; FARs;dentitions etc.6. ELEMENTS OF A TOWN / CITY PLAN: Planningattributes- physical infrastructure; socialinfrastructure; commerce; housing etc ; surveys fortown planning ; importance of climate; topograpgy;drainage; water supply in selection of site fordevelopment; planning standerds – UDPFIguidelines.7. COMPONENTS OF TOWN PLANNING: Housing;housing problems in India; National housing policy;housing agencies; housing finance institutions;Dhum housing; transportation planning process;national transportation policy; surveys of83

B.Tech. Computer Science & Engineering (Regular)transportation planning; urban conservation;National Building Code of India 1983 guidelines;norms for planting of shrubs, trees, etc.TEXT BOOKHiraskar G. K., “Fundamentals of Town Planning”,Dhanpat Rai & Co, 2001REFERENCE BOOKS1. Rangwala S. C. and Krishnarjun N., “Town Planning”,Charotar Publishing House, Anand, 1985.2. Pramar V. S., “Design Fundamentals inArchitecture”, Somaiya Publications, New Delhi.REFERENCE WEB SITE1. www.jadavpur.edu/academics/.../Architecture/archsyl.htm2. www.oauife.edu.ng/faculties/edm/arch/coursedescription.pdf3. www.unitytempleutrf.org/Unity%20Temple%20Teaches.pdfissuu.com/brentallpress/docs/adr3_vol3_1CH-471ADVANCED APPLIED L T P CrCHEMISTRY 5 0 0 3OBJECTIVETo make students familiar with the concept of chemistryassociated with dairy life, with the general method ofanalysis and other aspects related to engineering field.1. FUELS & PETROCHEMICALS TECHNOLOGY:Classification of fuels; coal biomass; biogasdetermination of calorific values using bombcalorimeter; bio- fuels and liquid fuels; generalconsideration of petrochemicals; an overview ofpetroleum refining; petroleum transpiration; anelementary ideas of petrochemicals; petroleumrefining -catalytic cracking & naptha reforming.2. CHEMICALS TOXICOLOGY: Introduction; kind oftoxic pollutants; toxic chemicals in air water & soil;toxic elements in waste water; carcinogenesis,impact of toxic chemicals on enzymes; biochemicaleffects of As ,Cd, Pg, Hg, CO, NO 2 , O 3 CN- Toxicmetal pollutants; Toxic minerals and dust; Toxicorganic compounds .3. ENVIRONMENTAL HAZARDS & POLLUTION:Cause; Effects; control & measures of waterpollution; soil pollution; thermal pollution; Nuclearpollution; solid waste management; industrialwaste & bio-medical waste management; cause;effects & control measures of urban & industrialwaste.4. INDUSTRIAL WASTE MANAGEMENT:Magnitude of industrial waste generation & theircharacteristics; effluent standards for disposal intowater bodies; waste water characterization &process survey; advanced treatment &sludgehanding; combined treatment of raw industrialwaste with sewage; common effluent treatment forindustrial estates; management of industrial wastefrom small scale industries.5. Selection procedure for physical; chemical &biochemical methods of industrial waste watertreatment.6. CORROSION & ITS CONTROL: Introduction; drycorrosion; wet corrosion; mechanism of wetcorrosion galvanic corrosion; concentration; Cell;corrosion fitting corrosion; inergranular corrosion;waterline corrosion; stress corrosion; galvanicseries; factors influencing corrosion; controlmethods.7. POLYMER TECHNOLOGY: Introduction of naturaland synthetic polymers; classification of polymerson different basis; Natural rubber; Source;Formula; Elasticity of rubber; chemical relativity;properties; isomerism in rubber; vulcanized rubberand its uses .8. ADVANCED ANALYTICAL METHODS: Thermoanalytical methods; Thermo gravimetric analysis(TGA); Differential thermal analysis (DTA);Differential scanning calorimetry (DSC);Instrumentation; Flame photometry;spectrophotometry; conductometry; conductometrychromatographic methods; Adsorption; liquid -liquid partition; ion-exchange; paper & thin-layerchromatography; gas chromatography; HPLC &Electrophorisis.TEXT BOOKJain & Jain, “Engineering Chemistry”, Dhanpat RaiPublishing Co.REFERENCE BOOKS1. Drago, “Physical Methods of Chemistry”.2. Hutzinger, “Hand Book of EnvironmentalChemistry”, Springer Verlag3. Fristschen L. J. and Gay L. W., “EnvironmentalInstrumentation”, Springer Verlag4. Bhatia H. S., “Environmental Pollution andControl”, Galgotia Publications, 20035. Khopkar S. M., “Basic Concept of AnalyticalChemistry”, 2nd edition, New Age Publications, 1998CS-303COMPUTER GRAPHICSL T P Cr5 0 0 3OBJECTIVEStudents completing this course are expected to beable to:• Write programs that utilize the OpenGL graphicsenvironment.• Use polygonal and other modeling methods todescribe scenes.• Understand and be able to apply geometrictransformations.• Create basic animations.• Understand scan-line, ray-tracing, and radiosityrendering methodsPRE-REQUISITESKnowledge of computer programming, 2D and 3Dgeometry1. INTRODUCTION: What is computer graphics,computer graphics applications, computer graphicshardware and software, two dimensional graphicsprimitives: points and lines, line drawingalgorithms: DDA, Bresenham’s; circle drawing84

Lingaya’s University, Faridabadalgorithms: using polar coordinates, Bresenham’scircle drawing, mid point circle drawing algorithm;polygon filling algorithm, boundary filled algorithm,scan-line algorithm, flood fill algorithm.2. TWO DIMENSIONAL VIEWING: The 2-D viewingpipeline, windows, viewports, window to view portmapping; clipping: point, clipping line (algorithms):4 bit code algorithm, Sutherland-Cohen algorithm,parametric line clipping algorithm (Cyrus Beck).3. POLYGON CLIPPING ALGORITHM: Sutherland-Hodgeman polygon clipping algorithm,homogeneous coordinates system, twodimensional transformations: transformations,translation, scaling, rotation, reflection, shearing,transformation, composite transformation.4. THREE DIMENSIONAL GRAPHICS: Threedimensional graphics concept, matrixrepresentation of 3-D transformations, compositionof 3-D transformation; viewing in 3D: projections,types of projections; the mathematics of plannergeometric projections; coordinate systems.5. HIDDEN SURFACE REMOVAL: Introduction tohidden surface removal; the Z- buffer algorithm,scan-line algorithm, area sub-division algorithm.6. REPRESENTING CURVES AND SURFACES:Parametric representation of curves: Beziercurves, B-Spline curves; parametric representationof surfaces; interpolation method.7. ILLUMINATION, SHADING, IMAGEMANIPULATION: Illumination models, shadingmodels for polygons, shadows, transparency; whatis an image, filtering, image processing, geometrictransformation of images.TEXT BOOKFoley James D., van Dam Andeies, Feiner Stevan K.and Hughes Johb F., “Computer Graphics Principlesand Practices”, 2nd Edition, Addision Wesley, 2000REFERENCE BOOKS1. Hearn Donald and Baker M. Pauline, “ComputerGraphics”, 2nd Edition, Prentice Hall of India, 19992. Rogers David F., “Procedural Elements forComputer Graphics”, 2nd Edition, Tata McGrawHill, 20013. Watt Alan, “Fundamentals of 3-DimensionalComputer Graphics”, Addision Wesley, 19994. John Corrign, “Computer Graphics: Secrets andSolutions”, BPB Publications, 19945. Krishanmurthy N., “Introduction to ComputerGraphics”, Tata McGraw Hill, 2002WEB REFERENCES1. http://en.wikipedia.org/wiki/Computer_graphics2. http://www.cgw.com/ME2/Default.asp3. http://www.graphics.cornell.edu/online/tutorial/4. http://graphics.stanford.edu/CS-402ARTIFICIAL INTELLIGENCEL T P Cr5 0 0 3OBJECTIVETo introduce about artificial intelligence approaches toproblem solving, various issues involved andapplication areasPRE-REQUISITESKnowledge of neural networks, data structures1. INTRODUCTION TO AI AND SEARCHTECHNIQUES: Foundation and history of AI; data,information and knowledge; AI problems andtechniques – AI programming languages, problemspace representation with examples; blind searchstrategies, breadth first search, depth first search,heuristic search techniques: hill climbing: best firstsearch, A * algorithm AO* algorithm, Means-endsanalysis.2. KNOWLEDGE REPRESENTATION ISSUES:predicate logic; logic programming; constraintpropagation; representing knowledge using rules.3. REASONING UNDER UNCERTAINITY:Reasoning under uncertainty, non monotonicreasoning; review of probability; Bayes’probabilistic interferences and Dempster Shafertheory; heuristic methods; symbolic reasoningunder uncertainty; statistical reasoning, fuzzyreasoning.4. PLANNING & GAME PLAYING: Minimax searchprocedure; goal stack planning; non linearplanning, hierarchical planning, planning insituational calculus; representation for planning;partial order planning algorithm5. LEARNING: Basic concepts; rote learning,learning by taking advices, learning by problemsolving, learning from examples, discovery aslearning, learning by analogy; explanation basedlearning; neural nets; genetic algorithms.6. OTHER KNOWLEDGE STRUCTURES: semanticnets, partitioned nets, parallel implementation ofsemantic nets; frames, common sense reasoningand thematic role frames; architecture of knowledgebased system; rule based systems; forward andbackward chaining; frame based systems.7. APPLICATIONS OF ARTIFICIAL INTELLIGENCE:Principles of natural language processing; rulebased systems architecture; expert systems,knowledge acquisition concepts; AI application torobotics, and current trends in intelligent systems;parallel and distributed AI: psychological modeling,parallelism in reasoning systems, distributedreasoning systems and algorithmsTEXT BOOKRich Elaine, Knight Kevin and Nair, “ArtificialIntelligence”, 3rd Edition, Tata McGraw Hill, 2009REFERENCE BOOKS1. Nilson Nils J., “Artificial Intelligence”, New YorkMcGraw-Hill, 1971.2. Russell Stuart and Norvig Peter, “ArtificialIntelligence: A Modern Approach”, Prentice Hall ofIndia, 19983. Negnevitsky, “Artificial Intelligence: A Guide toIntelligent System”, Pearson Education, 2004.4. Patterson O. W., “Introduction to ArtificialIntelligence & Expert Systems”, Prentice Hall ofIndia, 1996.5. Winston Patrick Henry, “Artificial Intelligence”, 3rdEdition, Addition Wesley, 19926. Clockson & Mellish, “Programming PROLOG”,Narosa Publications, 3rd Edition, 2002.85

B.Tech. Computer Science & Engineering (Regular)WEB REFERENCES1. http://wwwformal.stanford.edu/jmc/whatisai/2. http://library.thinkquest.org/2705/3. www.imdb.com.CS-422CRYPTOGRAPHY AND L T P CrDATA COMPRESSION 5 0 0 3OBJECTIVEThe course will attempt to dispel some of the manymyths that surround the idea of cryptography.Cryptography is (and will continue to be) anincreasingly important area of IT and it is important thatpractitioners are aware of the realities of the subject.The course will provide a down-to-earth overview ofcryptographic techniques applicable in an ITenvironment, and outline the constraints and limitationsof realistic secure systems. A running theme is thetradeoff between usability and security of a system.Also covered are a number of compression techniques- data compression and data encryption are, in somerespects, closely related. A working knowledge of C isassumed and essential.PRE-REQUISITESKnowledge of cryptography, analysis & designalgorithms and mathematics1. INTRODUCTION: Basics of cryptography; history;usefulness of compression techniques2. COMPRESSION: Packing, Huffman coding, Runlength encoding, Lempel-Ziv-Welch, PKZIP, Deltamodulation, JPEG; latest compression techniques3. ERROR DETECTION AND CORRECTION: Parity,1, 2, n-dimensions, Hamming codes, p-out-of-qcodes4. CRYPTOGRAPHY: vocabulary; history;steganography - visual textual, cipher hiding, falseerrors; public key cryptography – authentication;signatures; deniability5. MATHEMATICS: information; confusion; diffusion;modular arithmetic; inverses; Fermats littletheorem; Chinese remainder theorem, factoring;prime numbers; discrete logarithms6. ALGORITHMS: DES, AES (Rijndael), IDEA, Onetime pad, Secret sharing and splitting, RSA, Ellipticcurves, Modes, Random numbers7. ATTACKING SYSTEMS: Recognition, Destroyingdata, Cryptanalysis - Differential cryptanalysis -cracking DESTEXT BOOKB. Schneier, “Applied Cryptography: Protocols,Algorithms and Source Code in C”, 2nd edition, Wiley,1996.REFERENCE BOOKS1. Suhas Desai, “Security in Computing”, PearsonEducation, 20102. “Integration of Data Compression andCryptography: Another Way to Increase theInformation Security”, IEEE Computer SocietyVolume 2, 20073. W. Trappe and L. Washington, “Introduction toCryptography”, 2nd edition, Pearson Education, 2006WEB REFERENCES1. http://www.data-compression.com/index.shtml2. http://www.webopedia.com/TERM/D/data_compression.html3. http://en.wikipedia.org/wiki/Data_compression4. http://www.debugmode.com/imagecmp/EC-305 EMBEDDED SYSTEM DESIGNL T P Cr5 0 0 3OBJECTIVEThe course intends to cover the design issues involvedin embedded systems and system-on-chip technologies.The course also deals with the applications andprogramming languages and processor architecturesused for embedded systems. This course introduces thestudents to standard Embedded System Developmenttools and gives a hands-on experience in developingvarious embedded applications.1. INTRODUCTION: Different types ofmicrocontrollers: Embedded microcontrollers;External memory microcontrollers; ProcessorArchitectures: Harvard V/S Princeton; CISC V/SRISC; microcontrollers memory types; Introductionto Real Time Operating System.2. 8051 MICROCONTROLLER ARCHITECTURE:Architecture; memory considerations; Addressingmodes; clocking; i/o pins; interrupts; timers;peripherals; serial communication; Instruction set;simple operations.3. PIC MICROCONTROLLER ARCHITECTURE:Introduction to PIC microcontrollers; Architectureand pipelining; program memory considerations;Addressing modes; CPU registers; Instruction set;simple operations.4. INTERRUPTS AND I/O PORTS: Interrupt logic;Timer2 scalar initialization; IntService Interruptservice routine; loop time subroutine; Externalinterrupts and timers; synchronous serial portmodule; serial peripheral device; O/p portExpansion; I/p port expansion; UART.5. SOFTWARE: Development tools/ environments;Assembly language programming style;Interpreters; High level languages; Intel hex formatobject files; Debugging.6. PROGRAMMING WITH MICRO-CONTROLLERS: Arithmetic operations; Bitaddressing; Loop control; Stack operation;Subroutines; interfacing of 8051 with LCD; LED;keyboard; motors; seven segment and otherinterfacing; PIC simple operations.7. DESIGNING USING MICROCONTROLLERS:Music box; Mouse wheel turning; PWM motorcontrol; aircraft demonstration; ultra sonic distancemeasuring; temperature sensor; pressure sensor;magnetic field sensor.TEXT BOOKJohn B. Peatman, “Design with PIC Microcontrollers”,Pearson Education, 4th edition, 2005.REFERENCE BOOKS1. Mazidi, “8051 Microcontroller”, 2nd Edition,Prentice Hall, 200586

Lingaya’s University, Faridabad2. Predko, “Programming and Customizing the 8051Microcontroller”, 2nd Edition, McGraw Hill, 2002.3. Catsoulis John, “Designing Embedded Hardware”,2 nd Edition, O’Media, 2005.4. Barr Michael, “Programming Embedded Systemsin C and C++”, Shroff Pub. and Distr., 3rd Edition,2003.5. Ayala A. J., “The 8051 Microcontroller:Architecture, Programming, and Applications”,Pap/Dsk edition, West Publishing Company, 19916. Udai Shankar; “8051 Microcontrollers”, CSVTUResearch Journal, Chhattisgarh SwamiVivekanand Technical University, 2010.EC-401MOBILE COMMUNICATIONL T P Cr5 0 0 3OBJECTIVEThis subject covers the entire concept behind thecellular technology. It covers the different standardslike GSM; CDMA and going through these topics willhelp the students to face telecom sector and softwarecompanies.1. MOBILE RADIO SYSTEM: reference model;frequencies for radio transmission; signals;antennas; signal propagation; multiplexing;modulation2. CHARACTERISTICS OF RADIO WAVES:Multipath characteristics of radio waves; signalfading; time dispersion; Doppler spread ;coherence time; LCR; fading statistics; diversitytechniques3. WIRELESS SYSTEMS: GSM: architecture;services; frame structure; signal processingWireless data services :RAM ;CDPD; GPRS4. WI-FI AND THE IEEE STANDARD 802.11:802.11 architecture; MAC layer; PHY layer;Bluetooth and the IEEE standard 802.155. MOBILE NETWORK LAYER: MOBILE IP: Goalsand requirements; IP packet delivery; agentdiscovery; registration; tunneling andencapsulation; optimization; reverse tunneling; IP-V6; Mobile ad-hoc networks6. MOBILE TRANSPORT LAYER: Traditional TCP;classical TCP improvement; TCP over 2.5 G/3Gwireless networks; performance enhancingproxies7. CDMA IN MOBILE COMMUNICATIONSYSTEMS: Introduction, spreading sequences,basic transmitter and receiver schemes in theCDMA system, RAKE receiver, joint detection ofCDMA signals, basic properties of a CDMA mobilesystemTEXT BOOKRappaport T. S., “Wireless Communication: Principlesand Practice”, 2nd Edition, Prentice Hall of India, 2001REFERENCE BOOK1. Schiller Jochen, “Mobile Communication”, 2ndEdition, Pearson Education, 2005.2. William C. Y. Lee, “Mobile CellularTelecommunications”, 2 nd Edition, McGraw Hill,1995.EE-401PROGRAMMABLE LOGIC L T P CrCONTROLLERS & SCADA 5 0 0 3OBJECTIVEThe programmable logic controller represents a keyfactor in industrial automation. Its use permitsflexible adaptation to varying processes as well asrapid fault finding and error elimination. Today,Industrial environment is steered with the latesttechnological advancements in computers andcommunication. Programmable Logic Controllers(PLC) based automation is its outcome. This subjectis useful to understand the concept of automationused in industry.1. INTRODUCTION: Programmable Logic Controller;advantages of PLCs Over Relay System; inputoutput Section – Fixed input output, Modular inputoutput, Discrete input output Modules, Analoginput output Modules.2. PROCESSOR UNIT: Processor; Memory types;Guarding against Electro Static Discharge;Peripherals; Memory Organization.3. PROGRAMMING DEVICES: ProgrammingDevices; Dedicated Desktop Programmes; HardHeld Programmes; Computer Programmes4. LADDER DIAGRAM & PLC PROGRAMMING:Ladder Diagram Rules; Writing Diagram; LadderDiagram; Basic Stop / START Circuit; DigitalLogic gates; Sequenced Motor Starting; RelayType Instruction; Programming a PLC; PLCPeripherals; Network Limitation; ProgramScanning5. Program Control Instructions: Master ControlRelay Instructions; Latching Relay instruction;immediate input output instruction; Jump and LabelInstruction.6. PROGRAMMING TIMER & COUNTERS:Pneumatic Timers; Cascading Timers; AllenBradley PLCs Counters; Combining Timer &Counters.7. SCADA: Introduction; Concept of AutomaticScada; Architecture of Scada; Hierarchical ofSupervisory Control & Data Acquisition System;Technology Available; Data Acquisition Unit;Remote Technical Unit.TEXT BOOKCox Richard A., “Technician’s Guide to ProgrammableControllers”, 4th Edition, Delmar Thomson Learning,2001REFERENCE BOOKS1. Hackworth, John. R. and Hackworth, Jr. FrederickD., “Programmable Logic Controllers:Programming Methods and Applications”, PearsonEducation, 2004.2. Webb, John W., & Reis, Ronal A., “ProgrammableLogic Controllers: Principles & Applications”,Pearson Education / Prentice Hall, 2008.3. Dunning, Gary, “Introduction to ProgrammableLogic Controllers”, Delmar Thomson Learning,2004.87

B.Tech. Computer Science & Engineering (Regular)EE-431INDUSTRIAL L T P CrELECTRONICS 5 0 0 3OBJECTIVEStudents who enter the job market and becomeelectronic engineers must be prepared to work onindustrial electronics in many forms. The jobresponsibilities for these fields are rapidly changingbecause electronic devices and circuits have becomethoroughly integrated into all aspects of modernindustrial control systems during the past ten years.The role of an electronic engineer has changed to thepoint where he is expected to work on every aspect ofindustrial system from the simplest electricalcomponents, such as fuses and motor, to the mostcomplex, such as electronic boards, motor drives, andprogrammable controllers. This course providessufficient depth to be a useful resource while workingon job.1. INDUSTRIAL LOGIC CIRCUITS: Relay logic;Types of relays; voltage ratings for coils andcontacts; typical logic circuits; relay ladder & itsapplication; solid state devices used for relay logic;solid state logic blocks; solid state relays.2. PROGRAMMABLE LOGIC CONTROLLERS(PLC): Programmable logic controller systems;PLC operation; input module circuitry; processor;processor operations; memory & its layout;program scanning; programming – assemblylanguage; relay language or logic; programmingbasics; ladder diagram; timing function;sequencing operations; arithmetic functions; movefunction, conversion.3. TIMERS: Functions, types – delay timers;interval times; repeat cycle timers; reset timers;timer classification – thermal timers;electromechanical timers; motor driven delaytimers; block diagram of the basic elements ofan electronic timer.4. ILLUMINATION: Nature of light; basic laws ofillumination; light sources and their characteristics;light production by excitation and ionization;incandescence; fluorescence; different types oflamps; their construction; operation andcharacteristic; application, latest light sources;design of illumination system.5. POWER SUPPLIES: Performance parameters, ofpower supplies, comparison of rectifier circuit;filters, regulated power supplies; switchingregulators; switch mode converter.6. POWER FACTOR CONTROL: Static reactivepower compensation; shunt reactive powercompensator; application of static SCR controlledshunt compensators for load compensation; powerFactor improvement and harmonic Control ofConverter fed systems; methods employing naturaland forced commutation schemes; implementationof forced commutation.7. MOTOR CONTROL: Voltage control at constantfrequency; PWM control; phase control of dcmotor; PLC control of a DC motor.TEXT BOOKDubey G. K., “Power Semiconductor Controlled Drives”,Prentice Hall Inc. New York.REFERENCE BOOKS1. Thomas Kissel E., “Industrial Electronics”, 3rdEdition, Prentice Hall of India.2. Date Patrick R. & Stephen Fardo W., “IndustrialElectronics: Devices and Systems” 2nd Ed., MarcelDeckker, Inc. New York.LABORATORY: Performance parameter of variouspower converters, sequence control of AC-DC powerconverter, Comparison of AC-DC converters with andwithout filters, Project on illumination, simulation ofpower converters using MATLAB, relay networkprogramming, programming PLC.EL-421RENEWABLE ENERGY L T P CrSOURCES & ENERGYCONSERVATION 5 0 0 3OBJECTIVEProviding the knowledge to the students about varioustypes of conventional and non-conventional electricalpower plants and explain the concepts regarding theirlayout and their operations at different load conditions.PRE-REQUISTESKnowledge of electrical technology and circuits.1. INTRODUCTION: Energy classification; sources;utilization; economics; power generationterminology; energy conversion matrix; and reviewof various principal fuels for energy conversionsuch as solar; biogas; wind ; tidal etc.2. SOLAR ENERGY: Solar radiation and itsmeasurement; solar energy collectors; storage andapplications.3. WIND ENERGY: Basic principles of wind energyconversion; site selection considerations; winddata and energy estimation; classification of WECsystems; Magnus effect; wind energy collectors;storage and applications of wind energy; safetysystems.4. ENERGY FROM BIOMASS: Introduction; biomassconversion technologies; biogas generation;classification of biogas plants; details ofconstruction of some main digesters; methods formaintaining biogas production; problems related tobio-gas plants etc.5. ENERGY FROM THE OCEANS: OTEC; opencycle; closed cycle OTEC systems; energyutilization; hybrid cycle etc. operation methods ofutilization of tidal energy; prospects in India.6. PRODUCTION OF THERMAL ENERGY:Introduction; conversion of mechanical energy;conversion of electrical energy; conversion ofelectromagnetic energy; conversion of chemicalenergy; conversion of nuclear energy etc. Study oftypical energy converters such as high performancemotors; special generators driven by biogasengines; wind turbines etc; mini-hydro generators;energy efficient motors; magneto hydro dynamicspower generation; thermionic generation.7. ENVIRONMENTAL IMPACT OF POWER PLANTOPERATION: Introduction; particulate emissions;gaseous pollutants; thermal pollution; solid-wastepollution.88

Lingaya’s University, FaridabadTEXT BOOKMukund R., ‘’Non-conventional Energy Sources’’,Khanna Publishers, 2002REFERENCE BOOKS1. Domkundwar and Arora, “Power PlantEngineering”, Dhanpat Rai & Sons 2002.2. Rai R. C., “Power Plant Engineering”, Dhanpat RaiPublication, 20053. Cul A. W., “Energy converters”, McGraw Hill, 2000.4. Nag, P. K., “Power Plant Engineering”, TataMcGraw Hill, 19955. Subir, R.,” Electrical Power System”, Prentice HallIndia, 2007requirement in steady state; sources of reactivepower; static var systems; reactive power controlduring transients; introduction of harmonic andfilters; generation of harmonics; design of ACfilters; DC filters; carrier frequency and RI noise7. MEASUREMENTS & TESTING OF HVDC:Measurement of high direct voltage; electrostaticvoltmeters; generating voltmeter; sphere-gap;measurement of ripple voltages; types tests androutine tests of equipment; dielectric testing ofHVDC equipments; power frequency voltagewithstand tests; impulse voltage withstand test;measurement by sphere gaps; application of testvoltage to the equipments under test.EL-422HVDC TRANSMISSIONL T P Cr5 0 0 3TEXT BOOKArrillaga, J., “High voltage D.C.Transmission”, PeterPeregrinus Ltd, 1996OBJECTIVEProviding a basic knowledge and understanding of thefundamental concepts of high voltage engineering,explaining various methods of HVDC powertransmission, converter techniques and HVDC controland protection, and the method of measurement andtesting of HVDC.PRE-REQUISTESKnowledge of electromagnetic field theory and powersystems.1. DC POWER TRANSMISSION TECHNOLOGY:Introduction; comparison of AC and DCtransmission; application of DC transmission;description of DC transmission system; planningfor HVDC transmission; modern trends in DCtransmission.2. THYRISTOR VALVE & ANALYSIS OF HVDCCONVERTERS: Introduction; thryistor device;thyristor value; value tests; recent trends; pulsenumber; choice of converter configuration;simplified analysis of Graetz circuit; converterbridge characteristics; characteristics of twelvepulse converter; detailed analysis of converters.3. CONVERTER AND HVDC SYSTEM CONTROL:General; principles of DC link control; convertercontrol characteristics; system control hierarchy;firing angle control; current and extinction anglecontrol; starting and stopping of dc link; powercontrol; higher level controllers; telecommunicationrequirements.4. CONVERTER FAULTS AND PRODECTION:introduction; converter faults; protection againstover currents; overvoltages in a converter station;surge arresters; protection against overvoltagesintroduction of multiterminal DC systems; potentialapplications of MTDC systems; types of MTDCsystems; control and protection of MTDC systems;study of MTDC systems5. SMOOTHING REACTOR AND DC LINE:Introduction; smoothing reactors; DC line; transientover voltages in DC line; protection of DC line; DCbreakers; monopolar operation; effects of proximityof AC and DC transmission lines.6. REACTIVE POWER CONTROL, HARMONICAND FILTERS: Introduction; reactive powerREFERENCE BOOKS1. Padiyar K. R., “HVDC Power TransmisionsSystems”, New Age International Pvt. Ltd., 20012. Rao S., “EHV-AC, HVDC Transmission&Distribution Engineering”, Khanna Publishers,19993. Tagare, D. M., “Reactive Power Management”,Tata McGraw Hill, 19964. Dubey, G. K., “Power Semi-conductor ControlledDrives”, Prentice Hall, 1999.5. Subrahmaniyam V., “Electric Drives: Concepts andApplications”, Tata McGraw Hill, 2005.EL-423HIGH VOLTAGE L T P CrENGINEERING 5 0 0 3OBJECTIVEProviding a basic knowledge and understanding of thefundamental concepts of high voltage engineering,explaining various basic laws governing the conductionand breakdown, voltage gradients on conductors,phenomenon of corona and lightening discharges andhigh voltage testing arrangements.PRE-REQUISTESKnowledge of Electromagnetic field theory and powersystems.1. INTRODUCTION: Recent trends in high voltagetransmission.2. CONDUCTION AND BREAKDOWN: Conductionand breakdown in gases; liquids and soliddielectrics; insulator breakdown; insulationcharacteristics of long air gaps.3. VOLTAGE GRADIENTS ON CONDUCTORS:Electrostatic fields of sphere gaps; fields of linecharges and their properties; charge-potentialrelations for multi-conductor lines; surface voltagegradients on conductors; distribution of voltagegradient on sub conductors of bundle.4. CORONA: Corona and corona loss; corona lossformula; attenuation of traveling waves due tocorona; audible noise-generation andcharacteristics; corona pulses--their generationand properties; properties of pulse; radiointerference.89

B.Tech. Computer Science & Engineering (Regular)5. LIGHTENING: Lightening phenomenon; lightningstroke mechanism; principle of lightning protection;tower foot resistance; insulator flash over andwithstand voltage; lightning arresters and theircharacteristics.6. H. V. TESTING AND LAB EQUIPMENTS:Standard wave-shapes for testing; wave-shapingcircuits: principles and theory; impulse generator;generation of ac high voltage for testing;generation of direct voltage; measurement of highvoltage; general layout of H.V.laboratory.7. MEASUREMENT OF HIGH ALTERNATINGVOLTAGES: Peak voltage measurement withsphere-gaps; peak voltage measurement usingmeasuring capacitors; peak voltage measurementwith capacitor voltage divider; measurement of rmsvalues by electrostatic voltmeters; capacitancevoltage transformer; digital recording.TEXT BOOKBegamudre, R. D., “E.H.V. AC Transmission”, WileyEastern Ltd. 1992REFERENCE BOOKS1. Wadhwa C. L., “High Voltage Engineering”, NewAge international Ltd. 19952. Arrillaga J., “High voltage D.C. Transmission”,Peter Peregrinus Ltd. 19963. Kamaraju V. and Naidu, M. S., “High VoltageEngineering”, Tata McGraw Hill, 19964. Naidu M. S., “High Voltage Engineering”, Tata McGraw Hill, 4 Edition, 20015. Ray Subir, “An Introduction to High VoltageEngineering, Prentice Hall of India, 2008EN-471PROFESSIONAL L T P CrCOMMUNICATION 5 0 0 3OBJECTIVEThe objective of devising this course is to prepare thestudents or this University to be ready to take up theirprofessional job on the completion of this course.Professional communication is essential for the passouts of this University to help them prove their abilities inthe interviews and to utilize their knowledge in active job.1. PRACTICAL ENGLISH: Parts of speech; noun;pronouns; adjective; verb, adverb, propulsion,conjunctional interjection; conjunctionalinterjection; use of articles.2. ADVANCED ENGLISH: Phrasal verbs; reportedspeech; conditional clauses; concord; correct thesentences; question tags; idioms.3. VOCABULARY: Word formation; one wordsubstitution; foreign words; words often confused;homophones; antonyms; synonyms.4. BUSINESS ENGLISH: Importance: businessphrases; emphatic expression; e-mail writing;resume writing; interview techniques; businessletter; covering letter; application job; resignationletter, effective telephone handling.5. PHONETICS: Basic concepts; vowels,consonants; phonemes; syllabus; articulation ofspeech; transcription of words; word stress;Intonation.6. BOOK REVIEW7. MOVIE REVIEWTEXT BOOKRoy A. and Sharma P. L., "English for Students ofEngineering", Orient Longman, 2007The following four lessons are prescribes for textualstudy:1. The Year 20502. Human Environment3. The Discovery4. Grief.REFERENCE BOOKS1. Tickoo M. L. and Subramanian A. E., "IntermediateGrammar, Usage ad Composition", OrientLongman.2. Thomson and Martinet, "A Practical EnglishGrammar”, Oxford University Press3. Hornby, "A.S. Guide to patterns and Usage inEnglish", Oxford University Press4. Balasubramanian T., "A Textbook of EnglishPhonetics for Indian Students", MacMillan5. D. O' Connor J, "Better English Pronunciation",Cambridge University Press, London.6. McCarthy, "English Vocabulary in Use FoundationBooks", Cambridge University Press7. Hashem Abul, "Common Errors in English",Ramesh Publishing House8. Roach P, "English Phonetics & Phonology",Cambridge University Press9. Ramesh M. S. and Pattanshetti C. C., "BusinessCommunication", R. Chand and Company10. Wood F. T., "Remedial English Grammar forForeign Students", The Macmillan Press Ltd., 1975EN-472BUSINESSL T P CrCOMMUNICATION 5 0 0 3OBJECTIVEThe course proposes to help students developcompetence in business and technical communication.It focuses on writing skills and strategies for specificpurposes. The inevitability of introducing this course toEngineering students is embodied in that it hascomparatively a high concentration of certain complexwriting techniques and procedures.1 BUSINESS CORRESPONDENCE: Characteristicsand formats of business letter; quotations, orders,tenders, sales letters, complaints, claim andadjustment letters; credit and collection letters;application; letters for vacant situations withemphasis on resumes and curriculum vitae; e-mailand netiquette- format, style and tone2 BUSINESS REPORTS AND PROPOSALS:Importance; function; pattern and formats ofreports, typical business reports; reportpresentation, and formal reports: proposal formats,writing problem- solving proposals; executivesummery proposals and project proposals3 MEETINGS: Writing of memoranda; notes; agendaand minutes of the meeting.4 PUBLIC RELATIONS AND ADVERTISING90

Lingaya’s University, FaridabadDOCUMENTS: Press releases; public serviceannouncements, advertising strategy and itsobjectives; designing of classified and displayadvertising copies.5 PHONETICS: Vowels; consonants; syllables;transcription; word stress & intonation.6 ESSAY WRITING ON BUSINESS TOPICS-TRADITIONAL & CONTEMPORARY7 BOOK REVIEW/MOVIE REVIEWTEXT BOOKBansal R. K. and Harrison J. B., "Spoken English forIndia", Orient LongmanREFERENCE BOOKS1 Mary Ellen Guffey, “Business Communication:Process & Product”, 4th Edition, South-WesternCollege Publishing, Cincinnati.2 Sharma R. C. and Krishna Mohan, “BusinessCorrespondence and Report Writing”, TataMcGraw Hill3 Ramesh M. S. and Pattanshetti C. C., “EffectiveBusiness English and Correspondence”, R. Chand& Co.4 Shruter C., “Effective Letters in Business byRobert”, Tata McGraw Hill5 Wing F. W. and Anncree D., “English BusinessLetters”, Orient Longman.6 Sarah Freeman, “Written Communication inEnglish”, Orient Longman.7 Leo Jones and Riched Alexander, “InternationalBusiness English”, Cambridge University Press8 Sweet Stephen, “General and Business English”,Sir Issac Pitman & Sons Ltd., London.9 Charles FI. Sides, “How to Write and PresentTechnical Information”, Cambridge UniversityPress10 Susan Stevenson/Stave Whitmore, “Strategies forEngineering Communication”, John Wiley andSons/Replika Press. Pvt. Ltd. Delhi.IT-423INTRODUCTION TO L T P CrE-COMMERCE & ERP 5 0 0 3OBJECTIVETo provide knowledge about the protocols, methods,security issues in electronic commerce as well as aboutenterprise resource planning tools, models andtechniquesPRE-REQUISITESKnowledge of internet and web development, datamining, computer networks, software engineeringPART A1. INTRODUCTION AND CONCEPTS: Networks andcommercial transactions – Internet and othernovelties, networks and electronic transactionstoday; model for commercial transactions; Internetenvironment – internet advantage; world wide weband other internet sales venues; online commercesolutions.2. ELECTRONIC PAYMENT METHODS: Updatingtraditional transactions, secure online transactionmodels; online commercial environments; digitalcurrencies and payment systems; offline secureprocessing; private data networks; securityprotocols; electronic payment systems: digitalpayment systems3. DIGITAL CURRENCIES: Operational process ofDigicash; Ecash Trail; Using Ecash; Smart cards;Electronic Data Interchange: basics, EDI versusInternet and EDI over Internet; Strategies,Techniques and Tools; Shopping techniques andonline selling techniques.PART B4. ERP- AN ENTERPRISE PERSPECTIVE:Production Finance, Personnel disciplines andtheir relationship, Transiting environment, MISIntegration for disciplines, Information/Workflow,Network Structure, Client Server IntegratorSystem, Virtual Enterprise.5. ERP – RESOURCE MANAGEMENTPERSPECTIVE: Functional and Process ofResource; Management; Introduction to basicmodules of ERP System: HRD, Personnelmanagement, training and development; skillinventory, material planning and control, inventory;forecasting; manufacturing; production planning;production scheduling; production control; salesand distribution; finance; resource management inglobal scenario.6. ERP - INFORMATION SYSTEM PERSPECTIVE:Introduction to OLAP (Online Analysis andProcessing), TP, OAS, KBS, MRP, BPR, SCM, REP,CRM, Information Communication Technology.7. ERP-KEY MANAGERIAL ISSUES: ConceptSelling; IT infrastructure; implication of ERPsystems on business organization; critical successfactors in ERP System; ERP Cultureimplementation issues; resistance to change; ERPselection issues; return on investment; pre andpost implementation issues.TEXT BOOKKalakota Ravi and Whinston Andrew, “Frontiers ofElectronic Commerce”, Addison Wesley,1996REFERENCE BOOKS1. V. K. Garg and N. K. Venkita Krishna, “EnterpriseResource Planning – Concepts and Practice”,Prentice Hall of India, 1998,2. Motiwala, “Enterprise Resource & Planning”, 1stedition, Pearson Education3. John Antonio, Fernandez, “The SAP/3 Handbook”,Tata McGraw Hill4. Denial Amor, “The E-Business Revolution”,Addison Wesley5. Sokol, “From EDI to E-Commerce: A BusinessInitiative”, Tata McGraw Hill6. Greenstein and Feinman, “E Commerce”, TataMcGraw Hill7. Rajan and Nag, “E Commerce: The Cutting Edgeof Business”, Tata McGraw Hill8. Jaffrey F. Rayport , Bernard J. Jaworski, “E-Commerces”, Tata McGraw Hill, 20029. Greenstein and Feinman, “Electronic Commerce –Security, Risk Management and Control”, TataMcGraw Hill, 200210. Hendry Chan, Raymond Lee, Tharam Dillon andEllizabeth Cang, “E-Commerce Fundamentals andApplications”, John Wiley.91

B.Tech. Computer Science & Engineering (Regular)11. Efraim Turbon, Jee Lee, David King, H. MichaelChang, “E-Commerce” Wiley VCH, 2004WEB REFERENCES1. www.exforsys.com/tutorials/erp/erp-and-ecommerce.html2. www.bizautomation.com3. itmanagement.earthweb.com/erp4. www.e2-llc.com/e2_ecommerce_erp.aspx5. e-comm.webopedia.com/TERM/e/ERP.htmlIT-443INFORMATION STORAGE & L T P CrMANAGEMENT 5 0 0 3OBJECTIVEUsing a “building block” approach, the ISM curriculumprovides a core understanding of storage technologiesand progresses into system architectures, introductionto networked storage, and introduction to informationavailability. The course provides a comprehensiveintroduction to data storage technology fundamentals.Students will gain knowledge of the core logical andphysical components that make up a storage systemsinfrastructure.PRE-REQUISITESKnowledge of Computer Networks at B Tech level1. INTRODUCTION: Meeting today's data storageneeds - data creation; data creation: individuals,business; categories of data; data storage models;common data storage media and solutions - tapestorage systems, optical data storage, disk basedstorage2. DATA CENTER INFRASTRUCTURE: Example;key requirements of storage systems managementactivities3. STORAGE SYSTEMS ARCHITECTURE: Storagesystem environment; components of a host;connectivity; physical disks; RAID array; diskstorage systems; data flow exercise4. NETWORKED STORAGE: Direct AttachedStorage (DAS), Network Attached Storage (NAS),Fiber Channel Storage Area Network (FC SAN), IPStorage Area Network (IP SAN), ContentAddressed Storage (CAS)5. BUSINESS CONTINUITY: Introduction, overview,backup and recovery, local replication, remotereplication.6. MONITORING AND MANAGING THE DATACENTER: Areas of the data center to monitor;considerations for monitoring the data center;techniques for managing the data center.7. SECURING STORAGE AND STORAGEVIRTUALIZATION: Securing the storageinfrastructure; virtualization technologies.TEXT BOOKOsborne Marc Farley, “Building Storage Networks”,Tata McGraw HillREFERENCE BOOKS1. Spalding Robert, “Storage Networks: TheComplete Reference“, Tata McGraw Hill2. Gupta Meeta, “Storage Area NetworkFundamentals”, Pearson Education Limited3. Kowalski Gerald J. and Maybury Mark T.,“Information Storage & Retrieval Systems Theory& Implementation”, BS Publications4. Thejendra B. S., “Disaster Recovery & BusinessContinuity”, Shroff Publishers & Distributors, EMC– Students KitWEB REFERENCES1. http://www.cs.cmu.edu/~fp/courses/03-312/handouts/18-storage.pdf2. http://www.freedownloadscenter.com/Information_Management/MA-471DISCRETE MATHEMATICSL T P Cr5 0 0 3OBJECTIVETo acquaint the students with the various concepts andtools of applied mathematics which will be very basicand the very soul and guide of computer field.1. SET THEORY: Different types of sets; Setoperations; Classes of sets; Relation; Types ofrelation; Functions; Types of functions andcomposition of functions and relation; Cardinalityand inverse relations; Fuzzy sets; Basic operationsof fuzzy sets.2. BOOLEAN ALGEBRA & LATTICES: Definition ofBoolean algebra; Basic operations of Booleanalgebra; Partially ordered sets; Lattices; SubLattices; Different types of Lattices; Operations onLattices.3. NUMBER THEORY: Basic properties; Divisibilitytheory; Congruences; Chinese remainder theorem;Fermatt's little theorem; τ & μ functions.4. COMBLNATORICES: Fundamental principal ofcounting; Pigeonhole principal; Multinomialcoefficients; Recurrence relation; Generatingfunctions.5. ALGEBRAIC STRUCTURES: Binary operations;Group; Subgroup; Normal subgroup and theirelementary properties; Order of element andgroup; Lagrange's theorem; Rings; Sub ring; Ideal;Integral domain; Field only definition andexamples.6. GRAPH THEORY: Introduction to graphs; Type ofgraphs; Sub graphs and isomorphic graphs;Representation of graphs; Properties of graphs;Euler's formula for planar graph; Eulerian andHamiltonian graph; Ore's theorem.7. TREES: Trees and their properties; Spanning trees;Kruskal's algorithm; Prim's algorithm; Binary tree.TEXT BOOKSarkar S. K., "A Textbook of Discrete Mathematics" 5thEdition, S. Chand PublicationsREFERENCE BOOK1. Liu C. L., "Element of Discrete Mathematics"McGraw Hill.2. Sengadir, "Discrete Mathematics andCombinatorics", Pearson Education.3. Deo, "Graph Theory", Prentice Hall of India.4. Bough R. Johnson, "Discrete Mathematics",Pearson Education.92

Lingaya’s University, FaridabadMA-472ADVANCED HIGHER L T P CrENGINEERINGMATHEMATICS 5 0 0 3OBJECTIVETo acquaint the students with the various concepts andtools of applied mathematics which will be very basic andthe very soul and guide of various engineering subjects.1. SERIES SOLUTION OF DIFFERENTIALEQUATION: Series solution and its validity;General method; Forms of series solution.2 & 3. CALCULUS OF VARIATIONS: Introduction;Functinals; Euler's equation; solutions ofEuler's equation; Geodesies; Isoperimetricproblems; Several dependent variables;Functionals involving higher order derivative;Approximate solution of boundary valueproblems- Rayleigh-Ritz methods; Hamilton'sprinciple; Lagrange's equations.4 & 5. TENSOR ANALYSIS: Introduction;Summation convention; Transformation of coordinates;Tensor of order zero; KroneckerDelta; Contravariant and Co-variant tensors;Quotient law; Riemannian space; Conjugatetensor; Christoffel symbols; Transformation ofChristoffel symbol; Covariant differentiation ofa covariant tensors; Covariant differentiation ofa contravariant tensors.6 & 7. INTEGRAL EQUATIONS: Definition andclassification of integral equations; Conversionof a linear differential equation to an integralequation and vice versa; Voltera Integralequations, solution of integral equation byresolvent Kernel, Method of successiveapproximation, Euler integrals, VolterraIntegral equation of the first kind, Fredholmequation of second kind.TEXT BOOKGrewal B. S., “Higher Engineering Mathematics”, 38thEdition, Khanna Publisher, 2005REFERENCE BOOKS1. Wylie C. Ray and Barrett Louis.C., "AdvancedEngg. Mathematics", McGraw Hill2. Sastry S. S., "Engineering Mathematics”, IllrdEdition, Prentice Hall of India, 19943. Jerri Abdul J., "Introduction of Integral Equationwith Application", Wiley-Interscience; 2nd Edition,19994. Debnath Lokenath, "Integral Transforms and theirApplications", 2nd Edition, Chapman & Hall, 20075. Weatherburn, “Tensor Calculus", CambridgeUniversity Press, 20086. Kreyszig E., "Advanced Engineering Mathematics",9th Edition, John Wiley, 2006MA-473ADVANCED NUMERICAL L T P CrTECHNIQUES 5 0 0 3OBJECTIVETo acquaint the students with the various concepts andtools of applied mathematics which will be very basicand the very soul and guide of various engineeringsubjects.1. EIGEN VALUE PROBLEMS: Eigen valuesand eigen vectors; Power methods: Jacobi'smethods; Given's methods; House-holder'smethods.2 & 3. DIFFERENCE EQUATIONS: Introduction;formation of difference equations;complementary function; particular integral;difference equations reducible to linear form;simultaneous difference equations and itsapplications.4. PARABOLIC PARTIAL DIFFERENTIALEQUATION: Transient heat flow equation; theexplicit method; Crank-Nicolson method;parabolic equation in two or three dimension;finite elements for heat flow.5. HYPERBOLIC PARTIAL DIFFERENTIALEQUATION: The wave equation; solving thewave equation by finite differences;comparison to the d'Alembert solution; methodof characteristics; the wave equation in 2-D;finite elements and the wave equation.6. APPROXIMATION OF FUNCTION:Chebyshev polynomials; economized powerseries; approximation with rational functions;Fourier series; getting Fourier co efficientnumerically and fast Fourier transform.7. APPLICATION IN ENGINEERING FIELD:Application of Gaussian quadrature inevaluating stiffness and stress matrices for 2Dand 3D elements.TEXT BOOKCurtis F, Gerald and Patrick, "Applied NumericalAnalysis", 7th Edition, Wheatley SolutionREFERENCE BOOKS1. Balagurusamy E., "Numerical Methods", TataMcGraw Hill2. Sastry S. S., "Introductory Methods of NumericalAnalysis", Prentice Hall of India3. Jain M. K., Iyenger S. R. K. and Jain R. K.,"Numerical Methods for Scientific and Engg.Computations" by - Wiley Eastire Ltd.4. Rao S. S., “The Finite Element Method in Engg.”,Pregamon Press/McGraw Hill, 1989MA-474OPERATION RESEARCHL T P Cr5 0 0 3OBJECTIVEThe aim of the topic is to provide a common platform forthe Engineers, Scientists along with people frommanagement, industry & defence sector. This topic alsoprovides how to get optimal solution in above said branch.1. LINEAR PROGRAMMING: Linear programmingmodeling and examples; resolution of degeneracy;duality theory; dual-simplex and primal-dualalgorithms; transportation; assignment problems;sensitivity analysis; industrial applications of linearprogramming like product mix problems; blendingproblems; optimal allocation of resources, etc.2. INTEGER PROGRAMMING, GOELPROGRAMMING & MULTICRITERIA DECISIONMAKING: Formulation of various industrial problems93

B.Tech. Computer Science & Engineering (Regular)as integer and mixed integer programmingproblems; branch and bound algorithm; cutting planemethods for pure and mixed integer programmingproblems; Knap-sack; travelling salesman andshortest route problems. multicriteria decision;multicriteria decision making models; determinationof set of feasible alternatives; solution techniques;goal programming approach; goal programmingmodels; ranking and weighting of multiple goals;simplex method in goal programming.3. NON-LINEAR PROGRAMMING: Constraintqualification and Kuhn-Tucker necessaryconditions; sufficiency of Kuhn-Tucker necessaryconditions and convex programs; LinearComplementarity Problem (LCP); Quadraticprogramming and use of LCP for solving quadraticprogramming problems.4. SEQUENING MODEL: Two machine and n jobs(no passing) problem and three machine and njobs (no passing) problems; different routing; 2 jobsand m machines; n jobs and m machines; branchand bound algorithms.5. QUEING THEORY & INVENTARY CONTROL:Introduction to waiting line models? steady statebehavior of M/M/1 and M/M/C queues-the problemof machine interference and use of finite queuingtables- introduction to M/G/1, and G/M/1 .inventorycontrol problem; Concept of inventory and variouscosts; EQQ formula newspaper boy problems.6. PERT/CPM: Introduction to network analysis;Definition of a project; job and events; drawing ofarrow diagrams; determination of critical paths andcalculation o floats; resource allocation and leastcost planning; use of network flows for least costplanning; uncertain duration and PERT.7. STOCHASTIC PROGRAMMING: Stochasticprogramming with one objective function;stochastic linear programming; two stageprogramming technique; chance constrainedprogramming technique.TEXT BOOKTaha H. A., "Operations Research: An Introduction",Macmillan, N.Y.REFERENCE BOOK1. Hitter F. S. and Lieberman G. J., “Introduction toOperations Research", Addison Wesley.2. Hadley G., “Linear Programming", Addison Wesley.3. Dantzig G., “Linear Programming and Extensions",Princeton, N.J.4. Fletcher R., "Practical Methods of ConstrainedOptimization", John Wiley.5. Bazaraa M. S., Jervis J. J. and Sherali H. D., “LinearProgramming & Network Flows", John Wiiey.ME-442ERGONOMICSL T P Cr5 0 0 3OBJECTIVEThe course provides knowledge of ergonomicsprinciples so that the students are able to visualizefactors which affect the efficiency of human beings.After the study of the subject, the students will be ableto select a proper design of display controls,equipment, work plan and environment1. INTRODUCTION: Definition of ergonomics andergonomist; social and economic values ofergonomics; general and individual ergonomics.2. POSTURE AND MOVEMENT: Biomechanical;physiological and anthropometric background;postures; sitting and standing; Movement – lifting;carrying; pulling and pushing; Workplace designand assessment.3. INFORMATION AND OPERATION: User;information – visual; hearing and other senses;Control for operation – fixed and others diaguesuser friendliness; different forms and help; Websitedesign; mobile interaction; virtual reality.4. ENVIRONMENTAL FACTORS: Noise reduction;hearing conservation; Vibration prevention;illumination – light intensity; brightness differences;colour of light; Climate – heat and cold; Chemicalsubstances – measures; ventilation.5. WORK ORGANISATION JOBS & TASKS: Tasks;jobs; work organization – flexible; autonomousgroups; coaching measurement styles.6. ERGONOMIC APPROACH: Project management– initiative phase; problem identification phase;selection of solution phase; implementation phase;evaluation phase.7. CASE STUDIES: A set of case studies will beused to demonstrate how ergonomics had lead tochanges in work activity; safety and productdesign; Case studies will include advancedcomputer application; work place assessment;accidents; analysis and industrial inspection.TEXT BOOKJan Dul and Bernard Weerdancester, “Ergonomics forBeginners”, CRC Press/Taylor and Francis GroupREFERENCE BOOKS1. Knoz Stephana, Johnson Steven, Halconts “WorkDesign - Industrial Ergonomics”, Hathway,Scottsdagta, AZ2. Sanders M. S. and McCormic E. J., “HumanFactors in Engineering and Design”, McGraw HillNew York3. Verma A. P., “Industrial Engineering”, S. K. Katariaand SonsME-443FINITE ELEMENT L T P CrANALYSIS 5 0 0 3OBJECTIVEThe objective of the course is to teach thefundamentals of finite element method of solids;structures and fluids with emphasis on the underlyingtheory, assumptions, and modeling issues as well asproviding hands on experience using finite elementsoftware to model, analyze and design systems ofrelevance to mechanical engineering. This includes thetheoretical foundations and appropriate use of finiteelement methods.1. INTRODUCTION - VARIATIONALFORMULATION: General field problems inEngineering; Modeling; Discrete and Continuousmodels; Characteristics; Difficulties involved in94

Lingaya’s University, Faridabadsolution; The relevance and place of finite elementmethod; Historical comments; Basic concept ofFEM; Boundary and initial value problems;Gradient and divergence theorems; Functional;Variational calculus; Variational formulation ofVBPS; The method of weighted residuals; The Ritzmethod.2. FINITE ELEMENT ANALYSIS OF ONEDIMENSIONAL PROBLEMS: 1D second orderequations; discretisation of domain into elements;Generalised coordinates approach; derivation ofelements equations; assembly of elementequations; imposition of boundary conditions;solution of equations; Cholesky method; Postprocessing.3. EXTENSION OF THE METHOD TO FOURTHORDER EQUATIONS AND THEIR SOLUTIONS:time dependant problems and their solutions;example from heat transfer; fluid flow and solidmechanics.4. FINITE ELEMENT ANALYSIS OF TWODIMENSIONAL PROBLEMS: Second orderequations involving a scalar; valued function;model equation; Variational formulation – Finiteelement formulation through generalisedcoordinates approach; Triangular elements andquadrilateral elements ; convergence criteria forchosen models; Interpolation functions; Elementsmatrices and vectors; Assembly of elementmatrices; boundary conditions; solutiontechniques.5. ISOPARAMETRIC ELEMENTS ANDFORMULATION: Natural coordinates in 1, 2and 3 dimensions; use of area coordinates fortriangular elements in; 2 dimensional problems;Isoparametric elements in 1, 2 and 3 dimensions;Largrangean and serendipity elements;Formulation of element equations in one and twodimensions ; Numerical integration.6. APPLICATIONS TO FIELD PROBLEMS IN TWODIMENSIONS: Equations of elasticity; planeelasticity problems; axisymmetric problems inelasticity; Bending of elastic plates; Timedependent problems in elasticity; Heat transfer intwo dimensions; Incompressible fluid flow andrelated problems.7. INTRODUCTION TO ADVANCED TOPICS (NOTFOR EXAMINATION PURPOSES): Threedimensional problems; Mixed formulation; use ofsoftware packages.TEXT BOOKReddy J. N., “An Introduction to Finite ElementMethod”, McGraw Hill, Intl Student EditionREFERENCE BOOKS1 Zienkiewitch, "The Finite Element Method; BasicFormulation and Linear Problems", Vol 1, 4thEdition, McGraw Hill2 Desai C. S. and Abel J. F., "Introduction to theFinite Element Method", Affiliated East west Press,19723 Rao S. S., “The Finite Element Method inEngineering”, Pergaman Press, 1989ME-461RENEWABLE L T P CrSOURCES OF ENERGY 5 0 0 3OBJECTIVEThis gives the knowledge of estimation; conversion andutilization of non conventional sources of energy. Withthe depletion of fossil fuel sources, the importance ofnon-conventional renewable sources of energy hasgained tremendous importance. This courseintroduces the students to these sources and howthese can be utilized for power production.1 INTRODUCTION: Trends of energy consumption;sources of energy; conventional and Renewable;fossil fuel; availability and limitations; need todevelop new energy sources.2 SOLAR ENERGY: Solar radiation characteristicsand estimation; Solar Collectors; Flat Plate andconcentrating types; Their comparative study;design and material selection; Efficiency; Selectivepaints and surfaces; Heating of air and water forbuilding and other Uses; Thermal storages; SolarPonds; Solar pumps; solar Power; Solar Cookersetc; Direct Conversion of Solar energy to electricityand its various uses; materials; limitations andCosts.3 BIO-CONVERSION: Generation of bio-gas;digesters and their design; selection of material;feed to digester; paralytic gasification; productionof hydrogen; Algae production and their uses.4 WIND ENERGY: Types of rotors; horizontal axisand vertical axis systems; system design and siteselection.5 GEO-THERMAL ENERGY: Sites; potentiality andlimitation; study of different conversion systems.6 TIDAL ENERGY: Sites; potentiality and possibilityof harnessing from site; limitations; Ocean ThermalEnergy: Principle of utilization and its limitations;description of various systems.7 OTHER NON-CONVENTIONAL ENERGYSOURCES: Fluidized bed combustions; heat fromwaste and other sources.TEXT BOOKTiwari G. N. and Ghosal M. K., “Renewable EnergyResources”, Narosa Publishing HouseREFERENCE BOOKS1. Rai G. D., “Solar Energy Utilization”, KhannaPublishers, 19952. Duffie J. A. and Beckman, “Solar Heating andCooling”3. Wakil M. M, EL, “Power Plant Technology”,McGraw Hill4. Sharma P. C., “Power Plant Engineering”, S. K.Kataria and SonsPH-471NON DESTRUCTIVE L T P CrTESTING TECHNIQUES 5 0 0 3OBJECTIVETo give a general overview of novel non destructivetesting methods, the principles behind them, their uses,the advantages and limitations, both in application anddefect detection capability.95

B.Tech. Computer Science & Engineering (Regular)1. NON-DESTRUCTIVE TESTING: Non-destructivetesting (NDT): role, components and advantages;common NDT techniques.2. ULTRASONIC TESTING: ultrasonic flawdetection: principle, working and applications,advantages and limitations.3. RADIOGRAPHY: X-ray radiography, Gamma myradiography and Neutron radiography; principle,working and applications, advantages andlimitations.4. EDDY CURRENT TESTING: Principle, workingand applications of eddy current testing; probesand sensors; testing procedures, applications,advantages and imitations.5. MAGNETIC TESTING: Magnetic testing: particle,flux leakage testing; magnetization methods;detectables. applications and imitations,6. DYE PENETRANT TESTING: Principle, workingand applications of dye penetrant testing,advantages and limitations.7. VISUAL AND OPTICAL TESTING: Principle, workhgand applications of holography, optical interferencetechniques, advantages and limitations.TEXT BOOKBaldev Raj, Jayakumar T., and Thavasimuthu M.,“Practical Non-Destructive Testing”, Narosa Publishing,1997REFERENCE BOOKS1. Suryanarayana C., “Testing of Metallic Materials”,Prentice Hall of India, 19792. American Society for Metals, “Metals Hand Book(Mechanical Testing)”, Volume VIII, AmericanSociety for Metals, 19883. Rolfe T. and Barson J., “Fracture and FatigueControl and Structure - Application of FractureMechanics”, Prentice Hall, 19774. Halmshaw R, “Non-Destructive Testing”, EdwardArnold, 19895. Hull, “Non-Destructive Testing”, ELBS Edition,1991.6. Das A. K., “Metallurgy of Failure Analysis”, JMH,1992.PH-472NANO TECHNOLOGYL T P Cr5 0 0 3OBJECTIVEThe goal is to teach students some basicnanoscience/hanotechnology. Students are expectedto learn both some basic science and technology.Students from all branches are encouraged to take(his course. In addition, students are expected toassist each other in teaming and discussing thecontent and die context, and to maintain respect forthe scientific approach.1. NANOMATERIALS: Introduction to nanomaterials;nano-scale in one dimension: thin films,layers and surfaces, nanoscale in twodimensions: carbon nano-tubes; inorganic nanotubes,nano-wires, biopolymers; nano-scale inthree dimensions: nano-particles, fullerences(Carbon 60), dendrimers, quantum dots2. NANOMETROLOGY: Introduction tonanometrology; length measurement; forcemeasurement; measurement of single molecules;applications of metrology.3. ELECTRONICS, OPTOELECTRONICS ANDINFORMATION AND COMMUNICATIONTECHNOLOGY: Introduction to electronics;optoelectronics and information andcommunication technology; nanoscience inelectronics, opto-electronics and information andcommunication technology; currentapplications: computer chips, informationstorage, opto-electronics; applications anticipatedin the future: sensors.4. NANO-BIOTECHNOLOGY ANDNANOMEDICINE: introduction to nanobiotechnologyand nano-medicine, nano-sciencein nano-biotechnology and nano-medicine,current and future applications arraytechnologies, drug delivery, drug discovery,medical imaging, nano-technologies and cancertreatment, implants and Prosthetics.5. NANOFABRICATION: Lithographic techniquesfor nano-printing; nano-manipulation techniques,self assembly.6. SYNTHESIS AND CHARACTERIZATION:Metallic, semiconducting, magnetic and carbonbased nano structures, nanocomposites andbiological nanomaterials.7. APPLICATIONS OF NANOMATERIALS:Sunscreens and cosmetics, composites, clays.coatings and surfaces, tougher and harder cuttingtoots, paints; remediation, fuel ceils; displays,batteries, fuel additives, catalysts; carbonnanotube composites; lubricants, magneticmaterials; medical implants; machinableceramics, water purification, military battle suits.TEXT BOOKPoole Charles P. and Owens Frank J., “Introduction toNanotechnology”, Wiley lnterscience, 2003REFERENCE BOOKS1. Rainer Waser, “Nanoelectronics and InformationTechnology: Advanced Electronic Materials andNovel Devices”, Wiley VCH, 20032. Wang Z. L., “Characterization of NanophaseMaterials”, Wiley-VCH, 20013. Edelstein A. S. and Cammamm R. C.,“Nanomaterials: Synthesis, Properties andApplications”, IOP (UK), 19964. Heinzel T., “Mesoscopic Electronics in Solid StateNanostructures”, Wiley-VCH, 2003PH-473LASER TECHNOLOGYL T P Cr5 0 0 3OBJECTIVETo give a general overview of fundamentals of Laser,Laser production techniques and applications.1. CONDITIONS: Conditions for producing laser,concept of coherence - spatial and temporal,population inversions2. GROWTH FACTOR: Einstein coefficients, gain96

Lingaya’s University, Faridabadand gain saturation, saturation intensity,development and growth of a laser beam,exponential growth factor, threshold requirementfor a laser.3. NORMAL INVERSION: Inversions and two levelsystems, steady state inversions,4. POPULATION INVERSION: Three and four levelsystems, transient population inversions, factorseffecting population inversion, laser Amplifiers.5. EXCITATION AND PUMPING: Excitation orpumping threshold requirements, pumpingpathway and specific excitation parametersassociated with optical and particle pumping.6. TYPES OF LASERS: Helium-Neon Laser, CO 2Laser, Ruby Laser, Semiconductor diode laser.7. LASER SPECTROSCOPY: Introduction andapplicationsTEXT BOOKSilfvast William T., “Laser Fundamentals”, CambridgeUniversity PressREFERENCE BOOKS1. Beynon John, “Introductory University Optics”,Prentice Hall of India.2. Ghatak A. K., “Optics”, Tata McGraw Hill.* * * * * *97

B.Tech. Computer Science & Engineering (Regular)NOTES……………………………………………………………………………………………………………………………………….……………………………………………………………………………………………………………………………………….……………………………………………………………………………………………………………………………………….……………………………………………………………………………………………………………………………………….……………………………………………………………………………………………………………………………………….……………………………………………………………………………………………………………………………………….……………………………………………………………………………………………………………………………………….……………………………………………………………………………………………………………………………………….……………………………………………………………………………………………………………………………………….……………………………………………………………………………………………………………………………………….……………………………………………………………………………………………………………………………………….……………………………………………………………………………………………………………………………………….……………………………………………………………………………………………………………………………………….……………………………………………………………………………………………………………………………………….……………………………………………………………………………………………………………………………………….……………………………………………………………………………………………………………………………………….……………………………………………………………………………………………………………………………………….……………………………………………………………………………………………………………………………………….……………………………………………………………………………………………………………………………………….……………………………………………………………………………………………………………………………………….……………………………………………………………………………………………………………………………………….……………………………………………………………………………………………………………………………………….……………………………………………………………………………………………………………………………………….……………………………………………………………………………………………………………………………………….……………………………………………………………………………………………………………………………………….……………………………………………………………………………………………………………………………………….……………………………………………………………………………………………………………………………………….……………………………………………………………………………………………………………………………………….……………………………………………………………………………………………………………………………………….……………………………………………………………………………………………………………………………………….……………………………………………………………………………………………………………………………………….……………………………………………………………………………………………………………………………………….……………………………………………………………………………………………………………………………………….……………………………………………………………………………………………………………………………………….……………………………………………………………………………………………………………………………………….……………………………………………………………………………………………………………………………………….……………………………………………………………………………………………………………………………………….……………………………………………………………………………………………………………………………………….……………………………………………………………………………………………………………………………………….98

Lingaya’s University, Faridabad99