0% found this document useful (0 votes)
40 views11 pages

A Journey From Amateur To Skilled Professional

The document outlines a training program called Campus Recruitment Training (CRT) that aims to help engineering graduates become more employable. The training covers topics like quantitative aptitude, reasoning, verbal ability, programming concepts, and interview skills. Programming concepts covered include data types, loops, functions, pointers, linked lists, stacks, queues, trees, and sorting/searching algorithms. The training includes video lectures, practice questions, and online tests to help students learn and improve their skills over the 30 hour intensive course. Upon completion, students receive a certificate to validate the training they received.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
40 views11 pages

A Journey From Amateur To Skilled Professional

The document outlines a training program called Campus Recruitment Training (CRT) that aims to help engineering graduates become more employable. The training covers topics like quantitative aptitude, reasoning, verbal ability, programming concepts, and interview skills. Programming concepts covered include data types, loops, functions, pointers, linked lists, stacks, queues, trees, and sorting/searching algorithms. The training includes video lectures, practice questions, and online tests to help students learn and improve their skills over the 30 hour intensive course. Upon completion, students receive a certificate to validate the training they received.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 11

~ A Journey from Amateur to Skilled Professional

Problem Statement

• 94% of engineering graduates are unemployable, says this IT stalwart.


• The real reason why 95% of Indian engineers can't code.
• How can we increase the Placement rate for academics in Tier 2 ??

References:
//economictimes.indiatimes.com/articleshow/64446292.cms?utm_source=contentofinterest&utm medium=text&utm_campaign=cppst
//economictimes.indiatimes.com/articleshow/62067588.cms?utm_source=contentofinterest&utm_medium=text&utm_campaign=cppst
Why We??

• 94% of engineering graduates are unemployable, says this IT stalwart.


• The real reason why 95% of Indian engineers can't code.
• How can we increase the Placement rate for academics in Tier 2 ??

References:
//economictimes.indiatimes.com/articleshow/64446292.cms?utm_source=contentofinterest&utm medium=text&utm_campaign=cppst
//economictimes.indiatimes.com/articleshow/62067588.cms?utm_source=contentofinterest&utm_medium=text&utm_campaign=cppst
Courses Offered

• Campus Recruitment Training (CRT)


• Angular Development
• Digital Marketing
• Android Development
• Python Full Stack Development
• Software Development
CAMPUS RECRUITMENT TRAINING
APTITUDE,REASONING,VERBAL

Programming Concepts
7. Linked List
1. Basics & Data types
8. Stack & Queue
2. Pointers
9. Iteration & Recursion
3. Loops & Arrays
10. Trees &Hash Tables
4. Functions & Input / Output
11. Time Complexity
5. Operators and Precedence
12. Searching and Sorting
6. Structures &Unions
Coding
1. Finding Prime number 5. Finding Leap year
2. Palindrome Number 6. LCM & GCD of two numbers
3. Finding Factorial 7. Removing Duplicates in Array
4. Print Fibonacci Series 8. Bubble Sort
What’s Included?

Programming Concepts
Diagnostic Test • Video Lectures
7. Linked List
• Concept wise lectures on
1. Basics
Before&weData
begintypes
the training,
8. Stack & Queue
different topics
2. Pointers
we conduct a comprehensive
9. Iteration & Recursion
3. Loops & Arrays
diagnostic test
10. Trees &Hash Tables
4. Functions & Input / Output
11. Time Complexity
• Practice Questions
5. Operators
Classroomand Precedence
Training 12. Searching and Sorting
6. Structures &Unions • Topics wise segregated
30 hours intensive training by
Coding experienced faculty
practice questions

1. Finding Prime number 5. Finding Leap year


2. Palindrome Number 6. LCM & GCD of two
• Online numbers
Tests
Certificate
3. Finding Factorial 7. Removing Duplicates in Array
• Modules wise topic tests with
4. Print Fibonacci
Student will be Series
awarded with 8. Bubble Sort
detailed performance analytics
a training certificate
Modules
Programming Concepts
7. Linked List
1. Basics & Data types
8. Stack & Queue
2. Pointers
# Module 9. Iteration
hours&Program
Recursion
3. Loops & Arrays
10. Trees &Hash Tables
1 4. Functions
Quantitative Aptitude & Input / Output
11. Time15Complexity
hours
5. Operators and Precedence
2 Reasoning 12. Searching and Sorting
15 hours
6. Structures &Unions
3 Verbal Ability 15 hours
Coding
4 Interview Skills 15 hours
1. Finding Prime number 5. Finding Leap year
5 Programming concepts Number
2. Palindrome 6. LCM10& hours
GCD of two numbers
6 3. Coding
Technical Finding Factorial 7. Removing Duplicates in Array
15hours-20hours
4. Print Fibonacci Series 8. Bubble Sort
QuantitativeConcepts
Programming Aptitude
1. Number 7. Linked
13.List
1. System 7. Averages
Basics & Data types Problems on Trains, Boats
2. LCM HCF 8. Problems on Ages 8. Stack
14.& Queue
Simple and Compound Interest
2. Pointers
3. Decimal 9. Iteration & Recursion
3. Fractions
Loops & Arrays 9. Percentages 15. Geometry
4. Ratio Proportions
4. Functions & Input Profit and Loss 10.
10. / Output Trees
16.&Hash Tablesand Clocks
Calendar
5. Simplifications 11. Time and Work 11.
5. Operators and Precedence
Time17.
Complexity
Permutation and Combinations
6. Square6.roots 12. Time and Distance 12. Searching
18. DataandInterpretation
Sorting
Structures &Unions
Reasoning
Coding
1. 1. Finding Prime number
Series Completion 5. Finding Leap9.year
5. Direction Sense Test Coding and Decoding
2. Analogy 2. Palindrome Number 6. LCM & GCD of
6. Missing Characters 10.two numbers
Puzzle Test
3. 3. Finding Factorial7. Assertion and Reason
Classification 7. Removing Duplicates
11. BloodinRelations
Array
4. Logical4.
VennPrint Fibonacci Series
Diagrams 8. Bubble Sort 12.Data Sufficiency
8. Statements and Conclusions
Programming
Verbal AbilityConcepts 7. Linked List
1. Basics & Data types
1. Synonyms 5. 8.Sentence
Stack Completion
& Queue
2. Pointers
2. Antonyms 6. 9.Sentence
Iteration
Improvement
& Recursion
3. Loops & Arrays
3. Spotting Errors 7. 10.
Sentence
Trees Rearrangement
&Hash Tables
4. Functions & Input / Output
4. Correct and Incorrect Sentences 8. 11.
Reading
TimeComprehension
Complexity
5. Operators and Precedence
12. Searching and Sorting
6. Structures &Unions
Interview
CodingSkills
1. Finding Prime number 5. Finding Leap year
1. 2. Palindrome
How to introduce Number
yourself? 6. LCM & GCD of two numbers
2. 3. onFinding
Quick Tips Factorial
Handling 7. Removing Duplicates in Array
JAM, GD and Personal Interview
4. Print Fibonacci Series 8. Bubble Sort
Programming Concepts
7. Linked List
1. Basics & Data types
8. Stack & Queue
2. Pointers
9. Iteration & Recursion
3. Loops & Arrays
10. Trees &Hash Tables
4. Functions & Input / Output
11. Time Complexity
5. Operators and Precedence
12. Searching and Sorting
6. Structures &Unions
Coding
1. Finding Prime number 5. Finding Leap year
2. Palindrome Number 6. LCM & GCD of two numbers
3. Finding Factorial 7. Removing Duplicates in Array
4. Print Fibonacci Series 8. Bubble Sort
Contact Us

Bright side Consultancy Services


[email protected]
9849485501/8801358568

You might also like