×
If you want to be powerful, Educate yourself better.
--Your friends at LectureNotes
Close

Lab Manuals for Data Structure and Algorithms - DSA By veena p

  • Data Structure and Algorithms - DSA
  • Practical
  • 1166 Views
  • 17 Offline Downloads
  • Uploaded 1 year ago
0 User(s)
Download PDFOrder Printed Copy

Share it with your friends

Leave your Comments

Text from page-1

PRIYADARSHINI ENGINEERING COLLEGE, VANIYAMBADI – 635 751 (Approved by AIC TE, New Delhi and Affiliated to Anna University, Chennai) Listed in 2(f) & 12(B) Sections of UGC DEPARTMENT O F COMPUTER SCIENCE AND ENGINEERING III SEMESTER CSE CS8361 DATA STRUCTURES LABORATORY LAB MANUAL PREPARED BY G.PRAVEENA ASP/CSE

Text from page-2

PRIYADARSHINI ENGINEERING COLLEGE, VANIYAMBADI – 635 751 (Approved by AIC TE, New Delhi and Affiliated to Anna University, Chennai) DEPARTMENT O F COMPUTER SCIENCE AND ENGINEERING VISION OF THE DEPARTM ENT TO IMBIBE COMPUTER SCIENCE SKILLS TO MEET THE GROWING TECHNOLOGIC AL NEEDS OF SOFTWARE INDUS TRY FOCUSING SPECIF ICALLY RURAL BAS ED POPULATION. M ISSION OF THE D EPARTM ENT TO PROVIDE S TUDENTS AND FAC ULTY WITH AN OPEN ENVIRONMENT THAT FOSTERS P ROFESSIONAL AND P ERSONAL GROWTH. TO OFFER LIBERAL HIGH QUALITY COMPU TER SCIENCE EDUCATION. MOTIVATING STUDEN TS TO DO INTERDISCIPLINARY RES EARCH IN THE FIELD OF ENGINEERING AND TECHNOLOGY. PROGRAMME EDUCATIONAL OBJECTIVES (PEOs) PEO 1: Core Competence Graduates will be competent to design, develop and solve Engineering problems and shall have expertise in programming tools. PEO 2: B readth Graduates will acquire the skills required to be employed in National, International and Government Or ganizations. PEO 3: Lifelong Learning Graduates will be equipped with the skills to pursue higher education and be expert in their profession adopting lifelong learning. PEO 4: Professionalis m Graduates will have the ability to present and practice team based projects with professional ethics and s ocial responsibility.

Text from page-3

PROGRAM OUTCOMES (POs) PO1: Engineering Knowledge An ability to apply knowledge of computing, mathematics, science and engineering fundamentals appropriate to the discipline. PO2: Problem Analysis An ability to analyze a problem, identify and formulate the computing requirements appropriate to its solution. PO3: Design and Development of Solutions An ability to design, implement and evaluate a computer-based system, process, component or program to meet desired needs with appropriate consideration for public health, safety, cultural, societal and environmental considerations. PO4: Investigation of Complex Proble ms An ability to design and conduct experiments, as well as to analyze and interpret data. PO5: Modern Tool Usage An ability to use current techniques, skills and modern tools necessary for computing practice. PO6: Engineer and Society An ability to analyze the local and global impact of computing on individuals, organizations and society. PO7: Environment and S ustainability Knowledge of contemporary issues. PO8: Ethics An understanding of professional, ethical, legal, security and social issues and responsibilities. PO9: Individual and Teamwork An ability to function effectively individually and with teams, including diverse and multidisciplinary activities to acco mplish a common goal. PO10: Communication An ability to communicate effectively with a range of audiences. PO11: Lifelong Learning Recognition of the need for lifelong learning and an ability to engage in continuing professional development. PO12: Project Manage ment and Finance An understanding of engineering and management principles and apply these to one’s own work, as a member and leader in a team to manage project

Text from page-4

CS8361 DATA STRUCTURES LABORATORY OBJECTIVES • • • • To implement linear and non-linear data structures To understand the different operations of search trees To implement graph traversal algorithms To get familiarized to sorting and searching algorithms List of Experiments 1. Array implementation of Stack and Queue ADTs 2. Array implementation of List ADT 3. Linked list implementation of List, Stack and Queue ADTs 4. Applications of List, Stack and Queue ADT 5. Implementation of Binary Trees and operations of Binary Trees 6. Implementation of Binary Search Trees 7. Implementation of AVL Trees 8. Implementation of Heaps using Priority Queues. 9. Graph representation and Traversal algorithms 10. Applications of Graphs Implementation of searching and sorting algorithms 11. Hashing – any two collision techniques Total hours:60HRS OUTCOMES: At the end of the course, the students will be able 1. Write functions to implement linear and non-linear data structure operations 2. Suggest appropriate linear / non-linear data structure operations for solving a given problem 3. Appropriately use the linear / non-linear data structure operations for a given problem 4. Apply appropriate hash functions that result in a collision free scenario for data storage and retrieval

Lecture Notes