# JNU MCA Entrance Question Papers 2008 with Answers

JNU MCA Entrance Question Papers 2008 with Answers.

JNU MCA Entrance Question Paper 2008 With Answers Solution Free Download  JNU MCA Entrance 2008 Question Paper, This JNU MCA Entrance 2008 Question will help all the students for their exam preparation, here the question type is MCQ i.e multiple choice question answers, if this JNU MCA Entrance 2008 question paper in pdf file for JNU MCA Entrance you can download it in FREE, if JNU MCA Entrance 2008 paper in text for JNU MCA Entrance you can download JNU MCA Entrance 2008 page also just Go to menu bar, Click on File->then Save.

## JNU MCA Entrance Question Papers 2008 with Answers

The question paper for the entrance examination will consist of multiple choice questions. Syllabus:
10+2/Graduate level Mathematics and Probability, Graduate level Computer Science and General Aptitude.

In Similar Links you can also have JNU MCA Entrance Preparation Tips JNU MCA Entrance exam 2012, JNU MCA Entrance Question Bank or JNU MCA Entrance Reference Books or Study Materials JNU MCA Entrance

Structure is a programming language concept for aggregation of data using Cartesian product through conjunction of fields in most programming languages. Which one of the following is used for aggregation of data using Cartesian product through disjunction of its field ?
(a) Array (b) Pointer
(c) String (d) Union

The hexadecimal of of 756.603 with base 8 is
(a) 1EE.C18 (b) 2F4.25B
(c) 3DD.83 (d) None of these

Consider the following statements :
(i) Static languages do not support recursion.
(ii) The memory requirement for stack-based
language such as ALGOL-60 can be estimated at compile time.
(iii) Resolution of overloaded operators can be done at translation time.

Which one of the following options is correct ?
(a) (i) and (ii) are true
(b) (i) and (iii) are true
(c) (ii) and (iii) are true
(d) (i), (ii) and (iii) are true

What will the following program do ?
# include <stdio.h>
main()
{
char*names[6];
int i;
for (i=0; i Ü 5; i++
{
printf(‘‘\nEnter name’’);
scanf(‘‘%s’’,names[i]);
}
}
(a) The program does not work properly
(b) The program gives syntax error
(c) The program reads 6 strings
(d) None of the above

For a memory chip having capacity of 32 kilobytes, the minimum number of address lines required is
(a) 5 (b) 10 (c) 15 (d) 32

Determine number from the give alternatives, having the same relation with this number as the numbers of the given pair bear in the given
7528 : 5362 : : 4673 : ?
(a) 2367 (b) 2451
(c) 2531 (d) None of thes

Which of the following statements is/are correct ?
(a) A heap is always a complete binary tree
(b) An AVL tree is always a binary search three
(c) Full binary tree is a special case of complete binary
(d) All of the above