SDE - 1

You are given a matrix ‘MAT’. Print and return the transpose of the matrix. The transpose of a matrix is obtained by changing rows to columns and columns to rows. In other words, transpose of a matrix A[][] is obtained by changing A[i][j] to A[j][i].

For example:

Let matrix be : 
1 2
3 4

Then transpose of the matrix will be: 
1 3
2 4

Given an integer ‘N’ representing the number of pairs of parentheses, Find all the possible combinations of balanced parentheses with the given number of pairs of parentheses.

Note :

Conditions for valid parentheses:
1. All open brackets must be closed by the closing brackets.

2. Open brackets must be closed in the correct order.

For Example :

()()()() is a valid parentheses.
)()()( is not a valid parentheses.

Explain precondition and postcondition to the member function in context of C++. 

Indexing in DBMS

 Explain Stack Unwinding in C++. 

What is the difference between DDL and DML commands in DBMS? 

Explain memory management in C. 

Tell me about the projects mentioned in your resume?