iii b.tech i sem student hand book - welcome to · pdf fileharness psychology of testing...

III B.Tech I Sem Student Hand Book

Department of Information Technology: SVECW 1

CONTENTS

S.No Topic

Page. No

1 Software Engineering 1

2 Computer Networks 6

3 Web Technologies 11

4 Operating Systems 16

5 Computer Graphics 21

6 Advanced Data Structures 28



SHRI VISHNU COLLEGE FOR WOMEN:: BHIMAVARAM

LESSON PLAN

COURSE : III Year B.Tech BRANCH : Information Technology

CLASS : III / I Sem YEAR : 2013-14

SUBJECT : SOFTWARE ENGINEERING

Syllabus UNIT – I :

Introduction to Software Engineering:

The evolving role of software, Changing Nature of Software, Software myths.(Text Book 3)

The software problem: Cost, schedule and quality, Scale and change.

UNIT – II :

Software Process:

Process and project, component software process, Software development process models : Waterfall

model, prototyping, iterative development, relational unified process, time boxing model, Extreme

programming and agile process, using process models in a project. Project management process.

UNIT - III :

Software requirement analysis and specification: Value of good SRS, requirement process,

requirement specification, functional specifications with use-cases, other approaches for analysis,

validation.

UNIT – IV:

Planning a software project: Effort estimation, project schedule and staffing, quality planning, risk

management planning, project monitoring plan, detailed scheduling.

UNIT – V:

Software Architecture: Role of software architecture, architecture views, components and connector

view, architecture styles for C & C view, documenting architecture design, evaluating architectures.

UNIT – VI:

Design: Design concepts, function-oriented design, object oriented design, detailed design,

verification, metrics

UNIT VII:

Coding and Unit testing : Programming principles and guidelines, incrementally developing code,

managing evolving code, unit testing, code inspection, metrics.

UNIT VIII:

Testing: Testing concepts, testing process, black-box testing, white-box testing, metrics.



Prerequisites

Familiarity with basic programming concepts and database.

Course Objective

The objective of the course is to teach the basic concepts of Software Engineering and its applications

in the real world with innovative teaching methodologies to empower and enable the students.

Course Outcomes

After completion of the course, The Learner is able to:

Understand what is a software, process, project

Understand different types of models

Able to analyze the requirements for a software project

Able to estimate the cost of a project

Able to design a project with OO techniques

Demonstrates how to plan for testing a project;

Plan

Sl.

No

No. of

Hrs. Date Topic(s) Planned

Reference

(Book with

page

number)

Remarks

UNIT-I :: Introduction To Software Engineering

1 1 Introduction to Software Engineering T2, 33

2 2,3 The evolving role of software and

Change nature of software T2,34,40

3 4 Software Myths T2,45

4 5 The Software Problem T1, 1

5 6 Cost, Schedule, and Quality T1, 2

6 7 Scale and Change T1, 5

UNIT-II :: Software Process

7 8 Software Processes T1, 9

8 9 Process and Project

Component Software Processes T1,10,11

9 10

Software Development Process

Models

Waterfall Model

T1,13,14

10 11 Prototyping

Iterative Development T1,17,19

11 12 Rational Unified Process

Time boxing Model T1,22,25

12 13, 14

Extreme Programming and Agile

Processes

Using Process Models in a Project

Project Management Process

T1,28,30,32

UNIT-III :: Software Requirement Analysis And Specification

13 15

Software Requirements Analysis and

Specification

Value of a Good SRS

T1,37,38



14 16

Requirement Process

Requirements Specification

Desirable Characteristics of an SRS

T1,39,41

15 17 Components of an SRS

Structure of a Requirements Document T1,43,46

16 18,19 Functional Specification with Use

Cases , Basics, Examples, Extensions T1,49,52,54

17 20 Developing Use Cases

Other Approaches for Analysis T1,56,58

18 21 Data Flow Diagrams

ER Diagrams, Validation T1,59,61,63

UNIT-IV :: PLANNING A SOFTWARE PROJECT

19 22 Planning a Software Project, Effort

Estimation T1,69,70

20 23 Top-Down Estimation Approach

,Bottom-Up Estimation Approach T1,71,74

21 24 Project Schedule and Staffing, Quality

Planning T1,76,78

22 25,26

Risk Management Planning

Risk Management Concepts ,

Risk Assessment ,Risk Control ,

A Practical Risk Management Planning

Approach

T1,80,81,84

23 27

Project Monitoring Plan

,Measurements ,Project Monitoring

and Tracking ,Detailed Scheduling

T1,86,87,88

UNIT-V :: SOFTWARE ARCHITECTURE

24 28 Software Architecture Role of

Software Architecture T1,95.96

25 29 Architecture Views, Component and

Connector View T1,98,101

26 30,31 Components ,Connectors , An

Example

T1,101,103,10

4

27 32 Architecture Styles for C&C View,

Pipe and Filter, Shared-Data Style T1,108,110

28 33

Client-Server Style, Some Other

Styles, Documenting Architecture

Design

T1,112,113,11

4

29 34 Evaluating Architectures T1,118

UNIT-VI :: DESIGN

30 35 Design , Design Concepts T1,121,122

31 36 Coupling ,Cohesion T1,123,126

32 37 The Open-Closed Principle Function-

Oriented Design T1,129,131

33 38 Structure Charts ,Structured Design

Methodology, An Example

T1,132,134,14

0

34 39,40 Object-Oriented Design ,OO Concepts

Unified Modeling Language (UML)

T1,142,143,14

7

35 41 A Design Methodology Examples

,Detailed Design

T1,156,162,16

8



36 42 Logic/Algorithm Design, State

Modeling of Classes , Verification

T1,169,170,17

1

37 43

Metrics ,Complexity Metrics for

Function-Oriented Design

Complexity Metrics for OO Design

T1,172,173,17

5

UNIT-VII :: CODING AND UNIT TESTING

38 44

Coding and Unit Testing, Programming

Principles and Guidelines, Structured

Programming

T1,181,182,18

3

39 45 Information Hiding, Some

Programming Practices T1,186,187

40 46

Coding Standards, Incrementally

Developing Code, An Incremental

Coding Process Test-Driven

Development

T1,191,194,19

5

41 47 Pair Programming, Managing Evolving

Code T1,197,198

42 48 Source Code Control and Build

Refactoring , Unit Testing

T1,198,200,20

4

43 49 Testing Procedural Units Unit Testing

of Classes , Code Inspection, Planning

T1,205,207,21

0,211

44 50

Self-Review Group Review Meeting

Metrics , Size Measures ,Complexity

Metrics

T1,212,214,21

5,216

UNIT-VIII :: TESTING

45 51 Testing ,Testing Concepts , Error,

Fault, and Failure T1,225,226

46 52

Test Case, Test Suite, and Test

Harness Psychology of Testing ,Levels

of Testing ,Testing Process

T1,227,228,22

9,231

47 53 Test Plan, Test Case Design , Test

Case Execution

T1,231,233,23

4

48 54

Black-Box Testing, Equivalence Class

Partitioning, Boundary Value Analysis

Pair wise Testing

T1,236,237,23

9,240

49 55

Special Cases , State-Based Testing

,White-Box Testing ,Control Flow-

Based Criteria

T1,243,244,24

7,248

50 56

Test Case Generation and Tool

Support, Metrics , Coverage Analysis

Reliability, Defect Removal Efficiency

T1,251,252,25

4

Assignments

A1: What is Software Engineering?

1. Definition 2.Program Vs Software 3.Software Process 4.Characteristics 5.Applications

A2: Explain Classic Life Cycle of Software Development?

Compare and contrast RAD model with a Prototyping model?



Explain the concept of Unified Software Development?

A3: What is Requirement analysis Explain with an example?

Prepare a SRS document for a Project of your own interest?

A4: What is software project planning? Explain the key factors which affect the planning of a project?

What is Risk Management?

A5: Explain about the Role of Software architecture in Development?

A6: Explain the difference between Functional and Object oriented Design?

A7: What are the metrics available to measure the software quality?

What is code inspection and review?

A8: Explain different types of testing?

Explain the roles of programmer and tester in software development?

Write about test plan, test case design and test execution?

Text Books

T1: A Concise Introduction To Software Engineering (Undergraduate Topics In Computer Science),

Pankaj Jalote, Springer International Edition.

T2: Software Engineering A Practitioner’s Approach 6TH

Edition / Roger S .Pressman

T4: Software Engineering, A Precise approach, Pankaj Jalote, Wiley

Reference Books

R1: Software Engineering A Practitioner’s Approach 5TH

Edition / Roger S .Pressman

R2: An Integrated Approach To Software Engineering 2nd

Edition / Pankaj Jalote

R3: Software Engineering – K.K.Agarwal & Yogesh Singh

R4: Software Requirements And Estimation – Swapna Kishore, Rajesh Naik

R5: Software Engineering Principles And Practice Waman S Jawadekar

R4: Software Engineering,8/e, Sommerville, Pearson

Staff in charge Head of the Department



SHRI VISHNU ENGINEERING COLLEGE FOR WOMEN::BHIMAVARAM LESSON PLAN


CLASS : III/I Sem YEAR : 2013-2014

SUBJECT : COMPUTER NETWORKS

Syllabus

UNIT - I: Introduction: Data Communication, components, data representation, data flow;

Networks: distributed processing, network criteria, physical structures, network models, categories of

network, inter connection of networks; The Internet: brief history, internet today, Protocols

&standard layers: protocols, standards, standard organization, internet standards, Layered Tasks:

sender, receiver, carrier, hierarchy.

The OSI models: layered architecture, peer to peer process, encapsulation, Layers in OSI model:

physical layer, data link layer, Network layer, transport layer, session layer , presentation layer ,

application layer , TCP/IP protocol suite: physical and data link layers, network layer, transport layer,

application layer, Addressing: physical address, logical address, port address, specific address.

UNIT-II: Physical layer and overview of PL Switching: Multiplexing: frequency division

multiplexing, wave length division multiplexing, synchronous time division multiplexing, statistical time

division multiplexing, introduction to switching: Circuit Switched Networks, Datagram Networks,

Virtual Circuit Networks.

UNIT -III : Framing: fixed size framing, variable size framing, , Flow control, Error control ,Error

detections Error correction: block coding, linear block codes, cyclic codes: cyclic redundancy

check, hard ware implementation, polynomials, cyclic code analysis, advantages, Checksum: idea,

one’s complement internet check sum, services provided to Network Layer, elementary Data link

Layer protocols- Unrestricted Simplex protocol, Simplex Stop-and-Wait Protocol, Simplex protocol

for Noisy Channel.

UNIT-IV: Sliding Window Protocol: One bit, Go back N, Selective Repeat-Stop and wait protocol ,

data link layer HDLC: configuration and transfer modes, frames, control field, point to point

protocol( PPP): framing, transition phase, multiplexing, multi link PPP.

UNIT -V: Random Access : ALOHA, career sense multiple access (CSMA), career sense multiple

access with collision detection, career sense multiple access with collision avoidance , Controlled

Access: Reservation, Polling, Token Passing, Channelization: frequency division multiple

access(FDMA),time division multiple access(TDMA), code division multiple access(CDMA).

UNIT-VI: IEEE Standards: data link layer, physical layer, Manchester encoding, Standard Ethernet:

MAC Sub Layer, physical layer, Fast Ethernet: MAC Sub Layer, physical layer, IEE-802.11:

Architecture, MAC sub layer, addressing mechanism , frame structure.

UNIT -VII : Blue tooth : Architecture, blue tooth layers, Protocol stack, Frame structure ,cellur

Telephony-frequency reuse Transmitting, receiving, roaming, Satellite Networks –GEO,LEO,MEO

satellite.

Unit-VIII : Data Link Layer Switching-Bridges, Local internet working Spanning tree bridges, remote

bridges, switch virtual LANs.



Prerequisites Students should be familiar with the basic concepts of data communication system. Beginners can study the key networking concepts.

Course Objectives

This course is designed to provide the students with a foundation in signal presentation,

communication techniques, serial and parallel communication, modems, and other

interfacing methods.

The networking technologies for local and wide area networks are also studied in detail

This course covers relevant topics including network architecture and protocols.

To provide students with a theoretical and practical base in computer networks issues.

Course Outcomes

At the end of the course a student will be able to:

Purse his study in advanced networking courses.

Apply knowledge of mathematics, probability, and statistics to model analyze some

networking protocols.

Design, implement, and analyze simple computer networks.

Knowledge of contemporary issues in computer networks.

Be familiar with wireless networking concepts.

Be familiar with contemporary issues in networking technologies.

Plan

Sl.

No.

No. of

hours Date Topic(s) Planned

Reference

(Books with

page

numbers)

Remarks

UNIT – I

1 1 Data Communication, components, data

representation, data flow. T1: 3-6

2 2

Networks: distributed processing,

network criteria, physical structures,

network models, categories of network,

inter connection of networks

T1: 7-15

3 3

The Internet: brief history, internet today,

Protocols &standard layers: protocols,

standards, standard organization, internet

standards,

T1: 16-21

4 4

Layered Tasks: sender, receiver, carrier,

hierarchy. The OSI models: layered

architecture, peer to peer process,

encapsulation

T1: 27-33

5 5

Layers in OSI model: physical layer, data

link layer, Network layer, transport layer,

session layer , presentation layer ,

application layer

T1: 33-42

6 6 TCP/IP protocol suite: physical and data T1: 42-45



link layers, network layer, transport layer,

application layer

7 7 Addressing: physical address, logical address, port address, specific address.

T1: 45-50

8 8 Assignment-A1 & A2 discussion PPT presentation

UNIT – II

9 9,10

Multiplexing: frequency division

multiplexing, wave length division

multiplexing, synchronous time division

multiplexing, statistical time division

multiplexing

T1: 161-

179

10 11,12

Introduction to switching: Circuit

Switched Networks, Datagram Networks,

Virtual Circuit Networks.

T1: 214-

227

11 13 Assignment-A3 discussion PPT presentation

UNIT – III

12 14 Framing: fixed size framing, variable size

framing, Flow control, Error control

T1: 307-

311

13 15,16 Error detections Error correction: block

coding, linear block codes

T1: 267-

278

14 17,18

Cyclic codes: Cyclic redundancy check, hard ware implementation, polynomials, cyclic code analysis, advantages

T1: 284-

297

15 19

Checksum: idea, one’s complement

internet check sum, services provided to

Network Layer,

T1:

298,299

16 20,21

Elementary Data link Layer protocols: Unrestricted Simplex protocol, Simplex Stop-and-Wait Protocol, Simplex protocol for Noisy Channel.

T2: 200-

208

17 22

Assignment-A4 discussion PPT presentation

UNIT – IV

18 23,24 Sliding Window Protocol: One bit, Go back N, Selective Repeat-Stop and wait protocol , data link layer

T2: 211-

223

19 25 HDLC: configuration and transfer modes, frames, control field

T1: 340-

345

20 26,27 Point to point protocol (PPP): Framing, transition phase, multiplexing, multi link PPP.

T1: 346-

356


UNIT – V

22 29,30

Random Access : ALOHA, career sense

multiple access (CSMA), career sense

multiple access with collision detection,

career sense multiple access with

collision avoidance

T1: 364-

378

23 31 Controlled Access: Reservation, Polling,

Token Passing

T1: 379-

382

24 32,33 Channelization: frequency division multiple access (FDMA), time division

T1: 383-

389



multiple access (TDMA), code division multiple access (CDMA).


UNIT – VI

26 35 IEEE Standards: data link layer, physical

layer, Manchester encoding

T1: 395-

397,109,11

0

27 36,37 Standard Ethernet: MAC Sub Layer,

physical layer

T1: 397-

405

28 38,39 , Fast Ethernet: MAC Sub Layer, physical

layer

T1: 409-

411

29 40,41 IEE-802.11: Architecture, MAC sub layer, addressing mechanism , frame structure.

T1: 421-

433

T2: 299


UNIT – VII

31 43,44 Blue tooth : Architecture, blue tooth

layers, Protocol stack, Frame structure

T1: 436

T2:

311,313,31

6

32 45,46 cellur Telephony-frequency reuse

Transmitting, receiving, roaming

T1: 467-

477

33 47 Satellite Networks –GEO,LEO,MEO satellite.

T1: 478-

487


UNIT – VIII

35 49,50

Data Link Layer Switching-Bridges,

Local internet working Spanning tree

bridges

T1: 447-

454

36 51,52,

53 Remote bridges, switch virtual LANs.

T1: 456-

463


ASSIGNMENTS UNIT-1

1. Discuss the history of networking.

2. What are the problems faced with the early communication.

3. What is meant by computer network?

4. Enumerate the concept of networking

5. Explain the basic network application areas

6. What are the key issues of computer network

7. What are the major components of networking hardware?

8. Explain the merits and demerits of various network topologies.

9. What are the functions of the four layers of TCP/IP model?

10. Distinguish between the OSI model and TCP/IP model.

11. Enumerate on the functions of various addressing techniques.

UNIT-2

12. Differentiate between FDM, WDM, and TDM.

13. List the advantages of packet switching over circuit switching for data transmission.



UNIT-3

14. Explain the three different types of errors that occurs during the transmission and methods of

error correction.

15. Explain different types of redundancy checks.

16. Explain Elementary data link layer protocols.

17. What are different Framing methods.

UNIT-4

18. Explain sliding window protocols.

19. Explain HDLC protocol

UNIT-5

20. Differentiate ALOHA and SLOTTED ALOHA

21. Compare and contrast the functions of Carrier Sense on Multi-Access Networks (CSMA) and

Carrier Sense Multiple Access with Collision Detect (CSMA/CD).

22. Differentiate TDMA, FDMA, and CDMA.

UNIT-6

23. Explain Standard Ethernet and Fast Ethernet

24. Explain the Frame structure of 802.11.

25. Draw the wave forms for 010011110 in each of the following methods:

i)Manchester ii) Different Manchester.

UNIT-7

26. Explain protocol stack of Bluetooth.

27. Discuss the operation of cellular telephony.

28. Describe Satellite Communication.

UNIT-8

29. Explain the functions of four internetworking devices: repeaters, bridges, routers and

gateways

30. Explain spanning tree bridges.

31. Explain Switched virtual LAN’s

Text Books T1: Data communications and networking 4

th edtion Behrouz A Fourzan, TMH

T2: Computer networks 4th editon Andrew S Tanenbaum, Pearson

T3: Computer networks, Mayank Dave, CENGAGE

Reference Books

1. http://nptel.iitm.ac.in/courses/Webcourse-

contents/IIT%20Kharagpur/Computer%20networks/New_index1.html

2. Computer networks, A system Approach, 5th ed, Larry L Peterson and Bruce S Davie,

Elsevier


http://nptel.iitm.ac.in/courses/Webcourse-%20%20%20%20%20%20%20%20%20contents/IIT%20Kharagpur/Computer%20networks/New_index1.html

http://nptel.iitm.ac.in/courses/Webcourse-%20%20%20%20%20%20%20%20%20contents/IIT%20Kharagpur/Computer%20networks/New_index1.html



SHRI VISHNU ENGINEERING COLLEGE FOR WOMEN:: BHIMAVARAM LESSON PLAN


CLASS : III/ I Sem. YEAR : 2013-14

SUBJECT : WEB TECHNOLOGIES _______________________________________________________________

Syllabus UNIT I: History of the Internet and World Wide Web – HTML 4 protocols – HTTP, SMTP, POP3,

MIME,IMAP.

HTML Common tags- List, Tables, images, forms, Frames, Links and Navigation, Image Maps

UNIT II: CSS: Introduction, CSS Properties, Controlling Fonts, Text Formatting, Pseudo classes,

Selectors, CSS for Links, Lists, Tables.

UNIT III: Page Layout : Understanding site, Page size, Designing pages, Structuring pages and

Design issues.

Learning Java script: Variables, operators, Functions, Control structures, Events , Objects.

UNIT IV: Advanced Java Script with DHTML DOM and forms.

UNIT V: XML: XML DTD, XML Schema, Parsing XML, XPath,and XML Transformations .

UNIT VI: PHP Programming: Introducing PHP: Creating PHP script, Running PHP script.

Working with Variables and constants: Using variables, Using constants, Data types, Operators.

UNIT VII: Controlling program flow: Conditional statements, Control statements, Arrays, functions.

Working with forms and Database using MySql.

UNIT VIII: AJAX: Introduction, AJAX with XML and PHP, Common Gateway Interface and Perl

programming.

Prerequisites

To understand this subject, students must have a good knowledge of any programming language to

get familiar with web page coding and relational database concepts and also little bit knowledge of

SQL.

Course Objectives

The main objective of this subject is to learn how to design and develop web pages using a

range of current web technologies, including HTML, PHP, JavaScript, and MySQL. This course also

contains the concepts of how to develop web pages, using industrially recognized tools, which comply

with emerging WWW standards.

This course introduces the theory and current best practices of Web page design, markup

and presentation. The use of HTML for information structure and CSS for presentation and HTML

style sheets are provided , as well as HTML standards, HTML forms, media types, layout and

positioning, tables and lists, and accessibility.



Course Outcomes

Upon successful completion of this course, students should be able to:

Describe Internet and World Wide Web technology standards

Understand the basic networking protocols for the Internet and WWW

Understand the concepts, technologies and standards underpinning the WWW

Client & server side programming using Java Script, PHP & MySQL

Identify and apply an appropriate web page development methodology

Use and evaluate appropriate architectures for Web applications

Use Web technologies and frameworks to develop Web applications

Design and build medium-scale Web applications

Analyze and evaluate the implication of Web applications

Plan

Sl.No No. of

Hrs Date Topic(s) Planned

Reference (Books with

page numbers)

Remarks

UNIT-I

1 1 History of the Internet and World Wide Web

T2:4-5

2 2 HTML 4 protocols – HTTP, SMTP T2:9-16

3 3 & 4 POP3, MIME,IMAP. T2:17

4 5 & 6 HTML Common tags T1:2-35

5 7 List T1:36-44

6 8 Tables T1:109-135

7 9 Images, Links and Navigation T1:53-76

8 10 Frames T1:185-209

9 11,12 Forms T1:139-180

UNIT-II

10 13 CSS: Introduction T1:211-220

11 14 CSS Properties, Controlling Fonts T1:221-230

12 15 Text Formatting T1:231-239

13 16 Pseudo classes, Selectors T1:239-247

14 17 CSS for Links T1:274-283

15 18 CSS for Lists, Tables T1:283-294

UNIT-III

16 19 Understanding Page Layout and Page size

T1:323-331

17 20 Designing pages, Structuring pages T1:337-358

18 21 Design issues in structuring web pages T1:361-400

19 22 Java script Introduction T1:403-423

20 23 Variables, operators T1:423-427



21 24 Control structures T1:429-435

22 25,26,

27 Functions T1:427-429

23 28,29 Objects. T1:437-449

24 30,31 Events T1:435-436

UNIT-IV

25 32,33 Advanced Java Script with DHTML T1:482-486

26 34,35 Advanced Java Script with DOM T2:443-504

27 36 Advanced Java Script with Forms T2:505-253

UNIT-V

28 31 Introduction to XML T2:163-182

29 32,33,

34 XML DTD T2:183-215

30 35,36 XML Schema T2:216-257

31 37 Parsing XML T2:258-290

32 38 XPath,and XML Transformations T2:291-352

UNIT-VI

33 39 Introduction to PHP R1:17-1 to 17-3

34 40 Creating and running PHP script R1:17-4 to 17-7

35 41 Using variables R1:17-8

36 42 Using constants R1:17-9

37 43 Data types R1:17-10

38 44 Operators. R1:17-11

UNIT-VII

39 45 Conditional statements R1:17-14 to 17-17

40 46 Control statements R1:17-18

41 47,48 Arrays R3:157-175

42 49 functions R3:104-118

43 50,51 Working With forms R3:311-334

44 52,53,

54 Database using MySql

R1:18-2 to 18-24

UNIT-VIII

45 55 Introduction to AJAX T2:542-563

46 56,57 AJAX with XML and PHP T2:563-568

47 58 Common Gateway Interface T2:593-604

48 59,60 Perl programming. R1:12-1 to 12-24



Text books

T1: Web programming with HTML, XHTML and CSS, 2e, Jon Duckett, Wiley India

T2: Web Technolgies, Uttam Roy, OXFORD University press

References:

R1: Web programming Bai, Michael Ekedahl, CENAGE Learning , India edition.

R2:An Introduction to Web Design + Programming, Paul S.Wang, India Edition

R3:PHP5 and MySQL Bible Tim Converse and Joyce Park with Clark Morgan, Wiley Publishing

Assignments

Assignment 1:

1. What are the different types of lists in HTML? Explain how these lists are created in HTML

with suitable examples?

2. Create a HTML document that has your image and your friend’s image with a specific height

and width. Also when clicked on the images it should navigate to their respective profiles.

3. Show how group and alignment of tables rows and columns is achieved using HTML?

4. Create a HTML table with columns for a country name, national sport, national flower,

national animal, national tree. There must be at least five states as rows in the table.

5. Explain the creation of a form with at least five basic features.

Assignment – 2

1. Describe the different ways that styles can be added to a web page?

2. Write a CSS rule that places a background image halfway down the image tilting it

horizontally. The image should remain in place when the user scrolls up or down.

3. Explain the purpose of a class selector with an example?

4. How CSS can be added to links and tables?

5. Explain the properties of CSS?

Assignment - 3

1. Write a Java script that reads list of ten numbers and displays the count of negative numbers

and positive numbers and count of zeros from the list.

2. Write a java script that displays the square and cubes of numbers from 1 to 100?

3. Develop a java script to determine whether a given number is perfect number or not?

4. “Java Script is referred to as Object Based programming language” support the statement

with suitable examples?

5. Write a Java script program to determine whether the given number is odd or even?

Assignment – 4

1. Explain the DOM in detail?

2. Explain the document object properties and methods in detail?

3. Write a java script function to check whether a text field contains more than 10 characters or

not?

4. Describe the basic process of event-driven computation in creating java script?

5. Insert the image on the web page. Write a script which displays a messge when the mouse is

over the image. The co ordinates of mouse should be displayed if click is attempted on the

image?

Assignment – 5

1. Design XML schema for hospital information management. Include eery feature available with

schema?



2. Explain the various XSLT elements in detail?

3. Create a DTD for a catalog of 4-stroke motor bikes where each motor bike has the following

child elements- make, model, year, color, engine, chassis number and accessories. The

engine element has the child elements engine number,no.of cylinders, type of fuel. The

accessories element has the attributes like disc break, auto-start and radio, each of which is

required and possible values of yes and no. Entities must be declared for popular bike names.

4. Define XML schema? Show how an XML schema can be created?

5. What is a name space? Describe how a namespace is created with a relevant example?

Assignment- 6

1. Explain how PHP script is created and executed with an example?

2. Explain about datatypes in PHP?

3. Explain about operators in PHP

4. Explain about constants and variables in PHP

Assignment – 7

1. Explain about conditional statements in PHP?

2. Explain about control statements in PHP?

3. Explain about Arrays in PHP?

4. Explain about functions in PHP?

5. Explain database operations with MySQL using PHP?

Assignment – 8

1. Explain about advantages of AJAX script?

2. Explain CGI script in detail?

3. Explain the role of XML in AJAX?




SHRI VISHNU ENGINEERING COLLEGE FOR WOMEN : : BHIMAVARAM

LESSON PLAN

COURSE : III Year B. Tech BRANCH : Information Technology

CLASS : III/I Sem. YEAR : 2013-14

SUBJECT : OPERATING SYSTEMS

Syllabus UNIT I : Computer System and Operating System Overview: Overview of computer operating

systems, operating systems functions, protection and security, distributed systems, special purpose

systems, operating systems structures and systems calls, operating systems generation.

UNIT II : Process Management – Process concept- process scheduling, operations, Inter process

communication. Multi Thread programming models. Process scheduling criteria and algorithms, and

their evaluation.

UNIT III : Concurrency : Process synchronization, the critical- section problem, Peterson’s Solution,

synchronization Hardware, semaphores, classic problems of synchronization, monitors,

Synchronization examples

UNIT IV : Memory Management : Swapping, contiguous memory allocation, paging, structure of the

page table , segmentation

UNIT V : Virtual Memory Management:

virtual memory, demand paging, page-Replacement, algorithms, Allocation of Frames, Thrashing

UNIT VI : Principles of deadlock – system model, deadlock characterization, deadlock prevention,

detection and avoidance, recovery form deadlock,

UNIT VII : File system Interface- the concept of a file, Access Methods, Directory structure, File

system mounting, file sharing, protection.

File System implementation- File system structure, file system implementation, directory

implementation, allocation methods, free-space management

UNIT VIII: Mass-storage structure overview of Mass-storage structure, Disk structure, disk

attachment, disk scheduling, swap-space management

Prerequisites

Familiarity with Computer hardware and software concepts of Operating system, Different types of operating systems available

Course Objectives

The objective of the course is to teach the basic fundamentals of operating systems with emphasis on the underlying theory, assumptions, and programming as well as providing hands on experience using OS software to model, analyze and develop programs. At the end of the course, students will understand, be able to explain, use and develop further the key elements of the operating systems and can implement those concepts and be able to write the programs also.



Course Outcomes

Upon completion of this course, students should:

Understand the theoretical and practical knowledge of OS principles and concepts.

Be able to solve small problems with scheduling concepts and page allocation techniques.

Demonstrate the OS concepts by writing a program in C language;

Plan

Sl. No.

No. of Hrs.

Date Topic(s) planned

Reference (Books

with page numbers)

Remarks

UNIT I - Computer System And Operating System Overview

1 1

Overview of Computer Operating Systems

T1-3-6

2 2

Operating Systems functions T1-17-20, T1-39-41

3 3

Protection and security T1-26-27

4 4

Distributed systems T1-28-29

5 5

Special purpose systems T1-29-31

6 6

Operating System Structures T1-15-17

7 7

Systems calls T1-43-47

8 8

Operating systems generation T1-70-71

UNIT II - Process Management

9 9

Process Concept T1-81-85

10 10

Process Scheduling T1-85-90

11 11

Operations on Processes T1-90-95

12 12

Inter-process Communication T1-96-102

13 13

Multithread Programming Models T1-129-131

14 14,15

,16 Process Scheduling Criteria and Algorithms and their evaluation

T1-157-169

15 17

Assignment –A1 discussion NA

16 18

Contingency NA

UNIT III - Concurrency

17 19

Process synchronization, the critical-section problem

T1-191-195

18 20

Peterson's Solution T1-195-197

19 21

Synchronization Hardware T1-197-200

20 22

Semaphores T1-200-204

21 23

Classic problems of synchronization T1-204-209

22 24

Monitors T1-209-217

23 25

Synchronization Examples T1-217-230

UNIT IV - Memory Management

24 26

Swapping T1-282-284



25 27

Contiguous memory allocation T1-284-288

26 28

Paging T1-288-297

27 29

Structure of the Page Table T1-297-302

28 30

Segmentation T1-302-309

UNIT V - Virtual Memory Management

29 31

Virtual Memory T1-315-318

30 32

Demand paging T1-319-327

31 33,34,

35 Page-Replacement algorithms T1-327-340

32 36

Allocation of frames T1-340-343

33 37

Thrashing T1-343-348

34 38

Assignment –A2 NA

35 39

Contingency NA

UNIT VI - Principles Of Deadlock

36 40

System model T1-245-247

37 41

Deadlock characterization T1-247-253

38 42

Deadlock prevention T1-253-256

39 43

Deadlock avoidance T1-256-262

40 44

Deadlock detection T1-262-265

41 45

Recovery from deadlock T1-266-267

UNIT VII - File System Interface

42 46

The Concept of a file T1-373-382

43 47

Access Methods T1-382-385

44 48

Directory structure T1-385-395

45 49

File system mounting T1-395-397

46 50

File sharing T1-397-402

47 51

Protection T1-402-407

48 52

File system structure T1-411-413

49 53

File system Implementation T1-413-419

50 54

Directory implementation T1-419-420

51 55,56

Allocation methods T1-421-429

52 57

Free-space management T1-429-431

UNIT VIII - Mass Storage Structure

53 58

Mass-storage structure T1-451-454

54 59

Disk structure T1-454-454

55 60

Disk attachment T1-455-456

56 61

Disk Scheduling T1-456-462

57 62

Swap-space management T1-466-468

58 63

Assignment –A3 NA

59 64

Old Question Papers Review NA



60 65

Old Question Papers Review NA

Additional Topics

Overview of Linux – 2 hrs

Overview of Mobile OS – 1 hr

Assignments

Assignment 1

1) Explain the different views of OS?

2) Explain the difference between multiprocessor system and distributed system?

3) Role of OS in special purpose systems?

4) Explain about system calls & system services?

5) Algorithm evaluation? Criteria for CPU scheduling?

Assignment 2

1) Explain classical synchronization problems with semaphores and monitors?\

2) Problems associated by using semaphores?

3) Explain different page table structures?

4) Explain about segmentation?

Assignment 3

1) Explain demand paging with an example?

2) Explain the different types of page replacement algorithms

3) Explain thrashing with neat diagram?

4) What is deadlock? Explain necessary conditions for deadlock to occur ?

5) Explain deadlock avoidance with bankers algorithm?

6) Explain kernel I/O subsystem with a neat diagram?

7) Explain streams?

Assignment 4

1) Explain file allocation methods?

2) What is mount point? Explain file system mounting?

3) Explain about free space management?

4) Explain about disk scheduling algorithm?

5) Explain about swap-space management?

6) What is meant by RAID structure?

7) Explain about stable –storage implementation?

Text Book

T1. Operating System Concepts- Abraham Silberchatz,Peter B. Galvin, Greg Gagne 7th Edition, John

Wiley.

T2. Operating Systems’ – Internal and Design Principles Stallings, Sixth Edition–2005, Pearson

education

References

R1.http://nptel.iitm.ac.in/courses/Webcourse-contents/IISc-

BANG/Operating%20Systems/New_index1.html

R2. Operating systems- A Concept based Approach-D.M.Dhamdhere, 2nd

Edition, TMH



R3. Operating System A Design Approach-Crowley, TMH

R4. Modern Operating Systems, Andrew S Tanenbaum 3rd

edition PHI.




SHRI VISHNU ENGINEERING COLLEGE FOR WOMEN :: BHIMAVARAM

LESSON PLAN


CLASS : III/I Sem YEAR : 2013-14

SUBJECT : COMPUTER GRAPHICS

Syllabus

UNIT I : Introduction: Application of Computer Graphics, raster scan systems, random scan

systems, raster scan display processors.

Output primitives : Points and lines, line drawing algorithms( Bresenham’s and DDA Line derivations

and algorithms), mid-point circle and ellipse algorithms.

UNIT II : Filled area primitives: Scan line polygon fill algorithm, boundary-fill and flood-fill algorithms.

Inside and outside tests.

UNIT III : 2-D geometrical transforms: Translation, scaling, rotation, reflection and shear

transformations, matrix representations and homogeneous coordinates, composite transforms,

transformations between coordinate systems. (p.nos 204-227 of text book-1).

UNIT IV : 2-D viewing : The viewing pipeline, viewing coordinate reference frame, window to view-

port coordinate transformation, viewing functions, Cohen-Sutherland and Cyrus-beck line clipping

algorithms, Sutherland –Hodgeman polygon clipping algorithm.

UNIT V : 3-D object representation : Polygon surfaces, quadric surfaces, spline representation,

Hermite curve, Bezier curve and B-Spline curves, Bezier and B-Spline surfaces.

UNIT VI : 3-D Geometric transformations : Translation, rotation, scaling, reflection and shear

transformations, composite transformations. 3D Viewing pipeline, clipping, projections( Parallel and

Perspective).

UNIT VII : Visible surface detection methods: Classification, back-face detection, depth-buffer,

scan-line, depth sorting, BSPtree methods, area sub-division and octree methods.

UNIT VIII : Computer animation : Design of animation sequence, general computer animation

functions, raster animation, computer animation languages, key frame systems, motion specifications.

Prerequisites

To make a study of the principles and methods of computer graphics and its application in

solving problems for visualization of complex objects.

Course Objective

The objective of the course presents the basic concepts, tasks of computer graphics and it’s

the main algorithms and models. The course examines the principles of functioning of graphics

devices and the various limitations, the description of the geometric objects and its presentation in the

computer, the main functions of graphics packages, two- and three-dimensional coordinate

transformations, types of projections and its description, viewing parameters and viewing



transformation, the viewing pipeline of the three-dimensional wire frame model Visible surface

detection methods and computer animations.

Course Outcomes

Understand the computer graphics software and hardware used in graphical systems.

Understand the output primitives (lines, conics, filled polygons) and principles, concepts, and

algorithms of Computer Graphics.

Recognize coordinate representation and graphics functions of general graphics packages

and compare between alternative 3D objects representations.

Analyze computer graphics algorithms and capacity to create graphical design, using

appropriate output primitives, attributes and animation.

Understanding relation of algebra and geometry to computation algorithms used in Computer

Graphics

Plan

Sl. No

No of Hrs

Date Topic(s) Planned


page numbers)

Remarks

UNIT - I

1 1 Applications of Computer Graphics T-1 22 to 54

2 2 Video display devices T-1 56 to 70

3 3 Raster-Scan Systems, Raster-scan Display processor

T-1 73 to 75

4 4 Random –Scan Systems T-1 76

5 5 Output Primitives: Points and Lines T-1 104 to 106

6 6,7 Line –Drawing Algorithms T-1 106 to 114

7 8 Circle –Generation Algorithms T-1 117 to 122

8 9,10 Ellipse- Generation Algorithms T-1 122 to 129

UNIT – II

9 11,12 Filled – Area Primitives: Scan –Line Polygon Fill Algorithm

T-1 137 to 146

10 13 Boundary – Fill Algorithm T-1 147 to 150

11 14 Flood- Fill Algorithm T-1 150

12 15 Inside- Outside Tests T-1 145

UNIT – III

13 16 2-D Geometric Transforms: Translation,Rotation

T-1 204 to 206

14 17 Scaling, Reflection T-1 221 to 222

15 18 Shear T-1 223 to 225

16 19 Matrix representation and Homogeneous coordinates

T-1 208 to 210

17 20,21 Composite Transformations T-1 211 to



220

18 22 Transformations between Coordinate systems

T-1 225 to 227

UNIT – IV

19 23 2- D Viewing: The viewing pipeline T-1 237 to 239

20 24 Viewing Coordinate reference frame T-1 239 & 240

21 25 Window to Viewport coordinate transformation

T-1 240 to 242

22 26 2D viewing functions T-1 242 to 244

23 27 Cohen-Sutherland Line Clipping T-1 245 to 250

24 28,29 Sutherland- Hodgeman Polygon Clipping T-1 257 to 262

UNIT - V

25 30 3D Object Representations: Polygon Surfaces

T-1 325 to 330

26 31 Quadric surfaces T-1 330 to 332

27 32,33 Spline Representations T-1 335 to 340

28 34 Hermite Curves R-2 507 to 512

29 35,36 Bezier Curves R-2 512 to 515

30 37,38 B-Spline Curves T-1 354 to 363

31 39 Bezier and B-Spline surfaces T-1 353 & 364

UNIT- VI

32 40 3D Geometric Transformations: Translation T-1 428 & 429

33 41 Roation T-1 429 to 440

34 42 Scaling T-1 440 & 441

35 43 Reflections and Shears T-1 442 & 443

36 44 Composite Transformations T-1 443 to 445

37 45 3D Viewing Pipeline T-1 452 & 453

38 46 Projections T-1 458 to 446

39 47,48 Clipping T-1 476 to 483

UNIT – VII

40 49 Visible – Surface Detection methods Classifications, Back- Face Detection

T-1 490 to 492

41 50 Depth-Buffer Method, A-Buffer Method T-1 492 to 496

42 51 Scan-Line Method T-1 496 to 498

43 52 Depth-Sorting Method T-1 498 to 501

44 53 BSP-Tree Method T-1 501 & 502



45 54 Area-Subdivision Method, OCTree Method T-1 502 to 507

UNIT – VIII

46 55 Computer Animation: Design of Animation Sequences, General Computer-Animation Functions

T-1 604 & 606

47 56 Raster Animations , Computer-Animation Languages

T-1 606 to 608

48 57 Key-Frame Systems T-1 608 to 614

49 58 Motion Specifications T-1 614 to 616

Additional Topics (Not included in Syllabus)

Illumination Models and Surface-Rending Methods - 2 Hrs

Assignments

Assignment -I

1. a) Define computer graphics. List and explain the applications of computer graphics.

b) Briefly explain about raster scan systems.

2. a) How the interactive graphics display works? Explain them in detail with neat diagram and their working principles b) What is aliasing? Explain how one can reduce effect of aliasing.

3. a) Explain the working principle of CRT with neat diagram. b) With the help of a diagram explain the architecture of Raster displays.

4. a) Describe random and raster display systems with the help of neat sketches. b) Distinguish between aliasing and antialiasing.

5. a) Assuming that a certain full-color (24-bit per pixel) RGB raster system has a 512 by 512

frame buffer, how many distinct color choices (intensity levels) would be available. b) Explain how virtual reality systems can be used in design applications.

6. List the operating characteristics of

a) Raster refresh systems b) Vector refresh systems

c) Plasma panel d) LCDs.

Assignment -II:

1. a) What is DDA? Digitize the line with endpoints (20,10) and (30,18) by using Bresenham’s line drawing algorithm. b) Write a description of the midpoint circle algorithm in which decision parameter P is

updated using xi+1 & yi+1 instead of xi & yi.

2. Explain about boundary fill and flood fill algorithm in detail with suitable examples.

3. a) Explain midpoint circle algorithm. Given a circle radius r=10, demonstrate the midpoint circle algorithm by determining positions along the circle octant in the first quadrant from x=10 to x=y. b) Explain DDA line drawing algorithm between points (a, b) and (c, d).

4. a) Write on algorithm for scan-converting a line using mid-point algorithm.



b) Modify the mid-point algorithm for scan-converting lines to write pixels with varying intensities as a function of line slope.

5. a) Show graphically that an ellipse has four-way symmetry by plotting four points on the

ellipse: Where a = 2, b = 1, h = 0 and k = 0.

b) When 8-way symmetry of circle is used to obtain a full circle from pixel coordinates generated from first octant, does overstrike occur? Where?

Assignment -III:

1. a) How are pictures made to grow, shrink and rotate? Explain with transformation matrices and examples. b) Write short notes on transformations between coordinate systems.

2. a) Define transformation. Explain in detail about basic 2-D geometrical transformations b) Write the general form of the matrix for rotation about a point P (h,k).

3. a) Write the homogeneous coordinate transformation matrices for the three basic transformations. b) Find reflections of point (3, 4) with respect to a line y = x and find the corresponding transformation matrix.

4. a) Write a note on window-to-viewport transformation. b) Determine sequence of basic transformations that are equivalent to the rotation of a point (x, y) around (1, 3).

5. a) Perform a 450 rotation of a triangle A(0,0), B(1,1) and C(5,2) about P(-1,-1).

b) Magnify the triangle with vertices A(0,0), B(1,1) and C(5,2) to thrice its size while keeping B(1,1) fixed.

6. Give 3x3 homogeneous-coordinate transformation matrix which will have the same effect as

each of the following transformation techniques: a) Scale the image to be twice as large and then rotate counter-clockwise by 90 degrees

about the origin. b) Rotate clockwise about the origin by 45 degrees and then scale by y-direction to be one-

half as large. Assignment -IV:

1. a) Discuss about window to view port coordinate transformations in detail. c) Explain about Cyrus-Beck line clipping algorithm in detail.

2. a) What happens to pictures that are too large to fit on the screen? Give various categories of

methods in it. b) Discuss in detail about Sutherland-Hodgman polygon clipping.

3. a) How do we represent polygon using polygon table, edge table and vertex table? Explain

with an example. b) Distinguish between window and viewport. In 2-D clipping, how lines are grouped into visible, invisible and partially visible categories

4. a) Explain the concept of polygon clipping with neat diagrams.

b) Clip a line segment between points (1, 3) to (5, 17) using Cohen Sutherland clipping algorithm so that it fit into view port with left bottom at (2, 5) and right top at (5, 12).

5. Derive the window-to-viewport transformation equations by first scaling the window to the size

of the viewport and then translating the scaled window to the viewport position.



6. a) Explain how to determine whether a polygon vertex is inside or outside the window edge.

What is the significance of this routine in determining whether a polygon edge intersects the window edge. b) Justify that the Sutherland-Hodgeman algorithm is not suitable for clipping when the clipping polygon is concave window.

Assignment -V:

1. a) How are periodic B-spline curves different from non-periodic B-spline curves? b) Explain the importance of B-Spline curves in geometric modeling

2. a) What is Polygon? Explain different type of polygons. Explain the various approaches used to represent polygon b) Explain the procedure for generation of various surfaces and curves using B-Spline method.

3. a) How are periodic B-spline curves different from non-periodic B-spline curves? b) Given control points (10,100), (50,100), (70,120) and (100,150). Calculate coordinates of any four points lying on the corresponding Beizer curve.

4. Determine the Bezier blending functions for five control points. Plot each function and label the maximum and minimum values.

5. Derive the matrix form for the following basic geometric transformations in 3-D graphics:

a) Rotation b) Mirror reflection

6. Explain the procedure to design two-dimensional cubic-Bezier curve shapes that have second order piece-wise continuity.

Assignment -VI:

1. a) Explain various coordinate systems in 3d viewing. b) Describe 3-D rotation about x, y and z axes and write the corresponding transformation matrices.

2. a) Write the transformation matrix to rotate a point (x,y,z) about z-axis through an angle ө in

clock wise direction. b) Discuss about combined 3d transformations

3. a) Discuss about reflection and shear transformations. b) Give a 3x3 homogeneous matrix to rotate the image clockwise by 900. Then shift the image to the right by 10 units. Finally scale the image by twice as large.

4. a) Briefly explain about composite transformations. b) The triangle position is A(1,1),B(3,5) and C(2,2), translate the given triangle with respect to its centroid with A in the centroid position and rotate it by an angle 300.after shrinking the object half the size.

5. Prove that any two successive 3-D rotations about a given rotation axis is commutative. 6. a) Derive the quaternion rotation matrix for rotation about an arbitrary axis in three-

dimensional domain. b) Classify the perspective projections and explain about each.

Assignment -VII:

1. a) Discuss the techniques for efficient visible surfaces algorithm with suitable example. b) Briefly explain depth sorting in visible surface detection.



2. a) Explain the binary space partition tree visible surface Algorithm and write a pseudo code

for building a BSP tree b) Give the advantages and limitations of various visible surface detection methods.

3. a) Briefly explain area sub-division algorithm and give its advantages over other methods.

b) What is ray tracing algorithm for hidden surface removal? Explain mathematically how do we find which planes are visible using ray tracing algorithm

4. a) Briefly explain back-face detection algorithm.

b) What are the two spaces in which hidden surface algorithm work? How does sorting and coherence speed up calculation in such algorithms.

5. a) How does the basic scan-line method determine which surfaces are hidden.

b) Distinguish depth-sort and z-buffer algorithms.

6. a) Illustrate the procedure for implementing area-sub division method. b) Explain how the BSP-tree method is implemented for visible surface detection.

Assignment -VIII:

1. a) Discuss about a design of animation sequence. How frame-by-frame animation works? b) Briefly explain any four Animation techniques.

2. a) Discuss about general computer animation functions. b) How do you implement Morphing animation technique? Discuss with an example.

3. a) Briefly explain the steps involved in the Design of animation sequence b) Define the term morphing and explain its use in key frame systems of animation.

4. a) Write short notes on general computer animation functions b) Describe in brief the steps required to produce real time animation.

5. a) What is the mechanism followed for tracking live action in animated scenes?

b) Describe the problem of temporal aliasing.

6. Explain the procedure to simulate the linear, two-dimensional motion of a filled circle inside a given rectangular area. The circle is to be given an initial velocity and the circle is to rebound from the walls with the angle of reflection equal to the angle of incidence.

Text Books

1. Computer Graphics C version, Donald Hearn, M.Pauline Baker, Pearson 2. Computer Graphics with Virtual Reality Systems, Rajesh K Maurya, Wiley 3. Introduction to Computer Graphics, Using Java 2D and 3D, Frank Klawonn, Springer 4. Computer Graphics, Steven Harrington, TMH 5. Computer Graphics, Amarendra N Sinha, Arun Udai, TMH

Reference Books

1. Computer Graphics Principles & practice, 2/e, Foley, VanDam, Feiner, Hughes, Pearson

2. Computer Graphics, Peter, Shirley, CENGAGE 3. Principles of Interactive Computer Graphics, Neuman , Sproul, TMH. 4. The Computer Graphics manual, Vol 2, David, Soloman, Springer




SHRI VISHNU ENGINEERING COLLEGE FOR WOMEN :: BHIMAVARAM

LESSON PLAN


CLASS : III/I Sem. YEAR : 2013-14

SUBJECT : ADVANCED DATA STRUCTURES

Syllabus UNIT I : Dictionaries : Sets, Dictionaries, Hash Tables, Open Hashing, Closed Hashing (Rehashing

Methods), Hashing Functions( Division Method, Multiplication Method, Universal Hashing), Analysis

of Closed Hashing Result (Unsuccessful Search, Insertion, Successful Search, Deletion), Hash Table

Restructuring, Skip Lists, Analysis of Skip Lists. (Reference 1)

UNIT II : Balanced Trees : AVL Trees: Maximum Height of an AVL Tree, Insertions and Deletions. 2-

3 Trees : Insertion, Deletion.

UNIT III : Priority Queues :

Binary Heaps : Implementation of Insert and Delete min, Creating Heap.

Binomial Queues : Binomial Queue Operations, Binomial Amortized Analysis, Lazy Binomial Queues

UNIT IV : Graphs : Operations on Graphs: Vertex insertion, vertex deletion, find vertex, edge

addition, edge deletion, Graph Traversals- Depth First Search and Breadth First Search(Non

recursive) .

Graph storage Representation- Adjacency matrix, adjacency lists.

UNIT V : Graph algorithms : Minimum-Cost Spanning Trees- Prim's Algorithm, Kruskal's Algorithm

Shortest Path Algorithms: Dijkstra's Algorithm, All Pairs Shortest Paths Problem: Floyd's Algorithm,

Warshall's Algorithm,

UNIT VI : Sorting Methods : Order Statistics: Lower Bound on Complexity for Sorting Methods:

Lower Bound on Worst Case Complexity, Lower Bound on Average Case Complexity, Heap Sort,

Quick Sort, Radix Sorting, Merge Sort.

UNIT VII : Pattern matching and Tries : Pattern matching algorithms- the Boyer –Moore algorithm,

the Knuth-Morris-Pratt algorithm

Tries: Definitions and concepts of digital search tree, Binary trie, Patricia , Multi-way trie

UNIT VIII : File Structures: Fundamental File Processing Operations-opening files, closing files,

Reading and Writing file contents, Special characters in files.

Fundamental File Structure Concepts- Field and record organization, Managing fixed-length, fixed-

field buffers. ( Reference 5)

Prerequisites

Basic knowledge of preliminary data structures stacks, queues, linked lists is required.



Course Objectives

This course explores fundamental data structures, algorithms for manipulating them, and the practical

problems of implementing those structures in real programming languages and environments. Heavy

emphasis is placed upon the trees and graphs.

Introduces new & advanced data structures

To design algorithms that are easy to understand, code, and debug

Solve problems using different data structures and design techniques, and compare their

performance and tradeoffs

Get an insight on worst case and average case analysis of different well known sorting

algorithms

Introducing file structures concepts and its data processing

Can learn Concepts of pattern matching with various algorithms

Data structures allow efficient manipulation of data

Can Implement algorithms and data structures used for trees, graphs and file organizations in

C++/Java

Course Outcomes

Upon successful completion of this course, students should be able to:

Study the effects of data organization and algorithms on program efficiency.

Get an understanding of the design considerations in designing balanced trees and its

applications.

Analyze various sorting techniques performance.

Get greater understanding of Dictionary construction with skip lists, and hash tables.

Get an understanding of how heaps can be created and Analyze its applications in various

data structures.

Get an Understanding of the pattern matching concepts

Have a detailed knowledge of different algorithms on graphs.

Learn how tries are used in effective knowledge mining.

Plan

S.No No. of

Hrs Date Topic(s) Planned


page numbers) Remarks

UNIT-I

1 1 Sets Page 498-503& 388-

389

DSA USING C++

GOODRICH

2 2&3 Dictionaries Page 365-

370

DSA USING C++

GOODRICH

3 4&5 Hash Tables , HASH FUNCTIONS Open Hashing METHODS

Page 371-387 &

T3-181-196

DSA USING C++

GOODRICH

4 6 Closed Hashing &Analysis T3-197-200

5 7 SKIP LIST T3-440-441

6 8 Analysis of skip list Page-400-

402

DSA USING C++

GOODRICH

7 9 Tutorials



UNIT-II

8 10 Balanced Trees : AVL Trees introduction

T1-341-342

9 11 Balancing trees T1-343-347

10 11&12 Insertions operation T1-348-351

11 13 Deletions operations T1-352-355

12 14 2-3 Trees –introduction& operations T1-470

13 15 2-3 trees operations T3-162-170

T1-470

14 16 Tutorials

UNIT-III

15 17 & 18

Binary Heaps-creation & its operations

T1-401-405 & T3-213 to

222

16 19&20 Binomial Queues- operations T3-236-245

17 21 Binomial Amortized Analysis T3-469-475

18 22 Lazy Binomial Queues T3-478,

T3-481-483

19 23 Tutorials

UNIT-IV

20 24 Operations on Graphs: Vertex insertion, vertex deletion

T1-481-484

21 25 Find vertex, edge addition, edge deletion.

T1-484-485

22 26 Graph Traversals- Depth First Search

T1-485-486

23 27 Graph Traversals-BFS T1-487-488

24 28 Graph storage Representation- Adjacency matrix.

T1-488

25 29 Graph storage Representation- Adjacency List

T1-489

26 30 Tutorials

UNIT-V

27 31 Graph algorithms : Minimum-Cost Spanning Trees

T1-513-514

23 32&33 Prim's & kruskals Algorithms T1-515-517 T3-356-362

24 34&35 Shortest Path Algorithms: Dijkstra's Algorithm

T1-518-519

25 36 All Pairs Shortest Paths Problem: Floyd's Algorithm

T3-432-434 T1-519-520

26 37 Warshall's Algorithm T3-432-434 T1-519-520

27 38 Tutorials

UNIT-VI

28 39 Sorting Methods : Order Statistics:

Lower Bound on Complexity T3-255 to

256

29 40 Lower Bound on Worst Case&

Average Case Complexity-heap sort T1-260-,264

30 41 Lower Bound on Worst Case

&Average Case Complexity-merge T1-264 to

269



sort


&Average Case Complexity-quick sort

T1-269 to 279


&Average Case Complexity-shell sort

T1-256 to 260

33 44 Tutorial

UNIT-VII

34 48 Pattern matching algorithms-introduction

Page-538-540

DSA USING C++

GOODRICH

35 49 Boyer –Moore algorithm Page-540-

545

DSA USING C++

GOODRICH

36 50 Knuth-Morris-Pratt algorithm Page-545-

549

DSA USING C++

GOODRICH

37 51 Tries: Definitions and concepts of digital search tree

T1-472-474 & Page-550-

553

DSA USING C++

GOODRICH

38 52 Binary trie, and Multi-way trie with examples

Page-554-560 & http://www.cs.cmu.edu/~fp/course

s/15122-f10/lectures/18-

tries.pdf

DSA USING C++

GOODRICH

39 53 Tutorial

UNIT-VIII

40 54 File Structures: Fundamental File Processing Operations-opening files, closing files

R5-40,45 R5-

REFERENCE TEXT 5

41 55 Reading and Writing file contents R5-46-52 R5-

REFERENCE TEXT 5

42 56 Special characters in files. R5-55 R5-

REFERENCE TEXT 5

43 57 Fundamental File Structure Concepts- Field and record organization

R5-144-157 R5-

REFERENCE TEXT 5

44 58 & 59

Managing fixed-length buffers Managing fixed-field buffers

R5-170-173 R5-

REFERENCE TEXT 5

45 60 Tutorial

Text Books

1. Data Structures, A Pseudocode Approach, Richard F Gilberg, Behrouz A Forouzan, Cengage.

2. Fundamentals of DATA STRUCTURES in C: 2nd

ed, , Horowitz , Sahani, Anderson-freed, Universities Press

3. Data structures and Algorithm Analysis in C, 2nd

edition, Mark Allen Weiss, Pearson

Reference Books

1. Web : http://lcm.csa.iisc.ernet.in/dsa/dsa.html 2. http://utubersity.com/?page_id=878 3. http://freevideolectures.com/Course/2519/C-Programming-and-Data-Structures

http://www.cs.cmu.edu/~fp/courses/15122-f10/lectures/18-tries.pdf







4. http://freevideolectures.com/Course/2279/Data-Structures-And-Algorithms 5. File Structures :An Object oriented approach with C++, 3

rd ed, Michel J Folk, Greg Riccardi,

Bill Zoellick 6. C and Data Structures: A Snap Shot oriented Treatise with Live examples from Science and

Engineering, NB Venkateswarlu & EV Prasad, S Chand, 2010.


iii b.tech i sem student hand book - welcome to · pdf fileharness psychology of testing...

Documents