From 6047a07ddcc5b1a54dfa987e54fd81addbff657b Mon Sep 17 00:00:00 2001 From: Justin Yao Du Date: Fri, 2 Jun 2023 19:09:06 -0700 Subject: [PATCH] Update expected knowledge for developer interviews --- pages/students.tsx | 15 +++++++++------ 1 file changed, 9 insertions(+), 6 deletions(-) diff --git a/pages/students.tsx b/pages/students.tsx index 58b9fff5..d5707552 100644 --- a/pages/students.tsx +++ b/pages/students.tsx @@ -62,6 +62,8 @@ Here is the knowledge we expect for each grade level. The interview questions mi #### Freshmen +Approximately CSE 8A or equivalent: + - Familiarity with at least one programming language - Basic datatypes: booleans, integers, floating-point numbers, strings, arrays/lists - Control flow structures: if/else statements, for/while loops @@ -71,20 +73,21 @@ Here is the knowledge we expect for each grade level. The interview questions mi #### Sophomores +Approximately CSE 12 or equivalent: + - All of the topics for freshmen, listed above - Pointers or references, depending on the language you use - Recursion -- Data structures: multidimensional arrays/lists, linked lists, hash tables (also known as hash maps, dictionaries) -- Algorithms: sorting, binary search, greedy +- Data structures: multidimensional arrays/lists, dynamic arrays, linked lists, stacks, queues, heaps, binary search trees, hash tables (also known as hash maps, dictionaries) +- Algorithms: sorting, binary search - Object-oriented programming concepts: classes, constructors, instance variables, methods #### Juniors/Seniors - All of the topics for freshmen and sophomores, listed above -- Designing JSON-compatible data representations in the language of your choice (don't worry about serialization/deserialization though) -- Analyzing time and memory complexity -- Data structures: stacks, queues, heaps, trees, and graphs -- Algorithms: divide and conquer, recursion and backtracking, memoization, _basic_ dynamic programming +- Analyzing time and space complexity +- Trees and graphs +- More challenging applications of the previously listed algorithms and data structures ### How can I prepare for the technical components of the developer recruitment process?