Time Left - 09:00 mins
UPPCL AE 2019: Technical Quiz 1
Attempt now to get your rank among 359 students!
Question 1
Total number of simple graphs that can be drawn using six vertices are :
Question 2
Operating System maintains the page table for :
Question 3
The expression 5 – 2 – 3* 5- 2 will evaluate to 18, if :
Question 4
Non-contiguous memory allocation splits program into blocks of memory called __________ that can be loaded in non-adjacent holes in main memory.
Question 5
Which one of the following problems is undecidable?
Question 6
What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon-and unit-production (i.e., of type A -> 
and A -> a) to parse a string with n tokens?
and A -> a) to parse a string with n tokens? Question 7
Which one of the following is a key factor for preferring B+-trees to binary search trees for indexing database relations?
Question 8
Match the problem domains in GROUP I with the solution technologies in GROUP II
Group - I
(P) Service oriented computing
(Q) Heterogeneous communicating systems
(R) Information representation
(S) Process Description
Group - II
(1) Interoperability
(2) BPMN
(3) Publish-find-bind
(4) XML
Group - I
(P) Service oriented computing
(Q) Heterogeneous communicating systems
(R) Information representation
(S) Process Description
Group - II
(1) Interoperability
(2) BPMN
(3) Publish-find-bind
(4) XML
Question 9
What does the following function do for a given Linked List with first node as head?
{
if(head==NULL)
return;
fun1(head->next);
printf(“%d”, head->data);
}
{
if(head==NULL)
return;
fun1(head->next);
printf(“%d”, head->data);
}
Question 10
How many times the word “PROCESS” will be printed when executing the following program?
main()
{
printf(“PROCESS”);
fflush();
fork();
fork();
}
main()
{
printf(“PROCESS”);
fflush();
fork();
fork();
}
- 359 attempts
- 4 upvotes
- 1 comment
Tags :
GATE & PSU CSGeneralApr 12GATE & PSU CS
