Skip to content

Latest commit

 

History

History
52 lines (34 loc) · 4.04 KB

README.md

File metadata and controls

52 lines (34 loc) · 4.04 KB

CSE 220: Data Structures (3 credits) [Resource Link ⬇️⬇️]

Introduction to widely used and effective methods of data organisation, focussing on data structures, their algorithms and the performance of these algorithms. Concepts and examples, elementary data objects, elementary data structures, arrays, lists, stacks, queues, graphs, trees, compound structures, data abstraction and primitive operations on these structures. memory management; sorting and searching; hash techniques; Introduction to the fundamental algorithms and data structures: recursion, backtrack search, lists, stacks, queues, trees, operation on sets, priority queues, graph dictionary. Introduction to the analysis of algorithms to process the basic structures. A brief introduction to database systems and the analysis of data structure performance and use in these systems. The course includes a compulsory 3 hour laboratory work alternate week.

Pre Requisites:

CSE111: Programming Language-II

Suggested Books:

  1. Jeffrey Kingston,"Algorithms and Data Structures: Design, Correctness, Analysis", 2nd Edition, Addison-Wesley.

  2. Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman.,"Data Structures and Algorithms", Addison Wesley, 1974)

Additional Resources

Personal and Departmental Resources:

To help with the course, here are some curated resources:

Faculty and Student Contributions:

CSE220 Lab Solutions

CSE220 is a course that teaches Data Structures and their algorithms.

Important Notice

These solutions are meant for reference and educational purposes only. While you can use these solutions to understand the methods and approaches, plagiarism is strictly prohibited.

Directly copying the code violates academic integrity policies and hinders your learning and understanding of the subject. Always attempt to complete the assignments independently before looking at these solutions.

Contact Information

For corrections, suggestions, or any kind of academic help, please feel free to contact me at: