Faster and better experience!
Cisco
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
I applied via Campus Placement and was interviewed in Feb 2024. There were 2 interview rounds.
It was a 2 hour test with medium level questions
I applied via LinkedIn and was interviewed in Feb 2024. There were 2 interview rounds.
40 MCQ's, 2 Coding question
Dijkstra's Algorithm is a graph search algorithm that finds the shortest path between nodes in a graph.
Dijkstra's Algorithm is used to find the shortest path from a starting node to all other nodes in a weighted graph.
It works by maintaining a set of nodes whose shortest distance from the starting node is known.
The algorithm iteratively selects the node with the smallest distance and updates the distances of its neighb...
DSA, Behavioural, os, some networks basics
What people are saying about Cisco
I appeared for an interview before Mar 2021.
Round duration - 70 Minutes
Round difficulty - Medium
Interviewer was very nice and made me feel pretty comfortable. We talked about our hobbies for about 10mins and then he asked about my projects and which was my favourite of all. He then asked me a coding question. Which was like pretty easy and I gave him the optimized approach right away. He was satisfied with my approach and just moved on to the next part. He asked me some basic questions related to Operating Systems(related to deadlocks and semaphores). He even asked some basic questions related to OOPS. Then he gave me the next question. This was like a pretty new question for me and I took some time to understand the problem statement and then took some time to think about the logic. I was also sharing my approach with interviewer as well.I finally told him about my approach. He told me that my approach was fine but there also was some other approach but normally no-one would come up with that approach until they have previously solved the question.
We are provided with a tree containing 'N' nodes, numbered from 0 to N-1. The objective is to determine the total number of nodes within each subtree of the provided tree. Speci...
Given a tree, find the number of nodes in each subtree rooted at every node.
Traverse the tree using Depth First Search (DFS) to count nodes in each subtree.
Maintain a count of nodes in each subtree while traversing the tree.
Start the DFS from the root node (node 0) and recursively count nodes in each subtree.
For leaf nodes, the subtree size will be 1 (the node itself).
Round duration - 30 Minutes
Round difficulty - Easy
Interviewer seemed to be a senior manager.He just asked about me and started with the interview.Interviewer asked me to design a standard map(hash-map). I gave him my approach and he also asked me to devise a hash function for it. I also gave him a hash function and he seemed to be pretty satisfied.
Design a basic hash map
Use an array of linked lists to handle collisions
Implement methods for adding, removing, and retrieving key-value pairs
Include a hashing function to map keys to indices in the array
Tip 1 : Practise as many questions as you can
Tip 2 : Try solving the question on your own.
Tip 3 : To learn the concepts of OOM its best to go through a project.
Tip 1 : Mention your coding achievements
Tip 2 : Do not make a big resume.
Cisco interview questions for designations
I appeared for an interview before Jun 2021.
Round duration - 45 Minutes
Round difficulty - Medium
The interviewer was nice and he made me feel comfortable
Topics :- Data structures, string manipulation and pointers
Timing :- Afternoon
You are provided a string STR
of length N
, consisting solely of lowercase English letters.
Your task is to remove all duplicate occurrences of characters i...
Remove duplicate occurrences of characters in a given string.
Use a hash set to keep track of characters seen so far.
Iterate through the string and add non-duplicate characters to a new string.
Return the new string without duplicate characters.
Round duration - 60 Minutes
Round difficulty - Medium
The interviewer was very supportive and we had a good discussion regarding his role in cisco etc.
Questions on various topics were asked including my courses, resume and internship
You are provided with a binary tree consisting of integer-valued nodes. The task is to compute the In-Order, Pre-Order, and Post-Order traversals for the given binary tree.
Compute In-Order, Pre-Order, and Post-Order traversals for a given binary tree.
Implement tree traversal algorithms like In-Order, Pre-Order, and Post-Order.
Use recursion to traverse the binary tree efficiently.
Maintain separate lists for each traversal type and return them as nested lists.
Round duration - 30 Minutes
Round difficulty - Medium
It was the HR round
Tip 1 : Practice coding questions of each difficulty level in the ratio of 3:2:1 (easy:medium:hard)
Tip 2 : Make sure that you have thorough knowledge of your projects/internships
Tip 1 : Update your resume to highlight your strengths
Tip 2 : Remove unnecessary courses in which you aren’t confident
I am excited to join this company because of its reputation for innovation and commitment to employee growth.
I am impressed by the company's track record of developing cutting-edge software solutions.
I appreciate the emphasis on professional development and growth opportunities for employees.
I am excited about the prospect of working with a talented and dedicated team.
I believe that this company's values align with my ...
My role model is Elon Musk.
I admire his innovative thinking and determination to push boundaries.
His ability to lead multiple successful companies is inspiring.
His focus on sustainable energy and space exploration aligns with my values.
I strive to emulate his work ethic and passion for making a positive impact on the world.
I have been involved in various extra-curricular activities such as volunteering, sports, and music.
Volunteered at local animal shelter
Played on intramural basketball team
Participated in school choir
Attended coding workshops and hackathons
I appeared for an interview before Jan 2016.
Seeking new challenges and growth opportunities.
I felt that I had reached a plateau in my role and was no longer being challenged.
I was interested in exploring new technologies and wanted to work on more innovative projects.
I wanted to work in a more collaborative and dynamic environment.
I left on good terms and have maintained positive relationships with my former colleagues.
I am excited to bring my skills and experie...
I am excited to join Centurylink because of their reputation for innovation and commitment to customer satisfaction.
Centurylink has a strong focus on developing cutting-edge technology solutions
The company values customer feedback and strives to provide excellent service
I am impressed by Centurylink's dedication to diversity and inclusion in the workplace
Relocated to Noida for better career opportunities and growth.
Noida is a hub for IT companies and offers a lot of job opportunities in the software development field.
The city has a good work-life balance and a lower cost of living compared to other metropolitan cities.
I was also attracted to the diverse culture and the opportunity to work with people from different backgrounds.
I did my research and found that Noida has...
Yes, I am comfortable working in US shift.
I have prior experience working in US shift.
I am flexible with my work timings.
I understand the importance of meeting project deadlines.
I am willing to adjust my personal schedule to accommodate work requirements.
I currently reside in New York City.
I live in an apartment in Manhattan.
My neighborhood is known for its diverse food options.
I have easy access to public transportation.
I enjoy exploring the city in my free time.
I appeared for an interview before Apr 2021.
Round duration - 60 minutes
Round difficulty - Easy
Technical Interview round with questions on OOPS and OS mainly.
Little Endian and Big Endian refer to the order in which bytes are stored in computer memory.
Little Endian stores the least significant byte first, while Big Endian stores the most significant byte first.
Little Endian is commonly used in x86 architecture, while Big Endian is used in architectures like SPARC and PowerPC.
Endianness can affect data transmission between systems with different byte orders.
Program to determine system's endianness
Check the endianness by storing a multi-byte integer and checking the byte order
Use bitwise operations to extract the least significant byte
If the least significant byte is at the lowest memory address, it's little-endian
If the least significant byte is at the highest memory address, it's big-endian
The volatile keyword in programming is used to indicate that a variable's value can be changed unexpectedly.
Volatile keyword is used in multithreaded programming to prevent compiler optimizations on variables that can be changed by other threads.
It tells the compiler not to cache the variable's value in a register, ensuring that every access is made to the variable's memory location.
Commonly used in embedded systems pr...
Function pointers in C are used to store the address of functions, allowing for dynamic function calls and callbacks.
Function pointers can be used to implement callbacks in event-driven programming.
They can be used to switch between different functions at runtime.
Function pointers are commonly used in implementing data structures like function pointers in an array of function pointers.
Example: void (*funcPtr)(int) = &a
Design a data structure for multi-threading
Use a thread-safe queue to manage tasks for each thread
Implement a lock or semaphore to control access to shared resources
Consider using condition variables for synchronization
Use atomic operations for shared variables to prevent race conditions
The kernel is the core component of an operating system that manages system resources and provides a bridge between software and hardware.
Manages system resources such as CPU, memory, and I/O devices
Provides a bridge between software applications and hardware components
Handles tasks such as process scheduling, memory management, and device drivers
Controls communication between hardware and software layers
A storage class in programming defines the scope and lifetime of variables.
Storage classes include auto, register, static, and extern.
Auto variables are created when a function is called and destroyed when the function ends.
Register variables are stored in CPU registers for faster access.
Static variables retain their value between function calls.
Extern variables are declared outside of any function and can be accessed
Round duration - 30 minutes
Round difficulty - Easy
HR round with typical behavioral problems.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
based on 3 interviews
Interview experience
based on 2 reviews
Rating in categories
Software Engineer
2.7k
salaries
| ₹9.8 L/yr - ₹40 L/yr |
Senior Software Engineer
654
salaries
| ₹14 L/yr - ₹48.8 L/yr |
Technical Consulting Engineer
651
salaries
| ₹8 L/yr - ₹30 L/yr |
Network Engineer
397
salaries
| ₹3.9 L/yr - ₹17 L/yr |
Software Developer
359
salaries
| ₹17.9 L/yr - ₹43.1 L/yr |
Microsoft Corporation
Sterlite Technologies
Nokia Networks