• Placement Questions
• /
• Programming

Placement Papers with Solutions

(#M40166810) HEXAWARE QUESTION Keep an EYE

Which of the following is correct form of type-casting in C++?
A)per=total/(float)m B)per=(float) total/m C)per=total/float(m) D)per=float(total/m)

Asked In Hexaware Devendra Marghade (5 years ago)

Unsolved Read Solution (2)

Is this Puzzle helpful?   (10)   (0) Submit Your Solution Program

(#M40166809) HEXAWARE QUESTION Keep an EYE

Which of the following is true for B+ trees:
A) B+ trees are for storing data on disk B)On B+ trees range queries are faster C)B+ trees are for secondary indexes D)B+ trees are for primary indexes

Asked In Hexaware Devendra Marghade (5 years ago)

Unsolved Read Solution (2)

Is this Puzzle helpful?   (1)   (1) Submit Your Solution Output

(#M40166808) HEXAWARE QUESTION Keep an EYE

Which of the following in the data structure in which insertion can place from any direction but deletion can only takes place from opposite direction:
A)Stack B)Array C)Queue D)Tree

Asked In Hexaware Devendra Marghade (5 years ago)

Unsolved Read Solution (3)

Is this Puzzle helpful?   (4)   (1) Submit Your Solution Functions

(#M40166794) GOOGLE QUESTION Keep an EYE

If there is a N sorted array then what is time complexity of finding 2 numbers with sum less than 1000.
A) O(1) B) O(n^2) C) O(n) D) O(logn)

Asked In Google Devendra Marghade (5 years ago)

Unsolved Read Solution (3)

Is this Puzzle helpful?   (0)   (1) Submit Your Solution

(#M40166793) GOOGLE QUESTION Keep an EYE

Let w(n) and A(n) denote the worst case and average case running time of an algorithm executed on an input of size n. which of the following is ALWAYS TRUE?
A) A(n) = Omega(W(n)) B) A(n) = Theta(W(n)) C) A(n) = O(W(n)) D) A(n) = o(W(n)

Asked In Google Devendra Marghade (5 years ago)

Unsolved Read Solution (1)

Is this Puzzle helpful?   (0)   (0) Submit Your Solution

(#M40166792) GOOGLE QUESTION Keep an EYE

Two n-size arrays are given to you. n1 in decreasing order and n2 in increasing order. If c1 is time complexity for n1 using quicksort and c2 is time complexity for n2 using quicksort. Then –
A) c1 > c2 B) c1 < c2 C) c1 = c2 D) None of these

Asked In Google Devendra Marghade (5 years ago)

Unsolved Read Solution (1)

Is this Puzzle helpful?   (5)   (2) Submit Your Solution

(#M40166738) CAPGEMINI QUESTION Keep an EYE

What is the time complexity of searching for an element in a circular linked list?
A)O(n) B)O(nlogn) C)O(1) D)None of these

Asked In Capgemini Devendra Marghade (5 years ago)

Unsolved Read Solution (3)

Is this Puzzle helpful?   (13)   (4) Submit Your Solution Arrays

(#M40166675) QUESTION FROM WEBSIT QUESTION Output of a Program Keep an EYE

#include
int main()
{
char c;
int i = 0;
FILE *file;
file = fopen("test.txt", "w+");
fprintf(file, "%c", 'a');
fprintf(file, "%c", -1);
fprintf(file, "%c", 'b');
fclose(file);
file = fopen("test.txt", "r");
while ((c = fgetc(file)) != -1)
printf("%c", c);
return 0;

Asked In question from website sanfoundry.com Akanksha Priya (5 years ago)

Unsolved

Is this Puzzle helpful?   (0)   (2) Submit Your Solution

(#M40166660) ACCENTURE QUESTION Keep an EYE

If f(x) = (x + 2) / (x-2) for all integers except x=2, which of the following has the greatest value?
A)f(-1) B)f(0) C)f(1) D)f(3) E)f(4)

Asked In Accenture Devendra Marghade (5 years ago)

Unsolved Read Solution (2)

Is this Puzzle helpful?   (2)   (0) Submit Your Solution Functions

(#M40166398) JAVA QUESTION Keep an EYE

21. you have three dice each side is numbered as 1,2,3,4,5,6 .you have to take a
number from user check that number as sum of any side number of these
three dice.like we take number as 5 then the possibility are (1,1,3) (1,2,2)
(1,3,1) (2,1,2) (2,2,1) (3,1,1) and is 6 possibility. So write to a program for that.

Asked In Java Varun Kumar yr (5 years ago)

Unsolved Read Solution (1)

Is this Puzzle helpful?   (6)   (5) Submit Your Solution Arrays