DSA Using C - C++
DSA Using C - C++
DSA Using C - C++
About AvaIntern
Ava Intern is an Online learning platform that provides students a holistic learning experience to help make them
industry ready.With access to the Industry Experts, Online Courses and blended learning, it allows students to Learn
beyond Expectations
WHAT YOU WILL GET ?
Mentorship: The platform offers expert mentorship by professionals from various industries to guide students.
Project-Based Learning: AvaIntern emphasizes project-based learning, providing real-world experiences and
hands-on challenges.
Virtual Campus: AvaIntern is India's first-ever virtual campus dedicated to Placement and Mentorship for
undergraduate students.
Industry Collaborations: AvaIntern collaborates with renowned companies like Ernst & Young, TCS, VVDN, Presidio,
Genpact, and more.
Innovative Projects: AvaIntern offers unique and innovative projects that challenge students and boost creativity.
Resume Building: Engaging in AvaIntern projects enhances students' resumes and career prospects.
Flexible and Online: Provides a flexible learning environment through online workshops and projects.
DSA
( DATA STRUCTURES & ALGORITHMS )
USING C/C++
3 MONTHS CURRICULUM
PROGRAM STRUCTURE
1.Cohort based live program Quick doubt resolution
6.Placement Assistance for next 2 years helping students land in their dream job!
Certifications :
1. Course completion certificate through company
2. Project Completion/ internship Certification from company
3. Experience Certificate from Company
MODULES in DSA
01 02
Introduction to Arrays and Strings
DSA
03 04
Linked Lists Stacks and Queues
MODULES in DSA
05 06
Trees and Binary Graphs
Trees
07 08
Sorting and Project
Searching
Algorithms
COURSE STRUCTURE
MONTH WEEK DAY HOURS MODULE
1 hour 30 mins Linked List Variations (Skip Lists, Unrolled Linked Lists)
5 SAT
30 mins ASSIGNMENT & QUIZ
SAT 1 hour 30 mins Implementing Stacks using Arrays and Linked Lists
6
Applications of Stacks (Expression Evaluation, Parentheses
SUN 1 hour 30 mins Matching)
SAT 1 hour 30 mins Implementing Queues using Arrays and Linked Lists
7
SUN 1 hour 30 mins Introduction to Trees: Types and Terminology
2nd FRI 1 hour 30 mins Binary Trees: Introduction, Properties, and Operations
MONTH
1 hour 30 mins Binary Tree Traversals (Inorder, Preorder, Postorder)
8 SAT
30 mins Binary Search Trees: Properties and Operations
FRI 1 hour 30 mins Insertion Sort and Variants (Binary Insertion Sort)
12 SAT 1 hour 30 mins Linear Search, Binary Search, and Interpolation Search
BSNL
Thank You
Do you have
any questions?
support@avaintern.com
+91 9606670754
www.avaintern.com
Follow Us On :
Linkedin & Instagram : @avaintern