Eligibility
BE/BTech/MCA/MTech
70%
Only BE students were shortlisited.
I Could remember only these few question. Some question are multiple choice questions
Written test
3 Sections Duration: 90 min
1.What is the output of the following code?
x=0;y=1;
for( j=1;jlogfile
Date; who>logfile
What is the difference between the two statements.
10.How do you find the machine MAC address
11.Write the set operators that are used for select.
12.Write a single command to find and delete all the files that are older than 1 day(modification time)
13.A is a 3*4 matrix and B is 4*5 matrix. What is the number of additions and multiplications performed to obtain the resultant matrix
14.What is the output
#!/bin/perl
kill 0 pid
15.#!/bin/perl
echo $_
16. #!/bin/perl
kill $$
echo hello world
17.List different schema/database objects
18.Randomization is good for which algorithm(quick sort, heap sort, selection sort, hashed table, .)
19.Descride the language in the following regular expression (a*a) b+b
20.In an I-node what is not there (file type, file name, size, owner)
21.If the probability of work done by three persons are 1/3, 2/5, 5/12. Then what is the probability that the work is completed.
22.Given Id, author, creation time, size, links, web page, description
Bring it in 2nd normal form
23.Consider a heap containing numbers 10, 20, 30, 40, 80, 60, 70 such that numbers are in ascending order from the leaf to the root. If 25 is to be inserted what is the position.(A[1], A[2], A[3], A[4])
24. #!/bin/perl
var=///
aaaa
echo $var
25.Krishna tosses a one-rupee coin and a rupee coin. He announces that one is head. But the result is not announced. What is the probability that the other coin is head?
26.In database sort the student id and the course id for each student. Which is the best possible solution.
-Sort the student id using a stable algorithm and then sort the course id using unstable algorithm
-Sort the student id using a unstable algorithm and then sort the course id using stable algorithm
- Sort the course id using a stable algorithm and then sort the student id using unstable algorithm
- Sort the course id using a unstable algorithm and then sort the student id using unstable algorithm