vishal initials

8/3/2019 Vishal Initials

http://slidepdf.com/reader/full/vishal-initials 1/19

A PROJECT REPORT

On

“INFOPARK”

Submitted to the Jawaharlal Nehru Technological University in Partial fulfillmentof the requirements for the award of the Degree of

BACHELOR OF TECHNOLOGY

IN

COMPUTER SCIENCE AND ENGINEERING

BY

J. K. Vishal Ra j B. Sirisha

(06581A0560) (07581A0564)

K. Sravani G. Veerabhadra Rao

(07581A0568) (06581A0555)

UNDER THE ESTEEMED GUIDENCE OF

Ms. N. Mamtha B.Tech.

Asst. professor

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

NAGARJUNA INSTITUTE OF TECHNOLOGY AND SCIENCES

ISO (9001-2008)

(Affiliated to Jawaharlal Nehru Technological University, Hyderabad)

V.T. Palem(post), Srinivas Nagar,Miryalaguda-508 207.Dist:Nalgonda,A.P.

(2010-2011)



Department Of Computer Sciences & Engineering

CERTIFICATE

This is to certify that the Project work entitled “Infopark” being submitted by “Mr. J

K Vishal Ra j” bearing Roll no. 06581A0560, “Mr. B. Sirisha” bearing Roll no.07581A0564, “Mr. K. Sravani” bearing Roll no. 07581A0568 and Mr. “G. Veerabhadra

Rao” bearing Roll no. 06581A0555 in partial fulfillment for the award of Bachelor of

Technology in Computer Science and Engineering to the Jawaharlal Nehru Technological

University is a record of bonafide work carried out by them under our guidance and

supervision. The results embodied in this project report have not been submitted to any other

University or Institute for the award of any Degree / Diploma.

Internal Guide Project Coordinator

Ms. N. Mamtha, B.Tech Mr. D. Krishna, M.Tech

Assistant Professor , CSE Associate Professor , CSE

Head of the Department Principal

Mr. E. Ravi, M.Tech Dr. Ganti Krishna Sarma, Ph.D.

Associate Professor , CSE

………………………

External



ACKNOWLEDGEMENT

We express our deep gratitude towards our internal guide Ms. N. Mamtha for her

guidance, comments and encouragement during the course of present work.

We are grateful to the Head of the Department of Computer Science & Engineering

Professor Mr. E. Ravi for his valuable suggestions and encouragement during course of the

work.

We gratefully acknowledge the inspiring guidance, encouragement and continuous

support of Mr. D. Krishna. His helpful Suggestion and constant encouragement have gone a

long way in the completion of this dissertation. It was a pleasure working under his alert,

human and technical supervision.

We wish to express our sincere thanks to our Honorable Principal Dr. Ganti Krishna

Sarma for giving us permission for carrying out the project.

We are greatly indebted to our college, Nagarjuna Institute of Technology &

Sciences, which has provided use the healthy environment to achieve our ambitions and

goals.

J. K. vishal Raj (06581A0560)

B. Sirisha (07581A0564)

K. Sravani (07581A0568)

G. Veerabhadra Rao (06581A0555)



ABSTRACT

Association rule mining is an active data mining research area. However, most ARM

algorithms cater to a centralized environment. In contrast to previous ARM algorithms,

ODAM is a distributed algorithm for geographically distributed data sets that reduces

communication costs. Modern organizations are geographically distributed. Typically, each

site locally stores its ever-increasing amount of day-to-day data. Using centralized data

mining to discover useful patterns in such organizations' data isn't always feasible because

merging data sets from different sites into a centralized site incurs huge network

communication costs. Data from these organizations are not only distributed over various

locations but also vertically fragmented, making it difficult if not impossible to combine

them in a central location.

Distributed data mining has thus emerged as an active sub-area of data mining

research. Distributed ARM algorithms, aim to generate rules from different data sets spread

over various geographical sites; hence, they require external communications throughout the

entire process. DARM algorithms must reduce communication costs so that generating

global association rules costs less than combining the participating sites' data sets into a

centralized site. However, most DARM algorithms don't have an efficient message

optimization technique, so they exchange numerous messages during the mining process. We

have developed a distributed algorithm, called Optimized Distributed Association Mining,

for geographically distributed data sets. ODAM generates support counts of candidate item

sets quicker than other DARM algorithms and reduces the size of average transactions, data

sets, and message exchanges.



LIST OF FIGURES

S. No Fig No Figure Name Page No

1. 2.2.1 Spiral Model 7

2. 3.2.2.1 Architectural Layer 19

3. 4.5.1 E-R Diagram 30

4 4.6.1.1 Class Diagram 31

5. 4.6.2.1 Use Case Diagram for Admin 33

6 4.6.2.2 Use Case Diagram for Student 34

7 4.6.2.3 Use Case Diagram for Instructor 35

8 4.6.3.1 Sequence Diagram for Admin 37

9. 4.6.3.2 Sequence Diagram for Student 38

10. 4.6.3.3 Sequence Diagram for Instructor 39

11. 4.6.4.1 Collaboration Diagram for Admin 40

12. 4.6.4.2 Collaboration Diagram for Student 41

13. 4.6.4.3 Collaboration Diagram for Instructor 42

14. 4.6.4.1 Activity Diagram for Admin 43

15. 4.6.4.2 Activity Diagram for Student 44

16. 4.6.4.3 Activity Diagram for Instructor 45

17. 4.7.1 Zero level DFD Diagram 50

18. 4.7.2 First Level DFD for Admin 51



S. No Fig No Figure Name Page No

19. 4.7.3 First Level DFD for Student 52

20. 4.7.4 First Level DFD for Instructor 53

21. 4.7.5 Second Level DFD for Admin 54

22. 4.7.6 Second Level DFD for Student 55

23. 4.7.7 Second Level DFD for Instructor 56

24. 7.2.1 Strategic Approach to Software Testing 79



LIST OF TABLES

S.NO Table No Name of the table Page No

1. 4.3.1 Table for assignment 24

2. 4.3.2 Table For Batch 25

3. 4.3.3 Table For Course 25

4. 4.3.4 Table For Feedback 26

5. 4.3.5 Table For Instructor 26

6. 4.3.6 Table For Login 27

7. 4.3.7 Table For New Content 27

8. 4.3.8 Table For Student 28

9. 4.3.9 Table For Timetable 28

10. 7.4.1 Table For Test Case Report 84



CONTENTS

S. No Topic Page No

1. INTRODUCTION 1

1.1 Introduction 2

1.2 Scope 2

1.3 Objective 3

1.4 Existing System 3

1.5 Proposed System 4

2. SYSTEM ANALYSIS 5

2.1 Introduction 6

2.2 Analysis Model 6

2.3 Software Requirement Specifications 8

2.3.1 Functional Requirements 8

2.3.2 Non-Functional Requirements 9

2.3.3 Performance Requirements 9

2.4 Feasibility Study 10

2.4.1 Technical Feasibility 10

2.4.2 Operational Feasibility 11

2.4.3 Economic Feasibility 12



S. No Topic Page No

2.5 Hardware and Software Requirement 12

2.5.1 Hardware Requirements 25 2.5.2 Software Requirements 25

3. TECHNOLOGIES USED 13

3.1 Introduction to .Net framework 14

3.2 C#.Net 17

3.2 SQL Server 20

4. SYSTEM DESIGN 22

4.1 Introduction 23

4.2 Normalization 24

4.3 Data Dictionary 25

4.4 Modules Description 30

4.5 E-R Diagram 30

4.6 UML Diagrams 32

4.6.1 Class Diagram 32

4.6.2 Use Case Diagram 33

4.6.3 Sequence Diagram 37

4.6.4 Collaboration Diagram 41

4.6.5 Activity Diagram 44



S. No Topic Page No

4.7 Data Flow Diagram 47

5. IMPLEMENTATION 58

5.1Sample Code 59

6. OUTPUT SCREENS 63

7. TESTING 79

7.1 Introduction 79

7.2 Strategic Approach of Software Testing 79

7.3 Testing strategies 80

7.3.1 Test Case Preparation 82

7.3.2 Test Case Verification 82

7.4 Test Case 83

8. CONCLUSION 86

8.1Future Enhancements 87

9. REFERENCES 88

vishal initials

Documents