Alpha Curriculum

APNA
COLLEGE
Alpha Placement Course

Java
' Let not the fruit of action be your motive to action. Your
concern is with action alone, not with the fruit of action. '
- The Bhagavad Gita
APNA
COLLEGE
300+
What's new? Coding Questions
400+
Our experience tells us that students on average videos. Classes on alternate
are 3 times more serious in a batch. The Live days for next 2.5 months
completion of course and watch time of students
increases exponentially. 7 Live Mentorship Sessions
APNA
COLLEGE
Batch Overview
Complete Java
Complete Data Structures & Algorithms
Live Resume Preparation 400+ 300+

video solved questions
Live Interview Preparation & Mentorship sessions lectures practice
Coding Questions on all Important Topics (asked by Top Duration : 2.5 Months
Companies) Course access is for One Year
APNA
Topics Java COLLEGE
CATEGORY CHAPTERS OVERVIEW
Flowcharts & Pseudocodes what are flowcharts, pseudocodes, decision making using flowcharts, examples
Variables & Data Types Our first Java program, Variables and data types, Taking input/output, How java code runs?
Basics of
Programming Conditional Statements Introduction to if else, else if, Nested conditionals, switch
Operators arithmetic, relational, logical & assignment operators
For loops, While loops, Do-while loops, Flow of execution of statements, break & continue,
For loop, While loop, Do-while loop examples
Loops & Functions Patterns Introduction to nested loops, basic to advanced patterns solved
(butterfly, floyd's triangle, rhombus etc.)
Functions Introduction to functions, function calling, Pass by value, scope
Introduction to arrays, arrays in memory, Passing arrays to

Introduction to Arrays functions, interview problems
Arrays
Searching & Sorting Linear search, Binary search, Selection sort, Bubble sort, Insertion sort, count sort
2D arrays, 2D arrays in memory, Examples using 2D Arrays

2D Arrays
2D Arrays & Strings Introduction to strings & StringBuilder, storage of strings and their
Strings inbuilt functions
APNA
Data Structures & Algorithms (DSA) COLLEGE
Introduction to recursion, Principle of mathematical induction, factorial, Fibonacci

Recursion, Backtracking, numbers, Recursion using arrays, Recursion using strings, Recursion using 2D arrays,
Divide & Conquer backtrack, merge sort, quick sort
Problem Solving
Techniques Bit Manipulation Binary number system, bitwise operators, operations on bits, fast exponentiation
Order complexity analysis, Theoretical complexity analysis, Time complexity analysis of

Time & Space Complexity searching and recursive algorithms, Space complexity analysis of merge sort
Greedy Algorithms Introduction to greedy approach to problem solving, solving classical problems
Objects & Classes, Creating objects, Getters, and setters, Constructors and related concepts,
Object-oriented Inbuilt constructor and destructor, Example classes, Static members, Function overloading
programming Basic to Advanced OOP and related concepts, Abstraction, Encapsulation, Inheritance, Polymorphism, Abstract
classes, Interfaces
Introduction to java collection framework, arrays, solved questions

ArrayLists
Linked list Introduction, Inserting node in linked list, Deleting node from linked list, Midpoint of
Linear Data Linked lists linked list, Merge two sorted linked lists, merge sort of a linked list, Reversing a linked list
Structures
Stacks Introduction, Stack using arrays, Dynamic Stack class, Stack using linked list, Inbuilt
Stacks and Queues stack, Queue using arrays, Dynamic queue class, circular queue
APNA
Data Structures & Algorithms (DSA) COLLEGE

Introduction to Binary Trees, Constructing the tree, Binary Tree traversals, Diameter of
Trees Binary Trees & BST binary tree, height & LCA of the tree, Introduction to Binary Search Trees, Searching a
node in BST, BST class, Inserting and Deleting nodes in BST, Types of balanced BSTs
Introduction to Heaps, Min/Max heaps, Heap Sort, Priority Queues, how to implement
Heaps/Priority Queues priority queues, Introduction to CBT(Complete Binary Trees) and its implementation, Insert
and Delete operations in heaps, Implementing priority queues, In-built Priority Queue
Hashing (Maps & Sets) Introduction to Hashing, Hashmaps, Inbuilt Hashmap, Hashsets, In-built Hashsets, Hash
functions, Insert and Delete operation implementation in hashmap/hashset, examples
Advanced Data
Structures Tries What are Tries, Creating a Trie node class, Insert, Search and Remove operation in Tries,
Types of Tries, Questions on Tries
Introduction to Graphs, Graph Terminology, Graph implementation, Graph

Graphs Traversals (DFS and BFS), Weighted and Directed Graphs, Minimum
Spanning Trees, Cycle Detection in Graphs, Kruskal's algorithm, Prim's
Algorithm, Dijkstra's algorithm, Bellman Ford Algorithm & a lot of questions
Segment Trees What are segment trees, Creation of segment trees, solving range queries,
immutable & mutable
Fundamentals of Dynamic Programming, Introduction to Memoization,

Dynamic DP & its Questions
Knapsack using DP, Factorial using DP, Fibonacci numbers using recursion,
memoization and tabulation, Longest Common Subsequence (LCS) using
Programming recursion, Catalan's number, Edit distance using recursion, memoization
and dynamic programming, Matrix Chain Multiplication and much more
APNA
COLLEGE
1st Lecture upload will be on 2nd August (9:00 PM)

Till then, keep learning & keep exploring ❤️

Alpha Curriculum

Uploaded by

Copyright:

Available Formats

Alpha Curriculum

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Alpha Curriculum

Uploaded by

Copyright:

Available Formats

APNA

Alpha Placement Course

Complete Data Structures & Algorithms

Live Resume Preparation 400+ 300+

CATEGORY CHAPTERS OVERVIEW

Operators arithmetic, relational, logical & assignment operators

Introduction to arrays, arrays in memory, Passing arrays to

2D arrays, 2D arrays in memory, Examples using 2D Arrays

CATEGORY CHAPTERS OVERVIEW

Introduction to recursion, Principle of mathematical induction, factorial, Fibonacci

Order complexity analysis, Theoretical complexity analysis, Time complexity analysis of

Introduction to java collection framework, arrays, solved questions

CATEGORY CHAPTERS OVERVIEW

Introduction to Graphs, Graph Terminology, Graph implementation, Graph

Fundamentals of Dynamic Programming, Introduction to Memoization,

1st Lecture upload will be on 2nd August (9:00 PM)

You might also like