SDE - 2

1. ____________ offers the ability to query the data and insert, alter, and delete tuples.

a. Transaction Control Language (TCL)

b. Data Control Language (DCL)

c. Data Definition Language (DDL)

d. Data Manipulation Language (DML)

2.Assume a relation X (M, N, O, P, Q) that has the following functional dependencies:

MNO -> PQ and

P -> MN

The total number of superkeys of X would be:

a. 12

b. 10

c. 7

d. 2

1. In the case of the index allocation scheme of various blocks to a file, the maximum size (possible) of the file would depend on :

a. the total number of blocks that have been used for the index, size of all the blocks

b. the actual size of all blocks, the size of the blocks’ address

c. the of the blocks’ size, the blocks’ address size, and the total number of blocks that have been used for the index

d. None of the above

2.Out of these page replacement algorithms, which one suffers from Belady’s anomaly?

a. LRU

b. FIFO

c. Both LRU and FIFO

d. Optimal Page Replacement

Problem Statement :Given are two sequences of length  N each:  A=(A  1 ​  ,A  2 ​  ,A  3 ​  ,…,A  N ​  ) and  B=(B  1 ​  ,B  2 ​  ,B  3 ​  ,…,B  N ​  ). Determine whether it is possible to make  A equal  B by repeatedly doing the operation below (possibly zero times). If it is possible, find the minimum number of operations required to do so.  Choose an integer  i such that  1≤i<N, and do the following in order: swap  A  i ​   and  A  i+1 ​  ;add  1 to  A  i ​  ; subtract  1 from  A  i+1 ​.Constraints :2≤N≤2×10  5  0≤A  i ​  ≤10  9   0≤B  i ​  ≤10  9  All values in input are integers.

Given an array of non-negative integers ‘ARR’ of length ‘N’, you are initially positioned at the array's first index.

Each element in the array represents your maximum jump length at that position.

Return the minimum number of jumps required to reach the last index.

If it is not possible to reach the last index, return -1.

Example:

Input:

‘N’ = 3
‘ARR’ = [ 2, 1, 1 ]

The shortest way to reach index 2 is
Index 0 => Index 2
that requires only 1 jump.

Given a singly linked list of integers. Your task is to return the head of the reversed linked list.

For example:

The given linked list is 1 -> 2 -> 3 -> 4-> NULL. Then the reverse linked list is 4 -> 3 -> 2 -> 1 -> NULL and the head of the reversed linked list will be 4.

Follow Up :

Can you solve this problem in O(N) time and O(1) space complexity?

(Learn)

1-Explain ACID properties.(Learn)
2-What is Commit and rollback.(Learn)

1-What is Inter process communication and context switching .(Learn)
2-What is multithreading .(Learn)
3-What is deadlock.(Learn)
4-Process vs thread.(Learn)

1-Difference between Tree and graph 
2-Sorting algorithms complexities.
3-Difference between stack and queue.

1-Explain OOPS principles
2-Implement all OOPS principles with one program

5 SQL queries were asked based on my project data that I could solve by using having ,where and group by clauses.

1-Give some real life use cases of singly linked list and circular linked list.(Learn)
2-Which sorting algorithm is faster and why?(Learn)
3-Difference between array and linked list.(Learn)