DCSA PU - 2023 Placement Batch - 220103 - 154519
DCSA PU - 2023 Placement Batch - 220103 - 154519
DCSA PU - 2023 Placement Batch - 220103 - 154519
“CrushIT 2022”
• If you are someone working hard on Programming skills and still seeing little to no improvement.
• If you are someone who doesn’t know coding but want to get placed in top IT firms.
• If you are someone confused with the enormous available resources on internet for placement
Preparation
• If you are someone who wants to get a 𝑑𝑒𝑎𝑑𝑙𝑖𝑛𝑒 of next 5 month to be ready for top-MNC
If answer of any of the above questions is YES then you can join Placement batch at career café
before its too late and be ready to grill with us for next 6 months to get your dream job
CLASS I: The first category consists of entire technical content along with lectures and other
resources to learn programming basics, OOPs, Data Structures, Algorithms, CS Fundamentals –
OS, DBMS, Networking etc.
There will be regular online coding competition on HackerRank
CLASS II: The second part contains classes on Aptitude , Logicalreasoning, Verbal Ability, and
Quantitative Reasoning. This phase will also cover the interview puzzle sessions.
CLASS III: The third category will main focus on Interview skill and your Presentation skills . This will
consist of Assessment Test , Mock interviews by industrial expert etc.
It will also include JAM sessions and GD Sessions ( For Deloitte etc) .
CLASS IV : Project Mentorship - One or two good projects in your resume will give you an edge
over other students in Interviews . Projects mentioned in your resume put a greater impact on the
interviewers since it shows you have better practical experience and technical skills than others
Every weekend there will be Project specific classes where the industrial mentors from top tech
companies will train you with web development projects and assign you home assignments
OOPs Concept
Time complexity
Introduction to Recursion
Searching Algorithms
Sorting Algorithms
Array
Strings
Linked List
Stack
Queue
Recursion
Maps
Sets
Heaps
Trees
Classes will be conducted in this sequence only with one trainer clearing the fundamental concepts and
another trainer will take Problem solving classes of data structure and algorithm. All previous companies
questions will be discussed here.
APTITUDE SYLLABUS
Number system
HCF & LCM
Ratio and Proportion
Time, Speed & Distance
Reasoning Syllabus
Blood relation
Sequence and Series
Syllogism
Coding Decoding
Calendar
Clock
Cubes and Dices
Analogy
Ranking
Verbal reasoning
Data sufficiency
Seating arrangement
OBJECT ORIENTED PROGRAMMING (C++): (Most important for interviews)
DBMS , Operating System (OS) , Networking interview questions booklet will be provided with
answers and also lectures on its important topics with Mock Interviews.
SQL queries are one of the most important topics in interviews. Special classes will be
conducted by industrial experts with special SQL based Mock Interviews.
Language overview classes ( C, C++, JAVA) will be conducted with special emphasis on output
based questions and important previous interview questions will be discussed. Language
based mock interviews will be conducted before final full mock interviews.
Every student has to maintain a Excel Sheet in which all the coding questions which he/she has
practiced has to be mentioned with comments so that mentors can go through you
complete work and suggest improvements
In the same excel sheet mention all the projects done with comments so that you can be
mentored and interviewed on your projects
All students will be divided in to small groups (Coding Pals) of 2-3 students , you have
to cover your entire placement coding journey with this group.
2-3 Projects is compulsory for every individual. On weekends we have project classes where
Industrial mentors will guide on web development projects Those having confusion can share
there ideas with our mentors
Mock Interviews:
Though everything is important but the most important one is communication. You may be good at
DSA , Aptitude and Projects but your chances of selection is reduced if you can’t communicate well.
You are given a problem and you take the lead of solving the problem via thoughts first and then via
code, with an intent to bring clarity in ambiguity
You may not be sure whether you are ready for an interview or not.
We all face this issue and miss lot of good opportunities during campus placement without testing
our skills.
Mock interviews play an important role in Testing your skills and knowing which areas we need to
improve before attending the actual interview..
How does Career Cafe Mock Interviews from Industrial experts help you?
Test yourself to find out your weak areas in a mock interview environment.
Find the areas that need improvement, what you are doing right, and what's holding you back
Improve your performance in interviews , reduce stress , get more confident and eliminate the
fear
Helps you to improve your communication skills
It helps you learn what interviewers look for and how to avoid red flags during an interview
Example 1:-
values=[1,2,3,4,5,5,5,8];
output=[1,2,3,4,5,8]
Explanation:- 5 is occurring 3 times. so remove the extra two times.
Example 2:-
values=["sem","star","star"];
output=["sem","star"]
Explanation:- "star" is occurring 2 times. so remove the extra.
Example 3:-
values=[];
output=[]
Explanation:- As there are no elements in the array output will remain empty.
Naive/Iterative approach.
Hashmap approach.
Two pointer approach.
1. Naive/Iterative approach:-
Algorithm for removing all occurrences of an element using the Iterative/Naive approach as follows.
2. Hashmap approach:-
As we know, hashmap can only have unique keys. Let's use this characteristic of hashmap to solve this
problem. The process is as follows.
Initialize a hashmap.
Start a loop starting with 0 till the length of array-1.
Check if the element at ith index is present in the hashmap, if not put it in the hashmap with the key
being index and value being the actual value of the number array{i: values[i]}.
Once the process is completed until the end of the array, Iterate over the keys of the hashmap and
return the values of every key of the hashmap.
As part of this algorithm, the first step is to sort the array. Then apply two-pointer approach as
described below.
Initialize the two pointers say first Pointer and second Pointer at index 0.
Here the first Pointer keeps the track of the index where we need to push the values from the second
Pointer index which are not equal to the element given.
o Loop with second Pointer till the end of length of array, check if the values at second Pointer
equal to the element needs to be deleted.
o If the elements match, swap the value from second Pointer to the first Pointer. Once the
element is swapped increment the first Pointer by 1.
o Repeat the same process until the end of the array. In the end, Array from 0 till the first Pointer
is the result we are looking for.
Please pay your installments strictly between mentioned dates only.
We have Small batches with limited seats only because we have to mentor each and every
student according to his /her strength.
The top performers from batches will be referred for bigger tech companies by our Industrial
experts having CTC 15+ lakh
https://docs.google.com/forms/d/1RnUhreONppzvO7mY3wj5kDRVkQn0GxKaHKJr7gr2pi
w/edit
Results of 2022 Batch (200+ Students Placed with 100+ students having more
than 2 jobs)
+ Many More
200+ Students placed in 2019 and 2020 in American express, Amdocs , Edifecs, Vserve,
IVP, Accolite , TCS digital and Ninja, Bloc8, GoldmanSachs etc…
For all results and latest updates you can follow our instagram page -
career.cafe
No skills?
Not good in coding?
Insignificant projects?
Lack of proper guidance making you insecure about your placements?
Address
Think Career,
Think Career Café…
Address: The Career Café, Sector 24D Chandigarh-160036, Email:
[email protected],
Mob: +91-7015172316 Website: