Skip to content

Latest commit

 

History

History
97 lines (77 loc) · 2.8 KB

README.md

File metadata and controls

97 lines (77 loc) · 2.8 KB

Programming-For-Placements-L1

Programming for placements. Type = Level 1. Powered by Twoleaps.com

How to use this template?

  • Mentor should fork this template.
  • Mentee should join in as a contributor.

This template is designed to assist Twoleaps mentorship program. The template consists of two major sections: Goals and Progress tracker. Mentors and mentee should add goals prior to start of mentorship. Both Parties should have agreement on the goals. Progress tracker is to be updated on week by week basis with new tasks to complete the defined goals. For each week, a folder in the repository has to be maintained which captures the work done. It can be a small essay of things learned or code written etc.

Giving feedback

Regular feedback is highly encouraged. Feedbacks should inspire improvement. Mentors should summarize week by week progress in form of feedback whenever possible and add it to the weekly work folder in form of week1/feedback.md

Timeline

<Add mentorship timeline here in weeks. Example: 8 weeks starting 10th August>

Goals

The objectives of the mentorship should be listed down here. They can be customized over time by the mentor or the mentee's preferences.

  • Programming principles

    • Learning a programing language well.
    • Knowing pointers, references, variable types, memory allocation etc.
    • Iteration, Condition check, File manipulation etc.
    • Learn C language
  • Understanding complexity

    • Big O notation.
    • Space and time complexity
    • Asymptotics
  • Data Structures

    • Arrays
      • Multi-dimension arrays
      • Dynamic arrays
      • Jagged arrays
    • Linked list
      • Singly LL
      • LL vs Arrays
      • Doubly LL
      • Circular LL
    • Stack
    • Queue
      • Priority Queue
    • Hash Table
    • Trees
      • Binary Tree
      • Binary Search Tree
      • Trie Tree
      • AVL Tree
    • Heap
    • Graph
      • Representing graph
      • Traversing
  • Algorithms

    • Searching
      • Linear search
      • Binary search
      • Interpolation search
    • Sorting
      • Selection sort, Bubble sort
      • Insertion sort
      • Merge sort, Quick sort
    • Graph
      • Shortest path
      • Spanning tree
  • Interviwing principles

    • Code quality
    • Whiteboarding
    • Expressing ideas
    • Testability
  • Twoleaps Add-ons

    • Complete 1 mock phone screen interview
    • Resume review
    • Build a Web presence

Progress Tracking

Track weekly progress in this section according to above mentioned goals.

  • Week 1

    • Task 1
    • Task 2
    • Task 3