SDE - 1

You are given a non-empty binary tree where each node has a non-negative integer value. Return the maximum possible sum of path between any two leaves of the given tree.

The path is also inclusive of the leaf nodes and the maximum path sum may or may not go through the root of the given tree.

If there is only one leaf node in the tree, then return -1.

You are given a network of n nodes, labeled from 1 to n. You are also given times, a list of travel times as directed edges times[i] = (ui, vi, wi), where ui is the source node, vi is the target node, and wi is the time it takes for a signal to travel from source to target.We will send a signal from a given node k. Return the minimum time it takes for all the n nodes to receive the signal. If it is impossible for all the n nodes to receive the signal, return -1.

2. OS Question
In priority scheduling algorithm ____________
a) CPU is allocated to the process with the highest priority
b) CPU is allocated to the process with the lowest priority
c) Equal priority processes can not be scheduled
d) None of the mentioned

3. OS Question
To avoid deadlock ____________
a) there must be a fixed number of resources to allocate
b) resource allocation must be done only once
c) all deadlocked processes must be aborted
d) inversion technique can be used

1. DBMS Question
Which of the following is a command of DDL?
1) Alter
2) Delete
3) Create
4) All of the Above

Given an array/list of integer numbers 'CHOCOLATES' of size 'N', where each value of the array/list represents the number of chocolates in the packet. There are ‘M’ number of students and the task is to distribute the chocolate to their students. Distribute chocolate in such a way that:1. Each student gets at least one packet of chocolate.2. The difference between the maximum number of chocolate in a packet and the minimum number of chocolate in a packet given to the students is minimum.

You are given a binary tree having 'n' nodes.The boundary nodes of a binary tree include the nodes from the left and right boundaries and the leaf nodes, each node considered once.Figure out the boundary nodes of this binary tree in an Anti-Clockwise direction starting from the root node.

An array arr is a mountain if the following properties hold:arr.length >= 3.

There exists some i with 0 < i < arr.length - 1 such that:arr[0] < arr[1] < ... < arr[i - 1] < arr[i] arr[i] > arr[i + 1] > ... > arr[arr.length - 1].

Given a mountain array arr, return the index i such that arr[0] < arr[1] < ... < arr[i - 1] < arr[i] > arr[i + 1] > ... > arr[arr.length - 1].

You must solve it in O(log(arr.length)) time complexity.