SDE - 1

We need to answer questions related to Core subjects, DBMS, SQL, OOPS concept, Programming, Behavioral, Leadership Principles and workstyles.

this round is entirely based on MCQ's.
Questions like:-
1) Which of these is DML command?
2) What is the output of below program
3)What is the output of the flow chart program.
4)which unix command that creates a file without contend
5)Choose the correct property of foreign key in SQL?
6)Which unix command is used to redirect the no of characters in a file f1 to a file f2
7)How to show only last 10 files of a folder in unix?
8)How to copy files from one server to another server in unix?
9)What is the use of chmod command in unix?

You are given an undirected graph containing ‘N’ vertices that are connected by ‘M’ edges. Your task is to find the number of beautiful vertices. A vertex is beautiful if removing it will disconnect the graph, i.e., increase the number of connected components.

For Example:

You are given ‘N’ = 5, ‘M’ = 5 and ‘EDGES’ = [[1, 2], [1, 3], [3, 4], [3, 5], [4, 5]]. 

The beautiful vertices in the given graph are ‘1’ and ‘3’. If we remove ‘1’, vertex ‘2’ will be disconnected from the connected component (‘3’↔’4’↔’5’). If we remove vertex ‘3’, we will get two disjoint connected components (‘1’↔’2’) and (‘4’↔’5’).

Given a string STR of length N. The task is to return the count of minimum characters to be added at front to make the string a palindrome.

For example, for the given string “deed”, the string is already a palindrome, thus, minimum characters needed are 0.

Similarly, for the given string “aabaaca”, the minimum characters needed are 2 i.e. ‘a’ and ‘c’ which makes the string “acaabaaca” palindrome.

You are given an arbitrary binary tree consisting of N nodes where each node is associated with a certain integer value from 1 to 9. Consider each root to leaf path as a number.

For example:

       1
      /  \
     2    3

The root to leaf path 1->2 represents the number 12.
The root to leaf path 1->3 represents the number 13.

Your task is to find the total sum of all the possible root to leaf paths.

In the above example,

The total sum of all the possible root to leaf paths is 12+13 = 25

Note:

The output may be very large, return the answer after taking modulus with (10^9+7).