B.E.

INFORMATION SCIENCE AND ENGINEERING V SEMESTER

Teaching Hrs /
Examination
Week
Sl. Subject Teaching
Title of the Subject Marks
No. Code Dept. Duration
Theory Practical Theory /
(Hrs) IA Total
Practical

1 06IS51 Software Engineering CSE/ISE 04 - 03 25 100 125

2 06CS52 Systems Software CSE/ISE 04 - 03 25 100 125

3 06CS53 Operating Systems CSE/ISE 04 - 03 25 100 125

4 06CS54 Database Management Systems CSE/ISE 04 - 03 25 100 125

5 06CS55 Computer Networks - I CSE/ISE 04 - 03 25 100 125

Formal Languages and Automata

6 06CS56 CSE/ISE 04 - 03 25 100 125
Theory

7 06CSL57 Database Applications Laboratory CSE/ISE - 03 03 25 50 75

8 06CSL58 Algorithms Laboratory CSE/ISE - 03 03 25 50 75

Total 24 06 24 200 700 900

SOFTWARE ENGINEERING Subject Code : 06IS51

PART - A
UNIT - 1
OVERVIEW: Introduction: FAQ's about software engineering, Professional and ethical responsibility. Socio-
Technical systems: Emergent system properties; Systems engineering; Organizations, people and computer
systems; Legacy systems.
6 Hours
UNIT - 2
CRITICAL SYSTEMS, SOFTWARE PROCESSES: Critical Systems: A simple safety-critical system; System
dependability; Availability and reliability. Software Processes: Models, Process iteration, Process activities; The
Rational Unified Process; Computer-Aided Software Engineering.
7 Hours
UNIT - 3
REQUIREMENTS: Software Requirements: Functional and Non-functional requirements; User requirements;
System requirements; Interface specification; The software requirements document. Requirements Engineering
Processes: Feasibility studies; Requirements elicitation and analysis; Requirements validation; Requirements
management.
6 Hours
UNIT - 4
System models, Project Management: System Models: Context models; Behavioral models; Data models; Object
models; Structured methods. Project Management: Management activities; Project planning; Project scheduling;
Risk management.
7 Hours
PART - B
UNIT - 5
SOFTWARE DESIGN: Architectural Design: Architectural design decisions; System organization; Modular
decomposition styles; Control styles. Object-Oriented design: Objects and Object Classes; An Object-Oriented
design process; Design evolution.
7 Hours
UNIT - 6
DEVELOPMENT: Rapid Software Development: Agile methods; Extreme programming; Rapid application
development. Software Evolution: Program evolution dynamics; Software maintenance; Evolution processes;
Legacy system evolution.
6 Hours
UNIT - 7
VERIFICATION AND VALIDATION: Verification and Validation: Planning; Software inspections; Automated static
analysis; Verification and formal methods. Software testing: System testing; Component testing; Test case design;
Test automation.
7 Hours
UNIT - 8
MANAGEMENT: Managing People: Selecting staff; Motivating people; Managing people; The People Capability
Maturity Model. Software Cost Estimation: Productivity; Estimation techniques; Algorithmic cost modeling, Project
duration and staffing.
6 Hours
TEXT BOOK:
1. Software Engineering – Ian Somerville, 8th Edition, Pearson Education, 2007.
REFERENCE BOOKS:
1. Software Engineering: A Practitioners Approach - Roger S. Pressman, 7th Edition, McGraw-Hill, 2007.
2. Software Engineering Theory and Practice - Shari Lawrence Pfleeger, Joanne M. Atlee, 3rd Edition, Pearson
Education, 2006.
3. Software Engineering Principles and Practice - Waman S Jawadekar, Tata McGraw Hill, 2004.

SYSTEMS SOFTWARE Subject Code : 06CS52

PART - A
UNIT - 1
MACHINE ARCHITECTURE: Introduction, System Software and Machine Architecture, Simplified Instructional
Computer (SIC) - SIC Machine Architecture, SIC/XE Machine Architecture, SIC Programming Examples.
6 Hours
UNIT - 2
ASSEMBLERS - 1: Basic Assembler Function - A Simple SIC Assembler, Assembler Algorithm and Data Structures,
Machine Dependent Assembler Features - Instruction Formats & Addressing Modes, Program Relocation.
6 Hours
UNIT - 3
ASSEMBLERS - 2: Machine Independent Assembler Features – Literals, Symbol-Definition Statements, Expression,
Program Blocks, Control Sections and Programming Linking, Assembler Design Operations - One-Pass Assembler,
Multi-Pass Assembler, Implementation Examples - MASM Assembler.
6 Hours
UNIT - 4
LOADERS AND LINKERS: Basic Loader Functions - Design of an Absolute Loader, A Simple Bootstrap Loader,
Machine-Dependent Loader Features – Relocation, Program Linking, Algorithm and Data Structures for a Linking
Loader; Machine-Independent Loader Features - Automatic Library Search, Loader Options, Loader Design Options
- Linkage Editor, Dynamic Linkage, Bootstrap Loaders, Implementation Examples - MS-DOS Linker.
8 Hours
PART - B
UNIT - 5
EDITORS AND DEBUGGING SYSTEMS: Text Editors - Overview of Editing Process, User Interface, Editor Structure,
Interactive Debugging Systems - Debugging Functions and Capabilities, Relationship With Other Parts Of The
System, User-Interface Criteria.
6 Hours
UNIT - 6
MACRO PROCESSOR: Basic Macro Processor Functions - Macro Definitions and Expansion, Macro Processor
Algorithm and Data Structures, Machine-Independent Macro Processor Features - Concatenation of Macro
Parameters, Generation of Unique Labels, Conditional Macro Expansion, Keyword Macro Parameters, Macro
Processor Design Options - Recursive Macro Expansion, General-Purpose Macro Processors, Macro Processing
Within Language Translators, Implementation Examples - MASM Macro Processor, ANSI C Macro Processor.
8 Hours
UNIT - 7
LEX AND YACC – 1: Lex and Yacc - The Simplest Lex Program, Recognizing Words With LEX, Symbol Tables,
Grammars, Parser-Lexer Communication, The Parts of Speech Lexer, A YACC Parser, The Rules Section, Running LEX
and YACC, LEX and Hand- Written Lexers, Using LEX - Regular Expression, Examples of Regular Expressions, A Word
Counting Program, Parsing a Command Line.
6 Hours
UNIT - 8
LEX AND YACC - 2: Using YACC - Grammars, Recursive Rules, Shift/Reduce Parsing, What YACC Cannot Parse, A
YACC Parser - The Definition Section, The Rules Section, Symbol Values and Actions, The LEXER, Compiling and
Running a Simple Parser, Arithmetic Expressions and Ambiguity, Variables and Typed Tokens.
6 Hours
TEXT BOOKS:
1. System Software – Leland.L.Beck, 3rd Edition, Addison-Wesley, 1997.
2. Lex and Yacc - John.R.Levine, Mason and Doug Brown, O'Reilly, SPD, 1998.
REFERENCE BOOK:
1. System Programming and Operating Systems – D.M.Dhamdhere, 2nd Edition, Tata McGraw - Hill,
1999.

OPERATING SYSTEMS Subject Code : 06CS53

PART - A
UNIT - 1   
INTRODUCTION TO OPERATING SYSTEMS, SYSTEM STRUCTURES: What operating systems do; Computer System
organization; Computer System architecture; Operating System structure; Operating System operations; Process
management; Memory management; Storage management; Protection and security; Distributed system; Special-
purpose 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; Operating System generation; System boot.
6 Hours
UNIT - 2   
Process Management: Process concept; Process scheduling; Operations on processes; Inter-process
communication. Multi-Threaded Programming: Overview; Multithreading models; Thread Libraries; Threading
issues. Process Scheduling: Basic concepts; Scheduling criteria; Scheduling algorithms; Multiple-Processor
scheduling; Thread scheduling.
7 Hours
UNIT - 3   
PROCESS SYNCHRONIZATION: Synchronization: The Critical section problem; Peterson’s solution; Synchronization
hardware; Semaphores; Classical problems of synchronization; Monitors.
7 Hours
 UNIT - 4  
DEADLOCKS: Deadlocks: System model; Deadlock characterization; Methods for handling deadlocks; Deadlock
prevention; Deadlock avoidance; Deadlock detection and recovery from deadlock.
6 Hours 
PART - B
 UNIT - 5 
MEMORY MANAGEMENT: Memory Management Strategies: Background; Swapping; Contiguous memory
allocation; Paging; Structure of page table; Segmentation. Virtual Memory Management: Background; Demand
paging; Copy-on-write; Page replacement; Allocation of frames; Thrashing.
7 Hours
UNIT - 6     
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.
7 Hours
UNIT - 7    
SECONDARY STORAGE STRUCTURES, PROTECTION: Mass storage structures; Disk structure; Disk attachment; Disk
scheduling; Disk management; Swap space management. Protection: Goals of protection, Principles of protection,
Domain of protection, Access matrix, Implementation of access matrix, Access control, Revocation of access rights,
Capability-Based systems.
 6 Hours
 UNIT - 8    
CASE STUDY: THE LINUX OPERATING SYSTEM: Linux history; Design principles; Kernel modules; Process
management; Scheduling; Memory management; File systems, Input and output; Inter-process communication.
       6 Hours
TEXT BOOK:
1.       Operating System Principles – Abraham Silberschatz, Peter Baer Galvin, Greg Gagne, 7 th edition,
Wiley-India, 2006.
 REFERENCE BOOKS:
1. Operating Systems: A Concept Based Approach – D.M Dhamdhere, 2nd Edition, Tata McGraw-
Hill, 2002.
2. Operating Systems – P.C.P. Bhatt, 2nd Edition, PHI, 2006.
3. Operating Systems – Harvey M Deital, 3rd Edition, Addison Wesley, 1990.

DATABASE MANAGEMENT SYSTEMS Subject Code : 06CS54

PART - A
 UNIT - 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 client-server architectures;
Classification of Database Management systems.             
        6 Hours
 UNIT - 2  
ENTITY-RELATIONSHIP 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, Naming Conventions and
Design Issues; Relationship types of degree higher than two.
                                                                                         6 Hours
 UNIT - 3  
RELATIONAL MODEL AND RELATIONAL ALGEBRA: 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; Binary Relational
Operations : JOIN and DIVISION; Additional Relational Operations; Examples of Queries in Relational Algebra;
Relational Database Design Using ER- to-Relational Mapping.
8 Hours
UNIT - 4 
SQL-1: SQL Data Definition and Data Types; Specifying basic constraints in SQL; Schema change statements in SQL;
Basic queries in SQL; More complex SQL Queries.
6 Hours
PART - B
 UNIT - 5  
SQL-2: Insert, Delete and Update statements in SQL; Specifying constraints as Assertion and Trigger; Views (Virtual
Tables) in SQL; Additional features of SQL; Database programming issues and techniques; Embedded SQL, Dynamic
SQL; Database stored procedures and SQL / PSM.
6 Hours
 UNIT - 6   
DATABASE DESIGN - 1: Informal Design Guidelines for Relation Schemas; Functional Dependencies; Normal Forms
Based on Primary Keys; General Definitions of Second and Third Normal Forms; Boyce-Codd Normal Form.
6 Hours
 UNIT - 7  
DATABASE DESIGN: Properties of Relational Decompositions; Algorithms for Relational Database Schema Design;
Multivalued Dependencies and Fourth Normal Form; Join Dependencies and Fifth Normal Form; Inclusion
Dependencies; Other Dependencies and Normal Forms.
 6 Hours
 UNIT - 8
TRANSACTION MANAGEMENT: The ACID Properties; Transactions and Schedules; Concurrent Execution of
Transactions; Lock - Based Concurrency Control; Performance of locking; Transaction support in SQL; Introduction
to crash recovery; 2PL, Serializability and Recoverability; Lock Management; Introduction to ARIES; The log; Other
recovery-related structures; The write-ahead log protocol; Checkpointing; Recovering from a System Crash; Media
Recovery; Other approaches and interaction with concurrency control.
8 Hours
 TEXT BOOKS:
1. Fundamentals of Database Systems – Elmasri and Navathe, 5th Edition, Addison-Wesley, 2007
2. Database Management Systems – Raghu Ramakrishnan and Johannes Gehrke – 3 rd Edition,
McGraw-Hill, 2003.
REFERENCE BOOKS:
1.       Data Base System Concepts – Silberschatz, Korth and Sudharshan, 5 th Edition, Mc-GrawHill, 2006.
 2.       An Introduction to Database Systems – C.J. Date, A. Kannan, S. Swamynatham, 8 th Edition, Pearson
Education, 2006.

COMPUTER NETWORKS – I Subject Code : 06CS55

PART - A
 
UNIT - 1               
INTRODUCTION: Data Communications; Networks; the Internet; Protocols and Standards; Layered tasks; The OSI
Model and the layers in the OSI model; TCP / IP Protocol Suite.
6 Hours
UNIT - 2               
DATA, SIGNALS, AND DIGITAL TRANSMISSION : Analog and digital signals; Transmission impairment; Data rate
limits; Performance; Digital-to-Digital conversion; Analog-to-Digital conversion; Transmission modes.
8 Hours
 UNIT - 3               
ANALOG TRANSMISSION AND MULTIPLEXING: Digital - to - Analog conversion; Analog - to - Analog conversion;
Multiplexing; Spread spectrum.
6 Hours
UNIT - 4    
TRANSMISSION MEDIA, ERROR DETECTION AND CORRECTION   : Twisted pair cable, Coaxial cable, Fibre-Optic
cable, Radio waves, Microwaves, Infrared. Introduction to error detection / correction; Block coding; Linear block
codes; Cyclic codes, Checksum.
6 Hours
PART - B
UNIT - 5  
DATA LINK CONTROL: Framing; Flow and Error control; Protocols; Noiseless channels; Noisy channels; HDLC; Point-
to-point Protocol - framing, transition phases.
 7 Hours
UNIT - 6               
MULTIPLE ACCESS, ETHERNET: Random Access; Controlled Access; Channelization. Ethernet: IEEE standards;
Standard Ethernet and changes in the standard; Fast Ethernet; Gigabit Ethernet.
7 Hours
UNIT - 7   
WIRELESS LANS AND CONNECTION OF LANS: IEE 802.11; Bluetooth.Connecting devices; Backbone Networks;
Virtual LANs.
6 Hours
UNIT - 8               
OTHER TECHNOLOGIES: Cellular telephony; SONET / SDH: Architecture, Layers, Frames; STS multiplexing. ATM:
Design goals, problems, architecture, switching, layers.
6 Hours
TEXT BOOK:
1. Data Communications and Networking – Behrouz A. Forouzan, 4 th   Edition, Tata McGraw-Hill,
2006.
REFERENCE BOOKS:
1. Communication Networks: Fundamental Concepts and Key Architectures - Alberto Leon, Garcia
and Indra Widjaja, 3rd Edition, Tata McGraw- Hill, 2004.
2. Data and Computer Communication, William Stallings, 8th Edition, Pearson Education, 2007.
3. Computer Networks: A Systems Approach - Larry L. Peterson and Bruce S. David, 4 th Edition,
Elsevier, 2007.
4. Introduction to Data Communications and Networking – Wayne Tomasi, Pearson Education,
2005.
5. Computer and Communication Networks – Nader F. Mir, Pearson Education, 2007.
FORMAL LANGUAGES AND AUTOMATA THEORY Subject Code : 06CS56
PART - A
UNIT - 1   
INTRODUCTION TO FINITE AUTOMATA: Introduction to Finite Automata; The central concepts of Automata
theory; Deterministic finite automata; Nondeterministic finite automata.
        7 Hours 
UNIT - 2   
FINITE AUTOMATA, REGULAR EXPRESSIONS:  An application of finite automata; Finite automata with Epsilon-
transitions; Regular expressions; Finite Automata and Regular Expressions;     Applications   of Regular
Expressions.         
7 Hours
UNIT - 3   
REGULAR LANGUAGES, PROPERTIES OF REGULAR LANGUAGES: Regular languages; Proving languages not to be
regular languages; Closure properties of regular languages; Decision properties of regular languages; Equivalence
and minimization of automata.     
                                                                                            6 Hours                      
UNIT - 4   
CONTEXT-FREE GRAMMARS AND LANGUAGES: Context –free grammars; Parse trees; Applications; Ambiguity in
grammars and Languages.
6 Hours               
PART - B
UNIT - 5   
PUSHDOWN AUTOMATA: Definition of the Pushdown automata; The languages of a PDA; Equivalence of   PDA’s
and CFG’s; Deterministic Pushdown Automata.
7 Hours
UNIT - 6   
PROPERTIES OF CONTEXT-FREE LANGUAGES: Normal forms for CFGs; The pumping lemma for CFGs; Closure
properties of CFL                          
                6 Hours
UNIT - 7   
INTRODUCTION TO TURING MACHINE: Problems that Computers cannot solve; The turning
machine;  Programming techniques for Turning Machines; Extensions to the basic Turning Machines; Turing
Machine and Computers.   
7 Hours
UNIT - 8   
UNDECIDABILITY: A Language that is not recursively enumerable; An Undecidable problem that is RE;   Post’s
Correspondence problem; Other undecidable problems.                                                                                     
     6 Hours
TEXT BOOK:
1.       Introduction to Automata Theory, Languages and Computation – John E. Hopcroft, Rajeev
Motwani, Jeffrey D.Ullman:, 3rd Edition, Pearson education, 2007.
REFERENCE BOOKS:
1. Fundamentals of the Theory of Computation: Principles and Practice – Raymond Greenlaw, H.James
Hoove, Morgan Kaufmann, 1998.
2. Introduction to Languages and Automata Theory – John C Martin, 3rd Edition, Tata McGraw-Hill, 2007.
3. Introduction to Computer Theory – Daniel I.A. Cohen, 2nd Edition, John Wiley & Sons, 2004.
4. An Introduction to the Theory of Computer Science, Languages and Machines – Thomas A. Sudkamp,
3rdEdition, Pearson Education, 2006.
DATABASE APPLICATIONS LABORATORY Subject Code : 06CSL57

1. Consider the Insurance database given below.  The primary keys are underlined and the data types are
specified:
      PERSON (driver – id #: String, name: string, address: string)
CAR (regno: string, model: string, year: int)
ACCIDENT (report-number: int, accd-date: date, location: string)
OWNS (driver-id #:string, Regno:string)
PARTICIPATED (driver-id: string, Regno:string, report-number:int, damage amount:int)
(i)      Create the above tables by properly specifying the primary keys and the foreign keys.
(ii)    Enter at least five tuples for each relation.
(iii)   Demonstrate how you
a.    Update the damage amount to 25000 for the car with a specific Regno in the ACCIDENT table with
report number 12.
b.   Add a new accident to the database.
(iv)  Find the total number of people who owned cars that were involved in accidents in 2008.
(v)    Find the number of accidents in which cars belonging to a specific model were involved.
(vi)  Generate suitable reports.
(vii) Create suitable front end for querying and displaying the results.
 
2. Consider the following relations for an order processing database  application in a company:
CUSTOMER (cust #: int , cname: string, city: string)
ORDER (order #: int, odate: date, cust #: int, ord-Amt: int)
ORDER – ITEM (order #: int, item #: int, qty: int)
ITEM (item # : int, unit price: int)
SHIPMENT (order #: int, warehouse#: int, ship-date: date)
WAREHOUSE (warehouse #: int, city: string)
(i)         Create the above tables by properly specifying the primary keys and the foreign keys.
(ii)       Enter at least five tuples for each relation.
(iii)      Produce a listing: CUSTNAME, #oforders, AVG_ORDER_AMT, where the middle column is the
total numbers of orders by the customer and the last column is the average order amount for that
customer.
(iv)     List the order# for orders that were shipped from all the warehouses that the company has in a
specific city.
(v)       Demonstrate the deletion of an item from the ITEM table and demonstrate a method of
handling the rows in the ORDER_ITEM table that contain this particular item.
(vi)     Generate suitable reports.
(vii)    Create suitable front end for querying and displaying the results.
 
3. Consider the following database of student enrollment in courses & books adopted for each course:
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, book-ISBN:int)
          TEXT (book-ISBN:int, book-title:string, publisher:string, author:string)
(i)        Create the above tables by properly specifying the primary keys and the foreign keys.
(ii)       Enter at least five tuples for each relation.
(iii)       Demonstrate how you add a new text book to the database and make this book be adopted by
some department.
(iv)       Produce a list of text books (include Course #, Book-ISBN, Book-title) in the alphabetical order
for courses offered by the ‘CS’ department that use more than two books.
(v)       List any department that has all its adopted books published by a specific publisher.
(vi)     Generate suitable reports.
(vii)    Create suitable front end for querying and displaying the results.
 
4. The following tables are maintained by a book dealer:
AUTHOR (author-id:int, name:string, city:string, country:string)
 PUBLISHER (publisher-id:int, name:string, city:string, country:string)
CATALOG (book-id:int, title:string, author-id:int, publisher-id:int, category-id:int, year:int, price:int)
CATEGORY (category-id:int, description:string)
ORDER-DETAILS (order-no:int, book-id:int, quantity:int)
(i)         Create the above tables by properly specifying the primary keys and the foreign keys.
(ii)       Enter at least five tuples for each relation.
(iii)      Give the details of the authors who have 2 or more books in the catalog and the price of the
books is greater than the average price of the books in the catalog and the year of publication is after
2000.
(iv)     Find the author of the book which has maximum sales.
(v)       Demonstrate how you increase the price of books published by a specific publisher by 10%.
(vi)     Generate suitable reports.
(vii)    Create suitable front end for querying and displaying the results.
 
5. Consider the following database for a banking enterprise:
BRANCH(branch-name:string, branch-city:string, assets:real)
ACCOUNT(accno:int, branch-name:string, balance:real)
DEPOSITOR(customer-name:string, accno:int)
CUSTOMER(customer-name:string, customer-street:string, customer-city:string)
LOAN(loan-number:int, branch-name:string, amount:real)
BORROWER(customer-name:string, loan-number:int)
(i)      Create the above tables by properly specifying the primary keys and the  foreign keys
(ii)    Enter at least five tuples for each relation
(iii)   Find all the customers who have at least two accounts at the       Main branch.
(iv)  Find all the customers who have an account at all the branches located in a specific city.
(v)    Demonstrate how you delete tuples in ACCOUNT relation at every branch located in a specific city.
(vi)  Generate suitable reports.
(vii) Create suitable front end for querying and displaying the results.
 
Instructions:
1.    The exercises are to be solved in an RDBMS environment like Oracle or DB2.
2.    Suitable tuples have to be entered so that queries are executed correctly.
3.    Front end may be created using either VB or VAJ or any other similar tool.
4.    The student need not create the front end in the examination. The results of the queries may be
displayed directly.
5.    Relevant queries other than the ones listed along with the exercises may also be asked in the
examination.
6.    Questions must be asked based on lots.

ALGORITHMS LABORATORY Subject Code : 06CSL58

IMPLEMENT THE FOLLOWING USING C/C++ LANGUAGE:

1.       Implement Recursive Binary search and Linear search and determine the time required to search an
element. Repeat the experiment for different values of n, the number of elements in the list to be searched and
plot a graph of the time taken versus n.
 
2.       Sort a given set of elements using the Heapsort method and determine the time required to sort the
elements. Repeat the experiment for different values of n, the number of elements in the list to be sorted and plot
a graph of the time taken versus n.
3.       Sort a given set of elements using Merge sort method and determine the time required to sort the elements.
Repeat the experiment for different values of n, the number of elements in the list to be sorted and plot a graph of
the time taken versus n.
 
4.       Sort a given set of elements using Selection sort and determine the time required to sort elements. Repeat
the experiment for different values of n, the number of elements in the list to be sorted and plot a graph of the
time taken versus n.
 
5.   Implement   0/1    Knapsack   problem   using   dynamic programming.
 
6.       From a given vertex in a weighted connected graph, find shortest paths to other vertices using Dijkstra's
algorithm.
 
7.       Sort a given set of elements using Quick sort method and determine the time required sort the elements.
Repeat the experiment for different values of n, the number of elements in the list to be sorted and plot a graph of
the time taken versus n.
 
8.       Find Minimum Cost Spanning Tree of a given undirected graph using Kruskal's algorithm.
 
9.       a. Print all the nodes reachable from a given starting node in a digraph using BFS method.
b. Check whether a given graph is connected or not using DFS method.      
 
10. Find a subset of a given set S = {sl,s2,.....,sn} of n positive  integers whose sum is equal to a given positive
integer d. For example, if S= {1, 2, 5, 6, 8} and d = 9 there are two   solutions{1,2,6}and{1,8}.A suitable message is to
be displayed if the given problem instance doesn't have a solution.
 
11. a. Implement Horspool algorithm for String Matching.
b. Find the Binomial Co-efficient using Dynamic Programming.
 
12. Find Minimum Cost Spanning Tree of a given undirected graph using Prim’s algorithm.
 
13. a. Implement Floyd’s algorithm for the All-Pairs- Shortest-Paths problem.
b. Compute the transitive closure of a given directed graph using Warshall's algorithm.

14. Implement N Queen's problem using Back Tracking.