Welcome Guest

Questions for GLOBAL LOGIC


Aptitude And Technical Questions For GLOBAL LOGIC
           View All Aptitude And Technical Questions
Q. No. : 1
Question :A trader mixes 26 kg of rice at Rs. 20 per kg with 30 kg of rice of other variety at Rs. 36 per kg and sells the mixture at Rs. 30 per kg. His profit percent is:
A :
No profit, no loss
B :
5%
C :
8%
D :
10%
Answer: B
Solution
Q. No. : 2
Question :A monkey starts climbing up a tree 20ft. tall. Each hour, it hops 3ft. and slips back 2ft. How much time would it take the monkey to reach the top?
A :
15
B :
20
C :
21
D :
18
Answer: D
Q. No. : 3
Question : Father's age is five times his son's age.
Four years back father was 9 times older than his son. Find their present ages
A :
30yrs, 6yrs
B :
25yrs, 5yrs

C :
40yrs, 8yrs

D :
none of these
Answer: C
Q. No. : 4
Question :What is the least value of x for which expression x3 – 7x2 + 11x – 5 gives positive quantity?
A :
4
B :
5
C :
8
D :
none of these
Answer: D
Q. No. : 5
Question :x, y, z are distinct integers such as x is positive, y is lesser than x and z is more than x and y. Then which of the following is true ?
A :
x y³
B :
x-y > 0
C :
xyz>0
D :
none of these
Answer: B
Q. No. : 6
Question :A function q that accepts a pointer to a character as argument and returns a pointer to an array of integer can be declared as
A :
int(*q(char*))[]
B :
int *q(char *)[]
C :
int (*q)(char *)[]
D :
none of the above
Answer: A
Q. No. : 7
Question :Consider the declaration

int a=5,*b=&a;
The statement
printf("%D",a*b);

prints
A :
25
B :
garbage
C :
5 x address of b
D :
an error message
Answer: D
Solution
Q. No. : 8
Question :A possible output of the following program fragment
static char wer[ ][5]={"harmot","merli","axari"};
printf("%d%d%d",wer,wer[0],&wer[0][0]);
is
A :
262164 262164 262164
B :
262164 262165 262166
C :
262164 262165 262165
D :
262164 262164 262165
Answer: A
Q. No. : 9
Question :The for loop
for(i=0;i<10;++i)
printf("%d",i&1);

prints
A :
0101010101
B :
0111111111
C :
0000000000
D :
1111111111
Answer: A
Q. No. : 10
Question :Consider the following program segment
i=6720; j=4;
while((i%j)==0)
{
i=i/j;
j=j+1;
}

on termination j will have the value
A :
4
B :
8
C :
9
D :
6720
Answer: C
Q. No. : 11
Question :In an array representation of binary tree the right child of root will be at location of
A :
2
B :
5
C :
3
D :
0
Answer: C
Q. No. : 12
Question :The result of evaluating prefix expression */b+-dacd, where a = 3, b = 6, c = 1, d = 5 is
A :
0
B :
5
C :
10
D :
15
Answer: C
Solution
Q. No. : 13
Question : The total number of comparisons in a bubble sort is
A :
O(n log n)
B :
O(2n)
C :
O(n2)
D :
None of the above
Answer: C
Q. No. : 14
Question :In linked lists there are no NULL links in:
A :
Sin­gle linked list
B :
Lin­ear dou­bly linked list
C :
cir­cu­lar linked list
D :
None of the above
Answer: C
Q. No. : 15
Question :3. Which of the following data structures are indexed structures?
A :
linear arrays
B :
linked lists
C :
both of above
D :
none of above
Answer: A
Q. No. : 16
Question :Time complexity of AVL tree is
A :
N*N

B :
log(N)
C :
N*log(N)

D :
N
Answer: B
Q. No. : 17
Question :A sorting algorithm which can prove to be a best time algorithm in one case and a worst time algorithm in worst case is
A :
Quick Sort
B :
Heap Sort
C :
Merge Sort
D :
Insert Sort
Answer: A
Q. No. : 18
Question :The recurrence relation T(1)=2
T(n)=3T(n/4)+n
has solution T(n) equal to
A :
O(n)
B :
O(logn)
C :
O(n raised to power 3/4)
D :
npne of the above
Answer: A
Q. No. : 19
Question :Given two sorted list of size m and respectively. The number of comparisons needed in the worst case by merge sort will be
A :
mXn
B :
maximum of m and n
C :
minimum of m and n
D :
m+n-1
Answer: D
Q. No. : 20
Question :The average successful search time for sequential search on n items is
A :
n/2
B :
(n-1)/2
C :
(n+1)/2
D :
log(n)+1
Answer: C
Q. No. : 21
Question :Which of the following cannot be declared static?
A :
Class
B :
inline function
C :
Functions
D :
Member variables
Answer: A
Q. No. : 22
Question :Choose the correct statement regarding inline functions
A :
It speeds up execution
B :
It slows down the execution
C :
It increases the code size
D :
It decreases the code size
Answer: C
Q. No. : 23
Question :Which of the following parameter passing mechanism is/are supported by C++,but not by C?
A :
Pass by value
B :
Pass by reference
C :
Pass by value result
D :
All of the above
Answer: B