UGC NET CSA JUNE 2015 Paper 2

UGC NET CSA JUNE 2015 Paper 2

Q1➡ |
How many strings of 5 digits have the property that the sum of their digits is 7?
i ➥ 66
ii ➥ 330
iii ➥ 495
iv ➥ 99

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More DiscussionExplanation On YouTubeCombinatoricsHelp-Line

Q2➡ |
Consider an experiment of tossing two fair dice, one black and one red. What is the probability that the number on the black die divides the number on red die?
i ➥ 22 / 36
ii ➥ 12 / 36
iii ➥ 14 / 36
iv ➥ 6 / 36

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTubeProbabilityHelp-Line

Q3➡ |
In how many ways can 15 indistinguishable fish be placed into 5 different ponds, so that each pond contains at least one fish ?
i ➥ 1001
ii ➥ 3876
iii ➥ 775
iv ➥ 200

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTubeCombinatoricsHelp-Line

Q4➡ |
Consider the following statements:
(a) Depth first search is used to traverse a rooted tree.
(b) Preorder, Postorder and Inorder are used to list the vertices of an ordered rooted tree.
(c) Huffman’s algorithm is used to find an optimal binary tree with given weights.
(d) Topological sorting provides a labelling such that the parents have larger labels than their children.
Which of the above statements are true?
i ➥ (a) and (b)
ii ➥ (c) and (d)
iii ➥ (a), (b) and (c)
iv ➥ (a), (b), (c) and (d)

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More DiscussionExplanation On YouTubeGraphs and treeHelp-Line

Q5➡ |
Consider a Hamiltonian Graph (G) with no loops and parallel edges. Which of the following is true with respect to this Graph (G) ?
(a) deg (v) ≥ n / 2 for each vertex of G
(b) |E(G)| ≥ 1 / 2 (n – 1) (n – 2) + 2 edges
(c) deg (v) + deg (w) ≥ n for every n and v not connected by an edge.
i ➥ (a) and (b)
ii ➥ (b) and (c)
iii ➥ (a) and (c)
iv ➥ (a), (b) and (c)

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTubeGraph theoryHelp-Line

Q6➡ |
Consider the following statements :
(a)Boolean expressions and logic networks correspond to labelled acyclic digraphs.
(b)Optimal boolean expressions may not correspond to simplest networks.
(c)Choosing essential blocks first in a Karnaugh map and then greedily choosing the largest remaining blocks to cover may not give an optimal expression.
Which of these statement(s) is/are correct ?
i ➥ (a) only
ii ➥ (b) only
iii ➥ (a) and (b)
iv ➥ (a), (b) and (c)

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTubeK-mapHelp-Line
Q7➡ |
Consider a full – adder with the following input values:
(a)x = 1, y = 0 and C i (carry input) = 0
(b)x = 0, y = 1 and C i = 1 Compute the values of S(sum) and C o (carry output) for the above input values.
i ➥ S = 1, C o = 0 and S = 0, C o = 1
ii ➥ S = 1, C o = 0 and S = 1, C o = 1
iii ➥ S = 1, C o = 1 and S = 1, C o = 0
iv ➥ S0 = 1, C o = 1 and S = 1, C o = 0

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTubeAdderHelp-Line

Q8➡ |
“If my computations are correct and I pay the electric bill, then I will run out of money. If I don’t pay the electric bill, the power will be turned off. Therefore, if I don’t run out of money and the power is still on, then my computations are incorrect.” Convert this argument into logical notations using the variables c, b, r, p for propositions of computations, electric bills, out of money and the power respectively. (Where ¬ means NOT)
i ➥ if (c Λ b)→r and ¬b→p, then (¬r Λ p)→¬c
ii ➥ if (c ∨ b)→r and ¬b→¬p, then (r Λ p)→c
iii ➥ if (c Λ b)→r and ¬p→b, then (¬r ∨ p)→¬c
iv ➥ if (c ∨ b)→r and ¬b→¬p, then (¬r Λ p)→¬c

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTubePropositional logicHelp-Line

Q9➡ |
Match the following:

i ➥ (a)-(i), (b)-(ii), (c)-(iii), (d)-(iv)
ii ➥ (a)-(ii), (b)-(iii), (c)-(i), (d)-(iv)
iii ➥ (a)-(iii), (b)-(ii), (c)-(iv), (d)-(i)
iv ➥ (a)-(iv), (b)-(ii), (c)-(iii), (d)-(i)

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTubePropositional logicHelp-Line

Q10➡ |
Consider a proposition given as :
“ x ≥ 6, if x 2 ≥ 5 and its proof as:
If x ≥ 6, then x 2 = x.x ≥ 6.6 = 36 ≥ 25
Which of the following is correct w.r.to the given proposition and its proof?
(a)The proof shows the converse of what is to be proved.
(b)The proof starts by assuming what is to be shown.
(c)The proof is correct and there is nothing wrong.
i ➥ (a) only
ii ➥ (c) only
iii ➥ (a) and (b)
iv ➥ (b) only

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTubeCombinatoricsHelp-Line

Q11➡ |
What is the output of the following program?
(Assume that the appropriate preprocessor directives are included and there is no syntax error)
main( )
{
char S[ ] = “ABCDEFGH”;
printf (“%C”, (&S[3]));
printf (“%s”, S+4);
printf (“%u”, S);
/ *Base address of S is 1000 */
}
i ➥ ABCDEFGH1000
ii ➥ CDEFGH1000
iii ➥ DDEFGHH1000
iv ➥ DEFGH1000

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More DiscussionExplanation On YouTubeArraysHelp-Line

Q12➡ |
Which of the following, in C++, is inherited in a derived class from base class ?
i ➥ constructor
ii ➥ destructor
iii ➥ data members
iv ➥ virtual methods

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTubePropertiesHelp-Line

Q13➡ |
Given that x = 7.5, j = -1.0, n = 1.0, m = 2.0
the value of –x + j == x>n>=m is:
i ➥ 0
ii ➥ 1
iii ➥ 2
iv ➥ 3

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTubeOperatorHelp-Line

Q14➡ |
Which of the following is incorrect in C++ ?
(A) When we write overloaded function we must code the function for each usage.
(B) When we write function template we code the function only once.
(C) It is difficult to debug macros
(D) Templates are more efficient than macros
i ➥ (A) and (B)
ii ➥ (A), (B) and (C)
iii ➥ (B) and (C)
iv ➥ All are correct.

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More DiscussionExplanation On YouTubePropertiesHelp-Line

Q15➡ |
When the inheritance is private, the private methods in base class are ________ in the derived class (in C++).
i ➥ inaccessible
ii ➥ accessible
iii ➥ protected
iv ➥ public

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTubePropertiesHelp-Line

Q16➡ |
An Assertion is a predicate expressing a condition we wish database to always satisfy.
The correct syntax for Assertion is :
i ➥ CREATE ASSERTION ‘ASSERTION Name’ CHECK ‘Predicate’
ii ➥ CREATE ASSERTION ‘ASSERTION Name’
iii ➥ CREATE ASSERTION, CHECK Predicate
iv ➥ SELECT ASSERTION

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTubeSQLHelp-Line

Q17➡ |
Which of the following concurrency protocol ensures both conflict serializability and freedom from deadlock?
(a) Z-Phase Locking
(b) Timestamp ordering
i ➥ Both (a) and (b)
ii ➥ (a) only
iii ➥ (b) only
iv ➥ Neither (a) nor (b)

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTubeTransactionsHelp-Line

Q18➡ |
Drop Table cannot be used to drop a Table referenced by __ constraint.
(a)Primary key
(b)Sub key
(c)Super key
(d)Foreign key
i ➥ (a)(a)(a)(a)(a)(a)
ii ➥ (a), (b) and (c)
iii ➥ (d)
iv ➥ (a) and (d)

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTubeKeysHelp-Line

Q19➡ |
Database applications were built directly on top of file system to overcome the following drawbacks of using file-systems:
(a) Data redundancy and inconsistency
(b) Difficulty in accessing Data
(c) Data isolation
(d) Integrity problems
i ➥ (a)
ii ➥ (a) and (d)
iii ➥ (a), (b) and (c)
iv ➥ (a), (b), (c) and (d)

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More DiscussionExplanation On YouTubeIndexingHelp-Line

Q20➡ |
For a weak entity set to be meaningful, it must be associated with another entity set in combination with some of their attribute values, is called as:
i ➥ Neighbour Set
ii ➥ Strong Entity Set
iii ➥ Owner Entity Set
iv ➥ Weak Set

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTubeER-modelHelp-Line

Q21
Consider the given graph

Its Minimum Cost Spanning Tree is ____________.
i ➥
ii ➥
iii ➥
iv ➥

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More DiscussionExplanation On YouTubeMinimum spanning treeHelp-Line

Q22➡ |
The inorder and preorder Traversal of binary Tree are dbeafcg and abdecfg respectively. The post-order Traversal is ______.
i ➥ dbefacg
ii ➥ debfagc
iii ➥ dbefcga
iv ➥ debfgca

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More DiscussionExplanation On YouTubeBinary treesHelp-Line

Q23➡ |
Level order Traversal of a rooted Tree can be done by starting from root and performing:
i ➥ Breadth First Search
ii ➥ Depth First Search
iii ➥ Root Search
iv ➥ Deep Search

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTubeGraphs and treeHelp-Line

Q24➡ |
The average case occurs in the linear search algorithm when:
i ➥ The item to be searched is in somewhere middle of the array
ii ➥ The item to be searched is not in the array
iii ➥ The item to be searched is in the last of the array
iv ➥ The item to be searched is either in the last or not in the array

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTubeSearchingHelp-Line

Q25➡ |
To determine the efficiency of an algorithm the time factor is measured by:
i ➥ Counting microseconds
ii ➥ Counting number of key operations
iii ➥ Counting number of statements
iv ➥ Counting kilobytes of algorithm

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More DiscussionExplanation On YouTubeTime complexityHelp-Line

Q26➡ |
Which of the following protocols is an application layer protocol that establishes, manages and terminates multimedia sessions ?
i ➥ Session Maintenance Protocol
ii ➥ Real time Streaming Protocol
iii ➥ Real time Transport Control Protocol
iv ➥ Session Initiation Protocol

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More DiscussionExplanation On YouTubeApplication layer protocolHelp-Line

Q27➡ |
Match the following port numbers with their uses:
i ➥ (a)-(iv), (b)-(i), (c)-(ii), (d)-(iii)
ii ➥ (a)-(ii), (b)-(i), (c)-(iv), (d)-(iii)
iii ➥ (a)-(ii), (b)-(iv), (c)-(iii), (d)-(i)
iv ➥ (a)-(ii), (b)-(iv), (c)-(i), (d)-(iii)

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More DiscussionExplanation On YouTubePort no.Help-Line

Q28➡ |
Which of the following is not associated with the session layer ?
i ➥ Dialog control
ii ➥ Token management
iii ➥ Semantics of the information transmitted
iv ➥ Synchronization

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTubeOSI-TCP layerHelp-Line

Q29➡ |
What is the size of the ‘total length’ field in IPv4 datagram?
i ➥ 4 bit
ii ➥ 8 bit
iii ➥ 16 bit
iv ➥ 32 bit

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTubeIPv4 and fragmentationHelp-Line

Q30➡ |
Which of the following is/are restriction(s) in classless addressing?
i ➥ The number of addresses needs to be a power of 2.
ii ➥ The mask needs to be included in the address to define the block.
iii ➥ The starting address must be divisible by the number of addresses in the block.
iv ➥ All of the above

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More DiscussionExplanation On YouTubeSubnettingHelp-Line

Q31➡ |
Match the following:
i ➥ (a)-(ii), (b)-(iii), (c)-(iv), (d)-(i)
ii ➥ (a)-(iii), (b)-(iv), (c)-(ii), (d)-(i)
iii ➥ (a)-(iv), (b)-(i), (c)-(iii), (d)-(ii)
iv ➥ (a)-(iv), (b)-(iii), (c)-(ii), (d)-(i)

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLinear algebraHelp-Line

Q32➡ |
The translator which performs macro calls expansion is called:
i ➥ Macro processor
ii ➥ Micro preprocessor
iii ➥ Macro preprocessor
iv ➥ Dynamic Linker

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTubePre- processorHelp-Line

Q33➡ |
If all the production rules have single non-terminal symbol on the left side, the grammar defined is:
i ➥ context free grammar
ii ➥ context sensitive grammar
iii ➥ unrestricted grammar
iv ➥ phrase grammar

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTubeContext free grammarHelp-Line

Q34➡ |
Which one from the following is false?
i ➥ LALR parser is Bottom up parser
ii ➥ A parsing algorithm which performs a left to right scanning and a right most deviation is RL (1)
iii ➥ LR parser is Bottom up parser.
iv ➥ In LL(1), the 1 indicates that there is a one – symbol look – ahead.

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More DiscussionExplanation On YouTubeParsersHelp-Line

Q35➡ |
Which phase of compiler generates stream of atoms?
i ➥ Syntax Analysis
ii ➥ Lexical Analysis
iii ➥ Code Generation
iv ➥ Code Optimization

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTubePhase of compilersHelp-Line

Q36➡ |
A disk drive has 100 cyclinders, numbered 0 to 99. Disk requests come to the disk driver for cyclinders 12, 26, 24, 4, 42, 8 and 50 in that order. The driver is currently serving a request at cyclinder 24. A seek takes 6 msec per cyclinder moved. How much seek time is needed for shortest seek time first (SSTF) algorithm?
i ➥ 0.984 sec
ii ➥ 0.396 sec
iii ➥ 0.738 sec
iv ➥ 0.42 sec

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More DiscussionExplanation On YouTubeDisk schedulingHelp-Line

Q37➡ |
Let P i and P j be two processes, R be the set of variables read from memory, and W be the set of variables written to memory. For the concurrent execution of two processes P i and P j which of the following conditions is not true?
i ➥ R(P i ) ∩ W(P j ) = Ф
ii ➥ W(P i ) ∩ R(P j ) = Ф
iii ➥ R(P i ) ∩ R(P j ) = Ф
iv ➥ W(P i ) ∩ W(P j ) = Ф

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTubeProcess synchronizationHelp-Line

Q38➡ |
A LRU page replacement is used with four page frames and eight pages. How many page faults will occur with the reference string 0172327103 if the four frames are initially empty?
i ➥ 6
ii ➥ 7
iii ➥ 8
iv ➥ 5

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More DiscussionExplanation On YouTubePage replacement algorithmHelp-Line

Q39➡ |
What does the following command do?
grep -vn “abc” x
i ➥ It will print all of the lines in the file x that match the search string “abc”.
ii ➥ It will print all of the lines in file x that do not match the search string “abc”.
iii ➥ It will print the total number of lines in the file x that match the string “abc”.
iv ➥ It will print the specific line numbers of the file x in which there is a match for string “abc”.

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLinux commandsHelp-Line

Q40➡ |
The Unix Kernel maintains two key data structures related to processes, the process table and the user structure. Which of the following information is not the part of user structure?
i ➥ File descriptor table
ii ➥ System call state
iii ➥ Scheduling parameters
iv ➥ Kernel stack

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTubeProcess schedulingHelp-Line

Q41➡ |
Match the following:
i ➥ (a)-(iii), (b)-(iv), (c)-(i), (d)-(ii)
ii ➥ (a)-(ii), (b)-(i), (c)-(iv), (d)-(iii)
iii ➥ (a)-(iv), (b)-(ii), (c)-(iii), (d)-(i)
iv ➥ (a)-(iii), (b)-(i), (c)-(iv), (d)-(ii)

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More DiscussionExplanation On YouTubeFunctional pointsHelp-Line

Q42➡ |
In which testing strategy requirements established during requirements analysis are validated against developed software?
i ➥ Validation testing
ii ➥ Integration testing
iii ➥ Regression testing
iv ➥ System testing

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTubeSoftware testingHelp-Line

Q43➡ |
Which process model is also called as classic life cycle model?
i ➥ Waterfall model
ii ➥ RAD model
iii ➥ Prototyping model
iv ➥ Incremental model

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTubeWaterfall modelHelp-Line

Q44➡ |
Cohesion is an extension of:
i ➥ Abstraction concept
ii ➥ Refinement concept
iii ➥ Information hiding concept
iv ➥ Modularity

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTubeCoupling and cohesionHelp-Line

Q45➡ |
Which one from the following is highly associated activity of project planning?
i ➥ Keep track of the project progress.
ii ➥ Compare actual and planned progress and costs.
iii ➥ Identify the activities, milestones and deliverables produced by a project.
iv ➥ Both (2) and (3).

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTubeSoftware designHelp-Line

Q46➡ |
In the case of parallelization, Amdahl’s law states that if P is the proportion of a program that can be made parallel and (1 -P) is the proportion that cannot be parallelized, then the maximum speed-up that can be achieved by using N processors is:
i ➥ 1/((1−p)+ N .P)
ii ➥ 1/((N −1)P +P)
iii ➥ 1/((1−P )+ P /N)
iv ➥ 1/((P)+(1-P)/N)

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTubePipeliningHelp-Line

Q47➡ |
Which of the following statements is incorrect for Parallel Virtual Machine (PVM) ?
i ➥ The PVM communication model provides asynchronous blocking send, asynchronous blocking receive, and non-blocking receive function.
ii ➥ Message buffers are allocated dynamically.
iii ➥ The PVM communication model assumes that any task can send a message to any other PVM task and that there is no limit to the size or number of such messages.
iv ➥ In PVM model, the message order is not preserved.

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More DiscussionExplanation On YouTubeSoftware designHelp-Line

Q48➡ |
Which of the following algorithms sort n integers, having the range 0 to (n 2 – 1), in ascending order in O(n) time ?
i ➥ Selection sort
ii ➥ Bubble sort
iii ➥ Radix sort
iv ➥ Insertion sort

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTubeSortingHelp-Line

Q49➡ |
Which of the following statements is FALSE about weak entity set?
i ➥ Weak entities can be deleted automatically when their strong entity is deleted.
ii ➥ Weak entity set avoids the data duplication and consequent possible inconsistencies caused by duplicating the key of the strong entity.
iii ➥ A weak entity set has no primary keys unless attributes of the strong entity set on which it depends are included
iv ➥ Tuples in a weak entity set are not partitioned according to their relationship with tuples in a strong entity set.

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More DiscussionExplanation On YouTubeER-ModelHelp-Line

Q50➡ |
Which of the following is not valid with reference to Message Passing Interface (MPI) ?
i ➥ MPI can run on any hardware platform.
ii ➥ The programming model is a distributed memory model.
iii ➥ All parallelism is implicit.
iv ➥ MPI – Comm – Size returns the total number of MPI processes in specified communication.

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTubeInter process communicationHelp-Line

error: Content is protected !!
Open chat
1
Hi,how Can We Help You ?