What does the following expression means ? char &lowast;(&lowast;(&lowast; a[N]) ( )) ( );

an array of n pointers to function returning pointers to functions returning pointers to characters.

a pointer to a function returning array of n pointers to function returning character pointers.

a function return array of N pointers to functions returning pointers to characters

an array of n pointers to function returning pointers to characters

Tutorials
Courses
Go Premium

UGC NET CS 2014 Dec - II

Last Updated :

Discuss

Comments

Question 1

What will be the output of the following ‘C’ code?

#include <stdio.h>

int main()
{
    int x = 128;
    printf("\n%d", 1 + x++);
    
    return 0;
}

Discuss it

Question 2

Which of the following conditions does not hold good for a solution to a critical section problem ?

No assumptions may be made about speeds or the number of CPUs.
No two processes may be simultaneously inside their critical sections.
Processes running outside its critical section may block other processes.
Processes do not wait forever to enter its critical section.

Discuss it

Question 3

An analog signal has a bit rate of 6000 bps and a baud rate of 2000 baud. How many data elements are carried by each signal element?

0.336 bits/baud
3 bits/baud
120,00,000 bits/baud
None of the above

Discuss it

Question 4

Which of the following algorithm(s) is/are a broadcast routing algorithm?

Flooding
Multidestination routing
Reverse path forwarding
All of the above

Discuss it

Question 5

Convert the following infix expression into its equivalent post fix expression (A + B^ D) / (E – F) + G

ABD^ + EF – / G+
ABD + ^EF – / G+
ABD + ^EF / – G+
ABD^ + EF / – G+

Discuss it

Question 6

You have to sort a list L, consisting of a sorted list followed by a few ‘random’ elements. Which of the following sorting method would be most suitable for such a task?

Bubble sort
Selection sort
Quick sort
Insertion sort

Discuss it

Question 7

What does the following expression means ?
char ∗(∗(∗ a[N]) ( )) ( );

a pointer to a function returning array of n pointers to function returning character pointers.
a function return array of N pointers to functions returning pointers to characters
an array of n pointers to function returning pointers to characters
an array of n pointers to function returning pointers to functions returning pointers to characters.

Discuss it

Question 8

In a demand paging memory system, page table is held in registers. The time taken to service a page fault is 8 m.sec. if an empty frame is available or if the replaced page is not modified, and it takes 20 m.secs., if the replaced page is modified. What is the average access time to service a page fault assuming that the page to be replaced is modified 70 of the time?

11.6 m.sec.
16.4 m.sec.
28 m.sec.
14 m.sec.

Discuss it

Question 9

For the implementation of a paging scheme, suppose the average process size be x bytes, the page size be y bytes, and each page entry requires z bytes. The optimum page size that minimizes the total overhead due to the page table and the internal fragmentation loss is given by

x / 2
xz / 2
√(2xz)
√(xz) / 2

Discuss it

Question 10

A specific editor has 200 K of program text, 15 K of initial stack, 50 K of initialized data, and 70 K of bootstrap code. If five editors are started simultaneously, how much physical memory is needed if shared text is used?

1135 K
335 K
1065 K
320 K

Discuss it

Tags:

UGC-NET

There are 50 questions to complete.

Take a part in the ongoing discussion