Go Back   2023 2024 MBA > MBA > Main Forum > Master of Computer Applications entrance exam previous year question papers

Thread: Master of Computer Applications entrance exam previous year question papers Reply to Thread
Your Username: Click here to log in
Title:
  
Message:
Trackback:
Send Trackbacks to (Separate multiple URLs with spaces) :
Post Icons
You may choose an icon for your message from the following list:
 

Additional Options
Miscellaneous Options

Topic Review (Newest First)
20th October 2014 11:00 AM
Arvind Kumar
Re: Master of Computer Applications entrance exam previous year question papers

As you want to get the Master of Computer Applications entrance exam previous year question papers so here it is for you:

Some content of the file has been given here:

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

An ordinary deck of 52 playing cards is randomly divided into 4 piles of 13 cards each. The probability that each pile has exactly I ace is
(a) 0.105 (b) 0.215 (c) 0.516 (d) 0.001

Suppose that the number of typographical errors on a single page of a certain book has Poisson distribution with parameter X = 1/2. In 600 pages book, the average number of errors in the book is
(a) 300 (h) 150 (c) 600 (d) 393

In seven-layer OSI network architecture, the fourth layer corresponds to
(a) data link control layer (b) session layer
(c) transport layer (d) presentation layer

Given any five points in the square 12 = {(x, y) : 0 x 1, 0 y 1}, only one of the following statements is true. Which one is it?
(a) The five points lie on a circle
(b) At least one square can be formed using four of the five points
(c) At least three of the five points are collinear
(d) ‘I’here are at least two points such that the distance between them does not exceed

The worst case running time of quick sort is
(a)O (nlog2 n) (b)O(n1og n)
(c) 0 (n2) (d) None of these

You have an application in which a large hut fixed table is to be searched very frequently. ‘I’he available RAM is adequate to load the table. What would be the best option for storing such a table?
(a) a sorted array (b) Binary search tree
(c) Hash table (d) A heap

The number of ways in which three distinct numbers in AP can be selected from 1, 2, …, 24 is
(a) 112 (b) 132 (c) 276 (d) 572

Master of Computer Applications entrance exam previous year question papers










For more detailed information I am atteching two PDF files which are free to download:
20th October 2014 10:17 AM
Unregistered
Master of Computer Applications entrance exam previous year question papers

Will you please share with me the Master of Computer Applications entrance exam previous year question papers?

Posting Rules
You may post new threads
You may post replies
You may not post attachments
You may not edit your posts

BB code is On
Smilies are On
[IMG] code is On
HTML code is Off


All times are GMT +5.5. The time now is 05:17 PM.


Powered by vBulletin® Version 3.8.7
Copyright ©2000 - 2024, vBulletin Solutions, Inc.
Search Engine Friendly URLs by vBSEO 3.6.0 PL2

1 2