L01 - Introduction, Linked List, Recursion.pdf

L01 - Introduction, Linked List, Recursion.pdf - INFO1105...

Info icon This preview shows pages 1–15. Sign up to view the full content.

INFO1105 Data Structures Summer school University of Sydney
Image of page 1

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

} Introduction (week 1) } List of topics (prelim.), Assessment overview ; Linked lists , Recursion } Advanced: The median algorithm } Analysis of running times , Stacks , Queues (week 1) } Exceptions, applications using stacks, queues, Java generics } Iterators (week 1) } Trees (week 1-2) } Binary search trees , insertion at the root } Priority queues , heaps (week 2-3) } Selection and insertion sort, heap sort, merging heaps } Sorting (week 3) } Bubblesort , mergesort , quicksort , Bucketsort , Shellsort } Map ADT , hashing (week 3) } Hash tables , ordered map ADT , ordered search tables, dictionaries } Balanced search trees (week 4) } 2-3 trees , 2-4 trees , rotations } Red-black trees , Selection , (week 4) } Sets (union-find) , Graphs , DFS , BFS , (week 4) } Review (week 5) INFO1105 – Schedule may change ! © University of Sydney 2
Image of page 2
Introduction
Image of page 3

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

Introduction } Outline } Course outline } Assessment components } Tutorials © University of Sydney 4
Image of page 4
Teaching team } Dr. John Stavrakakis (unit coordinator) [email protected] } Martin McGrane } Waiho Wong } Tyson Thomas } Elie Moreau } Alan Robertson © University of Sydney 5
Image of page 5

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

Data structures } A table of data including structural relationships } Donald Knuth (Turing award ’74) } Algorithms + data structures = programs } Niklaus Wirth (Turing award ’84) © University of Sydney 6
Image of page 6
Why data structures } Programs are to manipulate data } Data should be organized so manipulations will be efficient } Search (e.g. Finding a word/file/web page) } Better programs are powered by good data structures } Naïve choices are often much less efficient than clever choices } Data structures are existing tools that can help you } Guide your design } and save you time (avoid re-inventing the wheel) © University of Sydney 7
Image of page 7

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

INFO1105 In this unit of study: } Fundamental data structures used in several applications } How they work } How to use them } How they are/can be implemented } Theoretical side of data structures… } Analysis of data structures } “Any comparison-based sorting algorithm requires at least ? comparisons to sort ? elements” } …and practical work } Programming/implementations in Java } a lot of it © University of Sydney 8
Image of page 8
INFO1105 } Is not about Java } Is not only a programming unit } Is not strictly data structures © University of Sydney 9
Image of page 9

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

Topics related to Data structures } Big Oh notation, scalability } Efficient algorithms/solutions } Modular solutions } Abstraction, abstract data types } Recursion } Analysis of running time (or number of operations) } Example data structures: Stacks, queues, trees, heaps, hashing, dictionaries, priority queues, red-black trees © University of Sydney 10
Image of page 10
and Java 11 Source:
Image of page 11

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

and Java Source: 12
Image of page 12
Classes } Lectures: 10x 2 hours per week } Lab: 14x 2 hours per week } Attend your assigned tutorial } Many assessments require your attendance } Please check the timetable. There will be interruptions to regular lecture/tutorials } } © University of Sydney 13
Image of page 13

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

© University of Sydney 14 Website via
Image of page 14
Image of page 15
This is the end of the preview. Sign up to access the rest of the document.
  • One '14

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern