Paid DataStructures/Algor­ithms 101 Class

  • September 8, 2013 · 10:00 AM

Build a solid foundation in Essential Data Structures and Algorithms

Pre-requisites:

• You have a working knowledge of Java

• You can code nested loops and manipulate arrays.

• You can write recursive functions.

What will you learn?

• Linked Lists

• Stacks

• Queue

• HashTables

• Binary Search

• Binary Trees

• Depth First Search

• Breadth First Search

• Quicksort

Additional Notes:

• Small Class Size (6-12) : If we cannot get 6 students to sign up, we will refund the money (and retry at a later date). 

Registration Process:

• Please RSVP ASAP if you are interested

• One of our hosts will reach out to you with the pre-course evaluation

• Once you complete the evaluation, you pay the course fee.

Join or login to comment.

  • Hemant

    Morning is really difficult as lot of other activities. Evening was working really good. So I will have to skip this time. I will miss this event.

    September 8, 2013

  • rsalota

    Due to too few people we have decided to cancel this class.

    September 6, 2013

  • A former member
    A former member

    Could we please also cover Tries?

    August 17, 2013

    • Eugene

      Maybe you're feeling a little better about the tries now, huh?

      1 · August 30, 2013

    • A former member
      A former member

      yeap! really good. thanks

      September 5, 2013

  • A former member
    A former member

    I'd like to know what I don't know. Do you have a "final" test for this course that I can take to see if this is worthwhile?

    September 2, 2013

    • Eugene

      Item 4) is a little broad, so here are some examples of problems we'd want people to be able to discuss intelligently after completing this course. Note that these are not necessarily problems we will cover directly, but just problems you should be able to figure out from the knowledge you gain:

      1) Given an array of numbers, how would you remove duplicates from it efficiently? Can you think of several possible approaches?

      2) Given an array of integers, in O(n log n) time, find two elements that sum to a given target value T. How about an O(n) solution?

      3) How would you represent a file system in terms of data structures? (Note: design questions are out of scope. Exposure to trees is however useful for this problem.)

      September 3, 2013

    • Eugene

      4) How would you need to modify a standard tree implementation in order to be able to return the largest element in the tree less than a specified number X?

      5) What considerations would you use to determine which sorting algorithm to use to sort a list?

      6) Write neat, recursive code for finding a) the largest value in a binary tree; b) number of nodes in a binary tree, c) the average node value in an n-ary tree.

      September 3, 2013

  • A former member
    A former member

    Forgot to ask ,Do we need to know Java lang or any OOPS lang like C# is also OK ?

    August 12, 2013

    • rsalota

      C# sharp should be good enough.

      August 18, 2013

    • Eugene

      The examples we do will be in Java. We will only assume knowledge of basic language constructs, which are extremely similar between Java and C#. I recommend taking a look at some Java code snippets and deciding for yourself whether you will have any trouble following in class. As for what you will learn, by far the main focus will be on the concepts, which are language-independent. However, we will also briefly mention how to use some of the Java standard libraries that implement the data structures you learn about. Those are called different names but have very similar functionality in C#. With a small amount of practice, you should be able to transition to C# easily.

      August 30, 2013

  • Greta W.

    How much time should the pre-evaluation take? Will this be a collabedit session?

    August 25, 2013

    • rsalota

      Should not be more than 30 minutes.

      August 25, 2013

  • A former member
    A former member

    Vivek ,can you share "pre-course" evaluation details ? or do we need to pay first to get the "pre-course" evaluation details

    August 12, 2013

    • rsalota

      The pre course evaluation details is basically to test that you know basic programming and know how to think through for loops, if else condition - and can easily write basic algorithms.

      August 18, 2013

  • Vivekanand K.

    Thanks for the question. Register first, one of us will pung you with the pre course test. Only after you complete that should you pay.

    August 12, 2013

  • Vivekanand K.

    In order to make the most of the class, we have a "pre-course" evaluation. This will help you decide if this course will be beneficial to you.

    August 12, 2013

4 went

Your organizer's refund policy for Paid DataStructures/Algorithms 101 Class

Refunds offered if:

  • the Meetup is cancelled

Additional notes: We need at least 6 students for this class to be useful. If we are unable get 6 students to sign up, we will refund the money (and retry at a later date).

Payments you make go to the organizer, not to Meetup. You must make refund requests to the organizer.

Imagine having a community behind you

Get started Learn more
Henry

I decided to start Reno Motorcycle Riders Group because I wanted to be part of a group of people who enjoyed my passion... I was excited and nervous. Our group has grown by leaps and bounds. I never thought it would be this big.

Henry, started Reno Motorcycle Riders

Sign up

Meetup members, Log in

By clicking "Sign up" or "Sign up using Facebook", you confirm that you accept our Terms of Service & Privacy Policy