Aspire Faculty ID #14709 · Topic: UGC NET Computer Science 26 June 2025 (Paper II) · Just now
UGC NET Computer Science 26 June 2025 (Paper II)

In a pack of 42 cards, 3 cards are chosen one after the other without replacement. Find the number of ways this can be done:

Solution

Since the cards are drawn “one after the other” and order matters, we use permutations:
Number of ways = \( ^{42}P_3 = 42 \times 41 \times 40 \).

Compute: \( 42 \times 41 = 1722 \), and \( 1722 \times 40 = 68880 \).

Previous 10 Questions — UGC NET Computer Science 26 June 2025 (Paper II)

Nearest first
1
The packet sent by a node to the source to inform it of congestion is called:
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
2
When developing a dynamic programming algorithm, the sequence of steps followed is: A. Construct an optimal s…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
3
The process followed in order to find difficult, unknown and hidden information about a software system is called:
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
4
Let P denote “She is intelligent” and Q denote “She is happy.” Given statements: (a) If she is intelligent, the…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
5
Which of the following trees are height balanced? A. Binary Search Tree B. AVL Tree C. Red-Black Tree D…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
6
Consider relation R(A, B, C, D, E) with the following functional dependencies: C → F, E → A, EC → D, A → B. Wh…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
7
Consider the following interrupt protection levels in Linux, and arrange them in the increasing order of their prioriti…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
8
Maintaining a graph in memory by means of its adjacency matrix is known as
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
9
Arrange the following parsers in increasing order of their power (least → most): LR(0) LR(1) LALR(1) LL(0) S…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
10
Match List I with List II List I List II A. Digital Signature I. Asymmetric encryption algor…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)

Next 10 Questions — UGC NET Computer Science 26 June 2025 (Paper II)

Ascending by ID
1
The transformation of data from main memory to cache memory is referred as:
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
2
Match List I with List II: List I List II A. Address Space I. Associative Mappi…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
3
Consider the following table defining the sample inputs and corresponding target values for a perceptron model. …
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
4
Arrange the following in the increasing order of coupling from lowest coupling to highest coupling. A. Common Coupling …
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
5
The correct sequence of constructing Huffman tree isA. Repeat until root formedB. Create leaf nodesC. Build priority qu…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
6
Consider the following three relations:Employee(eid, eName), Comp(cid, cName), Own(eid, cid).Which of the following rel…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
7
Match List I with List II List I List II A. Clustered Page Table III. Useful for sparse address spaces. B. Hie…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
8
The longest common subsequence of $\{1,2,3,2,4,1,2\}$ and $\{2,4,3,1,2,1\}$ is
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
9
Given that η refers to learning rate and xi refers to the i-th input to the neuron, which of the followings most suitab…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
10
Arrange the process of virtualization in cloud environments.A. Hypervisor installed on physical serverB. Virtual machin…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
Ask Your Question or Put Your Review.

loading...