Scribd
Upload
44 views3 pages

in UNIX A Files I-Node ...... ? I) Restricts File Permission Ii) Specifies File Size, Number of Lines To A File, Permissions Etc. Iii) Both The Above

1) FLOP stands for floating point operations per second, which is a unit of measurement for a processor's floating point performance. 2) The main() function calls itself recursively, so the program will run infinitely and not terminate. 3) The time complexity of heap sort is O(nlogn). 4) Enum values are assigned values starting from 0 and incrementing by 1 for each subsequent unassigned value. So in the given enum, the value of e would be 5.

Uploaded by

sonali
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
44 views3 pages

in UNIX A Files I-Node ...... ? I) Restricts File Permission Ii) Specifies File Size, Number of Lines To A File, Permissions Etc. Iii) Both The Above

1) FLOP stands for floating point operations per second, which is a unit of measurement for a processor's floating point performance. 2) The main() function calls itself recursively, so the program will run infinitely and not terminate. 3) The time complexity of heap sort is O(nlogn). 4) Enum values are assigned values starting from 0 and incrementing by 1 for each subsequent unassigned value. So in the given enum, the value of e would be 5.

Uploaded by

sonali
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Technical Questions

1. FLOP is the unit of – 2. main()


i)clock speed, {
ii)frequency printf("hello");
iii)memory main();
iv)processors speed. }
how many times it will print?

i)program will run infinite time


ii)Fatal error
iii)Compiler Error
iv)Program will run atleast one time

3. complexity of heap sort 4. what will be the o/p?


i) o(nlogn) int main()
ii) o(logn) {
iii)o2(logn) char a,b;
iv)n(logn) printf(“%d%d%d%d”,sizeof(‘A’),
sizeof(‘NULL’), sizeof(‘a’),
sizeof(main));
}

i)Error
ii)Prgram will display values
iii)Type conversion is not possible in
C
iv)None

5. necessity of pairty bit. 6. In UNIX a files i-node ......?


i)Parity bit is used to ensure that the total
number of 1-bits in string is even or odd. i)restricts file permission
ii) Parity bit is used to ensure that the ii) specifies file size, number of lines to a
total number of 0-bits in string is even or file, permissions etc.
odd.
iii) Both the above.
iv)None of the above

7. The UNIX shell ....


8. enum number { a= -1, b= 4,c,d,e}
What is the value of e ?
a) does not come with the rest of the
system (a) 7
b) forms the interface between the user (b) 4
and the kernal (c) 5
c) does not give any scope for (d) 15
programming (e) 3
d) does not allow calling one program
from with in another
e) all of the above

9. The very first process created by the 10. Output of the following program
kernal that runs till the kernal process is is:
halts is
main()
a) init {int i=0;
b) getty for(i=0;i<20;i++)
c) both (a) and (b) {switch(i)
case 0:i+=5;
d) none of these
case 1:i+=2;
case 5:i+=5;
default i+=4;
break;}
printf("%d,",i);
}
}

a) 0,5,9,13,17
b) 5,9,13,17
c) 12,17,22
d) 16,21
e) Syntax error

  11. A trigger is.....  12. What does the following


statement mean?
        (a) a statement ..start of database..         int (*a)[4]

        (b)statements that r executed as a


side effect to the modification to the         (a)'a' is a pointer to an array
database of 4 integers
        (b)'a' is an array of pointers to
        (c) occurs when system recognizes integer
some error.           (c)'a' is a pointer to function
returning an integer
        (d) a statement ..end of database..          (d) Ni significance
         
         )

  13. Best method to find out whether a 14. A primary key in one table also
given array already sorted,is sorted or not present in some other table is called
in min. Time.

i)Bubble Sort       (a)foreign key


ii)Heap Sort       (b)secondary key
iii) Merge Sort       (c)subordinate key
iv)Insertion Sort       (d)Candidate Key

     

You might also like