SDE - 1

round, with basic computer fundamentals like OS, NETWORKS, DBMS,CODING and analytical skills questions

Which of the following is TRUE?

A : Every relation in 3NF is also in BCNF
B : A relation R is in 3NF if every non-prime attribute of R is fully functionally dependent on every key of R
C : Every relation in BCNF is also in 3NF
D : No relation can be in both BCNF and 3NF

What will be the output of the following C program segment?

char inchar = 'A';switch (inchar){

case 'A' :    printf ("choice A \n") ;case 'B' :case 'C' :    printf ("choice B ") ;case 'D' :case 'E' :default:    printf ("No Choice") ;}

The worst case running time to search for an element in a balanced in a binary search tree with n2^n elements is(A) O(n log n)(B) O(n2^n) (C) O(n) (D) O(log n)

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?

You are given a string 'str' of length 'N'.

Your task is to reverse the original string word by word.

There can be multiple spaces between two words and there can be leading or trailing spaces but in the output reversed string you need to put a single space between two words, and your reversed string should not contain leading or trailing spaces.

Example :

If the given input string is "Welcome to Coding Ninjas", then you should return "Ninjas Coding to Welcome" as the reversed string has only a single space between two words and there is no leading or trailing space.

Introduce yourself, describe yourself in 1 line.