Cisco SDE (Software Development Engineer) Interview Questions and Answers

It includes two DSA questions and some aptitude questions

Q1. Introduce yourself
Add your answer
Q2. Give the maximum element at any point of time for after pop and push
Add your answer
Q3. Reverse a string
Add your answer

Normal dsa Basics and aptitude.

Q1. Give the elements of an array that sum up to given number.
Ans. 
Find elements in array that sum up to given number
• Use a nested loop to iterate through each pair of elements in the array

• Check if the sum of the pair equals the given number

• Return the pair of elements if found, otherwise continue iterating
Answered by AI
Add your answer
Q2. Binary search using recursion.
Ans. 
Binary search is a search algorithm that finds the position of a target value within a sorted array.
• Divide the array into two halves and compare the target value with the middle element.

• If the target value is equal to the middle element, return the index.

• If the target value is less than the middle element, recursively search the left half.

• If the target value is greater than the middle element, recursively search the ri
Answered by AI
Add your answer

Q1. Why should we hire you?
Add your answer
Q2. Why are you interested to join juniper?
Add your answer

Q1. Java programming
Add your answer

Q1. Workout Bigdata
Add your answer

Q1. Behaviour questions
Add your answer

Q1. Salary discussion
Add your answer

Q1. Find the memory of the given structure (Struct padding is the hint)
Ans. 
The question asks to find the memory of a given structure by considering struct padding.
• Struct padding refers to the unused bytes added to align the members of a structure.

• To find the memory of a structure, we need to consider the size of each member and the padding added.

• The total memory of a structure is the sum of the sizes of its members and the padding.
Answered by AI
Add your answer
Q2. Write code to find the position of a number in a BST
Ans. 
Code to find the position of a number in a BST
• Implement a recursive function to traverse the BST

• Compare the target number with the current node value

• If the target is smaller, go to the left subtree; if larger, go to the right subtree

• Repeat until the target is found or the subtree is null
Answered by AI
Add your answer
Q3. Create a Trie data structure and perform insertion and search on it.
Ans. 
A Trie is a tree-like data structure used for efficient retrieval of strings. It supports insertion and search operations.
• A Trie is also known as a prefix tree.

• Each node in the Trie represents a character.

• The root node represents an empty string.

• Each node can have multiple children, each representing a different character.

• Insertion involves traversing the Trie and creating new nodes as needed.

• Search involves traversing...read more
Answered by AI
Add your answer

Q1. Os , CPP , bit manipulation
Add your answer

Q1. Os , threads,cpp, python
Add your answer

Generic dotnet questions mcq

Q1. .net, c# , sql , async questions
Add your answer

One problem is given need to make logic and your current project details

Managerial round was taken at the end