Cisco Software Developer Intern Interview Questions, Process, and Tips

It was a 2 hour test with medium level questions

Q1. Mostly asked about CN
Add your answer
Q2. Small Linked list question
Add your answer

40 MCQ's, 2 Coding question

Q1. Dijkastra's Algorithm
Ans. 
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...read more
Answered by AI
Add your answer
Q2. Snake and Ladder
Add your answer

Q1. DSA Medium Questions on arrays & linkedList
Add your answer

DSA, Behavioural, os, some networks basics

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.

Q1. 
Subtree Node Count Problem
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...read more
Ans. 
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).
Answered by AI
Add your answer

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.

Q1. Design a basic hash map.
Ans. 
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
Answered by AI
Add your answer