GPL - Technical & Aptitude Question Paper | PSU |

X Close

You need to enable javascript to view this page properly.

Company

- All
- CIL
- ECIL
- EIL
- ONGC
- SAIL

All

Loading

1.

The lexical analysis for a modern language such as Java needs the power of which one of the following machine models in a necessary and sufficient sense?
A. Finite state automata
B. Deterministic pushdown automata
C. Non-deterministic pushdown automata
D. Turing machine

last reply by CpjJwWHV • 10 years ago • asked in CIL 2012 CSE

View Comments [1 Reply] Discuss Report
1.

Consider the following C function.

float f(float x, int y)
{
float p, s; int i;
for (s=1, p=1, i=1; i < y; i ++)
{
    p*= x/i;
    s+=p;
}
return s;
}
For large values of y, the return value of the function f best approximates
A. x^y
B. e^x
C. ln(1 + x)
D. x^x

last reply by CpjJwWHV • 10 years ago • asked in CIL 2012 CSE

View Comments [1 Reply] Discuss Report
1.

The usual θ(n^2) implementation of Insertion Sort to sort an array uses linear search to identify the position where an element is to be inserted into the already sorted part of the array. If, instead, we use binary search to identify the position, the worst case running time will
A. remain θ(n^2)
B. become θ(n(log n)^2)
C. become θ(n log n)
D. become θ(n)

asked in CIL 2012 CSE

View Comments [0 Reply] Discuss Report
2.

In a system with 32 bit virtual addresses and 1 KB page size, use of one-level page tables for virtual to physical address translation is not practical because of
A. the large amount of internal fragmentation
B. the large amount of external fragmentation
C. the large memory overhead in maintaining page tables
D. the large computation overhead in the translation process

asked in CIL 2012 CSE

View Comments [0 Reply] Discuss Report
3.

Using a larger block size in a fixed block size file system leads to
A. better disk throughput but poorer disk space utilization
B. better disk throughput and better disk space utilization
C. poorer disk throughput but better disk space utilization
D. poorer disk throughput and poorer disk space utilization

asked in CIL 2012 CSE

View Comments [0 Reply] Discuss Report
4.

Suppose the numbers 7, 5, 1, 8, 3, 6, 0, 9, 4, 2 are inserted in that order into an initially empty binary search tree. The binary search tree uses the usual ordering on natural numbers. What is the in-order traversal sequence of the resultant tree?
A. 7 5 1 0 3 2 4 6 8 9
B. 0 2 4 3 1 6 5 9 8 7
C. 0 1 2 3 4 5 6 7 8 9
D. 9 8 6 4 2 3 0 1 5 7

asked in CIL 2012 CSE

View Comments [0 Reply] Discuss Report

352 1 2 3 ›› ... 59

High Frequency Word List with Mnemonics

GPL Dictionary is fast way to learn words with mnemonics.
It contains high frequency word list which are mostly asked in various examinations.
It is dedicated for student appearing for PSUs, GRE, UPSC or any other exams in which vocabulary test is taken.
User can save their own mnemonics (key and link).

Check Now