A box contains six red balls and four green balls. Four balls are selected at random from the box. What is the probability that two of the selected balls will be red and two will be green?                                                                     NTA NET December 2018 

Match List - I with List - II:                                                  NTA NET JUNE 2019 

List - I	List - II
A. Prim's Algorithm	(i) O(V3logV)
B. Dijkstra's Algorithm	(ii) O(VE2)
C. Fastest all pair shortest path	(iii) O(ElogV)
D. Edmonds - Karp Algorithm	(iv) O(V2)

Choose the correct option from those given below:

Let G be a simple undirected graph, TD be a DFS tree on G, and TB be the BFS tree on G. Consider the following statements.          NTA NET JUNE 2020

Statement I: No edge of G is a cross with respect to TD.

Statement II: For every edge(u,V) of G, if u is at depth i and v is at depth j in TB then | i-j | = 1.

In the light of the above statements, choose the correct answer from the options given below

Consider the following two sentences:                                                             CBSE NET JULY 2018 

(A) The planning graph data structure can be used to give a better heuristic for a planning problem.

(B) Dropping negative effects from every action schema in a planning problem results in a relaxed problem.

Which of the following is correct with respect to the above sentences?

Consider the following statements:                                      NTA NET December 2019 

S1: If a group (G,*) is of order n, and aϵG is such that a^m = e for some integer m ≤ n, then m must divide n.

S2: If a group (G,*) is of even order, then there must be an element aϵG such that a≠e and a*a=e.

Which of the statements is / are correct?

Consider a vocabulary with only four propositions A, B, C and D. How many models are there for the following sentence?  B ⋁ C                            CBSE NET JULY 2018 

In mathematical logic, which of the following are statements?                                                     NTA NET December 2018 

(i) There will be snow in January.

(ii) What is the time now?

(iii) Today is sunday

(iv) You must study Discrete Mathematics

Choose the correct answer from the code given below:

Match List - I with List - II:                                                              NTA NET JUNE 2019 

List - I	List - II
A. p → q	(i) ¬(q → ¬p)
B. p ⋁ q	(ii) p ⋀ →q
C. p ⋀ q	(iii) ¬p → q
D. ¬(p → q)	(iv) ¬p ⋁ q

Choose the correct answer from those given below:

A survey has been conducted on methods of commuter travel. Each respondent was asked to check Bus, Train or Automobile as a major method of travelling to work. More than one answer was permitted. The results reported were as follows:

Bus 30 people; Train 35 people; Automobile 100 people; Bus and Train 15 people; Bus and Automobile 15 people, Train and Automobile 20 people; and all the three methods 5 people. How many people completed the survey form?                                                           NTA NET December 2018 

Consider the following statements with respect to duality in LPP: NTA NET December 2019 

A. The final simplex table giving optimal solution of the primal also contains optimal solution of its dual in itself.

B. If either the primal or the dual problem has a finite optimal solution, then the other problem also has a finite optimal solution

C. If either problem has an unbounded optimum solution, then the other problem has no feasible solution at all.

Which of the statements is / are correct?

How many reflexive relations are there on a set with 4 elements?                            NTA NET December 2019 

Consider the poset ({3,5,9,15,24,45},|).                                                  NTA NET JUNE 2019 

Which of the following is correct for the given poset?

What are the greatest lower bound (GLB ) and least upper bound (LUB) of the sets A={3,9,12} and B={1,2,4,5,10} if they exist in poset (z⁺,/)?               NTA NET December 2019 

If a graph (G) has no loops or parallel edges, and if the number of vertices (n) in the graph is n ≥ 3, then graph G is Hamiltonian if                                       NTA NET December 2018 


(i) deg(v) ≥ n/3 for each vertex v

(ii) deg(v) + deg(w) ≥ n    Whenever v and w are not connected by an edge.

(iii) E(G) ≥ 1/3(n-1) (n-2) + 2

Choose the correct answer from the code given below:

In PERT / CPM, the merge event represents __________ of two or more events.                                            NTA NET December 2018 

Consider the following properties: NTA NET JUNE 2020 

A. Reflexive

B. Antisymmetric

C. Symmetric

Let A = {a,b,c,d,e,f,g} and R={(a,a),(b,b),(c,d),(c,g),(d,g),(e,e),(f,f),(g,g)} be a relation on A. Which of the following property is satisfied by the relation R?

A clique in an undirected graph G = {V,E}; is a subset V^' ⊆ V of vertices, such that                                                  NTA NET December 2019 

1. If (u,v) ϵ E then u ϵ V^' and v ϵ V^'

2. If (u,v) ϵ E then u ϵ V^' or v ϵ V^'

3. Each pair of vertices in V^' is connected by an edge.

4. All pairs of vertices in V^' are not connected by an edge.

How many ways are there to place 8 indistinguishable balls into four distinguishable bins?                                                    NTA NET JUNE 2019 

How many cards must be selected from a standard deck of 52 cards to guarantee that atleast three hearts are present among them?                NTA NET JUNE 2019 

The Boolean expression A̅.B+A.B̅+A.B is equivalent to                                            NTA NET December 2018 

Which of the relations on {0, 1, 2, 3} is an equivalence relation?                                                              CBSE NET JULY 2018 

Match List I with List II                                 NTA NET JUNE 2020 
Let R1 = {(1,1),(2,2),(3,3)} and R2={(1,1),(1,2),(1,3),(1,4)}

List I	List II
A. R1 U R2	(i) {(1,1),(1,2),(1,3),(1,4),(2,2),(3,3)}
B. R1 - R2	(ii) {(1,1)}
C. R1 n R2	(iii) {(1,2),(1,3),(1,4)}
D. R2 - R1	(iv) {(2,2),(3,3)}

Choose the correct answer from the options given below

For which values of m and n does the complete bipartite graph K_m,n have a Hmamilton circuit?                                                            NTA NET JUNE 2019 

A tree has 2n vertices of degree 1, 3n vertices of degree 2, n vertices of degree 3. Determine the number of vertices and edges on tree.                  NTA NET December 2019 

Which of the following statements are true?                              NTA NET December 2018 

(i) Every logic network is equivalent to one using just NAND gates or just NOR gates.

(ii) Boolean expressions and logic networks correspond to labelled acyclic digraphs.

(iii) No two Boolean algebras with n atoms are isomorphic.

(iv) N0n - zero elements of finite Boolean algebras are not uniquely expressible as joins of atoms.

Choose the correct answer from the code given below:  

Which of the following statements is false about convex minimization problem?                                    CBSE NET JULY 2018 

Match List I with List II and choose the correct answer from the code given below.                                   NTA NET December 2018 

List - I	List - II
A. Equivalence	(i) p ⇒ q
B. Contrapositive	(ii) p ⇒ q: q ⇒ p
C. Converse	(iii) p ⇒ q : ~q ⇒ ~p
D. Implication	(iv) p ⇔ q

How many ways are there to pack six copies of the same book into four identical boxes. Where a box can contain as many as six books?             NTA NET JUNE 2020 

Let G be a directed graph whose vertex set is the set of numbers from 1 to 100. There is an edge from a vertex i to a vertex j if and only if either j=i+1 or j=3i. The minimum number of edges in a path in G from vertex 1 to vertex 100 is __________                        NTA NET JUNE 2020

A complete n - ary tree is a tree in which each node has n children or no children. Let I be the number of internal nodes and L be the number of leaves in a complete n - ary tree. If L = 41 and I = 10. What is the value of n?            NTA NET JUNE 2020

A basic feasible solution of an m x n transportation problem is said to be non - degenerate, if basic feasible solution contains exactly ____________ number of individual allocation in ________ positions.                   NTA NET December 2019 

Consider a weighted graph. The current shortest distance from source S to node x is represented by d[x]. Let d[v]=29, d[u]=15, w[u,v]=12. What is the updated value of d[v] based on current information                                  NTA NET December 2019 

Consider the following statements:                           NTA NET JUNE 2020 

A. Any tree is 2 - colorable.

B. A graph G has no cycles of even length if it is bipartite.

C. A graph G is 2 - colorable if it is bipartite.

D. A graph G can be colored with d+1 colors if d is the maximum degree of any vertex in the graph G.

E. A graph G can be colored with O(log|v|) colors if it has O(|v|) edges.

Choose the correct answer from the options given below:

Which of the following is principal conjunctive normal form for [(p ⋁ q) ⋀ ¬p → ¬q]?                            NTA NET JUNE 2019 

E is the number of Edges in the graph and f is maximum flow in the graph. When the capacities are integers, the runtime of Ford - Fulberson algorithm is bounded by: CBSE NET JULY 2018 

1. O(E*F)

2. O(E²*f)

3. O(E*F²)

4. O(E²*F²)

Let P be the set of all people. Let R be a binary relation on P such that (a,b) is in R if a is a brother of b. Is R symmetric, transitive, an equivalence relation, a partial order relation?                                             NTA NET December 2019 

Consider the set of all possible five - card poker hands dealt fairly from a standard deck of fifty - two cards. How many atomic events are there in the joint probability distribution?                                                        CBSE NET JULY 2018