Type Here to Get Search Results !

Computer Science Mock Test NET Exam (System Software and Compilers) - Part 02




This Quiz is posted with the sole aim of guiding the aspirants of UGC-NET /CSIR -NET Exam to the path of success. To sharpen the edges of your own intelligence and practice, in a structured and concrete manner to ensure you definite Success in your endeavor and will Pave your way for a successful career in Teaching (or) Research Profession . All the very best...... Knock the door of success......





  1.  Which of the following is a correct way to dynamically allocate space for an array of 100 integers in C?


    1.  arrayPtr = (int *) malloc(100 * sizeof 

    2.  arrayPtr = (int *) malloc(100 int);

    3.  arrayPtr = (int *) malloc(100);

    4.  arrayPtr = (int) malloc(100);







  2. Which of the following is an example of a spooled device ?


    1.  The terminal used to input data for a program being executed

    2.  A line printer used to print the output of a number of Jobs.

    3.  The Secondary memory device in a virtual memory system

    4.  Virtual memory







  3. Resources are allocated to the process on non-shareable basis is ___________.


    1.  hold and wait

    2.  circular wait

    3.  mutual exclusion

    4.  no pre-emption







  4. Translator for low level programming language were termed as ________.


    1.  Linker

    2.  Compiler 

    3.  Loader

    4.  Assembler







  5. In a two pass assembler the pseudo code EQU is to be evaluated during ? 


    1.  Pass 3

    2.  Pass 2

    3.  Pass 1

    4.  None of the above







  6. The peep hole optimization ______.


    1.  is applied to the small part of the code

    2.  can be used to optimized the intermediate code

    3.  can be applied to portion of the code that is not contiguous

    4.  All of the above







  7. Virtual memory can be implemented with ______.


    1.  Segmentation

    2.  Paging

    3.  Both (a) & (b)

    4.  None of the above







  8. Shift-reduce parser are ________.


    1.  top-bottom parsers

    2.  bottom-top parsers

    3.  Both (a) & (b)

    4.  None of the above







  9. Recursive decent parsing is an example of _______.


    1.  top-bottom parsers

    2.  predictive parsers

    3.  bottom-top parsers

    4.  contiguous parsers







  10. CSG can be recognized by _______.


    1.  push down automata

    2.  2- way linear bounded automata

    3.  infinite state automata

    4.  finite state automata




























Post a Comment

0 Comments

Labels