Computer Science Sessions Java Intro to JavaOverview (Computers, Programming, and Java), Variables, Assignment, Types (Simple Types and Strings), Basic I/O (System.out and Scanner), Branching (if-else, relational operators, logical operators, and switch), Looping (for, forEach, while, do while), Methods (fixed parameters, variable number of parameters, return type, overloading, pass by value), String Operations, String Builder, Operators (++, – -, +=, -=, *=, /=, %), Classes, Objects, Constructors, static, this, final, import, Testing, enum, Naming Conventions and Coding Conventions, Array and ArrayList, Math Library Operations, File Processing, Exceptions and try-catch, etc.Schedule Session Intermediate JavaPackages, Modules, Inheritance, Polymorphism, Abstract Classes, Interfaces, super, this, Casting, Boxing and Unboxing, Problem Decomposition, Pseudo-code, Access Modifiers, finally, Jumping (break and continue), Operators (tertiary operator, bitwise operators), Version Control(Git), Multidimensional Arrays, Jagged Arrays, Generics, HashMap, HashSet, Stack, Queue, Linked List, Iterator, Object Cloning, Serialization, Random Number Generators, Object Design, Comparable, Comparator, etc.Schedule Session Advanced JavaBinary Tree, Iterative Algorithms, Recursive Algorithms, Lambda Expressions, Regular Expressions, record, Observer Pattern, Event Driven Programming, Graphical User Interface, Nested Types, Type Parameter Constraints, Threads, Processes, Synchronization, Asynchronization, Concurrency, Parallelism, Socket Programming, NIO, Design Patterns (State, Command, Factory, Strategy, Adapter, Composite), Reflection, Java Virtual Machine, Garbage Collection, etc.Schedule Session C# Intro to C#Overview (Computers, Programming, and C#), Variables, Assignment, and Types (Simple Types and Strings), Properties, Basic I/O (reading from and writing to console), Branching (if-else, relational operators, logical operators, and switch), Looping (for, forEach, while, do while), Top Level Statement, Methods (fixed parameters, variable number of parameters, named parameters, return type, overloading, in, out, ref), String Operations, String Builder, Interpolated String, Verbatim String, Operators (++, –, +=, -=, *=, /=, %), Classes, Objects, Object Initializers, and Constructors, static, this, final, import, using, Testing, enum, Naming Conventions, Coding Conventions, Arrays, Lists, Math Operations, File Processing, Exceptions and try-catch, etc.Schedule Session Intermediate C#Namespaces, Assemblies, Inheritance, Polymorphism, Abstract Classes, Interfaces, super, this, Casting, Boxing and Unboxing, Nullable Types, Problem Decomposition and Pseudo-code, Access Modifiers, finally, Destructor, Jumping (break and continue), Operators (tertiary operator, bitwise operators), Version Control – Git, Multidimensional Arrays, Jagged Arrays, Generics, Dictionary, HashSet, Stack, Queue, Linked List, Iterator, yield, Object Cloning, Serialization, Random Number Generators, Object Design, etc.Schedule Session Advanced C#Binary Tree, Iterative Algorithms, Recursion Algorithms, Lambda Expressions, Regular Expressions, record, struct, Tuple, .Net, Extension Methods, LINQ, Anonymous Types, Delegates, Observer Pattern, Event Driven Programming, Partial Classes, Graphical User Interface, Nested Types, Type Parameter Constraints, Threads, Processes, Synchronization, Asynchronization, Concurrency, Parallelism, Socket Programming, Design Patterns (State, Command, Factory, Strategy, Adapter, Composite), Reflection, Garbage Collection, etc.Schedule Session Data Structures and Algorithms Data Structures, Algorithms, and AnalysisArrays and Lists, Time and Space Complexity Analysis, Linked Lists, Dictionaries, Sets, Bloom Filters (Hash Functions, Collision Handling, 2 Integer Sum Problem), Iterative Process vs Recursive Process, Sorting, Searching (Finding the i’th Order Statistic), Stacks (Depth First Search), Queues (Breadth First Search), Trees (BST, Heaps, Median Maintenance), Graphs (Adjacency List, Adjacency Matrix, Minimum #of Hops, Connected Components, Topological Sort, Strongly Connected Components), Divide and Conquer Algorithms (Binary Search, Merge Sort, Quick Sort, Towers of Hanoi, Closest Pair), Greedy Algorithms (Minimal # of Coins, Fractional Snapsack, Kruskal’s MST, Prim’s MST, Dijkstra’s Shortest Weighted Path, Job Sequencing, Huffman Coding, Max Flow Problem, Least Recently Used Page Replacement), etc.Schedule Session Advanced Data StructuresUnion Find, Skip Lists, Balanced Trees (AVL, Red-Black, Splay, 2-3-4 Trees, B-Trees, Treap), Amortized Analysis, Augmented BST, Dynamic Programming (0\1 Snapsack, Longest Common Subsequence, Partition Problem, Count Derangements, Floyd Warshall, Bellman–Ford), Randomized Algorithms (QuickSort, Minimum Cut), Backtracking (8 Queens, Crossword Puzzle, Sudoku), Tries, String Processing, P, NP, NP-Complete, NP-Hard (Bin Packing, Graph Coloring, K-Centers), etc.Schedule Session
