Entry Level Software Engineers | off campus | 2020-2021 batch Eligible | BE/BTech
Revature is the leading and fastest growing employer of emerging technology talents. We are looking for 300 entry level software engineers to work in Java Full Stack development and Big Data.
Apply link:-Click Here
Revature Entry Level Software Engineers Answer key
Test pattern:
Problem solving skills - 20
Numerical ability - 10
perceptual speed Ability - 10
programming - 15
coding - 02
Answer key
Section 1
1. (A) 17:10 pm
2. (A )124
3. (C) Monday
4. (B)924
5. (D)35
6. (A) pressure
7. (D) QNQF
8. (C) *,÷,+
9. (A) steve-D,billy-A,Tom-B,luis-C
10. (A) sister of father in law
11. (C) both 1 and 2 follow
12. (A) j#p!k
13. (C) if both 1 and 2 follow
14. (D) 50
15. (D) 12
16. (D) 11
17. (B) 6
18. (B) apples,green,fruit
19. (C) both the statement 1 and 2 independent course
20. (C) Rose
Section 2
1. (A) $225
2. (B) 256
3. (D) 12
4. (C) $25000
5. (C) 318
6.
7. (B) 900900
8.
9.
10. (C) 288
Section 3
See the pictures
Section 4
1. (D) -xyz
2. (D) private
3. (B) constructor
4. (B) Global variables
5. (A) A virtual constructor is not possible but a virtual destructor is possible
6. (C )John should find the maximum of all coordinates at the left end and minimum of all coordinates at the right end
7. (B) circular linked list
8.
9. (A) A->B->D->H->I->E->J->K->C->F->L->M->G->N->O
10.
11. (B) DELETE FROM student info
WHERE sname="mark Smith"
12. (A) SELECT count(id) FROM students
WHERE marks>90
13. (B) SELECT emoni,ename,sal,deptno from employee
ORDER by dal offset 10 row fetch next 10 rows only
14. (B) 5
15. (A) Type Name UNIQUE CHAR(10)
Section 5
1.ascending order
#include <stdio.h>
void main()
{
int i, j, a, n, number[30];
printf("Enter the value of N \n");
scanf("%d", &n);
printf("Enter the numbers \n");
for (i = 0; i < n; ++i)
scanf("%d", &number[i]);
for (i = 0; i < n; ++i)
{
for (j = i + 1; j < n; ++j)
{
if (number[i] > number[j])
{
a = number[i];
number[i] = number[j];
number[j] = a;
}
}
}
printf("The numbers arranged in ascending order are given below \n");
for (i = 0; i < n; ++i)
printf("%d\n", number[i]);
}
2.sum of nearest smaller and greatest number
import java.util.TreeSet;
public class Nearest {
public static int[] nearest(int arr[]){
int temp[]=new int[arr.length];
TreeSet<Integer> ts=new TreeSet<Integer>();
for(int i=0;i<arr.length;i++){
ts.add(arr[i]);
}
for(int i=0;i<arr.length;i++){
Integer greater=ts.higher(arr[i]);
if(greater==null){
temp[i]=0;
}
else{
temp[i]=greater;
}
}
for(int i=0;i<arr.length;i++){
Integer smaller=ts.lower(arr[i]);
if(smaller==null){
temp[i]=temp[i]+ 0;
}
else{
temp[i]=temp[i]+smaller;
}
}
return temp;
}
public static void main(String[] args) {
int arr[]={1,5,2,3,8};
int temp[]=nearest(arr);
for(int i=0;i<temp.length;i++){
System.out.print (temp[i]+" ");
}
}
}
No comments:
Post a Comment