## Student Interview Questions

- 0of 0 votes

AnswersHumanitarian: Philanthropy is as

- WonderWoman June 04, 2016 in United States

Fan: Notoriety

Thief: Larceny

Donor: Gratitude

Expert: apprenticeship

Scholar: Plagiarism| Report Duplicate | Flag | PURGE

Epic Systems Student Algorithm - 0of 0 votes

AnswerI have two coins that add up to 55 cents. One of them is not a nickel.

- WonderWoman June 04, 2016 in United States

What are the two coins?| Report Duplicate | Flag | PURGE

Epic Systems Student Algorithm - 0of 0 votes

AnswersPlease post me full explanation(not only answer)

I want to know how it works.

- Rituraj bhardwaj May 04, 2016 in India for afai`#include<stdio.h> void main() { int x=1, y=8, z; z= ++y + ++x + ++x; printf("z=%d", z); }`

| Report Duplicate | Flag | PURGE

Student Applications Developer C - 0of 0 votes

AnswersHey, everyone! I'm stuck trying to add my name, character by character over a certain amount of output lines. I have to use hail stone (which I've already figured out). It needs to look like this:

Please enter a Number: 53

J 132 is an odd number, so I make 3n + 1: 160

O 234 is an even number, so I take half: 80

H 154 is an even number, so I take half: 40

N 114 is an even number, so I take half: 20

(TAB) 94 is an even number, so I take half: 10

D 84 is an even number, so I take half: 5

O 84 is an odd number, so I make 3n + 1: 16

E 90 is an even number, so I take half: 8

82 is an even number, so I take half: 4

78 is an even number, so I take half: 2

76 is an even number, so I take half: 1

The process took 11 steps to reach 1`package question3; import java.util.Scanner; public class Question3 { public static void main(String[] args) { Scanner inputScanner = new Scanner(System.in); System.out.printf("Please enter a Number: "); try { int number = inputScanner.nextInt(); int steps = 0; while (number != 1) { if (number % 2 == 0) { System.out.println(number + " is an even number, so I take half: " + number / 2); number /= 2; } else { System.out.println(number + " is an odd number, so I make 3n + 1: " + (number * 3 + 1)); number = number * 3 + 1; } steps++; } String name = "JOHN\tDOE "; System.out.print(name.charAt (0) ); System.out.println("The process took " + steps + (steps < 2 ? " step" : " steps") + " to reach 1"); } catch (Exception e) { System.out.println("The input entered is not a number. Please run again."); } }`

}

- BrowerLot February 02, 2016 in United States| Report Duplicate | Flag | PURGE

Student Student - 0of 0 votes

AnswersProblem Statement

- bharadwajdaya December 12, 2015 in India

A group of scientists have broken down species DNA into sequences of integers. They determine that two species with the respective DNA sequences A and B are considered to be related if a non-decreasing sequence C of the same length can be found, such that Ci=Ai or Ci=Bi.

Given the DNA sequences for two species, help the scientists determine if they are related.

Input Format

The first line contains an integer, T, the number of test cases.

For each test case:

The first line contains an integer, N, the length of the DNA sequence.

The second line contains a sequence of space-separated integers describing species A.

The third line contains a sequence of space-separated integers describing species B.

Constraints:

1≤T≤5

1≤N≤105

0≤Ai, Bi≤1010

Output Format

On a new line for each test case, print YES if a non-decreasing sequence of the same length can be found (i.e.: species are related) or NO if it cannot.

3

3

1 2 3

4 4 4

3

3 2 1

6 5 4

2

1 0

10 2

Test Case 1: We could have C=1 2 4

Test Case 2: No increasing sequence C is possible.

Test Case 3: We could have C=1 2.| Report Duplicate | Flag | PURGE

AMD Student - 0of 0 votes

AnswersProblem Statement

- bharadwajdaya November 14, 2015 in India

Given an integer N, express it as the sum of at least two consecutive positive integers. For example:

10 = 1 + 2 + 3 + 4

24 = 7 + 8 + 9

If there are multiple solutions, output the one with the smallest possible number of summands.

Input Format

The first line of input contains the number of test cases T. The descriptions of the test cases follow:

Each test case consists of one line containing an integer N (1 ≤ N ≤ 109).

Output Format

For each test case, output a single line containing the equation in the format:

N = a + (a + 1) + ...+ b

as in the example. If there is no solution, output a single word ‘IMPOSSIBLE’ instead.

Sample Input

3

8

10

24

Sample Output

IMPOSSIBLE

10 = 1 + 2 + 3 + 4

24 = 7 + 8 + 9| Report Duplicate | Flag | PURGE

IIT-D Student C - -9of 9 votes

AnswersLOOKING FOR IAS TOPPERS PERSONAL INTERVIEW QUESTION AND ANSWERS

- prachisirdesaio July 21, 2015 in United States| Report Duplicate | Flag | PURGE

Here Student IAS TOPPERS - 0of 0 votes

AnswersGiven a 5 x 5 Grid comprising of tiles numbered from 1 to 25 and a set of 5 start-end point pairs.

- ranjankumar.jsr0 June 27, 2015 in United States

For each pair,find a path from the start point to the end point.

The paths should meet the below conditions:

a) Only Horizontal and Vertical moves allowed.

b) No two paths should overlap.

c) Paths should cover the entire grid

Input:

Input consist of 5 lines.

Each line contains two space-separated integers,Starting and Ending point.

Output:

Print 5 lines. Each line consisting of space-separated integers,the path for the corresponding start-end pair.

Assume that such a path Always exists.

In case of Multiple Solution,print any one of them.

Sample Input(Plaintext Link)

1 22

4 17

5 18

9 13

20 23

Sample Output(Plaintext Link)

1 6 11 16 21 22

4 3 2 7 12 17

5 10 15 14 19 18

9 8 13

20 25 24 23| Report Duplicate | Flag | PURGE

Student Dynamic Programming - 0of 2 votes

AnswersAnybody knows what will be the career path for Technical Consultant at SAP? I am MCA student, got hired at SAP(Banglore) , wanted to know what is it worthy to join SAP for technical consultant role? (for Pay , career n future opportunities wise)..Thanks in Advance...Bit of information will help me choosing my career

- Newbie April 18, 2015 in India| Report Duplicate | Flag | PURGE

Student Student Behavioral - 0of 0 votes

AnswersGiven an integer array with multiple repeated elements, print all distinct elements in array. O(n) c code/link??

- sharma.kamalkishor53 April 06, 2015 in India| Report Duplicate | Flag | PURGE

Student SDE1 Algorithm - 0of 0 votes

Answersan array contains number in range 1 to n and having a number missing and a number repeat twice find both numbers

- manas019283 February 25, 2015 in India| Report Duplicate | Flag | PURGE

None Student Algorithm - 1of 1 vote

Answersgiven a string without space "iamstudent" output "i am student" u are provided with a dictionary to check words

- manas019283 February 25, 2015 in India| Report Duplicate | Flag | PURGE

None Student Algorithm - 0of 0 votes

AnswersIn a single pass, find Nth node from last in a Linked List.

- Sunny February 24, 2015 in United States for java

{ N can be any value. }| Report Duplicate | Flag | PURGE

Student Intern Algorithm Java - 0of 0 votes

AnswersFind the number of substrings of 2 strings that are palindromes.

- Tuansu2021998 February 23, 2015 in United States| Report Duplicate | Flag | PURGE

xyz Student - 1of 1 vote

AnswersGiven a list of employees and their bosses as a text file , write a function that will print out a hierarchy tree of the employees.

- shalini.ravishankar February 08, 2015 in United States

Sample input =

Sam, Ian, technical lead, 2009 / Ian, NULL, CEO,2007/ Fred, Sam, developer, 2010

The format is name, supervisor, designation, year of joining

The output should be

Ian CEO 2007

-Sam Technical lead 2009

- -Fred Developer 2010| Report Duplicate | Flag | PURGE

Student Algorithm Coding Python - 0of 0 votes

AnswerHow to impliment a method to track devices using mac addresses in a wifi lan in java?

- sanu91ucsc October 31, 2014 in Sri Lanka| Report Duplicate | Flag | PURGE

Student student - 0of 0 votes

Answershiii...i have a question..."how to find duplicate in large file"

- sugandhiverma1 September 12, 2014 in India| Report Duplicate | Flag | PURGE

Student student - 0of 0 votes

AnswerIf we're given a project budget and limit of completion that is 6 months, then which approach is good, requirements capture, req analysis through modelling, detailed analysis or feasibility analysis?

- rajansoni56 July 26, 2014 in India| Report Duplicate | Flag | PURGE

Student student System Design - 0of 0 votes

AnswersGiven a tree having N vertices and N-1 edges where each edges is having one of either red(r) or black(b) color. I need to find how many triplets(a,b,c) of vertices are there, such that on the path from vertex a to b, vertex b to c and vertex c to a there is atleast one edge having red color.

- praveend806 June 19, 2014 in India

It should be noted that (a,b,c), (b,a,c) and all such permutation will be considered as the same triplets.

EXAMPLE : Let N=5 and edges with colors are as follow :

1 2 b

2 3 r

3 4 r

4 5 b

Here answer will be 4.

EXPLANATION : (2,3,4) is one such triplet because on all paths i.e 2 to 3, 3 to 4 and 2 to 4 there is atleast one edge having read color. (2,3,5), (1,3,4) and (1,3,5) are such other triplets.| Report Duplicate | Flag | PURGE

Hi5 Student student Algorithm - 0of 0 votes

AnswersHere is a small program which will be of my help.

- sharathchitra May 23, 2014 in India

Please code it in JAVA. If you are successful, please send me the code as early as possible by tomorrow.

If you are not able to get, please send me the update.

The Definition is given as below:

1. A File contains string for Example: GCDNPQACKSPEGF...FIM

2. Read each character from this file and ASSIGN the values as below:

A,C,S = 3

F,D,N,T= 4

P,F,Y = 9

M,E,G = 2

Q,H,I,K,R,L = 6

3. AFTER ASSIGNING CHECK THE FILE FOR MAPPING

4. Sum THE VALUES in that sequence for Eg: 2+ 3+ 4...... = SUM = 60

5. FIND THE total LENGTH of the sequence for E: L = 20

6. Find the AVERAGE A = SUM/L =60/20 =3

7. USE THE PATTERNS as triplets from the same file as given below AND CALCULATE EACH PATTERN'S WEIGHTAGE as for Eg:

GCD = 2 + 3 + 4 = 9 (G = 2, C=3, D=4 from the mapping)

CDN = 3+4+4 = 11

...........

for all possible patterns

8. FinD THE MAXIMUM OF ALL THE PATTERN'S WEIGHTAGE

So, the o/p should be : Average -->

Triplet and its Weightage as :GCD : 2 + 3+ 4 = 9 for all possible triplets

Maxi Weightage -->| Report Duplicate | Flag | PURGE

Student student Java Developer Java - 0of 0 votes

AnswersThe nargin and nargout command returns the number of input and output respectively for a function.

- jinglan.seiran April 25, 2014

nargin is particularly useful when the input values are trivial. For example (0, 0) seems to be trivial

input in Q5. Modify the program so that the default value of (a,b) is (0,0) whenever it is not specifed

by the user.

Q5:The following function is supposed to generate an array of Cartesian coordinates for a circle with

radius r and centered at (a; b).

function [x,y] = circle(r,theta)

theta = [0:pi/100:2*pi];

x = r*cos(theta);

y = r*sin(theta);

end| Report Duplicate | Flag | PURGE

Student student - -3of 3 votes

Answershow to redirect the url to the custom url after the successful completion of the payment in the emppay gateway

- Nasibnba April 03, 2014 in India| Report Duplicate | Flag | PURGE

Student student - 0of 0 votes

AnswerOperation :Deleting element in the binary search tree(Without linked list) I'm trying to implement a pseudo-code but operation not implemented.can cause?(If you want I can write a pseudo-code.)So,delete operation is not happening for BST.can cause?-1 is null element in array. Linked list is not be for this code.

- maxflow34 March 11, 2014 in turkiye

void deleting(int *Tree,int element){

int temp=0;

while((Tree[temp]!=element) && (Tree[temp]!=-1)){

/*loop until the element is found*/

if(element<Tree[temp])

temp=2*temp+1;

else

temp=2*temp+2;

}

if(Tree[temp]!=1)/* if the element is found*/

/*case1 - Delete leaf node*/

if((Tree[2*temp+1]==-1) && (Tree[2*temp+2]==-1))

Tree[temp]=-1

/*case 2- delete node with one child*/

else if((Tree[2*temp+1]==-1)|| (Tree[2*temp+2]==-1)){

if(Tree[2*temp+1]!=-1) /* is the child in the left of temp*/

preOrder((2*temp+1),Tree);

else

preOrder((2*temp+2),Tree);

}

/*case 3-delete node with 2 children*/

else if {

int inOrder_N=2*temp+2 /* inorder successor is surely in the right sub tree*/

while(Tree[2*inOrder_N]!=-1)

inOrder_N=2*inOrder_N;

Tree[temp]=Tree[inOrder_N]; /* replace with inorder successor*/

if(Tree[2*inOrder_N+2]==-1);/* inorder successor has no child*/

Tree[inOrder_N]=-1;

else /* inorder successor has no child*/

preOrder(((2*inOrder_N)+1),Tree)

}

else

printf("element not found");

}

void preOrder(int node, int *bst,int n){

if(node<n){

printf("Node : %d - Value : %d \n",node,bst[node]);

preOrder(2*node+1,bst,N);

preOrder(2*node+2,bst,N);

}

return;

}| Report Duplicate | Flag | PURGE

unknown Student student Algorithm - -1of 1 vote

AnswersWrite a recursive Method int shortestPath(int start, int end) in Java which returns the length of the shortest Path between start and end.

- nuni March 04, 2014 in Germany`public class GraphMatrix { public GraphMatrix(int iNrOfNode){ m_Matrix = new boolean[iNrOfNodes][iNrOfNodes]; } private boolean[][] m_Matrix; }`

| Report Duplicate | Flag | PURGE

Amazon Student student Algorithm - -14of 14 votes

AnswersIdea student

- manojsainitoda February 22, 2014 in United States for single| Report Duplicate | Flag | PURGE

Facebook Student student Ideas - -12of 12 votes

AnswersI idea student for facebook.

- manojsainitoda February 22, 2014 in United States for single| Report Duplicate | Flag | PURGE

Facebook Student student Ideas - 0of 0 votes

AnswersWrite a function which checks a Red-Black-Tree that the max depth isn't > than 2* min depth. It must return a boolean.

- nuni February 17, 2014 in Germany

boolean checkdepth(){}

no class variables| Report Duplicate | Flag | PURGE

Amazon Student student Algorithm

**CareerCup**is the world's biggest and best source for software engineering interview preparation. See all our resources.

Open Chat in New Window