3rdsemj

8/13/2019 3rdsemj

1/24

Dr.AmbedkarInstituteofTechnology

(AnAutonomousInstitutionaffiliatedtoVTU,Belgaum)

DEPARTMENTOF

COMPUTER SCIENCE ENGINEERING5TH 6THSEMESTER

SYLLABUS2011-12

1

8/13/2019 3rdsemj

2/24

Dr.AmbedkarInstituteofTechnology(AnAutonomousInstitutionaffiliatedtoVTU,Belgaum)

DepartmentofComputerScience&Engineering

CONTENTSHEET

Sl.No Content PageNo

1. VSemesterScheme 32. VISemesterScheme 33. SoftwareEngineering 54. SystemsSoftware 65. OperatingSystem 76. DatabaseManagementSystem 87. ComputerNetworksI 98. FormalLanguagesandAutomataTheory 109. DatabaseApplicationLaboratory 1110. SystemsSoftwareandOperatingSystemsLaboratory 1311. ManagementandEntrepreneurship 1612. UnixSystemsProgramming 1713. CompilerDesign 1814. ComputerNetworksII 1915. ComputerGraphicsandVisualization 2116. ElectiveI(GroupA) OperationResearch 2217. ComputerGraphicsandVisualizationLaboratory 2318. UnixSystemsProgrammingand CompilerDesign

Laboratory

24

2

8/13/2019 3rdsemj

3/24

Dr.AmbedkarInstituteofTechnology(AnAutonomousInstitutionaffiliatedtoVTU,Belgaum)

DepartmentofComputerScience&Engineering

FifthSemester201112

Sl.

No

SubjectTitle Subject

Code

No.of

Credits

1. SoftwareEngineering CS51 3:0:02. SystemsSoftware CS52 4:0:03. OperatingSystem CS53 4:0:04. DatabaseManagementSystem CS54 4:0:05. ComputerNetworksI CS55 4:0:06. FormalLanguagesandAutomataTheory CS56 4:0:07. DatabaseApplicationLaboratory CSL57 0:0:18. SystemsSoftwareandOperatingSystems

LaboratoryCSL58

0:0:1

TOTAL 25

SixthSemester201112

Sl.

No

SubjectTitle Subject

Code

No.of

Credits

1. ManagementandEntrepreneurship CS61 3:0:02. UnixSystemsProgramming CS62 3:0:03. CompilerDesign CS63 4:0:04. ComputerNetworksII CS64 4:0:05. ComputerGraphicsandVisualization CS65 4:0:06. ElectiveI(GroupA) OperationResearch CS66 4:0:07. ComputerGraphicsandVisualization

LaboratoryCSL67

0:0:1

8. UnixSystemsProgrammingandCompilerDesignLaboratory

CSL680:0:1

TOTAL 24

3

8/13/2019 3rdsemj

4/24

Dr. AMBEDKAR INSTITUTE OF TECHNOLOGY

AIDED BY GOVERNMENT OF KARNATAKA

&

AUTONOMOUS INSTITUTION AFFILIATED TO VTU

DEPARTMENT OF COMPUTER SCIENCEENGINEERING5THSEMESTER

SYLLABUS

4

8/13/2019 3rdsemj

5/24

Subject:SOFTWAREENGINEERING

SubCode:CS51 NoofCredits:4:0:0 Nooflecturehours/week:4

ExamDuration:3hours ExamMarks:100

UNIT

No

SyllabusContent

Noof

Hours

1

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.

11

2

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.

10

3

Systemmodels: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.

11

4

Development: Rapid Software Development: Agile methods; Extreme programming; Rapid

applicationdevelopment,SoftwarePrototyping.

Software Evolution: Program evolution dynamics; Software maintenance; Evolution processes;

Legacysystemevolution.

10

5.

Verification and Validation: Verification and Validation: Planning; Software inspections;

Automatedstaticanalysis;Verificationandformalmethods.

Softwaretesting:Systemtesting;Componenttesting;Testcasedesign;Testautomation.

Management:ManagingPeople:Selectingstaff;Motivatingpeople;Managingpeople;ThePeople

CapabilityMaturityModel.

10

TextBooks:

1.

Ian

Sommerville:

Software

Engineering,

8

th

Edition,

Pearson

Education,

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.

5

8/13/2019 3rdsemj

6/24

Subject:SYSTEMSSOFTWARE

SubCode:CS52 No.ofCredits:400

No.ofLectureHours/week:04ExamDuration:3Hours ExamMarks:100

Unit

No

SyllabusContent No.of

Hours

1 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,InteractiveDebuggingSystems DebuggingFunctionsandCapabilities,RelationshipWith

OtherPartsOfTheSystem,UserInterfaceCriteria.

10

2 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

DesignOperations OnePassAssembler,MultiPassAssembler, ImplementationExamples MASM

Assembler.

12

3 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 foraLinkingLoader;MachineIndependentLoaderFeatures AutomaticLibrarySearch,

Loader Options, Loader Design Options Linkage Editor, Dynamic Linkage, Bootstrap Loaders,

ImplementationExamples MSDOSLinker.

10

4 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,MacroProcessorDesignOptions RecursiveMacroExpansion,General

Purpose

Macro

Processors,

Macro

Processing

Within

Language

Translators,

Implementation

Examples MASMMacroProcessor.

10

5 LexandYacc:LexandYacc TheSimplestLexProgram, Grammars,ParserLexerCommunication, A

YACC Parser, The Rules Section, Running LEX and YACC, LEX, Using LEX Regular Expression,

ExamplesofRegularExpressions,AWordCountingProgram,ParsingaCommandLine.UsingYACC

Grammars, Recursive Rules, Shift/Reduce Parsing, What YACC Cannot Parse, A YACC Parser The

DefinitionSection,TheRulesSection,SymbolValuesandActions,TheLEXER,CompilingandRunning

aSimpleParser,ArithmeticExpressionsandAmbiguity,VariablesandTypedTokens.

10

TextBook:

1. Leland.L.Beck: SystemSoftware,3rdEdition,AddisonWesley,1997.(Chapters

1.1

to

1.3,

2(except

2.5.2

and

2.5.3),

3(except

3.5.2

and

3.5.3),

4(except

4.4.3))

2. John.R.Levine,TonyMasonandDougBrown:LexandYacc,O'Reilly,SPD,1998.(Chapters1,2(Page242),3(Page5165))

6

8/13/2019 3rdsemj

7/24

Subject: OPERATINGSYSTEM



Unit

No


Hours

1 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;

OperatingSystemdesignandimplementation;OperatingSystemstructure;Virtualmachines;Process

Management: Process concept; Process scheduling; Operations on processes; Interprocess

communication. MultiThreaded Programming: Overview; Multithreading models; Thread Libraries;

Threadingissues.

11

2 Continuation of Process Management: Process Scheduling: Basic concepts; Scheduling criteria;

Schedulingalgorithms;MultipleProcessorscheduling;

Process Synchronization: Synchronization: The Critical section problem; Petersons solution;

Synchronizationhardware;

Semaphores;

Classical

problems

of

synchronization;

Monitors.

10

3 Deadlocks: Deadlocks: System model; Deadlock characterization; Methods for handling deadlocks;

Deadlockprevention;Deadlockavoidance;Deadlockdetectionandrecoveryfromdeadlock.

Memory Management: Memory Management Strategies: Background; Swapping; Contiguousmemory allocation; Paging; Structure of page table; Segmentation.

10

4 ContinuationofMemoryManagement: 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

10

5 SecondaryStorageStructures,Protection:Massstoragestructures;Disk structure;Diskattachment;

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.

11

TextBook:

1. AbrahamSilberschatz,PeterBaerGalvin,GregGagne:OperatingSystemPrinciples,8thedition,WileyIndia,2009.

ReferenceBooks:

1.D.M

Dhamdhere:

Operating

systems

A

concept

based

Approach,2nd

Edition,

Tata

McGraw

Hill,

2002.

2.P.C.P.Bhatt:IntroductiontoOperatingSystems:ConceptsandPractice,2ndEdition,PHI,2008.

3.HarveyMDeital:Operatingsystems,3rdEdition,PearsonEducation,1990.

7

8/13/2019 3rdsemj

8/24

Subject: DATABASEMANAGEMENTSYSTEM



UNITNo SyllabusContent Noof Hours

1 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;

Entitytypes,EntitySets,AttributesandKeys;Relationshiptypes,RelationshipSets,Roles

and structural Constraints; Weak Entity types; Refining the ER Design; ER Diagrams,

NamingConventions

and

Design

issues;

Relationship

types

of

degree

higher

than

two.

10

2 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.

11

3 SQL

Specifying basic constraints in SQL; schema change statements in SQL; Basic queries in

SQL;MorecomplexSQLqueriesInsert,DeleteandUpdatestatementsinSQL;Specifying

constraintsasAssertionandTrigger;Views(VirtualTables) inSQL;Additionalfeaturesof

SQL;

Database

programming

issues

and

techniques;

Embedded

SQL,

Dynamic

SQL

11

4 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;

JoinDependenciesandFifthNormalForm;InclusionDependencies;OtherDependencies

andNormalForms.

10

5 TransactionManagement

Transaction and System Concepts, Desirable Properties of Transactions, characterizing

schedulesbasedonRecoverability,Characterizing schedulesbasedonSerializability.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

10

TextBook

1.FundamentalofDatabaseSystemsbyElmasriandNavathe,5thEdition,AddisonWesley,2007.

ReferenceBooks:

1.DataBasesystemConceptsbySilberschatz,KorthandSudharshan,5theditionmcgrawHill,2006

2.An IntroductiontoDatabaseSystemsbyC.J.Date,A.Kannan,S.Swamynathan, 8thEdition,PearsonEducation,

2006.

3.DatabaseManagementSystemsbyRaghuRamakrishnanandJohannesGehrke3rdEdition,McGrawHill,2003.

8

8/13/2019 3rdsemj

9/24

Subject: COMPUTERNETWORKSI



Unit

No

SyllabusContent No.

of

Hours

1 Introduction: Data Communications, Networks, LayeredTasks, TheOSI model, Layers in OSI model,

TCP/IPProtocolsuite,Addressing.

Physical Layer1: Analog & Digital Signals, Transmission Impairment, Data Rate limits, Performance,

Digitaldigitalconversion (Only Line coding: Polar, Bipolar and Manchester coding),Analogtodigital

conversion(onlyPCM),Digitaltoanalogconversion.

11

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.

11

3 Data Link Layer2: Framing, Noiseless Channels, Noisy channels, HDLC, PPP (Framing, Transition

phasesonly)

10

4 Multiple Access & Ethernet:Randomaccess,ControlledAccess,Channelization,Ethernet:,Standard

Ethernet,Changesinthestandard,FastEthernet,GigabitEthernet

10

5 Network Layer: Introduction, Logical addressing, IPv4 addresses, IPv6 addresses, and IPv4, IPv6,

ComparisonofIPv4andIPv6Headers.

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.

9

8/13/2019 3rdsemj

10/24

Subject: FINITEAUTOMATAANDFORMALLANGUAGES



Unit

No


Hours

1 IntroductiontoFiniteAutomata:IntroductiontoFiniteAutomata;ThecentralconceptsofAutomata

theory; Deterministic finite automata; Nondeterministic finite automata An application of finite

automata;

FiniteAutomata,RegularExpressions:FiniteautomatawithEpsilontransitions;Regularexpressions;

FiniteAutomataandRegularExpressions;Applicationsof RegularExpressions

14

2

RegularLanguages,

Properties

of

Regular

Languages:

Regular

languages;

Proving

languages

not

to

be

regular languages;Closurepropertiesofregularlanguages;Decisionpropertiesofregularlanguages;

Equivalenceandminimizationofautomata

07

3 ContextFreeGrammarsAndLanguages : Context free grammars; Parse trees; Applications;

AmbiguityingrammarsandLanguages .

08

4 PushdownAutomata:DefinitionofthePushdownautomata;thelanguagesofaPDA;Equivalenceof

PDAsandCFGs;DeterministicPushdownAutomata

09

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.

14

TextBooks:

1. John E. Hopcroft, Rajeev Motwani, Jeffrey D.Ullman: Introduction to Automata Theory, Languages andComputation,3

rdEdition,PearsonEducation,2007.

(Chapters:1.1,1.5,2.2to2.5,3.1to3.3,4,5,6,7,8.1to8.4,8.6)

ReferenceBooks:

1. K.L.P. Mishra: Theory of Computer Science, Automata, Languages, and Computation, 3rd Edition, PHI,2007.

2. Raymond Greenlaw, H.James Hoover: Fundamentals of the Theory of Computation, Principles andPractice,MorganKaufmann,1998.

3. JohnCMartin:IntroductiontoLanguagesandAutomataTheory,3rdEdition,TataMcGrawHill,2007.4. KaviMahesh:TheoryofComputation,AProblemsolvingapproach,WileyIndia

10

8/13/2019 3rdsemj

11/24

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)Themeaningoftheserelations isstraightforward; forexample,Enrolledhasonerecordperstudent

classpairsuchthatthestudent isenrolled intheclass.Level isatwocharactercodewith4different

values(example:Junior:JRetc)

WritethefollowingqueriesinSQL.Noduplicatesshouldbeprintedinanyoftheanswers.

i. FindthenamesofallJuniors(level=JR)whoareenrolledinaclasstaughtbyProf.Harshithii. Find the names of all classes that either meet in room R128 or have five or more Students

enrolled.

iii. Findthenamesofallstudentswhoareenrolledintwoclassesthatmeetatthesametime.iv. Findthenamesoffacultymemberswhoteachineveryroominwhichsomeclassistaught.v. Findthe names of faculty members for whom the combined enrollment of the courses that

theyteach

is

less

than

five.

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 morethanRs.80,000.

ii.

For

each

pilot

who

is

certified

for

more

than

three

aircrafts,

find

the

eidand

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 theaveragesalaryofallpilotscertifiedforthisaircraft.

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(book

ISBN:int,

book

title:string,

publisher:string,

author:string)

i. Createtheabovetablesbyproperlyspecifyingtheprimarykeysandtheforeignkeys.ii. Enteratleastfivetuplesforeachrelation.

iii. Demonstratehowyouaddanewtextbooktothedatabaseandmakethisbookbeadoptedbysomedepartment.

iv. Producealistoftextbooks(includeCourse#,BookISBN,Booktitle)inthealphabeticalorderforcoursesofferedbytheCSdepartmentthatusemorethantwobooks.

v. Listanydepartmentthathasallitsadoptedbookspublishedbyaspecificpublisher.vi. Generatesuitablereports.

Subject: DATABASEAPPLICATIONS LABORATORYSubCode: CSL57 No.ofCredits:100


11

8/13/2019 3rdsemj

12/24

vii. Createsuitablefrontendforqueryinganddisplayingtheresults4 4. 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

(order

no:int,

book

id:int,

quantity:int)

i. Createtheabovetablesbyproperlyspecifyingtheprimarykeysandtheforeignkeys.ii. Enteratleastfivetuplesforeachrelation.

iii. Givethedetailsoftheauthorswhohave2ormorebooksinthecatalogandthepriceofthebooksisgreaterthantheaveragepriceofthebooksinthecatalogandtheyearofpublication

isafter2000.

iv. Findtheauthorofthebookwhichhasmaximumsales.v. Demonstratehowyouincreasethepriceofbookspublishedbyaspecificpublisherby10%.

vi. Generatesuitablereports.vii. Createsuitablefrontendforqueryinganddisplayingtheresults.

5 5. ConsiderthefollowingdatabaseforabankingenterpriseBRANCH(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. Createtheabovetablesbyproperlyspecifyingtheprimarykeysandthe foreignkeysii. Enteratleastfivetuplesforeachrelation

iii. FindallthecustomerswhohaveatleasttwoaccountsattheMainbranch.iv. Findallthecustomerswhohaveanaccountatallthebrancheslocatedinaspecificcity.v. Demonstratehowyoudeleteallaccounttuplesateverybranchlocatedinaspecificcity.

vi. Generatesuitablereports.vii. Createsuitablefrontendforqueryinganddisplayingtheresults.

Instructions:

1. TheexercisesaretobesolvedinanRDBMSenvironmentlikeOracleorDB2.2. Suitabletupleshavetobeenteredsothatqueriesareexecutedcorrectly.3. FrontendmaybecreatedusingeitherVBorVAJoranyothersimilartool.4. The student need not create the front end in the examination. The results of the queries may be

displayeddirectly.

5. Relevant queries other than the ones listed along with the exercises may also be asked in theexamination.

6. Questionsmustbeaskedbasedonlots.

12

8/13/2019 3rdsemj

13/24

PARTA

LEXandYACCPrograms:

Design,develop,andexecutethefollowingprogramsusingLEX:

1 a)Programtocountthenumberofcharacters,words,spacesandlinesinagiven inputfile.

b)ProgramtocountthenumbersofcommentlinesinagivenCprogram.Also eliminatethemandcopythe

resultingprogramintoseparatefile.

2 a)Programtorecognizeavalidarithmeticexpressionandtorecognizetheidentifiersandoperatorspresent.

Printthemseparately.

b)Programtorecognizewhetheragivensentenceissimpleorcompound.

3

Programto

recognize

and

count

the

number

of

identifiers

in

agiven

input

file.

Design,develop,andexecutethefollowingprogramsusingYACC:

4 a)Programtorecognizeavalidarithmeticexpressionthatusesoperators+,,*and/.

b)Programtorecognizeavalidvariable,whichstartswithaletter,followedbyanynumberoflettersordigits.

5 a)Programtoevaluateanarithmeticexpressioninvolvingoperators+,,*and/.

b)Programtorecognizestringsaaab,abbb,abanda using the grammar (anb

n,n>=0).

6 Programtorecognizethegrammar(anb,n>=10).

PARTB

UNIXProgramming:

Design,develop,andexecutethefollowingprograms

1 a)Nonrecursiveshellscript thataccepts any numberof arguments and printsthemintheReverseorder,

(Forexample,ifthescriptisnamedrargs,then executingrargsABC shouldproduceCBAonthestandard

output).b)Cprogramthatcreatesachildprocesstoreadcommandsfromthestandard inputandexecutethem(a

minimalimplementationofashelllikeprogram).Youcanassumethatnoargumentswillbepassedtothe

commandstobeexecuted.

2 a)Shellscriptthatacceptstwofilenamesasarguments,checksifthepermissionsforthesefilesareidentical

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.

3 a)Shellscriptthatacceptsfilenamesspecifiedasargumentsandcreatesashellscriptthatcontainsthisfileas

well as the code to recreate these files. Thus if the script generated by your script is executed, it would

recreatetheoriginalfiles(ThisissameasthebundlescriptdescribedbyBrainW.KernighanandRobPikein

TheUnixProgrammingEnvironment,PrenticeHallIndia).

b)Cprogram

to

do

the

following:

Using

fork(

)

createa

child

process.The

child

process

prints

its

own

processidandidofitsparentandthenexits.Theparentprocesswaitsforitschildtofinish(byexecutingthe

wait())andprintsitsownprocessidandtheidofitschildprocessandthenexits

OperatingSystems:

4 Design,developandexecuteaprogram inC/C++tosimulatetheworkingofShortestRemainingTimeand

RoundRobinSchedulingAlgorithms.ExperimentwithdifferentquantumsizesfortheRoundRobinalgorithm.

Inallcases,determinetheaverageturnaroundtime.Theinputcanbereadfromkeyboardorfromafile.

Subject: SYSTEMSOFTWAREANDOPERATINGSYSTEM LABORATORY

SubCode: CSL58 No.ofCredits:100


13

8/13/2019 3rdsemj

14/24

5 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:

Inthe

examination,

acombination

of

one

LEX

and

one

YACC

problem

has

to

be

asked

from

Part

A

for

atotal

of

30

marksandoneprogrammingexercisefromPartBhastobeaskedforatotalof20marks.

14

8/13/2019 3rdsemj

15/24

Dr. AMBEDKAR INSTITUTE OF TECHNOLOGY

AIDED BY GOVERNMENT OF KARNATAKA

&

AUTONOMOUS INSTITUTION AFFILIATED TO VTU

DEPARTMENT OF COMPUTER SCIENCEENGINEERING6THSEMESTER

SYLLABUS

15

8/13/2019 3rdsemj

16/24

Subject: MANAGEMENTANDENTREPRENEURSHIP

SubCode:CS61 NoofCredits:3:0:0 Nooflecturehours/week: 4


UNITNo

SyllabusContent

Noof Hours

1

Management: IntroductionNatureand Characteristics, Scope and Functional areas

Management as a Science, Art or Profession. Management & Administration,

Managerial Roles, Levels, Early Management approachesModern Management

approaches.

11

2

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.

11

3Entrepreneur:Meaning,Evolutionoftheconcept,FunctionsandTypes,Concepts&

Development of Entrepreneurship; Stages, Role of entrepreneurs in Economic

Development,EntrepreneurshipinIndia,itsbarriers.

10

4

SmallScale Industry:Definition;Characteristics;Need,Objectives,Scopeandroleof

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 andTiny industry.

SupportingagenciesofGovernmentforSSI TECKSOK,KIADB,KSSIDC,SIDBI,KSFCand

NSIC.

10

5.

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.

10

TextBooks:

EntrepreneurshipandManagementShashiK.Gupta,R.KSharmaandNeetiGupta KalyaniPublishers

EntrepreneurshipandManagementS.NagendraandV.S.Manjunath PearsonPublication

16

8/13/2019 3rdsemj

17/24

Subject: UNIXSYSTEMPROGRAMMING



UNITNo SyllabusContent No of

Hours

1 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.

10

2 UNIXFileAPIs:GeneralFileAPIs,FileandRecordLocking,Directory FileAPIs,DeviceFile

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.

10

3 UNIXProcesses:TheEnvironmentofaUNIXProcess: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.

10

4 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.

10

5 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.

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

8/13/2019 3rdsemj

18/24

Subject: COMPILERDESIGN



Unit

No


Hours

1 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,

08

2 LexicalAnalysis:TheRoleOfLexicalAnalyzer,InputBuffering,SpecificationsOfTokens,RecognitionOf

TokensSyntaxAnalysis:Introduction,ContextFreeGrammars.

10

3 SyntaxAnalysis:WritingaGrammar,TopDownParsing.BottomUpParsing

10

4 Syntax Analysis , Introduction to LR Parsing, Simple LR Parser, More Powerful LR Parsers, Using

AmbiguousGrammars

SyntaxDirected

Translation:

Syntax

Directed

Definitions,

Evaluation

Order

for

SDDs,

ApplicationofSyntaxDirectedTranslation,SyntaxDirectedTranslationSchemes

12

5 RunTimeEnvironmentsStorageOrganization,StorageAllocationofSpace,Accessto

NonLocalDataontheStack,HeapManagement,IntroductiontoGarbageCollection

CodeGeneration:IssuesInTheDesignOfCodeGenerator,TheTargetLanguage,

AddressesintheTargetCode,BasicBlocksAndFlowGraphs,NextUseInformation,A

SimpleCodeGenerator.

12

TextBooks

1.Alfred

W

Aho,

Monica

SLam,

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.

18

8/13/2019 3rdsemj

19/24

Subject: COMPUTERNETWORKSII

SubCode: CS64 No.ofCredits:4:0:0



Hours

1 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

11

2 TCP/IP2:IPv6;Userdatagramprotocol;Transmissioncontrolprotocol;Internetroutingprotocols;

MobileIP

10

3 MobileAdHocNetworks,WirelesssensorNetworks:Overviewofwirelessadhocnetworks;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: Networkmanagementoverview;SNMP;Structure of Management

information;MIB;Remotenetworkmonitoring

Securityandcryptographicalgorithms;Securityprotocols;Cryptographicalgorithms

11

4 QoS,ResourceAllocation,VPNs,Tunneling,OverlayNetworks:OverviewofQOS;Integratedservices

QoS;

Differentiated

services

QoS;

Resource

allocation

VirtualPrivateNetworks;MultiprotocolLabelswitching;Overlaynetworks

10

5 Compression of Digital Voice and Video, VoIP, Multimedia Networking: Overview of data

compression;Digital voice andcompression;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

8/13/2019 3rdsemj

20/24

TextBooks:

1. Alberto LeonGarcia and Indra Widjaja: Communication Networks Fundamental Concepts and Keyarchitectures,2

ndEdition,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: DataCommunications andNetworking,4thEdition,TataMcGrawHill,2006.2. WilliamStallings:DataandComputerCommunication, 8thEdition,PearsonEducation,2007.3. LarryL.PetersonandBruceS.David:ComputerNetworksASystemsApproach,4thEdition,Elsevier,2007.4. WayneTomasi:IntroductiontoDataCommunicationsandNetworking,PearsonEducation,2005.

xxxxxxxxxxxxxxxxxx

20

8/13/2019 3rdsemj

21/24

Subject:COMPUTERGRAPHICSANDVISUALIZATION



Unit

No

SyllabusContent No

Ho

1 Introduction:Applicationsofcomputergraphics;Agraphicssystem;Images:Physicalandsynthetic;Imaging

Systems;Thesyntheticcameramodel;Theprogrammersinterface;Graphicsarchitectures;Programmable

Pipelines; Performance Characteristics Graphics Programming: The Sierpinski gasket; Programming Two

DimensionalApplications.

2 TheOpenGL:TheOpenGLAPI;Primitivesandattributes;Color;Viewing;Controlfunctions;TheGasket

program;Polygonsandrecursion;Thethreedimensionalgasket;PlottingImplicitFunctions.

InputandInteraction:Interaction;Inputdevices;ClientsandServers;DisplayLists;DisplayListsand

Modeling;

Programming

Event

Driven

Input;

Menus;

Picking;

A

simple

CAD

program;

Building

Interactive

Models;AnimatingInteractivePrograms;DesignofInteractivePrograms;LogicOperations.

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;Polygo

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;

Light

sources

in

OpenGL;

Specification

of

materials

in

OpenGL;

Shading

of

the

sphere

model;

GlobalIllumination.

TextBooks:

1. EdwardAngel: InteractiveComputer Graphics ATopDownApproach withOpenGL, 5th Edition,PearsonEducation,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 VanDam, StevenK Feiner, John FHughes, ComputerGraphics, AddisonWesley1997.

21

8/13/2019 3rdsemj

22/24

Subject: OPERATIONRESEARCH

SubCode: CS661 No.ofCredits:400


Unit

No


Hours

1 Introduction, Linear Programming: Introduction: The origin, nature and impact of OR; Defining the

problemandgatheringdata;Formulatingamathematicalmodel;Derivingsolutionsfromthemodel;

Testing the model; Preparing to apply the model; Implementation. Introduction to Linear

Programming: Thelinearprogramming(LP)model.AssumptionsofLP;Additionalexamples.

11

2 SimplexMethod: Theessenceofthesimplexmethod;Settingupthesimplexmethod;Algebraofthe

simplexmethod;thesimplexmethodintabularform;Tiebreakinginthesimplexmethod,Adaptingto

othermodel

forms;

Post

optimality

analysis.

10

3 Transportation and Assignment Problems: The transportation problem; A streamlined simplex

method for the transportation problem; The assignment problem; A special algorithm for the

assignmentproblem.

10

4 Game Theory, Decision Analysis: GameTheory: The formulationof two persons, zerosum games;

Solving simple games a prototype example; Games with mixed strategies; Graphical solution

procedure;Solvingbylinearprogramming,Extensions.

DecisionAnalysis: Aprototypeexample; Decisionmakingwithoutexperimentation;Decision making

withexperimentation;Decisiontrees.

11

5 Metaheuristics:ThenatureofMetaheuristics,TabuSearch,SimulatedAnnealing,GeneticAlgorithms.

10

TextBooks:

1. Frederick S. Hillier and Gerald J. Lieberman: Introduction to Operations Research, 8th Edition, TataMcGrawHill,2005.

ReferenceBooks:

1. Wayne L. Winston: Operations Research Applications and Algorithms, 4th Edition, Thomson CourseTechnology,

2003.

2. HamdyATaha:OperationsResearch:AnIntroduction,8thEdition,PrenticeHallIndia,2007.

22

8/13/2019 3rdsemj

23/24

Subject: COMPUTERGRAPHICSANDVISUALIZATIONLABORATORY

SubCode: CSL67 No.ofCredits:100


PART A

Design,develop,andimplementthefollowingprogramsinC/C++

1 Programtorecursivelysubdivideatetrahedrontofrom3DSierpinskigasket.Thenumberofrecursive

steps

is

to

be

specified

by

the

user.

2 ProgramtoimplementLiangBarskylineclippingalgorithm.

3 ProgramtodrawacolorcubeandspinitusingOpenGLtransformationmatrices.

4 Programtocreateahouselikefigureandrotateitaboutagivenfixedpointusing OpenGLfunctions.

5 ProgramtoimplementtheCohenSutherlandlineclippingalgorithm.Makeprovision tospecifytheinputline,

windowforclippingandviewportfordisplayingtheclippedimage.

6 Programtocreateacylinderandaparallelepipedbyextrudingacircleandquadrilateralrespectively.Allowthe

usertospecifythecircleandthequadrilateral.

7 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.

8

Programto

draw

acolor

cube

and

allow

the

user

to

move

the

camera

suitably

to

experiment

with

perspective

viewing.UseOpenGLfunctions.

9 Programtofillanygivenpolygonusingscanlineareafillingalgorithm.(Useappropriatedatastructures.)

10 Programtodisplayasetofvalues{fij}asarectangularmesh.

PART B

DevelopasuitableGraphicspackagetoimplementtheskillslearntinthetheoryandtheexercisesindicated

inPartA.UsetheOpenGL.

Note:

1. AnyquestionfromPartAmaybeaskedintheexamination.2. Areportofabout1012pagesonthepackagedeveloped inPartB,dulycertifiedbythedepartment

mustbesubmittedduringexamination.

Instructions:

Intheexamination,oneexercisefromPartAistobeaskedforatotalof30marks.Thepackagedeveloped

underPartBhastobeevaluatedforatotalof20marks.

23

8/13/2019 3rdsemj

24/24

Subject: UNIXSYSTEMPROGRAMMINGANDCOMPILERDESIGNLABORATORYSubCode: CSL68 No.ofCredits:100


Design,develop,andexecutethefollowingprograms:

ListofExperimentsforUSP

1 WriteaC/C++POSIXcompliantprogramtocheckthefollowinglimits:

(i)No.ofclockticks(ii)Max.no.ofchildprocesses

(iii)Max.pathlength

(iv)Max.no.ofcharactersinafilename(v)Max.no.ofopenfiles/process.

2 WriteaC/C++POSIXcompliantprogramthatprintsthePOSIX definedconfigurationoptionssupportedonany

givensystemusingfeaturetestmacros.

3

Considerthe

last

100

bytes

as

aregion.

Write

aC/C++

program

to check

whether

the

region

is

locked

or

not.

If

theregionislocked,printpidoftheprocesswhichhaslocked.Iftheregionisnotlocked,locktheregionwithan

exclusivelock,readthelast50bytesandunlocktheregion.

4 WriteaC/C++programwhichdemonstratesinterprocess communicationbetweenareaderprocessandawriter

process.Usemkfifo,open,read,writeandcloseAPIsinyourprogram.

5 a)WriteaC/C++programthatoutputsthecontentsofits Environmentlist

b)WriteaC/C++programtoemulatetheunixlncommand

6 WriteaC/C++programtoillustratetheracecondition.

7

Write

a

C/C++

program

that

creates

a

zombie

and

then

calls

system to

execute

the

ps

command

to

verify

that

the

processiszombie.

8 WriteaC/C++programtoavoidzombieprocessbyforkingtwice.

9 WriteaC/C++programtoimplementthesystemfunction.

10 WriteaC/C++programtosetuparealtimeclockintervaltimer usingthealarmAPI.

ListofExperimentsforCompilerDesign

11 WriteaCprogramtoimplementthesyntaxdirecteddefinitionofif EthenS1andifEthenS1elseS2.(Refer

Fig.8.23inthetextbookprescribedfor06CS62CompilerDesign,AlfredVAho,RaviSethi,andJeffreyDUllman:

Compilers Principles,TechniquesandTools,2ndEdition,PearsonEducation,2007).

12 Writeayaccprogramthatacceptsaregularexpressionasinputand produce itsparsetreeasoutput.

Note:Intheexaminationeachstudentpicksonequestionfromthelotofall12questions.

24

3rdsemj

Documents