UGC-NET December 2020 and June 2021 computer Science and application solutions

Q1➡ | Data Structure
Two balanced binary trees are given with m and n elements, respectively. They can be merged into a balanced binary search tree in time.
i ➥ O(m*log n)
ii ➥ O(m*log(m+n))
iii ➥ O(m*n)
iv ➥ O(m+n)

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More DiscussionExplanation On YouTube binary trees Help-Line

Q2➡ | Computer Graphics
What is the transformation matrix M that transforms a square in the xy-plane defined by (1, 1)T, (-1,1)T,(-1,-1)T and (1,-1)T to a parallelogram whose corresponding vertices are (2, 1)T, (0,-1)T,(-2,-1)T and (0,-1)T?
i ➥
ii ➥
iii ➥
iv ➥

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q3➡ | Algorithms
In the following table, the left column contains the names of standard graph algorithms and the right column contains the time complexities of the algorithms. Here, n and m are number of vertices and edges, respectively. Match each algorithm with its time complexity.


Choose the correct answer from the options given below: Options:-
i ➥ A – II, B – I, C – III, D – IV
ii ➥ A – II, B – IV, C – III, D – I
iii ➥ A – III, B – I, C – II, D – IV
iv ➥ A – III, B – IV, C – I, D – II

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q4➡ | Database Management System
A transaction may be in one of the following states during its execution life cycle in concurrent execution environment.

A. FAILED
B. TERMINATED
C. PARTIALLY COMMITTED
D. COMMITTED
E. ACTIVE

Given a transaction in active state during its execution, find its next transitioned state from the options given below:
i ➥ A only
ii ➥ C only
iii ➥ D only
iv ➥ Either A or C only

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q5➡ | Theory of Computation
Which of the following languages are not regular?
A. L={ (01)n0k | n > k, k>=0 }
B. L={ cnbkan+k | n >= 0, k>=0 }
C. L={ 0n1k | n≠k }
Choose the correct answer from the options given below:
i ➥ A and C only
ii ➥ A and B only
iii ➥ A, B and C
iv ➥ B and C only

Show Answer With Best Explanation

Answer: III
Explanation:
Regular language does not have any memory to compare.
A. L={ (01)n0k | n > k, k>=0 }
Here, occurance of n is greater than occurance of k, for that we need to compare value of n with k, and regular language does not have power to compare. so,it is not regular language. It is Context Free Language.

B. L={ cnbkan+k | n >= 0, k>=0 }
Here, occurance of c is less than or equal to ocuurance of a and Finite Automata cannot do this comparison. So, it is not regular language . It is Context Free Language.

C. L={ 0n1k | n≠k }
Here, occurance of n is not equal to occurance of k, and this type of comparison cannot be done by Finite Automata.So, it is also not regular language . It is Context Free Language.

So, Option(III) is correct.

More Discussion Explanation On YouTubeLearn Topic WiseHelp-Line

Q6➡ | Database Management System
Which of the DBMS component ensures that concurrent execution of multiple operations on the database results into a consistent database state?
i ➥ Buffer manager
ii ➥ File manager
iii ➥ Logs
iv ➥ Transaction processing system

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q7➡ | Database Management System
Given the following STUDENT-COURSE scheme:
STUDENT (Rollno, Name, courseno)
COURSE (courseno, coursename, capacity),

where Rollno is the primary key of relation STUDENT and courseno is the primary key of relation COURSE. Attribute coursename of COURSE takes unique values only. Which of the following query(ies) will find total number of students enrolled in each course, along with its coursename.

A. SELECT coursename, count(*) 'total' from STUDENT natural join COURSE group by coursename;
B. SELECT C.coursename, count(*) 'total' from STUDENT S, COURSE C where S.courseno=C.courseno group by coursename;
C. SELECT coursename, count(*) 'total' from COURSE C where courseno in (SELECT courseno from STUDENT);
i ➥ A and B only
ii ➥ A only
iii ➥ B only
iv ➥ C only

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q8➡ | Operating System
Given memory access time as p nanoseconds and additional q nanoseconds for handling the page fault. What is the effective memory access time if a page fault occurs once for every 100 instructions?
i ➥
ii ➥
iii ➥
iv ➥
Answer: I
Click below to see detailed Solution
[Easy Solution]Explanation On YouTubePage FaultHelp-Line

Q9➡ | Theory of Computation
What language is accepted by the pushdown automaton
M=({q0, q1, q2}, {a, b}, {a, b, z}, δ, q0, z, {q2})
with
δ(q0, a, a) ={ (q0, aa) }; δ(q0, b, a) ={(q0, ba)}
δ(q0, a, b) ={ (q0, ab) }; δ(q0, b, b) ={ (q0, bb) }
δ(q0, a, z) ={ (q0, az) }; δ(q0, b, z) ={ (q0, bz) }
δ(q0, λ, b) ={ (q1, b) }; δ(q0, λ, a) ={ (q1, a) }
δ(q1, a, a) ={ (q1, λ) }; δ(q1, b, b) ={ (q1, λ) }
δ(q1, λ, z) ={ (q2, z) }?
i ➥ L = { w | na(w) <= nb(w), w Є {a, b}+}}
ii ➥ L = { w | na(w) = nb(w), w Є {a, b}+}}
iii ➥ L = { w | nb(w) <= na(w), w Є {a, b}+}}
iv ➥ L= {wwR | w Є {a, b}+}

Show Answer With Best Explanation

Answer: IV
Explanation:
Given,
pushdown automata M=({q0, q1, q2}, {a, b}, {a, b, z}, δ, q0, z, {q2})
where,
{q0, q1, q2} = Finite state of states
{a, b} = Input alphabet
{a, b, z} = Stack alphabet
δ = Transition Function
q0 = Initial state
z = Bottom of the stack
{q2} = Final state
Let’s Draw pushdown automata for a given Transition function:
 What language is accepted by the pushdown automaton M=({q0, q1, q2}, {a, b}, {a, b, z}, δ, q0, z, {q2}) with  δ(q0, a, a) ={ (q0, aa) };
First, keep pushing any number of a’s and b’s in the stack , and then pop one a from stack on seeing input alphabet a and pop one b from stack on seeing input alpbabet b. Keep popping untill we reach end of string λ. when we reach end of string λ and Top of Stack is z, then go to final state.
Let’s take one string and analyze them
suppose string
What language is accepted by the pushdown automaton M=({q0, q1, q2}, {a, b}, {a, b, z}, δ, q0, z, {q2}) with
Language generated by above push down automata (L)= {wwR | w Є {a, b}+}
So, Option(IV) is correct.

More Discussion Explanation On YouTubeLearn Topic WiseHelp-Line

Q10➡ | Operating System
In a file allocation system, the following allocation schemes are used:
A. Contiguous
B. Indexed
C. Linked allocation
Which of the allocation scheme(s) given above will not suffer from external fragmentation?
Choose the correct answer from the options given below:
i ➥ A and B only
ii ➥ A only
iii ➥ B and C only
iv ➥ C only

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q11➡ | Compiler Design
Given below are two statements
Statement I: LL(1) and LR are examples of Bottom-up parsers.
Statement II: Recursive descent parser and SLR are examples of Top-down parsers
In light of the above statements, choose the correct answer from the options given below Options:-
i ➥ Both Statement I and Statement II are false
ii ➥ Both Statement I and Statement II are true
iii ➥ Statement I is false but Statement II is true
iv ➥ Statement I is true but Statement II is false

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q12➡ | Software Engineering
Given below are two statements, one is labelled as Assertion A and the other is labelled as Reason R
Assertion A : Software developers do not do exhaustive software testing in practice.
Reason R : Even for small inputs, exhaustive testing is too computationally intensive (e.g., takes too long) to run all the tests.
In light of the above statements, choose the correct answer from the options given below
i ➥ A is false but R is true
ii ➥ A is true but R is false
iii ➥ Both A and R are true and R is the correct explanation of A
iv ➥ Both A and R are true but R is NOT the correct explanation of A

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q13➡ | Discrete Mathematics
Let (X,* ) be a semi-group. Furthermore, for every a and b in X, if a ≠ b, then a*b ≠ b*a. Based on the defined semi-group,
choose the correct equalities from the options given below:
A. For every a in X, a*a = a
B. For every a, b in X, a*b *a= a
C. For every a, b, c in X, a*b *c= a*c
i ➥ A and B only
ii ➥ A and C only
iii ➥ A, B and C
iv ➥ B and C only
Answer: III

Explanation:
Given,
(X,* ) be a semi-group.
for every a and b in X, if a ≠ b, then a*b ≠ b*a.

Concept,
Semi Group(X,* ) have 2 properties, which are:
1) Closure Property
if a and b in X, then a*b∈X

2) Associative Property
if a,b and c in X, then
(a*b)*c = a*(b*c)

Let’s solve,
A) For every a in X, a*a = a

Lets assume a*a ≠ a

Lets suppose a*a = b, where a ≠ b
⟹ a*(a*a) = a*b
⟹ (a*a)*a = a*b { by associative property, a*(b*c) = (a*b)*c}
⟹ b*a = a*b { we suppose a*a = b}

Since it is given, for every a and b in X, if a ≠ b, then a*b ≠ b*a, but here a*b = b*a, which proves that our initial assumption is wrong.
Hence, For every a in X, a*a = a (Correct)

B) For every a, b in X, a*b *a= a

Lets assume a*b*a ≠ a

Lets suppose a*b*a = b, where a ≠ b

it is given, a*b ≠ b*a, and we already suppose a*b*a = b. Now put b = a*b*a in a*b ≠ b*a
⟹ a*(a*b*a) ≠ (a*b*a)*a
⟹ (a*a)*b*a ≠ a*b*(a*a) { by associative property, a*(b*c) = (a*b)*c}
⟹ a*b*a ≠ a*b*a { it is given in A, a*a = a and we already proved that this is correct}

Here, a*b*a ≠ a*b*a but it is actually equal, which proves that our initial assumption is wrong.
Hence, For every a, b in X, a*b *a= a (Correct)

C) For every a, b, c in X, a*b *c= a*c

Lets assume a*b*c ≠ a*c

Lets suppose a*b*c = a, and a*c=b where a ≠ b

it is given, a*b ≠ b*a, and we already suppose a*b*c = a and a*c=b . Now put a= a*b*c and b = a*c in a*b ≠ b*a
⟹ (a*b*c)*(a*c) ≠ (a*c)*(a*b*c)
⟹ a*b*(c*a*c) ≠ (a*c*a)*b*c { by associative property, a*(b*c) = (a*b)*c}
⟹ a*b*c ≠ a*b*c { it is given in B, a*b *a= a and we already proved that this is correct. Like statement B, we can write c*a*c=c and a*c*a=a }

Here, a*b*c ≠ a*b*c but it is actually equal, which proves that our initial assumption is wrong.
Hence, For every a, b in X, a*b *a= a (Correct)

Therefore, Option(III) is correct.
[Easy Solution]Explanation On YouTubeDiscrete MathHelp-Line

Q14➡ | Database Management System
A company is consuming parts in the manufacturing of other products. Each of the part is either manufactured within the company or purchased from the external suppliers or both. For each part, part_number, part_name is maintained. Attribute batch_number is maintained if the consumed part is manufactured in the company. If part is purchased from external supplier, then supplier name is maintained. Which of the following constraints need to be considered when modelling class/subclass concepts in ERD for the given problem.
i ➥ Disjoint constraint only
ii ➥ Partial participation and disjoint constraints
iii ➥ Partial participation
iv ➥ Total specialization and overlapping constraints

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q15➡ | Software Engineering
Given below are two statements
Statement I:
Cleanroom software process model incorporates the statistical quality certification of code increments as they accumulate into a system.
Statement II:
Cleanroom software engineering follows the classic analysis, design, code, test, and debug cycle to software development and focussing on defect removal rather than defect prevention.
In light of the above statements, choose the correct answer from the options given below Options:-
i ➥ Both Statement I and Statement II are false
ii ➥ Both Statement I and Statement II are true
iii ➥ Statement I is false but Statement II is true
iv ➥ Statement I is true but Statement II is false

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More DiscussionExplanation On YouTubeCleanroomHelp-Line

Q16➡ | Artificial Intelligence
Which agent deals with the happy and unhappy state?
i ➥ Goal-based Agent
ii ➥ Learning Agent
iii ➥ Model-based agent
iv ➥ Utility-based agent
Answer: IV
Explanation:
An agent is anything that can be viewed as perceiving its environment through sensors and sensor acting upon that environment from actuators.
All intelligent systems have four basic kinds of agent programs that represent the principles:
• Simple reflex agents;
• Model-based reflex agents;
• Goal-based agents; and
• Utility-based agents.




More DiscussionExplanation On YouTubeUtility-based agentHelp-Line

Q17➡ | Discrete Mathematics
How many ways are there to assign 5 different jobs to 4 different employees if every employee is assigned at least 1 job?
i ➥ 1024
ii ➥ 20
iii ➥ 240
iv ➥ 625
Answer: III

Explanation:
Given,
5 different jobs and 4 different employees
every employee is assigned at least 1 job


Let’s solve,
Lets take 4 employees as A,B,C,D

  How many ways are there to assign 5 different jobs to 4 different employees if every employee is assigned at least 1 job?

Total ways = 60 + 60 + 60 + 60 = 240 ways

Therefore, Option(III) is correct.
[Easy Solution]Explanation On YouTubeDiscrete MathHelp-Line

Q18➡ | Software Engineering
The V components in MVC are responsible for:
i ➥ Business logic and domain objects.
ii ➥ Security of the system.
iii ➥ Translating between user interface actions/events and operations on the domain objects.
iv ➥ User interface.

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q19➡ | Computer Graphics
Given below are two statements
Statement I:
The maximum number of sides that a triangle might have when clipped to a rectangular viewport is 6.
Statement II:
In 3D graphics, the perspective transformation is nonlinear in z.
In light of the above statements, choose the correct answer from the options given below Options:-
i ➥ Both Statement I and Statement II are false
ii ➥ Both Statement I and Statement II are true.
iii ➥ Statement I is false but Statement II is true.
iv ➥ Statement I is true but Statement II is false.

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q20➡ | Artificial Intelligence
Consider the sentence below.
There is a country that borders both India and Pakistan.
Which of the following logical expressions express the above sentence correctly when the predicate Country(x)
represents that x is a country and Borders(x, y) represents that the countries x and y share the border?
i ➥ [∃c Country(c)] ⇒ [Border (c, India) ∧ Border (c,Pakistan)]
ii ➥ ∃c Border (Country(c), India ∧ Pakistan)
iii ➥ ∃c Country(c) ∧ Border (c, India) ∧ Border (c,Pakistan)
iv ➥ ∃c Country(c) ⇒ [Border (c, India) ∧ Border (c,Pakistan)]

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTubePropositional logicHelp-Line

Q21➡ | Programming in JAVA
Consider the following recursive function F() in Java that takes an integer value and returns a string value:
i ➥ -1-145-2-245
ii ➥ -2-25-1-3-135
iii ➥ -2-25-3-1-135
iv ➥ -2-25-3-135

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q22➡ | Software Engineering
If every requirement stated in the Software Requirement Specification (SRS) has only one interpretation, then SRS is said to be
i ➥ consistent
ii ➥ correct
iii ➥ unambiguous
iv ➥ verifiable

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTubeSRSHelp-Line

Q23➡ | Computer Graphics
Suppose you have eight ‘black and white’ images taken with a 1-megapixel camera and one ‘8-color’ image taken by an 8-megapixel camera.
How much hard disk space in total do you need to store these images on your computer?
i ➥ 1 GB
ii ➥ 3 GB
iii ➥ 3 MB
iv ➥ 4 MB

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q24➡ | Database Management System
Given a fixed-length record file that is ordered on the key field. The file needs B disk blocks to store R number of records. Find the average access time needed to access any record of the given file using binary search.
i ➥ B/2
ii ➥ log2 B
iii ➥ B+R
iv ➥ B

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q25➡ | Software Engineering
In the context of Software Configuration Management (SCM), what kind of files should be committed to your source control repository?
A. Code files
B. Documentation files
C. Output files
D. Automatically generated files that are required for your system to be used.
Choose the correct answer from the options given below:
i ➥ A and B only
ii ➥ B and C only
iii ➥ C and D only
iv ➥ D and A only

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q26➡ | Digital Logic Design
The Octal equivalent of hexadecimal (D.C)16 is:
i ➥ (15.3)8
ii ➥ (15.6)8
iii ➥ (61.3)8
iv ➥ (61.6)8

Show Answer With Best Explanation

Answer: II
Explanation:
Given,
(D.C)16
Calculation,
To obtain octal equivalent for a given number , first convert into base 2 representation and then make a group of 3 bits.
why 3 bits? Because octal representation have base 8 and log28 = 3bits.
(D)16 = (13)10 = (1101)2
(C)16 = (12)10 = (1100)2
(D.C)16 = (1101.1100)2
make a pair of 3 bits
(D.C)16 = (001 101.110 000)2 = (15.60)8 = (15.6)8
So, Option(II) is correct.

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q27➡ | Artificial Intelligence
Which among the following statement(s) is(are) FALSE?
A. Greedy best-first search is not optimal but is often efficient.
B. A* is complete and optimal provided h(n) is admissible or consistent.
C. Recursive best-first search is efficient in terms of time complexity but poor in terms of space complexity.
D. h(n) = 0 is an admissible heuristic for the 8-puzzle.
i ➥ A and D only
ii ➥ A only
iii ➥ C and D only
iv ➥ C only
Answer – IV

Explanation:

So correct option is (IV).
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q28➡ | Database Management System
The order of a leaf node in a B+ tree is the maximum number of (value, data record pointer) pairs it can hold. Given that the block size is 1K bytes, data record pointer is 7 bytes long, the value field is 9 bytes long and a block pointer is 6 bytes long, what is the order of the leaf node?
i ➥ 63
ii ➥ 64
iii ➥ 67
iv ➥ 68

Show Answer With Best Explanation

Answer: I
Explanation:
Given,
Block size = 1KByte = 1024 Byte
Record Pointer = 7 Byte
Key Size = 9 Byte
Block pointer = 6 Byte

Ask,
Order of leaf node =?
Formula,
n*(Key size + Record Pointer) + Block Pointer <= Block size
Calculation,
=> n*(9+7) + 6 <= 1024 Byte
=> 16n <= 1018
=> n <= 1018/16
=> n <= 63.625
=> n = 63
So,Option(I) is correct.

More Discussion Explanation On YouTubeLearn Topic WiseHelp-Line

Q29➡ | Computer Graphics
Suppose a Bezier curve P(t) is defined by the Following four control points in the xy-plane:
P0=(-2, 0); P1=(-2,4);P2=(2,4); and P3=(2,0). Then which of the following statement are correct ?
A. Bezier curve P(t) has degree 3.
B.
B. bezier curve P(t) may extend outside the convex full of its control points.
Choose the correct answer from the options below:
i ➥ A and B only
ii ➥ A and C only
iii ➥ A, B, and C
iv ➥ B and C only

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q30➡ | Programming in C
What does the following function f() in ‘C’ return?
int f(unsigned int N)
{
unsigned int counter = 0;
while(N > 0)
{
counter += N & 1; N = N >> 1;
}
return counter == 1;}
i ➥ 1 if N is a power of 2, otherwise 0
ii ➥ 1 if N is odd, otherwise 0
iii ➥ 1 if the binary representation of N has any 1’s, otherwise 0
iv ➥ 1 if the binary representation of N is all 1’s, otherwise 0

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q31➡ | Computer Architecture
Given below are three statements related to interrupt handling mechanism
A. Interrupt handler routine is not stored at a fixed address in the memory.
B. CPU hardware has a dedicated wire called the interrupt request line used for handling interrupts
C. Interrupt vector contains the memory addresses for speciaized interrupt handlers.
In the context of above statements, choose the correct answer from the options given below: Options:-
i ➥ A is TRUE only
ii ➥ Both A and B are TRUE only
iii ➥ Both A, C are TRUE only
iv ➥ Both B and C are TRUE only

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q32➡ | Theory of Computation
L1 = { 0n1n0m | n>=1, m>=1 }
L2 = { 0n1m0m | n>=1, m>=1 }
L3 = { 0n1n0n | n>=1}
Which of the following are correct statements?
A. L3 =L1 ∩ L2
B. L1 and L2 are context free languages but L3 is not a context free language
C. L1 and L2 are not context free languages but L3 is a context free language
D. L1 is a subset of L3
Choose the correct answer from the options given below:
i ➥ A and C only
ii ➥ A and D only
iii ➥ A only
iv ➥ A and B only

Show Answer With Best Explanation

Answer: IV
Explanation:
Statement A: L3 =L1 ∩ L2
L1 = { 0n1n0m | n>=1, m>=1 }
= {010, 0100, 00110, 001100……………………}
L2 = { 0n1m0m | n>=1, m>=1 }
= {010, 0010, 01100, 001100…………………. }
L3 =L1 ∩ L2
= {010, 001100, 000111000…………………….}
= {0n1n0n | n>=1}
Statement A is correct.
Statement B: L1 and L2 are context free languages but L3 is not a context free language
L1 = { 0n1n0m | n>=1, m>=1 }
let’s draw push down automata for above language:
L1 = { 0n1n0m | n>=1, m>=1 }”><br>Language L<sub>1</sub> is Context Free Language.<br><br><strong><strong>L<sub>2</sub> </strong></strong>= { 0<sup>n</sup>1<sup>m</sup>0<sup>m</sup> | n>=1, m>=1 }<br>let’s draw push down automata for above language:<br><img loading==1, m>=1 }”>
Language L2 is Context Free Language.

L3 = { 0n1n0n | n>=1}
Here, n times 0 followed by n times 1 followed by n times 0, this kind of comparison cannot be done by Push Down Automata. So, it is not Context Free Language. It is Context Sensitive Language.
Statement B is correct.

Statement C: L1 and L2 are not context free languages but L3 is a context free language
As statement B is correct, Statement C is obviously incorrect.

Statement D: L1 is a subset of L3
L1 = { 0n1n0m | n>=1, m>=1 }
= {010, 0100, 00110, 001100……………………}
L3 ={ 0n1n0n | n>=1}
= {010, 001100, 000111000…………………….}
As see, L1 is superset L3
Statement D is incorrect.
So, Option(IV) is correct.

More Discussion Explanation On YouTubeLearn Topic WiseHelp-Line

Q33➡ | Linear Programming Problem
Consider the following linear optimization problem: Maximize Z = 6x+5y
Subject to 2x – 3y <= 5
x+3y <= 11 4x + y <=15
and x>=0, y >= 0.

The optimal solution of the problem is:
i ➥ 15
ii ➥ 25
iii ➥ 31.72
iv ➥ 41.44

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q34➡ | Discrete Mathematics
Which of the following Graphs is (are) planar?

choose the correct answer from the options given below:
i ➥ A and B only
ii ➥ A only
iii ➥ B and C only
iv ➥ B only
Answer: II
More DiscussionExplanation On YouTubePage FaultHelp-Line

Q35➡ | Programming
Match List I with List II

Choose the correct answer from the options given below:
i ➥ A – II, B – III, C – I, D – IV
ii ➥ A – III, B – IV, C – I, D – II
iii ➥ A – IV, B – III, C – I, D – II
iv ➥ A – IV, B – III, C – II, D – I

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q36➡ | Software Engineering
In software testing, beta testing is the testing performed by ______.
i ➥ potential customers at the developer’s location
ii ➥ potential customers at their own locations
iii ➥ product developers at the customer’s location
iv ➥ product developers at their own locations

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q37➡ | Software Engineering
A system has 99.99% uptime and has a mean-time-between-failure of 1 day. How fast does the system repair itself in order to reach this availability goal?
i ➥ 10 seconds
ii ➥ 11 seconds
iii ➥ 12 seconds
iv ➥ 9 seconds

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q38➡ | Artificial Intelligence
Given below are two statements
Statement I:
Breadth-First Search is optimal when all the step costs are equal whereas uniform-cost se optimal with any step-cost.
Statement II:
When all the step costs are same uniform-cost search expends more nodes at depth d the Breadth-First Search.
In light of the above statements, choose the correct answer from the options given below
i ➥ Both Statement I and Statement II are false
ii ➥ Both Statement I and Statement II are true
iii ➥ Statement I is false but Statement II is true
iv ➥ Statement I is true but Statement II is false
Answer: II
Explanation :

So correct option (II).
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q39➡ |
Which of the statements given below is/are correct?
It is always important and useful to include an ‘alt’ attribute on ‘img’ tag in HTML because
A. users who cannot see the image due to vision impairment can have a textual description of the image (which can be spoken aloud by a screen reader).
B. If the image fails to load (slow connection, broken path, etc.) then alt text is displayed instead.
C. SEO (Search Engine Optimization) benefits.
Choose the correct answer from the options given below:
i ➥ A only
ii ➥ A, B, and C
iii ➥ B and C only
iv ➥ C only

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q40➡ | Java
Match List I with List II

Choose the correct answer from the options given below:
i ➥ A – I, B – III, C – IV, D – II
ii ➥ A – II , B – III, C – IV, D – I
iii ➥ A – II, B – IV, C – III, D – I
iv ➥ A – III, B – II, C – IV, D – I

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q41➡ | Computer Architecture
Which of the following statement is true?
A. Control memory is part of the hardwired control unit.
B. Program control instructions are used to alter the sequential flow of the program.
C. The register indirect addressing mode for accessing memory operand is similar to displacement addressing mode.
D. CPU utilization is not affected by the introduction of Interrupts.
i ➥ A
ii ➥ B
iii ➥ C
iv ➥ D

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q42➡ | Linear Programming Problem
A company stores products in a warehouse. Storage bins in this warehouse are specified by their aisle, location in the aisle, and self. There are 50 aisles, 85 horizontal locations in each aisle, and 5 shelves throughout the warehouse. What is the least number of products the company can have so that at least two products must be stored in the same bin?
i ➥ 21251
ii ➥ 251
iii ➥ 4251
iv ➥ 426

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q43➡ | Data Structure
A hash function h defined as h(key)=key mod 7, with linear probing, is used to insert the keys 44, 45, 79, 55, 91, 18, 63 into a table indexed from 0 to 6. What will be the location of key 18?
i ➥ 3
ii ➥ 4
iii ➥ 5
iv ➥ 6

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q44➡ | Theory of Computation
Any string of terminals that can generated by the following context free grammar (where S is start non-terminal symbol)

S→XY
X→0X|1X|0
Y→Y0|Y1|0
i ➥ has at least one 1
ii ➥ has no consecutive 0’s or 1’s
iii ➥ should end with 0
iv ➥ has at least two 0’s

Show Answer With Best Explanation

Answer: IV
Explanation:
S-> XY
->0XY | 1XY | 0Y
->0XY0 | 0XY1 | 0X0 | 1XY0 | 1X0 | 0Y0 | 0Y1 | 00
->0XY0 | 0XY1 | 000 | 1XY0 | 100 | 000 | 001 | 00

Option(i): has at least one 1
This is incorrect, because one of the string of above language is 00 which don’t contain 1.

Option(ii): has no consecutive 0’s or 1’s
This is incorrect, because one of the string of above language is 100 which has consecutive 0’s.

Option(iii): should end with 0
This is incorrect, because one of the string of above language is 001 which ends with 1.

Option(iv): has at least two 0’s
This is correct. Because X and Y always end with 0, so string has atleast two 0’s.

More Discussion Explanation On YouTubeLearn Topic WiseHelp-Line

Q45➡ | Discrete Mathematics
which of the following are logically equivalent ?
A. ¬p→(q→r)and q→(p∨r)
B. (p→q)→r and p→(q→r)
C. (p→q)→(r→s) and (p→r)→(q→s)

Choose the correct answer from the options below:
i ➥ A and B only
ii ➥ A and C only
iii ➥ A only
iv ➥ B and C only

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q46➡ | Theory of Computation
Match List I with List II

Choose the correct answer from the options below:
i ➥ A – III, B -I , C – IV, D – II
ii ➥ A – III, B -II , C – I, D – IV
iii ➥ A – III, B -IV, C – I, D – II
iv ➥ A – IV, B -III , C – I, D – II

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q47➡ | Theory of Computation
What is the minimum number of states required to the finite automaton equivalent to the transition diagram given below?
i ➥ 3
ii ➥ 4
iii ➥ 5
iv ➥ 6
Answer: III
Click below to see detailed Solution
[Easy Solution]Explanation On YouTubePage FaultHelp-Line

Q48➡ | Discrete Mathematics
For which value of n is Wheel graph Wn regular?
i ➥ 2
ii ➥ 3
iii ➥ 4
iv ➥ 5

Show Answer With Best Explanation

Answer: II,III
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q49➡ | Database Management System
Given the following STUDENT-COURSE scheme: STUDENT (Rollno, Name, Courseno) COURSE (Courseno, Coursename, Capacity), where Rollno is the primary key of relation STUDENT and Courseno is the primary key of relation COURSE. Attribute Coursename of COURSE takes unique values only. The number of records in COURSE and STUDENT tables are 3 and 5 respectively. Following relational algebra query is executed: R=STUDENT X COURSE

Match List I with List II in context to the above problem statement.

Choose the correct answer from the options given below:
i ➥ A -I , B -III , C -IV , D – II
ii ➥ A -I , B -III , C -IV , D – II
iii ➥ A -I , B -III, C -II , D – IV
iv ➥ A -III , B -I , C -IV , D – II

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q50➡ | Artificial Intelligence
Consider the given tree below. Calculate the value at the root of the tree using alpha-beta pruning algorithm.
i ➥ 3
ii ➥ 5
iii ➥ 6
iv ➥ 9

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

Answer : II
Explanation:
Alpha Beta Pruning
Alpha Beta Pruning is a method which is used to optimizes the Minimax algorithm.
Alpha-beta pruning works with depth-first search up to a stated depth limit. Search tree is searched through from left to right. Like in minimax search,
in the minimum nodes the minimum is generated from the minimum value of the successor nodes and in the maximum nodes similarly the maximum.
At every leaf node the evaluation is calculated.
For every maximum node the current largest child value is saved in α.
For every minimum node the current smallest child value is saved in β.

So the correct option is (II).
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q51➡ | Theory of Computation
Given below are two statements
Statement I:
The family of context free languages is closed under homomorphism
Statement II:
The family of context free languages is closed under reversal.
In light of the above statements, choose the correct answer from the options given below
i ➥ Both Statement I and Statement II are false
ii ➥ Both Statement I and Statement II are true
iii ➥ Statement I is false but Statement II is true
iv ➥ Statement I is true but Statement II is false

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q52➡ | Data Structure
A double-ended queue (dequeue) supports adding and removing items from both the ends of the queue. The operations supported by dequeue are AddFront(adding item to front of the queue), AddRear(adding item to the rear of the queue), RemoveFront(removing item from the front of the queue), and RemoveRear(removing item from the rear of the queue). You are given only stacks to implement this data structure. You can implement only push and pop operations. What’s the time complexity of performing AddFront() and AddRear() assuming m is the size of the stack and n is the number of elements?
i ➥ O(1) and O(n)
ii ➥ O(m) and O(n)
iii ➥ O(n) and O(1)
iv ➥ O(n) and O(m)

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q53➡ | Database Management System
Given a relation scheme R(x,y,z,w) with functional dependencies set F={x→y, z→w}. All attributes take single and atomic values only.
A. Relation R is in First Normal FORM
B. Relation R is in Second Normal FORM
C. Primary key of R is xz
Choose the correct answer from the options given below:
i ➥ A and C only
ii ➥ B and C only
iii ➥ B only
iv ➥ C only

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q54➡ | Computer Network
In Ethernet when Manchester coding is used, the bit rate is ______.
i ➥ Half the baud rate
ii ➥ Same as the baud rate
iii ➥ Thrice the baud rate
iv ➥ twice the baud rate

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q55➡ | Database Management System
Which of the following is used to create a database schema?
i ➥ DDL
ii ➥ DML
iii ➥ HTML
iv ➥ XML

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q56➡ | Computer Graphics
Which of the statements given below are correct?
The midpoint (or Bresenham) algorithm for rasterizing lines is optimized relative to DDA algorithm in that
A. it avoids round-off operations.
B. it is incremental.
C. it uses only integer arithmetic.
D. all straight lines can be displayed as straight (exact).
Choose the correct answer from the options given below:
i ➥ A and B only
ii ➥ A and C only
iii ➥ A, B, and C only
iv ➥ A, B, C, and D

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q57➡ | Data Structure
A data structure is required for storing a set of integers such that each of the following operations can be done in O(log n) time, where n is the number of elements in the set.
∎ Deletion of the smallest element
∎ Insertion of an element if it is not already present in the set
Which of the following data structures can be used for this purpose?
i ➥ A balanced binary search tree can be used but not a heap.
ii ➥ A heap can be used but not a balanced binary search tree.
iii ➥ Both balanced binary search tree and heap can be used.
iv ➥ Neither balanced binary search tree nor heap can be used.

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q58➡ | Operating System
Match List I with List II

Choose the correct answer from the options given below:
i ➥ A – II , B – III , C – IV , D – I
ii ➥ A – IV , B – I , C – II , D – III
iii ➥ A – IV , B – III , C – I , D – II
iv ➥ A – IV , B – III , C – II, D – I

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q59➡ | Theory of Computation
Find the regular expression for the language accepted by the automata given below.
i ➥ (a+b)ab(ab+bb+ aa*(a+b)ab)*
ii ➥ (aa*(a+b)ab)*
iii ➥ a*(a+b)ab(ab+bb+ aa*(a+b)ab)*
iv ➥ a*ab(ab+bb+ aa*(a+b)ab)*

Show Answer With Best Explanation

Answer: (Marks to all from UGC NET )
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q60➡ | Discrete Mathematics
Let us assume a person climbing the stairs can take one stair or two stairs at a time.
How many ways can this person climb a flight of eight stairs?
i ➥ 21
ii ➥ 24
iii ➥ 31
iv ➥ 34

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q61➡ | Data Structure
Consider the following graph.

Among the following sequences
I. a b e g h f
II. a b f e h g
III. a b f h g e
IV. a f g h b e

Which are depth first traversals of the above graph?
i ➥ I and IV only
ii ➥ I, II, and IV only
iii ➥ I, III, and IV only
iv ➥ II, III, and IV only

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q62➡ | Software Engineering
Match List I with List II

Choose the correct answer from the options given below:
i ➥ A – I, B – IV, C – II, D – III
ii ➥ A – II, B – III, C – I, D – IV
iii ➥ A – IV, B – I, C – II, D – III
iv ➥ A – IV, B – I, C – III, D – II

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q63➡ | Software Engineering
In software engineering, what kind of notation do formal methods predominantly use?
i ➥ computer code
ii ➥ diagrammatic
iii ➥ mathematical
iv ➥ textual

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q64➡ | Data Structure
Which of these statements about the floor and ceiling functions are correct
Statement I: ⌊2x= x+x+(1/2) for all real number x
Statement I: x+y= x+ y for all real number x and y
i ➥ Both Statement I and Statement II are false
ii ➥ Both Statement I and Statement II are true
iii ➥ Statement I is false but Statement II is true
iv ➥ Statement I is true but Statement II is false

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q65➡ | Database Management System
Consider following two statements:
Statement I: Relational database schema represents the logical design of the database.
Statement II: Current snapshot of a relation only provides the degree of the relation.
In the context to the above statements, choose the correct option from the options given below:
i ➥ Both Statement I and Statement II are FALSE
ii ➥ Both Statement I and Statement II are TRUE
iii ➥ Statement I is FALSE but Statement II is TRUE
iv ➥ Statement I is TRUE but Statement II is FALSE

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q66➡ | Algorithms
Which of the given options provides the increasing order of asymptotic complexity of functions f1, f2, f3 and f4?
A. f1(n) = 2n
B. f2(n) = n3/2
C. f3(n) = n log n
D. f4(n) = nlog n

Choose the correct answer from the options given below Options:-
i ➥ B, C, A, D
ii ➥ B, C, D, A
iii ➥ C, B, A, D
iv ➥ C, B, D, A

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

UGC-NET December 2020 and June 2021 computer Science and application solutions


Q67➡ | Database Management System
Suppose a B+ tree is used for indexing a database file.
Consider the following information:
size of the search key field= 10 bytes,
block size = 1024 bytes,
size of the record pointer= 9 bytes,
size of the block pointer= 8 bytes.
Let K be the order of internal node and L be the order of leaf node of B+ tree, then (K, L)=_____,
i ➥ (34, 31)
ii ➥ (50, 52)
iii ➥ (57, 53)
iv ➥ (60, 64)

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q68➡ | Computer Network
Given below are two statements
Statement I: Telnet, Ftp, Http are application layer protocol
Statement II: The Iridium project was planned to launch 66 low orbit satellites.
In light of the above statements, choose the correct answer from the options given below.
i ➥ Both Statement I and Statement II are false
ii ➥ Both Statement I and Statement II are true
iii ➥ Statement I is false but Statement II is true
iv ➥ Statement I is true but Statement II is false

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q69➡ | Operating System
Consider the following 3 processes with the length of the CPU burst time given in milliseconds:

What is the average waiting time for these processes if they are scheduled using preemptive shortest job first scheduling algorithm?
i ➥ 2.66
ii ➥ 4.66
iii ➥ 5.5
iv ➥ 6
Answer: II
Click below to see detailed Solution
[Easy Solution]Explanation On YouTubeCPU SchedulingHelp-Line

Q70➡ | Data Structure
The postfix form of the expression (A + B) * (C * D – E) * F / G is _____ .
i ➥ A B + C D * E – * F * G /
ii ➥ A B + C D * E – F * * G /
iii ➥ A B + C D * E – F G / * *
iv ➥ A B + C D E * – * F * G /

Show Answer With Best Explanation

Answer: I
Explanation:
The infix expression form : operand1 operator operand2
The reverse Polish notation form: operand1 operand2 operator
Order of precedence:
The postfix form of the expression (A + B) * (C * D - E) * F / G
= (A + B) * (C * D – E) * F / G
= [A*{B+C*(D+E)}] / {F*(G+H)}
= (A+B) * (C * D – E) * F / G
= AB+ * (C * D – E) * F / G
= AB+ * (CD* E) * F / G
= AB+ * CD*E– * F / G
= (AB+ CD*E – *) * F / G
= AB+ CD*E – * F * / G
= A B + C D * E – * F * G /
Note: Here blue is used to highlight operands and Orange is used to highlight operator that need to be evaluated first.
So, Option(I) is correct.

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line


Q71➡ | Software Engineering
Identify the correct order of the following five levels of Capability Maturity Model (from lower to higher) to measure the maturity of an organization’s software process.
A. Defined
B. Optimizing
C. Initial
D. Managed
E. Repeatable
Choose the correct answer from the options given below
i ➥ C, A, E, D, B
ii ➥ C, B, D, E, A
iii ➥ C, E, A, B, D
iv ➥ C, E, A, D, B

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q72➡ | Data Structure
Which of the following concepts can be used to identify loops?
A. Depth first ordering
B. Dominators
C. Reducible graphs
Choose the correct answer from the options given below:
i ➥ A and B only
ii ➥ A and C only
iii ➥ A, B and C
iv ➥ B and C only

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q73➡ | Data Structure
Given below are two statements
Statement I: In an undirected graph, number of odd degree vertices is even.
Statement II: In an undirected graph, sum of degrees of all vertices is even.
In light of the above statements, choose the correct answer from the options given below.
i ➥ Both Statement I and Statement II are false.
ii ➥ Both Statement I and Statement II are true.
iii ➥ Statement I is false but Statement II is true.
iv ➥ Statement I is true but Statement II is false.

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q74➡ | Digital Logic Design
Match List I with List II

Choose the correct answer from the options given below:
i ➥ A – I, B -III , C – IV, D – II
ii ➥ A – III, B -I , C – II, D – IV
iii ➥ A – III, B -I , C – IV, D – II
iv ➥ A – III, B -IV , C – I, D – II

Show Answer With Best Explanation

Answer: III
Explanation:
Some Boolean algebra laws:
i) Identity Law
x + 0 = x , x .1 = x
ii) Absorption Law
x + xy = x , x.(x + y) = x
iii) Idempotent Law
x + x = x , x . x = x
iv) Domination Law
x + 1 = 1 , x . 0 = 0
v) Commutative Law
x + y = y + x , x . y = y . x
vi) Associative Law
x + (y + z) = (x + y) + z , x .(y . z) = (x . y). z
vii) Distributive Law
x.(y + z) = x.y + x.z , x + (y.z) = (x + y).(x + z)
viii) Complementation Law
x + x’ = 1 , x . x’ = 0
ix) DeMorgan’s Law
(x . y)’ = x’ + y’ , (x + y)’ = x’ . y’

So, Option(III) is correct.

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q75➡ | Computer Network
Match List I with List II

Choose the correct answer from the options given below:
i ➥ A – II, B – III, C – I, D – IV
ii ➥ A – IV, B – I, C – III, D – II
iii ➥ A – IV, B – II, C – I, D – III
iv ➥ A – IV, B – III, C – I, D – II

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q76➡ | Operating System
Comprehension: Q76 to Q80
Read the following and answer the questions:
Consider a machine with 16 GB main memory and 32-bits virtual address space, with page size as 4KB. Frame size and page size is same for the given machine.
If a process of size 34KB is to be executed on this machine, then what will be the size of internal fragmentation for this process?
i ➥ 1KB
ii ➥ 2KB
iii ➥ 4KB
iv ➥ Zero
Answer: II
Click below to see detailed Solution
[Easy Solution]Explanation On YouTubeMemory ManagementHelp-Line

Q77➡ | Operating System
Comprehension: Q76 to Q80
Read the following and answer the questions:
Consider a machine with 16 GB main memory and 32-bits virtual address space, with page size as 4KB. Frame size and page size is same for the given machine.
What is the size of page table for handling the given virtual address space, given that each page table entry is of size 2 bytes?
i ➥ 12KB
ii ➥ 2KB
iii ➥ 2MB
iv ➥ 32MB
Answer: III
Click below to see detailed Solution
[Easy Solution]Explanation On YouTubeMemory ManagementHelp-Line

Q78➡ | Operating System
Comprehension: Q76 to Q80
Read the following and answer the questions:
Consider a machine with 16 GB main memory and 32-bits virtual address space, with page size as 4KB. Frame size and page size is same for the given machine.
What is the minimum number of bits needed for the physical address?
i ➥ 12
ii ➥ 24
iii ➥ 28
iv ➥ 34
Answer: IV
Click below to see detailed Solution
[Easy Solution]Explanation On YouTubeCPU SchedulingHelp-Line

Q79➡ | Operating System
Comprehension: Q76 to Q80
Read the following and answer the questions:
Consider a machine with 16 GB main memory and 32-bits virtual address space, with page size as 4KB. Frame size and page size is same for the given machine.
The number of bits reserved for the frame offset is __________
i ➥ 12
ii ➥ 14
iii ➥ 32
iv ➥ 8
Answer: I
Click below to see detailed Easy Solution
[Easy Solution]Explanation On YouTubeCPU SchedulingHelp-Line

Q80➡ | Operating System
Comprehension: Q76 to Q80
Read the following and answer the questions:
Consider a machine with 16 GB main memory and 32-bits virtual address space, with page size as 4KB. Frame size and page size is same for the given machine.
Find number of pages required for the given virtual address space.
i ➥ 210
ii ➥ 212
iii ➥ 220
iv ➥ 230
Answer: III
Click below to see detailed Easy Solution
[Easy Solution]Explanation On YouTubeCPU SchedulingHelp-Line

Q81➡ | Computer Architecture
Which of the following is not an example of pseudo-instruction?
i ➥ DEC
ii ➥ END
iii ➥ HLT
iv ➥ ORG

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q82➡ | Computer Network
Which of the following statement is False?
i ➥ Packet switching can lead to reordering unlike circuit switching.
ii ➥ Packet switching leads to better utilization of bandwidth resources than circuit switching.
iii ➥ Packet switching results in less variation in the delay than circuit switching.
iv ➥ Packet switching sender and receiver can use any bit rate, format or framing method unlike circuit switching.

Show Answer With Best Explanation

Answer: III, IV
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q83➡ | Digital Logic Design
Match List I with List II

Choose the correct answer from the options given below:
i ➥ A – I, B – II, C – III, D – IV
ii ➥ A – I, B – III, C – II, D – IV
iii ➥ A – II, B – I, C – IV, D – III
iv ➥ A – IV, B – II, C – III, D – I

Show Answer With Best Explanation

Answer: III
Explanation:
ODD Function: X-OR is an ODD Function Because it gives High output for Odd number of High inputs.
Le us check for two input A and B
Logical equation of X-OR gate.
Y = AMatch List I with List IIB = AB’ + A’B
Match List I with List II List List II A.ODD function I. NAND gate B. universal gate II. XOR gate C. 2421 code III. Amplification D. Buffer IV. Self complementing
Universal Gate: The NAND Gate and NOR Gate are said to be Universal Gate because any Logic circuit can be implemented with it.
Self Complementing Code: In Self Complementing code, the code of a digit and the code of 9’s complement of the digit are 1’s complement to each other.
2421 code
let’s take decimal number 2,
9’s complement of the digit 2 = 7
the 2421 code of a digit 2 = 0010 ………….Code(1)
the 2421 code of a digit 7 = 1101 ………….Code(2)
Code (1) and code(2) are 1’s complement to each other. That’s why 2421 code is self complement code.
Buffer: Amplification
So, Option(III) is correct.

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q84➡ | Digital Logic Design
The characteristics of the combinational circuits are:
A. Output at any time is function of inputs at that time
B. Contains memory elements
C. Do not have feedback paths
D. Clock is used to trigger the circuits to obtain outputs
Choose the correct answer from the options given below:
i ➥ A and B only
ii ➥ A and C only
iii ➥ B and C only
iv ➥ B and D only

Show Answer With Best Explanation

Answer: II
Explanation:
Combinational Circuits
• Combinational circuits are defined as time independent circuits which do not depends upon previous inputs to generate any output.
• Output depends upon only present input.
• As combinational circuit don’t have clock, they don’t require triggering.
The characteristics of the combinational circuits are: A. Output at any time is function of inputs at that time B. Contains memory elements C. Do not have feedback paths D. Clock is used to trigger the circuits to obtain outputs
A. Output at any time is function of inputs at that time. (True)
Outputs depend on present inputs only.
B. Contains memory elements. (False)
• Combinational Circuits does not have any memory elements because it depends on present inputs only.
C. Do not have feedback paths. (True)
D. Clock is used to trigger the circuits to obtain outputs. (False)
So, Option(II) is correct.

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q85➡ | Computer Network
A message is encrypted using public key cryptography to send a message from sender to receiver. Which one of the following statements is True?
i ➥ Receiver decrypts using his own public key
ii ➥ Receiver decrypts using sender’s public key
iii ➥ Sender encrypts using his own public key
iv ➥ Sender encrypts using receiver’s public key

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q86➡ | Data Structure
The reverse Polish notation of the following infix expression [A*{B+C*(D+E)}] / {F*(G+H)} is ________.
i ➥ ABCDE*++*FGH+*/
ii ➥ ABCDE+**+FGH+*/
iii ➥ ABCDE+*+*FGH*+/
iv ➥ ABCDE+*+*FGH+*/

Show Answer With Best Explanation

Answer: IV
Explanation:
The infix expression form : operand1 operator operand2
The reverse Polish notation form: operand1 operand2 operator
Order of precedence:
The postfix form of the expression (A + B) * (C * D - E) * F / G
= [A*{B+C*(D+E)}] / {F*(G+H)}
= [A*{B+C*DE+}] / {F*(G+H)}
= [A*{B+CDE+*}] / {F*(G+H)}
= [A*BCDE+*+] / {F*(G+H)}
= [ABCDE+*+*] / {F*(G+H)}
= [ABCDE+*+*] / {F*GH+}
= [ABCDE+*+*] / {F*GH+}
= [ABCDE++] / {FGH+*}
= ABCDE+*+* FGH+*/
Note: Here blue is used to highlight operands and Orange is used to highlight operator that need to be evaluated first.
So, Option(IV) is correct.

More Discussion Explanation On YouTubeLearn Topic WiseHelp-Line

Q87➡ | Computer Architecture
Given below are two statements
Statement I: CISC computers have a large of number of addressing modes.
Statement II: In RISC machines memory access is limited to load and store instructions.
In light of the above statements, choose the correct answer from the options given below
i ➥ Both Statement I and Statement II are false
ii ➥ Both Statement I and Statement II are true
iii ➥ Statement I is false but Statement II is true
iv ➥ Statement I is true but Statement II is false

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q88➡ | Computer Architecture
The cache coherence problem can be solved
A. by having multiport memory
B. allow only nonshared data to be stored in cache
C. using a snoopy cache controller
D. using memory interleaving
Choose the correct answer from the options given below:
i ➥ A and C only
ii ➥ B and C only
iii ➥ B and D only
iv ➥ D and C only

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q89➡ | Computer Network
In electronic mail, which of the following protocols allows the transfer of multimedia?
i ➥ IMAP
ii ➥ MIME
iii ➥ POP3
iv ➥ SMTP

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q90➡ | Computer Network
Which of the following statements are true?
A. X.25 is connection-oriented network
B. X.25 doesn’t support switched virtual circuits.
C. Frame relay service provides acknowledgements.
D. Frame relay service provides detection of transmission errors.
Choose the correct answer from the options given below:
i ➥ A and D only
ii ➥ B and C only
iii ➥ B and D only
iv ➥ C and D only

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q91➡ | Computer Network
The address of class B host is to be split into subnets with 6-bit subnet number. What is the maximum number of subnets and the maximum number of hosts in each subnet?
i ➥ 62 subnets and 1022 hosts
ii ➥ 62 subnets and 262142 hosts
iii ➥ 64 subnets and 1024 hosts
iv ➥ 64 subnets and hosts 262142

Show Answer With Best Explanation

Answer: I
Explanation:
Class B : Out of 32 bits, Class B have
Network id = 16 bits and
Host id = 16 bits
Calculation
Given subnet bits = 6 bits
Maximum number of the subnets = 26 – 2 = 62
Note that 2 is substracted because
* all 0’s is used to represent Network and
* all 1’s is used to represent Broadcast Address of Network.
Maximum number of hosts in each subnet
Host id bits = 32 – (Network id bit + subnet id bits) = 32 – (16+ 6) = 10
Maximum number of hosts in each subnet = 210– 2 = 1022
Note that 2 is substracted because
* all 0’s is used to represent Subnet and
* all 1’s is used to represent Broadcast Address of Subnet.
So, Option(I) is correct.

More Discussion Explanation On YouTubeIP Address Help-Line

Q92➡ | Computer Architecture
Arrange the following in the increasing order of complexity.
A. I/O Module
B. I/O processor
C. I/O Channel
D. DMA
Choose the correct answer from the options given below Options:-
i ➥ A, B, C, D
ii ➥ A, D, C, B
iii ➥ C, D, A, B
iv ➥ D, C, B, A

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q93➡ | Computer Network
Which of the following statements are true?
A.Frequency division multiplexing technique can be handled by digital circuits.
B.Time division multiplexing technique can be handled by analog circuits
C. Wavelength division multiplexing technique is used with optical fiber for combining two signals.
D. Frequency division multiplexing technique can be applied when the bandwidth of a link is greater than the bandwidth of the signals to be transmitted.
Choose the correct answer from the options given below:
i ➥ A and D only
ii ➥ B and D only
iii ➥ B and D only
iv ➥ C and D only

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q94➡ | Digital Logic Design
A digital computer has a common bus system for 8 registers 16 bits each. How many multiplexers are required to implement common bus? What size of multiplexers is required?
i ➥ 16, 16×1
ii ➥ 16, 8×1
iii ➥ 8, 16×1
iv ➥ 8, 8×1

Show Answer With Best Explanation

Answer: II
Explanation:
Given,
Number of registers = 8
Number of bits in each register = 16bits
Formula,
Number of multiplexer in the bus = number of bits in each register
Size of multiplexer : number of register X 1
Calculation,
Number of multiplexer in the bus:
Number of Multiplexer = number of bits in each register
Here, number of bits in each register = 16
Therefore, Number of register = 16
Size of multiplexer:
Size of multiplexer : number of register X 1
Here, number of register = 8
Therefore, Size of multiplexer = 8×1
So, Option(II) is correct.

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q95➡ | Algorithms
Let G(x) be the generator polynomial used for CRC checking. The condition that should be satisfied by the G(x) to catch all errors consisting of an odd number of inverted bits is:
i ➥ (1-x2) is factor of G(x)
ii ➥ (x+1) is factor of G(x)
iii ➥ (x2+1) is factor of G(x)
iv ➥ (x-1) is factor of G(x)

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line


Q96➡ | Artificial Intelligence
Next five questions are based on the following passage.
Consider a domain consisting of three Boolean variables Toothache, Cavity, and Catch. The full joint distribution is a 2×2×2 table as shown in the figure below.

The probability of a toothache, given evidence of a cavity, P(toothache | cavity) is ____.
i ➥ 0.216
ii ➥ 0.280
iii ➥ 0.400
iv ➥ 0.600

Show Answer With Best Explanation

Answer: IV
Explanation:
Formula,
Conditional Probability
The probability of a toothache, given evidence of a cavity, P(toothache | cavity) is ____.
Calculation,
The probability of a toothache, given evidence of a cavity,
 The probability of a toothache, given evidence of a cavity, P(toothache | cavity) is ____.
The probability of a toothache, given evidence of a cavity, P(toothache | cavity) is ____.
P(toothache Ո cavity ) = 0.108 + 0.012 = 0.12

The probability of a toothache, given evidence of a cavity, P(toothache | cavity) is ____.
P(cavity ) = 0.108 + 0.012 + 0.072 + 0.008 = 0.2
 The probability of a toothache, given evidence of a cavity, P(toothache | cavity) is ____.
The probability of a toothache, given evidence of a cavity, P(toothache | cavity) is ____.
So,Option(IV) is correct.

More Discussion Explanation On YouTubeProbability Help-Line

Q97➡ | Artificial Intelligence
Next five questions are based on the following passage.
Consider a domain consisting of three Boolean variables Toothache, Cavity, and Catch. The full joint distribution is a 2×2×2 table as shown in the figure below.

P(cavity U toothache) is________________.
i ➥ 0.120
ii ➥ 0.200
iii ➥ 0.280
iv ➥ 0.600

Show Answer With Best Explanation

Answer: III
Explanation:
Formula,
P(A U B) = P(A) + P(B) – P(A Ո B)
Calculation,
P(cavity U toothache) = P(cavity) + P(toothache) – P(cavity Ո toothache)
The probability of a toothache, given evidence of a cavity, P(toothache | cavity) is ____.
P(cavity ) = 0.108 + 0.012 + 0.072 + 0.008 = 0.2

P(cavity U toothache) is________________.
P(toothache) = 0.108 + 0.012 + 0.016 + 0.064 = 0.2


P(cavity Ո toothache) = 0.108 + 0.012 = 0.12

P(cavity U toothache) = P(cavity) + P(toothache) – P(cavity Ո toothache)
P(cavity U toothache) = 0.2 + 0.2 – 0.12 = 0.28
So, Option(III) is correct.

More Discussion Explanation On YouTubeProbability Help-Line

Q98➡ | Artificial Intelligence
Next five questions are based on the following passage.
Consider a domain consisting of three Boolean variables Toothache, Cavity, and Catch. The full joint distribution is a 2×2×2 table as shown in the figure below.

The probability for Cavity, given that either Toothache or Catch is true, P(Cavity | toothache U catch) is _______.
i ➥ 0.4615
ii ➥ 0.5384
iii ➥ 0.6000
iv ➥ 0.8000

Show Answer With Best Explanation

Answer: I
Explanation:
Formula,
The probability for Cavity, given that either Toothache or Catch is true, P(Cavity | toothache U catch) is _______.
Calculation,
 The probability for Cavity, given that either Toothache or Catch is true, P(Cavity | toothache U catch) is _______.
The probability for Cavity, given that either Toothache or Catch is true, P(Cavity | toothache U catch) is _______.
P(cavity Ո (toothache U catch)) = 0.108 + 0.012 + 0.072 = 0.192

 The probability for Cavity, given that either Toothache or Catch is true, P(Cavity | toothache U catch) is _______.
P(toothache U cavity) = 0.108 + 0.012 + 0.072 + 0.016 + 0.064 + 0.144 = 0.416

 The probability for Cavity, given that either Toothache or Catch is true, P(Cavity | toothache U catch) is _______.
 The probability for Cavity, given that either Toothache or Catch is true, P(Cavity | toothache U catch) is _______.= 0.4615
So, Option(I) is correct.

More Discussion Explanation On YouTubeProbability Help-Line

` Q99➡ | Artificial Intelligence
Next five questions are based on the following passage.
Consider a domain consisting of three Boolean variables Toothache, Cavity, and Catch. The full joint distribution is a 2×2×2 table as shown in the figure below.

The marginal probability of cavity P(cavity) is _____.
i ➥ 0.080
ii ➥ 0.120
iii ➥ 0.200
iv ➥ 0.216

Show Answer With Best Explanation

Answer: III
Explanation:
Calculation,
The probability of a toothache, given evidence of a cavity, P(toothache | cavity) is ____.
P(cavity ) = 0.108 + 0.012 + 0.072 + 0.008 = 0.2

So, Option(III) is correct.

More DiscussionExplanation On YouTubeProbability Help-Line

Q100➡ | Artificial Intelligence
Next five questions are based on the following passage.
Consider a domain consisting of three Boolean variables Toothache, Cavity, and Catch. The full joint distribution is a 2×2×2 table as shown in the figure below.

The probability of a cavity, given evidence of a toothache, P(cavity | toothache) is ____.
i ➥ 0.216
ii ➥ 0.280
iii ➥ 0.400
iv ➥ 0.600

Show Answer With Best Explanation

Answer: IV
Explanation:
Formula,
Conditional Probability
The probability of a toothache, given evidence of a cavity, P(toothache | cavity) is ____.
Calculation,
The probability of a cavity, given evidence of a toothache,
 The probability of a cavity, given evidence of a toothache, P(cavity | toothache) is ____.
 The probability of a cavity, given evidence of a toothache, P(cavity | toothache) is ____.
P(cavity Ո toothache ) = 0.108 + 0.012 = 0.12

P(cavity U toothache) is________________.
P(toothache) = 0.108 + 0.012 + 0.016 + 0.064 = 0.2
 The probability of a cavity, given evidence of a toothache, P(cavity | toothache) is ____.
 The probability of a cavity, given evidence of a toothache, P(cavity | toothache) is ____.= 0.6
So,Option(IV) is correct.

More Discussion Explanation On YouTubeProbability Help-Line

UGC-NET December 2020 and June 2021 computer Science and application solutions

Leave a Reply

Your email address will not be published.

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