Software Developer

Binary tree level order traversal recommends breadth first search (BFS) with a queue data structure. We will push the children of a node (curr) into the queue in the order in which we plan to traverse it (in this case, left to right). This way, we'll have finished putting the next row in the queue at the same time we finish iterating through this row.
We nest the main loop inside another loop to keep track of the rows. The queue length is captured at the start of the outer loop, which will tell us how long the row is. By iterating through that many nodes, we can pop them off the queue's front one at a time, and then push the current row array onto our answer array. 
This process will continue until the queue is empty, at which point the binary tree will be terminated and we will be able to return ans.
Time Complexity: O(N) where N is the number of nodes in the binary tree

Floyd Warshall Algorithm is used to solve all pairs shortest path problem. Floyd-Warshall computes the shortest distances between every pair of vertices in the input graph. At the heart of Floyd-Warshall is this function: ShortestPath(i,j,k).This function returns the shortest path from A to C using the vertices from 1 to k in the graph. The vertices are individually numbered {1, 2, ..., k}
There is a base case and a recursive case. The base case is that the shortest path is simply the weight of the edge connecting A and C: ShortestPath(i,j,0)=weight(i,j).
Pseudo Code :
Create a |V| x |V| matrix, M, that will describe the distances between vertices
For each cell (i, j) in M:
if i == j:
M[i][j] = 0
if (i, j) is an edge in E:
M[i][j] = weight(i, j)
else:
M[i][j] = infinity
for k from 1 to |V|:
for i from 1 to |V|:
for j from 1 to |V|:
if M[i][j] > M[i][k] + M[k][j]:
M[i][j] = M[i][k] + M[k][j]

Time Complexity : O(V^3)

Tip 1: Make all necessary assumptions required to create the relations and tables
Tip 2: Identify all the main entities of the database management system and their relationships with each other.
Tip 3: For each entity, define all the necessary attributes.

1. Private Cloud has a Single-Tenant infrastructure: Dedicated hardware and network for your business managed by an in-house technical team.
Public Cloud has a Multi-Tenant infrastructure: Shared network hosted off site and managed by your service provider.
2. The Business requirement of private cloud includes high performance, security, and customization and control options.
The Business requirement of public cloud includes affordable solutions that provide room for growth.
3. Scalability of private cloud : Can be managed in house. Extreme performance – fine-grained control for both storage and compute.
Scalability of public cloud : Depends on the Service Level Agreement but usually easy via a self-managed tool the customer will use.
4. Cost for private cloud : Large upfront cost to implement the hardware, software and staff resources. Maintenance and growth must also be built into ongoing costs. CapEx.
Cost for public cloud : Affordable option offering a pay as you go service fee. OpEx – Pay as you go, scale up, scale down as needed, charged by the minute.
5. Security of private cloud : Isolated network environment. Enhanced security to meet data protection legislation.
Security of public cloud : Basic security compliance. Some may offer bolt-on security options.

This can be solved both: recursively and iteratively. 
The recursive approach is more intuitive. First reverse all the nodes after head. Then we need to set head to be the final node in the reversed list. We simply set its next node in the original list (head -> next) to point to it and sets its next to NULL. The recursive approach has a O(N) time complexity and auxiliary space complexity. 
For solving the question is constant auxiliary space, iterative approach can be used. We maintain 3 pointers, current, next and previous, abbreviated as cur, n and prev respectively. All the events occur in a chain.
1. Assign prev=NULL, cur=head .
2. Next, repeat the below steps until no node is left to reverse:
1. Initialize n to be the node after cur. i.e(n=cur->next)
2. Then make cur->next point to prev (next node pointer).
3. Then make prev now point to the cur node.
4. At last move cur also one node ahead to n.
The prev pointer will be the last non null node and hence the answer.

A primary key is a special relational database table column(s) designated to uniquely identify each table record.
A primary key’s main features are:
1) It must contain a unique value for each row of data.
2)It cannot contain null values.
3)Every row must have a primary key value.

A unique key is a group of one or more than one columns of a table which uniquely identify database record. A unique key is the same as a primary key, but it can accept one null value for a table column. It also cannot contain identical values.

TOP keyword can be used to find the nth highest salary. By default ORDER BY clause print rows in ascending order, since we need the highest salary at the top, we have used ORDER BY DESC, which will display salaries in descending order. Again DISTINCT is used to remove duplicates. The outer query will then pick the topmost salary, which would be your Nth highest salary.
SQL query : 
SELECT TOP 1 salary
FROM ( 
SELECT DISTINCT TOP N salary
FROM #Employee 
ORDER BY salary DESC 
) AS temp
ORDER BY salary

1. In DES the data block is divided into two halves while in AES the entire data block is processed as a single matrix.
2. DES work on Feistel Cipher structure while AES works on Substitution and Permutation Principle.
3. Plaintext is of 64 bits in DES while in AES, Plaintext can be of 128,192, or 256 bits. 
4. DES in comparison to AES has smaller key size.

Tip 1 : Be sure to do your homework on the organization and its culture before the interview.
Tip 2 : Employers want to understand how you use your time and energy to stay productive and efficient. Be sure to emphasize that you adhere to deadlines and take them seriously.
Tip 3 : Talk about a relevant incident that made you keen on the profession you are pursuing and follow up by discussing your education.