Centillion Networks Senior Telecom Engineer Interview Questions and Answers

Q1. Python basics and modules
Add your answer
Q2. Networking protocols basic networking
Add your answer

Q1. Array Linked list BST
Add your answer

Q1. Array LL BST Stack
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. Javascript basics - event loop, type conversion, call apply bind
Add your answer

Q1. Design discussion, current project
Add your answer

Javascript related test

Shopping cart, How to develop a shopping cart, its architecture

Q1. A string contains parenthesis, curly brackets and square brackets. Check if the string is valid or not.
Ans. 
Check if a string containing parenthesis, curly brackets, and square brackets is valid.
• Use a stack to keep track of opening brackets

• Pop from stack when encountering a closing bracket, ensuring it matches the corresponding opening bracket

• Return false if stack is not empty at the end
Answered by AI
Add your answer