Software Engineer

There are ‘N’ people at a party. Each person has been assigned a unique id between 0 to 'N' - 1(both inclusive). A celebrity is a person who is known to everyone but does not know anyone at the party.

Given a helper function ‘knows(A, B)’, It will returns "true" if the person having id ‘A’ know the person having id ‘B’ in the party, "false" otherwise. Your task is to find out the celebrity at the party. Print the id of the celebrity, if there is no celebrity at the party then print -1.

Note:

1. The helper function ‘knows’ is already implemented for you.
2. ‘knows(A, B)’ returns "false", if A doesn't know B.
3. You should not implement helper function ‘knows’, or speculate about its implementation.
4. You should minimize the number of calls to function ‘knows(A, B)’.
5. There are at least 2 people at the party.
6. At most one celebrity will exist.

What do you mean by Kernel? How OS operates, what all scheduling algorithms are used in windows OS

Explain all the layers of the TCP/IP model.

How do you think 5g will help or improve user experiences, and how it will benefit the industry overall?

Have you ever faced any internet issues or network problems? How did you solve those issues what was your approach.

You are given a directed graph having ‘N’ nodes. A matrix ‘EDGES’ of size M x 2 is given which represents the ‘M’ edges such that there is an edge directed from node EDGES[i][0] to node EDGES[i][1].

Find whether the graph contains a cycle or not, return true if a cycle is present in the given directed graph else return false.

For Example :

In the following directed graph has a cycle i.e. B->C->E->D->B.

Note :

1. The cycle must contain at least two nodes.
2. It is guaranteed that the given graph has no self-loops in the graph.
3. The graph may or may not be connected.
4. Nodes are numbered from 1 to N.
5. Your solution will run on multiple test cases. If you are using global variables make sure to clear them.

How we can create a data structure to store values whose size is not fixed and can grow as and when needed? and how we can implement sorting on that data structure

Write binary search algorithm for arrays. can we implement Binary search on a Linked list and what will be the time complexity of the binary search in arrays and linked lists? which one will be more suitable?

what is the main difference between a mobile OS and a windows OS?

At which layer of the TCP/IP model do routers work? what do you know about routing protocols?

What do you know about Cisco? Have you used any of our products before?

Who are the competitors of Cisco?

Where do you want to work Bangalore/Chennai/Pune?