Dr.

AmbedkarInstituteofTechnology
(AnAutonomousInstitutionaffiliatedtoVTU,Belgaum)

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING 5 & 6 SEMESTER SYLLABUS 2011-12

TH TH

Dr.AmbedkarInstituteofTechnology
(AnAutonomousInstitutionaffiliatedtoVTU,Belgaum)

DepartmentofComputerScience&Engineering

CONTENTSHEET
Sl.No 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 2 Content VSemesterScheme VISemesterScheme SoftwareEngineering SystemsSoftware OperatingSystem DatabaseManagementSystem ComputerNetworksI FormalLanguagesandAutomataTheory DatabaseApplicationLaboratory SystemsSoftwareandOperatingSystemsLaboratory ManagementandEntrepreneurship UnixSystemsProgramming CompilerDesign ComputerNetworksII ComputerGraphicsandVisualization ElectiveI(GroupA)OperationResearch ComputerGraphicsandVisualizationLaboratory UnixSystemsProgrammingandCompilerDesign Laboratory PageNo 3 3 5 6 7 8 9 10 11 13 16 17 18 19 21 22 23 24

Dr.AmbedkarInstituteofTechnology
(AnAutonomousInstitutionaffiliatedtoVTU,Belgaum)

DepartmentofComputerScience&Engineering

FifthSemester201112
Sl. No 1. 2. 3. 4. 5. 6. 7. 8. SubjectTitle SoftwareEngineering SystemsSoftware OperatingSystem DatabaseManagementSystem ComputerNetworksI FormalLanguagesandAutomataTheory DatabaseApplicationLaboratory SystemsSoftwareandOperatingSystems Laboratory TOTAL Subject Code CS51 CS52 CS53 CS54 CS55 CS56 CSL57 CSL58 No.of Credits 3:0:0 4:0:0 4:0:0 4:0:0 4:0:0 4:0:0 0:0:1 0:0:1 25

SixthSemester201112
Sl. No 1. 2. 3. 4. 5. 6. 7. 8. 3 SubjectTitle ManagementandEntrepreneurship UnixSystemsProgramming CompilerDesign ComputerNetworksII ComputerGraphicsandVisualization ElectiveI(GroupA)OperationResearch ComputerGraphicsandVisualization Laboratory UnixSystemsProgrammingand CompilerDesignLaboratory TOTAL Subject Code CS61 CS62 CS63 CS64 CS65 CS66 CSL67 CSL68 No.of Credits 3:0:0 3:0:0 4:0:0 4:0:0 4:0:0 4:0:0 0:0:1 0:0:1 24

Dr. AMBEDKAR INSTITUTE OF TECHNOLOGY

AIDED BY GOVERNMENT OF KARNATAKA & AUTONOMOUS INSTITUTION AFFILIATED TO VTU

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING 5 SEMESTER SYLLABUS

TH

Subject:SOFTWAREENGINEERING SubCode:CS51 ExamDuration:3hours NoofCredits:4:0:0 ExamMarks:100 UNIT No SyllabusContent Overview:Introduction:FAQ'saboutsoftwareengineering,Professionalandethicalresponsibility. SocioTechnicalsystems:Emergentsystemproperties;Systemsengineering;Legacysystems. Critical Systems, Software Processes: Critical Systems: A simple safetycritical system; System dependability;Availabilityandreliability. Software Processes: Models, Process iteration, Process activities; The Rational Unified Process; ComputerAidedSoftwareEngineering. Requirements: Software Requirements: Functional and Nonfunctional requirements; User requirements; System requirements; Interface specification; The software requirements document. Requirements Engineering Processes: Feasibility studies; Requirements elicitation and analysis; Requirementsvalidation;Requirementsmanagement. System models: SystemModels:Contextmodels;Behavioralmodels;Datamodels;Objectmodels; Structuredmethods. Software Design: Architectural Design: Architectural design decisions; System organization; Modulardecompositionstyles;Controlstyles. ObjectOriented design: Objects and Object Classes; An ObjectOriented design process; Design evolution. Development: Rapid Software Development: Agile methods; Extreme programming; Rapid applicationdevelopment,SoftwarePrototyping. Software Evolution: Program evolution dynamics; Software maintenance; Evolution processes; Legacysystemevolution. Verification and Validation: Verification and Validation: Planning; Software inspections; Automatedstaticanalysis;Verificationandformalmethods. Softwaretesting:Systemtesting;Componenttesting;Testcasedesign;Testautomation. Management: Managing People: Selecting staff; Motivating people; Managing people; The People CapabilityMaturityModel. Noof Hours Nooflecturehours/week:4

11

10

11

10

5.

10

TextBooks: 1. IanSommerville:SoftwareEngineering,8thEdition,PearsonEducation,2007. (Chapters:1,2,3,4,6,7,8,11,14,17,21,22,23,25) ReferenceBooks: 1. Roger.S.Pressman:SoftwareEngineeringAPractitionersapproach,7thEdition,McGrawHill,2007. 2. PankajJalote:AnIntegratedApproachtoSoftwareEngineering,3rdEdition,NarosaPublishingHouse, 2005.

Subject:SYSTEMSSOFTWARE SubCode:CS52 ExamDuration:3Hours Unit No 1 No.ofCredits:400 ExamMarks:100 No.ofLectureHours/week:04

SyllabusContent Machine Architecture: Introduction, System Software and Machine Architecture, Simplified Instructional Computer (SIC) SIC Machine Architecture, SIC/XE Machine Architecture, SIC ProgrammingExamples. Editors and Debugging Systems:Text Editors Overview of Editing Process, User Interface, Editor Structure, Interactive Debugging Systems Debugging Functions and Capabilities, Relationship With OtherPartsOfTheSystem,UserInterfaceCriteria. Assemblers: Basic Assembler Function A Simple SIC Assembler, Assembler Algorithm and Data Structures, Machine Dependent Assembler Features Instruction Formats & Addressing Modes, Program Relocation. Machine Independent Assembler Features Literals, SymbolDefinition Statements, Expression, Program Blocks, Control Sections and Programming Linking, Assembler Design Operations OnePass Assembler, MultiPass Assembler, Implementation Examples MASM Assembler. Loaders and Linkers: Basic Loader Functions Design of an Absolute Loader, A Simple Bootstrap Loader, MachineDependent Loader Features Relocation, Program Linking, Algorithm and Data Structures for a Linking Loader; MachineIndependent Loader Features Automatic Library Search, Loader Options, Loader Design Options Linkage Editor, Dynamic Linkage, Bootstrap Loaders, ImplementationExamplesMSDOSLinker. Macro Processor: Basic Macro Processor Functions Macro Definitions and Expansion, Macro Processor Algorithm and Data Structures, MachineIndependent Macro Processor Features Concatenation of Macro Parameters, Generation of Unique Labels, Conditional Macro Expansion, KeywordMacroParameters,MacroProcessorDesignOptionsRecursiveMacroExpansion,General Purpose Macro Processors, Macro Processing Within Language Translators, Implementation ExamplesMASMMacroProcessor. Lex and Yacc: LexandYaccTheSimplestLexProgram,Grammars,ParserLexerCommunication,A YACC Parser, The Rules Section, Running LEX and YACC, LEX, Using LEX Regular Expression, Examples of RegularExpressions, AWord Counting Program, Parsing a Command Line. Using YACC Grammars, Recursive Rules, Shift/Reduce Parsing, What YACC Cannot Parse, A YACC Parser The DefinitionSection,TheRulesSection,SymbolValuesandActions,TheLEXER,CompilingandRunning aSimpleParser,ArithmeticExpressionsandAmbiguity,VariablesandTypedTokens.

No.of Hours 10

12

10

10

10

TextBook:

1. Leland.L.Beck:SystemSoftware,3rdEdition,AddisonWesley,1997. (Chapters1.1to1.3,2(except2.5.2and2.5.3),3(except3.5.2and3.5.3),4(except4.4.3)) 2. John.R.Levine,TonyMasonandDougBrown:LexandYacc,O'Reilly,SPD,1998. (Chapters1,2(Page242),3(Page5165))

Subject:OPERATINGSYSTEM SubCode:CS53 ExamDuration:3Hours Unit No 1 No.ofCredits:400 ExamMarks:100 No.ofLectureHours/week:04

SyllabusContent IntroductiontoOperatingSystems,Systemstructures:Whatoperating systemsdo;ComputerSystem organization; Computer System architecture; Operating System structure; Operating System operations; Process Management; Memory management; Storage management; Protection and security; Distributed system; Specialpurpose systems; Computing environments. Operating System Services; User Operating System interface; System calls; Types of system calls; System programs; Operating System design and implementation; Operating System structure; Virtual machines; Process Management: Process concept; Process scheduling; Operations on processes; Interprocess communication. MultiThreaded Programming: Overview; Multithreading models; Thread Libraries; Threadingissues. Continuation of Process Management: Process Scheduling: Basic concepts; Scheduling criteria; Schedulingalgorithms;MultipleProcessorscheduling; Process Synchronization: Synchronization: The Critical section problem; Petersons solution; Synchronizationhardware;Semaphores;Classicalproblemsofsynchronization;Monitors. Deadlocks: Deadlocks: System model; Deadlock characterization; Methods for handling deadlocks; Deadlockprevention;Deadlockavoidance;Deadlockdetectionandrecoveryfromdeadlock. Memory Management: Memory Management Strategies: Background; Swapping; Contiguous memory allocation; Paging; Structure of page table; Segmentation. Continuation of Memory Management: VirtualMemoryManagement:Background;Demandpaging; Pagereplacement;Allocationofframes;Thrashing. File System, Implementation of File System: File System: File concept; Access methods; Directory structure; File system mounting; File sharing; Protection. Implementing File System: File system structure; File system implementation; Directory implementation; Allocation methods; Free space management Secondary Storage Structures, Protection: Mass storage structures; Disk structure; Disk attachment; Disk scheduling; Disk management; Swap space management. Protection: Goals of protection, Principlesofprotection,Domainofprotection,Accessmatrix,Implementationofaccessmatrix. Case Study: The Linux Operating System: Linux history; Design principles; Kernel modules; Process management; Scheduling; Memory management; File systems, Input and output; Interprocess communication.

No.of Hours 11

10

10

10

11

TextBook: 1. AbrahamSilberschatz,PeterBaerGalvin,GregGagne:OperatingSystemPrinciples,8thedition,Wiley India,2009. ReferenceBooks: 1.D.MDhamdhere:OperatingsystemsAconceptbasedApproach,2ndEdition,TataMcGrawHill,2002. 2.P.C.P.Bhatt:IntroductiontoOperatingSystems:ConceptsandPractice,2ndEdition,PHI,2008. 3.HarveyMDeital:Operatingsystems,3rdEdition,PearsonEducation,1990.

Subject:DATABASEMANAGEMENTSYSTEM SubCode:CS54 ExamDuration:3hours UNITNo 1 NoofCredits:4:0:0 ExamMarks:100 SyllabusContent Introduction Introduction; An example; Characteristics of Database approach; Actors on the Screen; workers behind the scene; Advantages of using DBMS approach; A brief history of database applications; when not to use a DBMS. Data models, schemas and instances; three schema architecture and data independence; Database languages and interfaces; The database system environment; Centralized and clientserver architectures; Classification of Database management systems. EntityRelationship model; using High Level conceptual Data Models for database Design; An example Database Application; Entity types, Entity Sets, Attributes and Keys; Relationship types, Relationship Sets, Roles and structural Constraints; Weak Entity types; Refining the ER Design; ER Diagrams, NamingConventionsandDesignissues;Relationshiptypesofdegreehigherthantwo. RelationalModelandRelationalAlgebra Relational Model Concepts; relational Model constraints and Relational Database Schemas; update operations, Transactions and dealing with constraint violations; Unary Relational Operations; SELECT and PROJECT; RELATIONAL Algebra Operations from Set Theory;BinaryRelationalOperations:JOINandDIVISION;AdditionalRelationalOperations; Examples of Queries in Relational Algebra; Relational Database Design Using ERto Relationalmapping. SQL Specifying basic constraints in SQL; schema change statements in SQL; Basic queries in SQL; More complex SQL queriesInsert, Delete and Update statements in SQL; Specifying constraints as Assertion and Trigger; Views(Virtual Tables) in SQL; Additional features of SQL;Databaseprogrammingissuesandtechniques;EmbeddedSQL,DynamicSQL DatabaseDesign Informal Design Guidelines for Relation Schemas; Functional Dependencies; Normal Forms Based on Primary Keys; General Definitions of Second and Third Normal Forms; BoyceCodd Normal form, Properties of Relational Decompositions; Algorithms for relationalDatabaseSchemaDesign;MultivaluedDependenciesandFourthNormalForm; Join Dependencies and Fifth Normal Form; Inclusion Dependencies; Other Dependencies andNormalForms. TransactionManagement Transaction and System Concepts, Desirable Properties of Transactions, characterizing schedulesbasedonRecoverability,CharacterizingschedulesbasedonSerializability.Two Phase Locking Techniques for Concurrency Control, Concurrency Control based on Timestamp ordering, Recovery Concepts, Recovery Techniques based on deferred update, Recovery techniques based on Immediate Update; Shadow Paging. The ARIES RecoveryAlgorithm,DatabaseBackupandRecoveryfromCatastrophicFailures NoofHours 10 Nooflecturehours/week:4

11

11

10

10

TextBook 1.FundamentalofDatabaseSystemsbyElmasriandNavathe,5thEdition,AddisonWesley,2007. ReferenceBooks: 1.DataBasesystemConceptsbySilberschatz,KorthandSudharshan,5theditionmcgrawHill,2006 2. An Introduction to Database Systems by C.J. Date, A.Kannan, S.Swamynathan, 8th Edition, Pearson Education, 2006. 3.DatabaseManagementSystemsbyRaghuRamakrishnanandJohannesGehrke3rdEdition,McGrawHill,2003.

Subject:COMPUTERNETWORKSI SubCode:CS55 No.ofCredits:400 ExamDuration:3Hours ExamMarks:100 Unit SyllabusContent No 1 Introduction: Data Communications, Networks, Layered Tasks, The OSI model, Layers in OSI model, TCP/IPProtocolsuite,Addressing. Physical Layer1: Analog & Digital Signals, Transmission Impairment, Data Rate limits, Performance, Digitaldigital conversion (Only Line coding: Polar, Bipolar and Manchester coding), Analogtodigital conversion(onlyPCM),Digitaltoanalogconversion. 2 Physical Layer2 and Switching: Multiplexing, Introduction to switching, Circuit Switched Networks, DatagramNetworks,VirtualCircuitNetworks. Data Link Layer1: Error Detection & Correction: Introduction ,Linear block codes, Cyclic codes, Checksum. 3 Data Link Layer2: Framing, Noiseless Channels, Noisy channels, HDLC, PPP (Framing, Transition phasesonly) 4 Multiple Access & Ethernet: Random access, Controlled Access, Channelization, Ethernet:, Standard Ethernet,Changesinthestandard,FastEthernet,GigabitEthernet 5 Network Layer: Introduction, Logical addressing, IPv4 addresses, IPv6 addresses, and IPv4, IPv6, ComparisonofIPv4andIPv6Headers. No.ofLectureHours/week:04

No.of Hours 11

11

10 10

10

TextBooks: 1.BehrouzA.Forouzan,:DataCommunicationandNetworking,4thEditionTataMcGrawHill,2006. ReferenceBooks: 1. Alberto LeonGarcia and Indra Widjaja: Communication Networks Fundamental Concepts and Key architectures,2ndEditionTataMcGrawHill,2004. 2.WilliamStallings:DataandComputerCommunication,8thEdition,PearsonEducation,2007. 3.LarryL.PetersonandBruceS.Davie:ComputerNetworksASystemsApproach,4thEdition,Elsevier,2007. 4.NaderF.Mir:ComputerandCommunicationNetworks,PearsonEducation,2007.

Subject:FINITEAUTOMATAANDFORMALLANGUAGES SubCode:CS56 ExamDuration:3Hours Unit No 1 No.ofCredits:400 ExamMarks:100 No.ofLectureHours/week:04

SyllabusContent

Introduction to Finite Automata: Introduction to Finite Automata; The central concepts of Automata theory; Deterministic finite automata; Nondeterministic finite automata An application of finite automata; Finite Automata, Regular Expressions: Finite automata with Epsilontransitions; Regular expressions; FiniteAutomataandRegularExpressions;ApplicationsofRegularExpressions 2 Regular Languages, Properties of Regular Languages: Regularlanguages;Provinglanguagesnottobe regular languages; Closure properties of regular languages; Decision properties of regular languages; Equivalenceandminimizationofautomata 3 ContextFreeGrammarsAndLanguages : Context free grammars; Parse trees; Applications; AmbiguityingrammarsandLanguages . 4 Pushdown Automata: Definition of the Pushdown automata; the languages of a PDA; Equivalence of PDAsandCFGs;DeterministicPushdownAutomata 5 PropertiesofContextFreeLanguages:NormalformsforCFGs;ThepumpinglemmaforCFGs;Closure propertiesofCFLs Introduction To Turing Machine: Problems that Computers cannot solve; The turning machine; Programming techniques for Turning Machines; Extensions to the basic Turning Machines; Turing MachineandComputers. TextBooks: 1. John E. Hopcroft, Rajeev Motwani, Jeffrey D.Ullman: Introduction to Automata Theory, Languages and Computation,3rdEdition,PearsonEducation,2007. (Chapters:1.1,1.5,2.2to2.5,3.1to3.3,4,5,6,7,8.1to8.4,8.6)

No.of Hours 14

07

08 09

14

ReferenceBooks: 1. 2. 3. 4. K.L.P. Mishra: Theory of Computer Science, Automata, Languages, and Computation, 3rd Edition, PHI, 2007. Raymond Greenlaw, H.James Hoover: Fundamentals of the Theory of Computation, Principles and Practice,MorganKaufmann,1998. JohnCMartin:IntroductiontoLanguagesandAutomataTheory,3rdEdition,TataMcGrawHill,2007. KaviMahesh:TheoryofComputation,AProblemsolvingapproach,WileyIndia

10

Subject: DATABASEAPPLICATIONS LABORATORY SubCode:CSL57 No.ofCredits:100 No.ofLectureHours/week:03

ExamDuration:3Hours ExamMarks:50 1 1. Considerthefollowingrelations: Student(snum:integer,sname:string,major:string,level:string,age:integer) Class(name:string,meetsat:string,room:string,d:integer) Enrolled(snum:integer,cname:string) Faculty(fid:integer,fname:string,deptid:integer) The meaning of these relations is straightforward; for example, Enrolled has one record per student class pair such that the student is enrolled in the class. Level is a two character code with 4 different values(example:Junior:JRetc) WritethefollowingqueriesinSQL.Noduplicatesshouldbeprintedinanyoftheanswers. i. FindthenamesofallJuniors(level=JR)whoareenrolledinaclasstaughtbyProf.Harshith ii. Find the names of all classes that either meet in room R128 or have five or more Students enrolled. iii. Findthenamesofallstudentswhoareenrolledintwoclassesthatmeetatthesametime. iv. Findthenamesoffacultymemberswhoteachineveryroominwhichsomeclassistaught. v. Find the names of faculty members for whom the combined enrollment of the courses that theyteachislessthanfive. 2 2. Thefollowingrelationskeeptrackofairlineflightinformation: Flights(no:integer,from:string,to:string,distance:integer,Departs:time,arrives:time,price:real) Aircraft(aid:integer,aname:string,cruisingrange:integer) Certified(eid:integer,aid:integer) Employees(eid:integer,ename:string,salary:integer) NotethattheEmployeesrelationdescribespilotsandotherkindsofemployeesaswell;Every pilot is certifiedforsomeaircraft,andonlypilotsarecertifiedtofly. WriteeachofthefollowingqueriesinSQL. i. Find the names of aircraft such that all pilots certified to operate them have salaries more thanRs.80,000. ii. For each pilot who is certified for more than three aircrafts, find the eid and the maximum cruisingrangeoftheaircraftforwhichsheorheiscertified. iii. Find the names of pilots whose salary is less than the price of the cheapest route from BengalurutoFrankfurt. iv. For all aircraft with cruisingrange over 1000 Kms, .find the name of the aircraft and the averagesalaryofallpilotscertifiedforthisaircraft. v. FindthenamesofpilotscertifiedforsomeBoeingaircraft. vi. FindtheaidsofallaircraftthatcanbeusedonroutesfromBengalurutoNewDelhi. 3 3. Considerthefollowingdatabaseofstudentenrollmentincourses&booksadoptedforeachcourse. STUDENT(regno:string,name:string,major:string,bdate:date) COURSE(course#:int,cname:string,dept:string) ENROLL(regno:string,course#:int,sem:int,marks:int) BOOK_ADOPTION(course#:int,sem:int,bookISBN:int) TEXT(bookISBN:int,booktitle:string,publisher:string,author:string) i. Createtheabovetablesbyproperlyspecifyingtheprimarykeysandtheforeignkeys. ii. Enteratleastfivetuplesforeachrelation. iii. Demonstratehowyouaddanewtextbooktothedatabaseandmakethisbookbeadoptedby somedepartment. iv. Produce a list of text books (include Course #, BookISBN, Booktitle) in the alphabetical order forcoursesofferedbytheCSdepartmentthatusemorethantwobooks. v. Listanydepartmentthathasallitsadoptedbookspublishedbyaspecificpublisher. vi. Generatesuitablereports.

11

vii. Createsuitablefrontendforqueryinganddisplayingtheresults Thefollowingtablesaremaintainedbyabookdealer. AUTHOR(authorid:int,name:string,city:string,country:string) PUBLISHER(publisherid:int,name:string,city:string,country:string) CATALOG(bookid:int,title:string,authorid:int,publisherid:int,categoryid:int,year:int,price:int) CATEGORY(categoryid:int,description:string) ORDERDETAILS(orderno:int,bookid:int,quantity:int) i. Createtheabovetablesbyproperlyspecifyingtheprimarykeysandtheforeignkeys. ii. Enteratleastfivetuplesforeachrelation. iii. Give the details of the authors who have 2 or more books in the catalog and the price of the booksisgreaterthantheaveragepriceofthebooksinthecatalogandtheyearofpublication isafter2000. iv. Findtheauthorofthebookwhichhasmaximumsales. v. Demonstratehowyouincreasethepriceofbookspublishedbyaspecificpublisherby10%. vi. Generatesuitablereports. vii. Createsuitablefrontendforqueryinganddisplayingtheresults. 5 5. Considerthefollowingdatabaseforabankingenterprise BRANCH(branchname:string,branchcity:string,assets:real) ACCOUNT(accno:int,branchname:string,balance:real) DEPOSITOR(customername:string,accno:int) CUSTOMER(customername:string,customerstreet:string,customercity:string) LOAN(loannumber:int,branchname:string,amount:real) BORROWER(customername:string,loannumber:int) i. Createtheabovetablesbyproperlyspecifyingtheprimarykeysandtheforeignkeys ii. Enteratleastfivetuplesforeachrelation iii. FindallthecustomerswhohaveatleasttwoaccountsattheMainbranch. iv. Findallthecustomerswhohaveanaccountatallthebrancheslocatedinaspecificcity. v. Demonstratehowyoudeleteallaccounttuplesateverybranchlocatedinaspecificcity. vi. Generatesuitablereports. vii. Createsuitablefrontendforqueryinganddisplayingtheresults. Instructions: 4 4. 1. 2. 3. 4. 5. 6. TheexercisesaretobesolvedinanRDBMSenvironmentlikeOracleorDB2. Suitabletupleshavetobeenteredsothatqueriesareexecutedcorrectly. FrontendmaybecreatedusingeitherVBorVAJoranyothersimilartool. The student need not create the front end in the examination. The results of the queries may be displayeddirectly. Relevant queries other than the ones listed along with the exercises may also be asked in the examination. Questionsmustbeaskedbasedonlots.

12

Subject: SYSTEMSOFTWAREANDOPERATINGSYSTEM LABORATORY SubCode:CSL58 No.ofCredits:100 No. of Lecture Hours/ week:03 ExamDuration:3Hours ExamMarks:50

PARTA LEXandYACCPrograms: Design,develop,andexecutethefollowingprogramsusingLEX: a)Programtocountthenumberofcharacters,words,spacesandlinesinagiveninputfile. b)ProgramtocountthenumbersofcommentlinesinagivenCprogram.Alsoeliminatethemandcopythe resultingprogramintoseparatefile. a) Program to recognize a valid arithmetic expression and to recognize the identifiers and operators present. Printthemseparately. b)Programtorecognizewhetheragivensentenceissimpleorcompound. Programtorecognizeandcountthenumberofidentifiersinagiveninputfile. Design,develop,andexecutethefollowingprogramsusingYACC: a)Programtorecognizeavalidarithmeticexpressionthatusesoperators+,,*and/. b)Programtorecognizeavalidvariable,whichstartswithaletter,followedbyanynumberoflettersordigits. a)Programtoevaluateanarithmeticexpressioninvolvingoperators+,,*and/. b)Programtorecognizestringsaaab,abbb,abandausingthegrammar(anbn,n>=0). Programtorecognizethegrammar(anb,n>=10). PARTB UNIXProgramming: Design,develop,andexecutethefollowingprograms a)NonrecursiveshellscriptthatacceptsanynumberofargumentsandprintsthemintheReverseorder, (Forexample,ifthescriptisnamedrargs,thenexecutingrargsABCshouldproduceCBAonthestandard output). b)Cprogramthatcreatesachildprocesstoreadcommandsfromthestandardinputandexecutethem(a minimalimplementationofashelllikeprogram).Youcanassumethatnoargumentswillbepassedtothe commandstobeexecuted. a) Shell script that accepts two file names as arguments, checks if the permissions for these files are identical and if the permissions are identical, outputs the common permissions, otherwise outputs each file name followedbyitspermissions. b) C program to create a file with 16 bytes of arbitrary data from the beginning and another 16 bytes of arbitrarydatafromanoffsetof48.Displaythefilecontentstodemonstratehowtheholeinfileishandled. a)Shellscriptthatacceptsfilenamesspecifiedasargumentsandcreatesashellscriptthatcontainsthisfileas well as the code to recreate these files. Thus if the script generated by your script is executed, it would recreate the original files(This is same as the bundle scriptdescribed byBrain W. Kernighan andRob Pike in TheUnixProgrammingEnvironment,PrenticeHallIndia). b) C program to do the following: Using fork( ) create a child process. The child process prints its own processid and id of itsparent and then exits. The parentprocess waits for its childto finish (by executing the wait())andprintsitsownprocessidandtheidofitschildprocessandthenexits OperatingSystems: Design, develop and execute a program in C / C++ to simulate the working of Shortest Remaining Time and RoundRobinSchedulingAlgorithms.ExperimentwithdifferentquantumsizesfortheRoundRobinalgorithm. Inallcases,determinetheaverageturnaroundtime.Theinputcanbereadfromkeyboardorfromafile.

3 4 5 6

13

Using OpenMP, Design, develop and run a multithreaded program to generate and print Fibonacci Series. One thread has to generate the numbers up to the specified limit and another thread has to print them. Ensurepropersynchronization. 6 Design, develop and run a program to implement the Bankers Algorithm. Demonstrate its working with differentdatavalues. Instructions: In the examination, a combination of one LEX and one YACC problem has to be asked from Part A for a total of 30 marksandoneprogrammingexercisefromPartBhastobeaskedforatotalof20marks.

14

Dr. AMBEDKAR INSTITUTE OF TECHNOLOGY

AIDED BY GOVERNMENT OF KARNATAKA & AUTONOMOUS INSTITUTION AFFILIATED TO VTU

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING 6 SEMESTER SYLLABUS

TH

15

 Subject:MANAGEMENTANDENTREPRENEURSHIP SubCode:CS61 ExamDuration:3hours NoofCredits:3:0:0 ExamMarks:100 SyllabusContent UNITNo Management: IntroductionNature and Characteristics, Scope and Functional areas Management as a Science, Art or Profession. Management & Administration, Managerial Roles, Levels, Early Management approachesModern Management approaches. Planning: Nature, Importance and purposeObjectives, Types of plans, Decision making,StepsinplanningandPremises,Hierarchyofplans. Organizing and Staffing : Nature and purpose, Principles, Types, Departmentation, Centralization Vs Decentralization, Span of control MBA and MBE, nature and importance,Processofselection. Directing and Controlling: Meaning and natureLeadership styles, Motivation Theories, Communication, Meaning and Importance of Coordination, Steps in controlling. Entrepreneur: Meaning, Evolution of the concept, Functions and Types, Concepts & Development of Entrepreneurship; Stages, Role of entrepreneurs in Economic Development,EntrepreneurshipinIndia,itsbarriers. Small Scale Industry: Definition; Characteristics; Need, Objectives, Scope and role of SSI In economic development. Advantages of SSI, Government policy towards SSI; Government support for SSI during Five years plans, Impact of Liberalization, Privatization, Globalization on SSI, Effect of WTO/GATT, Ancillary and Tiny industry. SupportingagenciesofGovernmentforSSITECKSOK,KIADB,KSSIDC,SIDBI,KSFCand NSIC. Preparation of Project: Meaning, Project identification, Project selection; Project Report; Need and Significance of Report, Contents: formulation: Guidelines by Planning Commission for Project report, Network Analysis: Errors of project report, Project Appraisal and Identification of Business Opportunities: Market Feasibility Study: Technical Feasibility Study; Financial Feasibility Study and Social Feasibility Study. NoofHours Nooflecturehours/week:4

11

11

10

10

5.

10

TextBooks:

EntrepreneurshipandManagementShashiK.Gupta,R.KSharmaandNeetiGuptaKalyaniPublishers EntrepreneurshipandManagementS.NagendraandV.S.ManjunathPearsonPublication

16

Subject:UNIXSYSTEMPROGRAMMING SubCode:CS62 ExamDuration:3hours UNITNo SyllabusContent No of Hours 10 NoofCredits:4:0:0 ExamMarks:100 Nooflecturehours/week:4

Introduction:ThePOSIXStandards,ThePOSIX.1FIPSStandard, UNIX Files: File Types, The UNIX and POSIX File System, The UNIX and POSIX File Attributes, Inodes in UNIX System V, Application Program Interface to Files, UNIX Kernel Support for Files, Relationship of C Stream Pointers and File Descriptors, Directory Files, HardandSymbolicLinks. UNIX File APIs: General File APIs, File and Record Locking, Directory File APIs, Device File APIs, FIFO File APIs, Symbolic Link File APIs, General File Class, regfile Class for Regular Files, dirfile Class for Directory Files, FIFO File Class, Device File Class, Symbolic Link File Class,FileListingProgram. UNIX Processes: The Environment of a UNIX Process: Introduction, main function, Process Termination, CommandLine Arguments, Environment List, Memory Layout of a C Program, Shared Libraries, Memory Allocation, Environment Variables, setjmp and longjmpFunctions,getrlimit,setrlimitFunctions,UNIXKernelSupportforProcesses. Process Control : Introduction, Process Identifiers, fork, vfork, exit, wait, waitpid, wait3, wait4Functions,RaceConditions,execFunctions,I/ORedirection. Process Relationships: Introduction, Terminal Logins, Network Logins, Process Groups, Sessions,ControllingTerminal. Signals: Signals: The UNIX Kernel Support for Signals, signal, Signal Mask, sigaction, The SIGCHLD Signal and the waitpid Function, The sigsetjmp and siglongjmp Functions, Kill, Alarm, Interprocess Communication 1: Overview of IPC Methods, Pipes, popen, pclose Functions,FIFOs,MessageQueues.

10

10

10

12

TextBooks: 1.TerrenceChan:UNIXSystemProgrammingUsingC++,PrenticeHallIndia,1999. (Chapters1,5,6,7,8,9,10) 2.W.RichardStevens:AdvancedProgrammingintheUNIXEnvironment,2ndEdition,PearsonEducation,2005. (Chapters7,8,9,13,14,15) ReferenceBooks: 1.MarcJ.Rochkind:AdvancedUNIXProgramming,2ndEdition,PearsonEducation,2005. 2.MauriceJBach:TheDesignoftheUNIXOperatingSystem,PearsonEducation,1987. 3.UreshVahalia:UNIXInternals:TheNewFrontiers,PearsonEducation,2001.

17

Subject:COMPILERDESIGN SubCode:CS63 ExamDuration:3Hours Unit No 1 No.ofCredits:400 ExamMarks:100 No.ofLectureHours/week:04

SyllabusContent Introduction: Language Processors, The Structure of a Compiler, The Evolution of Programming Languages, The Science of Building a Compiler, Applications of Compiler Technology, Programming LanguageBasics,

No.of Hours 08

2 3 4

LexicalAnalysis:TheRoleOfLexicalAnalyzer,InputBuffering,SpecificationsOfTokens,RecognitionOf TokensSyntaxAnalysis:Introduction,ContextFreeGrammars. SyntaxAnalysis:WritingaGrammar,TopDownParsing.BottomUpParsing Syntax Analysis , Introduction to LR Parsing, Simple LR Parser, More Powerful LR Parsers, Using AmbiguousGrammars

10 10 12

SyntaxDirectedTranslation:SyntaxDirectedDefinitions,EvaluationOrderforSDDs, 5 ApplicationofSyntaxDirectedTranslation,SyntaxDirectedTranslationSchemes RunTimeEnvironmentsStorageOrganization,StorageAllocationofSpace,Accessto NonLocalDataontheStack,HeapManagement,IntroductiontoGarbageCollection CodeGeneration:IssuesInTheDesignOfCodeGenerator,TheTargetLanguage, AddressesintheTargetCode,BasicBlocksAndFlowGraphs,NextUseInformation,A SimpleCodeGenerator. TextBooks 1. Alfred W Aho, Monica S Lam, Ravi Sethi, and Jeffrey D Ullman, Compilers Principles, Techniques and Tools, AddisonWesley,2007 ReferenceBooks 1.AndrewWApple,ModernCompilerImplementationinC,CambridgeUniversityPress,1997. 2.KennethCLouden,CompilerConstructionPrinciples&Practice,ThomsonEducation,1997. 3.CharlesNFischer,RichardleBlanc,Jr,CraftingaCompilerwithC,PearsonEducation,1991. 12

18

SubCode:CS64 ExamDuration:3Hours 1

Subject:COMPUTERNETWORKS II No.ofCredits:4:0:0 ExamMarks:100

No.ofLectureHours/week:04

SyllabusContent PacketSwitching Networks 1: Packet network topology; Datagrams and virtual circuits; Routing in packetnetworks;Shortestpathrouting; PacketSwitching Networks 2, TCP / IP 1: Traffic management at the packet level; Traffic management at the flow level; Traffic management at the flowaggregate level,The TCP / IP architecture;TheInternetprotocol

No.of Hours 11

TCP / IP 2: IPv6; User datagram protocol; Transmission control protocol; Internet routing protocols; MobileIP Mobile AdHoc Networks, Wireless sensor Networks: Overview of wireless adhoc networks; Routing in adhoc networks; Routing protocols for adhoc networks; security of adhoc networks. Sensor networks and protocol structures; Communication energy model; Clustering protocols; Routing protocols;ZigbeetechnologyandIEEE802.15.4 Network Management, Security: Network management overview; SNMP; Structure of Management information;MIB;Remotenetworkmonitoring Securityandcryptographicalgorithms;Securityprotocols;Cryptographicalgorithms QoS, Resource Allocation, VPNs, Tunneling, Overlay Networks: Overview of QOS; Integrated services QoS;DifferentiatedservicesQoS;Resourceallocation VirtualPrivateNetworks;MultiprotocolLabelswitching;Overlaynetworks

10

11

10

Compression of Digital Voice and Video, VoIP, Multimedia Networking: Overview of data compression; Digital voice and compression; Still images and JPEG compression; Moving images and MPEG compression; Compression methods without loss, Overview of IP telephony; VoIP signaling protocols;RealTimemediatransportprotocols;Distributedmultimedianetworking;SCTP

10

19

TextBooks:
1. Alberto LeonGarcia and Indra Widjaja: Communication Networks Fundamental Concepts and Key architectures,2ndEdition,TataMcGrawHill,2004. (Chapters7.2,7.3,7.4.1,7.5,7.7,7.8,7.9,8(excluding8.3.3,8.3.4,8.7), Chapter10,11(excluding11.2.3,11.2.4,11.2.5,11.2.6) 2. NaderF.Mir:ComputerandCommunicationNetworks,PearsonEducation,2007. (Chapters9,16,17,18.1to18.3,18.5,19,20.1,20.2,20.3,20.4) ReferenceBooks: 1. BehrouzA.Forouzan:DataCommunicationsandNetworking,4thEdition,TataMcGrawHill,2006. 2. WilliamStallings:DataandComputerCommunication,8thEdition,PearsonEducation,2007. 3. LarryL.PetersonandBruceS.David:ComputerNetworksASystemsApproach,4thEdition,Elsevier,2007. 4. WayneTomasi:IntroductiontoDataCommunicationsandNetworking,PearsonEducation,2005. xxxxxxxxxxxxxxxxxx

20

 Subject:COMPUTERGRAPHICSANDVISUALIZATION SubCode:CS65 No.ofCredits:400 No.ofLectureHours/week:04 ExamDuration:3Hours ExamMarks:100 Unit SyllabusContent No.of No Hours 1 Introduction:Applicationsofcomputergraphics;Agraphicssystem;Images:Physicalandsynthetic;Imaging 10 Systems; The synthetic camera model; The programmers interface; Graphics architectures; Programmable Pipelines; Performance Characteristics Graphics Programming: The Sierpinski gasket; Programming Two DimensionalApplications. 2 TheOpenGL:TheOpenGLAPI;Primitivesandattributes;Color;Viewing;Controlfunctions;TheGasket 10 program;Polygonsandrecursion;Thethreedimensionalgasket;PlottingImplicitFunctions. InputandInteraction:Interaction;Inputdevices;ClientsandServers;DisplayLists;DisplayListsand Modeling;ProgrammingEventDrivenInput;Menus;Picking;AsimpleCADprogram;BuildingInteractive Models;AnimatingInteractivePrograms;DesignofInteractivePrograms;LogicOperations. 10 3 Geometric Objects and Transformations: Scalars, Points, and Vectors; Threedimensional Primitives CoordinateSystemsandFrames;ModelingaColoredCube;AffineTransformations;Rotation,Translation and Scaling; Geometric Objects and Transformations;Transformation in Homogeneous Coordinates ConcatenationofTransformations;OpenGLTransformationMatrices. 4 Implementation:BasicImplementationStrategies;Four majortasks;Clipping;Linesegmentclipping;Polygon 12 clipping; Clipping of other primitives; Clipping in three dimensions; Rasterization; Bresenhams algorithm PolygonRasterization;Hiddensurfaceremoval;Antialiasing;Displayconsiderations. Viewing:Classicalandcomputerviewing;ViewingwithaComputer;Positioningofthecamera; Simpleprojections;ProjectionsinOpenGL;InteractiveMeshDisplays; Parallelprojectionmatrices;Perspectiveprojectionmatrices;ProjectionsandShadows. 5 LightingandShading:LightandMatter;LightSources;ThePhongLightingmodel;PolygonalShading; 10 LightsourcesinOpenGL;SpecificationofmaterialsinOpenGL;Shadingofthespheremodel; GlobalIllumination. TextBooks: 1. Edward Angel: Interactive Computer Graphics A TopDown Approach with OpenGL, 5th Edition, Pearson Education,2008. (Chapters1to7) ReferenceBooks: 1. Donald Hearn and Pauline Baker: Computer Graphics OpenGL Version, 3rd Edition, Pearson Education, 2004. 2. F.S.HillJr.:ComputerGraphicsUsingOpenGL,2ndEdition,Pearsoneducation,2001. 3. James D Foley, Andries Van Dam, Steven K Feiner, John F Hughes, Computer Graphics, AddisonWesley 1997.

21

Subject: OPERATIONRESEARCH SubCode:CS661 ExamDuration:3Hours Unit No 1 SyllabusContent Introduction, Linear Programming: Introduction: The origin, nature and impact of OR; Defining the problem and gathering data; Formulating a mathematical model; Deriving solutions from the model; Testing the model; Preparing to apply the model; Implementation. Introduction to Linear Programming:Thelinearprogramming(LP)model.AssumptionsofLP;Additionalexamples. Simplex Method: The essence of the simplex method;Setting up the simplex method; Algebra ofthe simplexmethod;thesimplexmethodintabularform;Tiebreakinginthesimplexmethod,Adaptingto othermodelforms;Postoptimalityanalysis. Transportation and Assignment Problems: The transportation problem; A streamlined simplex method for the transportation problem; The assignment problem; A special algorithm for the assignmentproblem. Game Theory, Decision Analysis: Game Theory: The formulation of two persons, zero sum games; Solving simple games a prototype example; Games with mixed strategies; Graphical solution procedure;Solvingbylinearprogramming,Extensions. Decision Analysis: A prototype example; Decision making without experimentation; Decision making withexperimentation;Decisiontrees. Metaheuristics:ThenatureofMetaheuristics,TabuSearch,SimulatedAnnealing,GeneticAlgorithms. No.of Hours 11 No.ofCredits:400 ExamMarks:100 No.ofLectureHours/week:04

10

10

11

10

TextBooks: Frederick S. Hillier and Gerald J. Lieberman: Introduction to Operations Research, 8th Edition, Tata McGrawHill,2005. ReferenceBooks: 1. 1. 2. Wayne L. Winston: Operations Research Applications and Algorithms, 4th Edition, Thomson Course Technology,2003. HamdyATaha:OperationsResearch:AnIntroduction,8thEdition,PrenticeHallIndia,2007.

22

Subject:COMPUTERGRAPHICSANDVISUALIZATIONLABORATORY SubCode:CSL67 No.ofCredits:100 No. of Lecture Hours/ week:03 ExamDuration:3Hours ExamMarks:50 PART A Design,develop,andimplementthefollowingprogramsinC/C++ Programtorecursivelysubdivideatetrahedrontofrom3DSierpinskigasket.Thenumberofrecursive stepsistobespecifiedbytheuser. 2 3 4 5 6 7 ProgramtoimplementLiangBarskylineclippingalgorithm. ProgramtodrawacolorcubeandspinitusingOpenGLtransformationmatrices. ProgramtocreateahouselikefigureandrotateitaboutagivenfixedpointusingOpenGLfunctions. ProgramtoimplementtheCohenSutherlandlineclippingalgorithm.Makeprovisiontospecifytheinputline, windowforclippingandviewportfordisplayingtheclippedimage. Programtocreateacylinderandaparallelepipedbyextrudingacircleandquadrilateralrespectively.Allowthe usertospecifythecircleandthequadrilateral. Program, using OpenGL functions, to draw a simple shaded scene consisting of a tea pot on a table. Define suitably the position and properties of the light source along with the properties of the properties of the surfacesofthesolidobjectusedinthescene. Program to draw a color cube and allow the user to move the camera suitably to experiment with perspective viewing.UseOpenGLfunctions. Programtofillanygivenpolygonusingscanlineareafillingalgorithm.(Useappropriatedatastructures.) Programtodisplayasetofvalues{fij}asarectangularmesh. PART B DevelopasuitableGraphicspackagetoimplementtheskillslearntinthetheoryandtheexercisesindicated inPartA.UsetheOpenGL. 1. 2. Instructions: In the examination, one exercise from Part A is to be asked for a total of 30 marks. The package developed underPartBhastobeevaluatedforatotalof20marks. AnyquestionfromPartAmaybeaskedintheexamination. A report of about 10 12 pages on the package developed in Part B, duly certified by the department mustbesubmittedduringexamination.

8 9 10

Note:

23

Subject:UNIXSYSTEMPROGRAMMINGANDCOMPILERDESIGNLABORATORY SubCode:CSL68 ExamDuration:3Hours 1 ListofExperimentsforUSP WriteaC/C++POSIXcompliantprogramtocheckthefollowinglimits: (i)No.ofclockticks(ii)Max.no.ofchildprocesses (iii)Max.pathlength (iv)Max.no.ofcharactersinafilename(v)Max.no.ofopenfiles/process. 2 Write a C/C++ POSIX compliant program that prints the POSIX defined configuration options supported on any givensystemusingfeaturetestmacros. 3 Consider the last 100 bytes as a region. Write a C/C++ program to check whether the region is locked or not. If the region is locked,print pid ofthe process whichhas locked. If the region isnot locked, lock the region with an exclusivelock,readthelast50bytesandunlocktheregion. 4 Write a C/C++ program which demonstrates interprocess communication between a reader process and a writer process.Usemkfifo,open,read,writeandcloseAPIsinyourprogram. 5 a)WriteaC/C++programthatoutputsthecontentsofits Environmentlist b)WriteaC/C++programtoemulatetheunixlncommand 6 WriteaC/C++programtoillustratetheracecondition. 7 WriteaC/C++programthatcreatesazombieandthencallssystem toexecutethepscommandtoverifythatthe processiszombie. 8 WriteaC/C++programtoavoidzombieprocessbyforkingtwice. 9 WriteaC/C++programtoimplementthesystemfunction. 10 WriteaC/C++programtosetuparealtimeclockintervaltimer usingthealarmAPI. ListofExperimentsforCompilerDesign 11 Write a Cprogram to implement the syntaxdirected definition ofif E then S1 andifE then S1 elseS2. (Refer Fig. 8.23 in the text book prescribed for 06CS62 Compiler Design, Alfred V Aho, Ravi Sethi, and Jeffrey D Ullman: CompilersPrinciples,TechniquesandTools,2ndEdition,PearsonEducation,2007). 12 Writeayaccprogramthatacceptsaregularexpressionasinputand produce itsparsetreeasoutput. Note:Intheexaminationeachstudentpicksonequestionfromthelotofall12questions. No.ofCredits:100 ExamMarks:50 No.ofLectureHours/week:03

Design,develop,andexecutethefollowingprograms:

24