Presentation is loading. Please wait.

Presentation is loading. Please wait.

{} Getting a Job in CS Micah Chasteen. Introduction Introduction Getting Started Getting Started Resumes Resumes Interviews Interviews Phone Phone In-Person.

Similar presentations


Presentation on theme: "{} Getting a Job in CS Micah Chasteen. Introduction Introduction Getting Started Getting Started Resumes Resumes Interviews Interviews Phone Phone In-Person."— Presentation transcript:

1 {} Getting a Job in CS Micah Chasteen

2 Introduction Introduction Getting Started Getting Started Resumes Resumes Interviews Interviews Phone Phone In-Person In-Person Offers Offers Outline

3 Why Why Set Goals Set Goals Give Confidence Give Confidence Demystify The Process Demystify The Process Provide Career Options Provide Career Options Because People Asked Me To Because People Asked Me To Introduction

4 Disclaimer Disclaimer May Be Too Intense For Some Viewers May Be Too Intense For Some Viewers No Purchase Necessary No Purchase Necessary For Educational Purposes Only For Educational Purposes Only Use Only As Directed Use Only As Directed Some Assembly Required Some Assembly Required Your Miles May Vary Your Miles May Vary Introduction

5 If you have time… If you have time… Projects Projects Internships Internships Research Research Papers Papers Conferences Conferences Contests Contests Getting Started

6 Start Studying/Refreshing Start Studying/Refreshing Apply Everywhere Apply Everywhere Even Google (When?) Even Google (When?) Experience and Future Opportunities Experience and Future Opportunities Use Job Sites Use Job Sites Network Network LinkedIn and Alumni LinkedIn and Alumni Getting Started

7 If you have time… If you have time… Start Your Resume Start Your Resume Add Details As They Happens Add Details As They Happens Always Keep It Up To Date Always Keep It Up To Date Resumes

8 Tailor For The Position Tailor For The Position Resume Paper Resume Paper 1 Page (B.S.) || 2 Page (M.S.) 1 Page (B.S.) || 2 Page (M.S.) Clean, Organized Style Clean, Organized Style Promote Yourself Reasonably Promote Yourself Reasonably Multiple Formats (PDF, DOC, TXT) Multiple Formats (PDF, DOC, TXT) 4 Second Rule 4 Second Rule Resumes

9 Layout Layout Name Name Contact Contact Objective Objective Experience Experience Skills Skills Education (GPA) Education (GPA) Projects Projects Clubs/Activities Clubs/Activities Interests Interests Reference Requests Reference Requests QRC/Link To Personal Site QRC/Link To Personal Site Resumes

10 Must Haves Must Haves C++ or Java C++ or Java Hot Skills Hot Skills Mobile Development Mobile Development Cloud Computing Cloud Computing Resumes

11 Electronic Resume Electronic Resume More Details More Details Easy, Professional Name Easy, Professional Name Reliable, Accessible Reliable, Accessible Elegant, Properly Coded Elegant, Properly Coded Personal Website

12 Actively Review Social Media Actively Review Social Media Reduce Your Social Time Reduce Your Social Time You Get Out What You Put In You Get Out What You Put In Dont Take The First Job Dont Take The First Job Aim For Concurrent Offers Aim For Concurrent Offers This Can Be A Long Process This Can Be A Long Process Recruiters Want Money (Not You) Recruiters Want Money (Not You) Reminders/Suggestions

13 HR Questions HR Questions Project Questions (Excel) Project Questions (Excel) Be Polite And Personable Be Polite And Personable Be Confident and Dont Give Up Be Confident and Dont Give Up Have Questions For Them Have Questions For Them Do At Least One Mock Interview (One For Each Kind) Do At Least One Mock Interview (One For Each Kind) Interviewing

14 Find Secluded Area Find Secluded Area Use Landline w/Hands Free Use Landline w/Hands Free No Noises or Distractions No Noises or Distractions Keep Resume In Sight Keep Resume In Sight No Visual Contact No Visual Contact Phone

15 Be Early Be Early Dress Nice But Appropriate Dress Nice But Appropriate Be Rested and Relaxed Be Rested and Relaxed Turn Cell Phone OFF Turn Cell Phone OFF Dont Fidget Dont Fidget Take Extra Resumes Take Extra Resumes In Person

16 Why Are Manhole Covers Round? Why Are Manhole Covers Round? How Many Golf Balls Can Fit On A School Bus? How Many Golf Balls Can Fit On A School Bus? How Many Piano Tuners Are There In Nashville? How Many Piano Tuners Are There In Nashville? How Do They Make M&Ms? How Do They Make M&Ms? Riddles

17 This a game for two players This a game for two players You have a flat, rectangular table You have a flat, rectangular table Each player lays a quarter on the table somewhere that touches no other quarter Each player lays a quarter on the table somewhere that touches no other quarter The loser is the first person who cannot place a quarter The loser is the first person who cannot place a quarter What is your strategy if you go first? What is your strategy if you go first? Question

18 Stress Stress Confidence Confidence Knowledge Knowledge Quick Thinking Quick Thinking Explaining Explaining Problem Solving Problem Solving Coding Interviews

19 Space Complexity Space Complexity Growth Complexity Growth Complexity Asymptotic Notation Asymptotic Notation Best, Average, And Worst Case Best, Average, And Worst Case Coding Interviews

20 Practice On A Whiteboard Practice On A Whiteboard Do Not Look Anything Up Do Not Look Anything Up Talk Out Loud Talk Out Loud Time Yourself Time Yourself Coding Interviews

21 Programming Contests Programming Contests Top Coder Top Coder ACM ICPC ACM ICPC Code Sprint Code Sprint Interview Sites Interview Sites Glass Door Glass Door Career Cup Career Cup Coding Interviews

22 Recursion Recursion Encryption Encryption Encoding Encoding Parallel Processing Parallel Processing Deadlock, Livelock Deadlock, Livelock Monitors, Semaphors, Locks Monitors, Semaphors, Locks Process VS. Thread Process VS. Thread Distributive Computing Distributive Computing Concepts

23 Traveling Salesperson Traveling Salesperson Knapsack (0/1) Knapsack (0/1) Shortest Path Shortest Path Must-Know Problems

24 C++ C++ Size of Data Types Size of Data Types IEEE Format IEEE Format Abstract Classes Abstract Classes Overloaded Operators Overloaded Operators Multiple Inheritance Multiple Inheritance ST Library ST Library Language Specific

25 Java Java Final, Finalize, Finally Final, Finalize, Finally Inheritance and Interface Inheritance and Interface Pass-By-Value or Pass-By-Reference Pass-By-Value or Pass-By-Reference Synchronization Synchronization Garbage Collection Garbage Collection Language Specific

26 Sorting Sorting Heap Sort Heap Sort Quick Sort Quick Sort Merge Sort Merge Sort Searching Searching Min, Max Min, Max K th Least K th Least Basic Algorithms

27 Design Patterns Design Patterns What Are These? What Are These? Test Cases Test Cases Practice Testing Programs Practice Testing Programs S.E. Questions

28 You have an array with 999 locations, and each location contains a unique integer with a value from 1 to 1000 (inclusive) You have an array with 999 locations, and each location contains a unique integer with a value from 1 to 1000 (inclusive) How do you find the missing number? How do you find the missing number? Question

29 Strings Strings Reverse (Words) Reverse (Words) Remove Characters Remove Characters Matching Substrings Matching Substrings Linked Lists Linked Lists Reverse (Singly-Linked) Reverse (Singly-Linked) Swap Pairs (Singly-Linked) Swap Pairs (Singly-Linked) Delete (Circular) Delete (Circular) Data Structures/ADT

30 Write a program to find the M th -to-last element in a singly linked list given only the head of the list. Write a program to find the M th -to-last element in a singly linked list given only the head of the list. Question

31 Write a program to determine if a singly linked list is cyclic. Write a program to determine if a singly linked list is cyclic. If it is then return the node that begins the new cycle. If it is then return the node that begins the new cycle. Question

32 Queue Queue Make From Stacks Make From Stacks Heap Heap Priority Queue Priority Queue Hash Table Hash Table Ordered Hash Table Ordered Hash Table Data Structures/ADT

33 Trees Trees Binary Tree Binary Tree Binary Search Tree Binary Search Tree 2-3 Tree and Tree 2-3 Tree and Tree Red-Black Tree or AVL Tree Red-Black Tree or AVL Tree Pre/In/Post Order Traversal Pre/In/Post Order Traversal Data Structures/ADT

34 Graphs Graphs Breadth First Search Breadth First Search Depth First Search Depth First Search Dijkstras Shortest Path Dijkstras Shortest Path A* Search A* Search Minimal Spanning Tree Minimal Spanning Tree Data Structures/ADT

35 Amazon Streaming Service Amazon Streaming Service Amazon Recommendation Service Amazon Recommendation Service Design Questions

36 Create a class-based weapon schema Create a class-based weapon schema Question

37 Self-Testing Furniture Class Self-Testing Furniture Class Question

38 Pivot of Rotated Array Pivot of Rotated Array Conways Game of Life Conways Game of Life Scrabble Tiles Scrabble Tiles Boggle Solver Boggle Solver Search Continuous Floating Point F(X) Search Continuous Floating Point F(X) Fibonacci Sequence (Memoized) Fibonacci Sequence (Memoized) Sum of Array Pairs Sum of Array Pairs Coding Questions

39 Write a program that prints out all the valid words on a Boggle board. Write a program that prints out all the valid words on a Boggle board. Question

40 Write a program to determine if an array has a pair of numbers that equal a given sum. Write a program to determine if an array has a pair of numbers that equal a given sum. Question

41 Read Everything Read Everything Look At The Benefits Look At The Benefits Consider Perks Consider Perks Travel Percentage Travel Percentage Relocation Relocation Research Location (CoL) Research Location (CoL) Comparing Offers

42 Work Environment Work Environment Ability To Advance Ability To Advance Experience Gained Experience Gained Is It What You Want To Do? Is It What You Want To Do? Comparing Offers

43 Call Them Call Them Be As Polite As Possible Be As Polite As Possible Keep Contact Information Keep Contact Information Declining Offers

44 {} Getting a Job in CS Thank You! Thank You!


Download ppt "{} Getting a Job in CS Micah Chasteen. Introduction Introduction Getting Started Getting Started Resumes Resumes Interviews Interviews Phone Phone In-Person."

Similar presentations


Ads by Google