Solved UGC NET NOV 2020 - Computer Science & Applications

10 Solved Questions UGC NET NOV 2020: 1-10

#UGCNET #NOV2020 #ComputerScience&Applications Important Topics Covered

#OperatingSystem

What is #Ceil?

What is #floor?

What is #XML?

#pipeLine #NonPipeLine

#DirectedGraph #UndirectedGraph

#DFS #BFS #ContextSesitiveLanguage

#AI #AIAgent #SoftwareAgent #SSTF

#ShortestSeekTimeFirst

#LexicographyOrdering #Handshaking

#ProgrammedIO #IOProcessor #IntruptControl

#SMNP #UDP #OSI #TCP #SLIP #BGP

The following Questions are solved Paper-II: UGC NET Nov 2020

ये प्रश्न हैं 1 से 10 तक, video में ही options हैं।

1. Consider the following pseudo-code fragment where A and B are integer variables that have been initialized. When the loop terminates what will be the value of x in terms of a and b?

#programming #whileLoop

2. Which of the following statement regarding the example is/are true:

a) XML is a set of tags designed to tell the browser how to display text and images on a web page

b) XML defines the syntax for representing data but the meaning of data varies from application to application

c) XML is case sensitive (कुछ टैग हैं) #xml #html #diffirence-html-xml से

3. In non pipelined system takes 50ns to process a task the same task can be processed in a six-segment pipeline with a clock cycle of 10ns determining approximately the speed-up of the ratio of the pipeline for 500 hours #OperatingSystem से

4. Let G be a simple undirected graph TD be the DFS tree on G and TB be the BFS tree on G, Consider the statement of the following 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 #graphTheory #DiscreteStructure&Optimization #UGC #NET #UNIT_I

5. Decidable for context-sensitive languages & undecidable for context-sensitive languages 5th question इस topic से है। #TuringMachine #theory_of_Computation

6. which of the following is not true in problem-solving in artificial intelligence a) implements heuristic search techniques b) Solution steps are not explicit c) knowledge is imprecise d) it works on or implements a repetition mechanism #AI #artificial_Intelligence

7. Consider a disk system having 16 cylinders disk requests are received by a disk drive fastened 10, 22, 20, 40, 6, and 38 In that order assuming that the disk head is currently at cylinder 22 what is the time taken to satisfy all the requests if it takes 2 milliseconds to move from one cylinder to adjacent one and shortest seek time first algorithm is used? #os #OperatingSystem

8. Find the lexicographic ordering of the bit strings given below based on ordering 0 is less than 1.

9. Match the following: list I- handshaking programmed input-output interrupt initiated input-output processor #ComputerArchitecture

10. Match the following: list I - serial line IP broader Gateway protocol user datagram protocol simple network management protocol list II: to application layer transport layer data link layer network layer #ComouterNetwork

10 Solved Questions UGC NET NOV 2020: 11-20

#UGCNET #NOV2020

#ComputerScience&Applications

+++++++++++++++++++++++++++++++++++++++

Important Topics Covered ?????

11. Which of the preposition is Correct #TheoryOfComputation Negation, Conjunction, Disjunction, Condition and Bidirectional Truth Table of Logical Symbols

12. Suppose you have Linux file system where the Block size is 2K bytes, a disk address is 32 bits and an i-node contain disk address of 12 direct block of the file, a single indirect block and a Doble indirect Block. Approximatly, what is the latest file that can be represented by an i-node.

Formula Max. File size = (12 direct + 1 single indirect block + 1 double indirect) × block size

Given Block size = 2K =2*1024 Bytes =2048 bytes

Disk Address = 32 bits=4 bytes

Number of addresses/Block= Block Size/Disk address =2*1024/4 =512 bytes

Max. File size = (12 + 512 +512*512) x 2048 = (12 +512 + 262144) x 2048 = 262668 x 2048 = 537944064 bytes = 537 Mbytes

13. 3D Projection : Perspective Projection - distance and angles are not preserved Orthographic Projection - direction of projection is normal

14. Assuming that system call fork() never fail. C program P1 and P2 run on Unix system. find the output fork() - create child processes fork() returns 0 in child process and process ID of child process in parent process. For n number fork() created 2n processes

P1 : 23 = 8

P2= 2 +22 +23 =2+4+8=14

15. If two variable V1 and V2 used for k mean k=3 Clustering K-Means Clustering Algorithm with k=3 -Machine Learning Algo.. -Data Mining -Organized data

16. #ER Symbol and Description : #Entity, #Relationship, #Attribute, #WeekEntity, #WeekEntityRelationship, #MultiValueAttribute, #KeyAttribute

17. Restructering of Software: #AdaptiveMaintenance #PerventiveMaintenance #PerfectiveMaintenamce #CorrectiveMaintenance

18. A software project was estimated at 864 function points. A six person will be assigned to project .. What is the projected cost of software? Projected Cost = Total One Month salary * Total Months One Month Salary = 70k + 2*60K + 2*60K+50K = 360K Total Months required = FP/ Team Members * Avg FP = 864/ 6*12 = 12 Projected Cost= 360K *12 = 4320K

19. To create an Object behavioral Model, the analyst performs the following steps Behaviour of the system as a function of specific events & time Steps followed by Analyst Evaluate all use-cases to fully understand the sequence of interaction within the system. Identify events that drive the interaction sequence and understand how these events relate to specific objects. Create an event trace for each use case. Build a state transition diagram for the system. Review the object-behavior model to verify accuracy and consistency.

20. The process of removing the details from the given state representation is called Abstraction.

10 Solved Questions UGC NET NOV 2020: 21-30

#UGCNET #NOV2020 #ComputerScience&Applications

--------------------------------------------------------------------------

?????

21. If f(x)=x is my friend and p(x)=x is perfect then correct logical translation of the statement "Some of my friends are not perfect" #DiscreteMathemetics

22. Which of the following grammar is Ambiguous S - SS | aSb | bSa | λ S- SS | aSba | bSaS | λ S - aAB | A - bBb B - A | λ #ContextFreeLanguage #TheoryOfComputation

23. #SoftwareEngineering #Cohesion #Coupling Coupling: Degree of inter dependability between modules - Low Cohesion: Degree of Functionally related to modules - High

24. Prism’Alogrithm: minimum cost spanning tree, greedy approach, shortest path first algorithms, nodes as a single tree

25. Calculate Total cost of Project: Development Cost + Maintainable Cost, #LOC of Language, Line of Code. #SoftwareEngineering

26. #Artifitialintelligence #informedSearchAlgo #HeuristicSearch #LargeSearchSpace #KnowledgeOfSearchSpace Best Search Algorithm Greedy Best Search Algorithm A* - Common form of Best First Algo ( DFS & BFS) SMA* - Simplified memory bounded - Shortest Path Algo based on A* algo

27. #PhongShading is better and more complex than #GouroudShading

28. Pooling and sharing of Resources on Cloud is done by #virtulization

29. Artificial Intelligence searching Algorithm.

30. A hash function is a function that takes a set of inputs of any arbitrary size and fits them into a table or other data structure that contains fixed-size elements.

This video has a discussion on 10 questions asked in the UGC NET Examination June 2020 in the Subject of Computer Science and Application.

UGCNET #NOV2020 #ComputerScience&Applications

Q31. This Question from the #Discrete Mathematics Argument with Premise and Conclusion

#Universal instantiation

Premise - Reason & Evidence behind Conclusion

Conclusion -The Statement Premise Support. - One Conclusion for an Argument

Example:

Argument -

“All mammals are warm-blooded [premise];

therefore,

whales are warm blooded [Conclusion]”

If P∧Q is a premise, we can use the Simplification rule to derive P.

"He studies very hard and he is the best boy in the class", P∧Q Therefore − "He studies very hard"

Q32. This Question is the Theory of Computation Closure Properties of Context-Free Language

1. Union Operation

2. Concatenation

3. Kleene closure

4. Reversal operation

5. Homomorphism

6. Inverse Homomorphism

7. Substitution

8. init or prefix operation

9. Quotient with regular language

10. Cycle operation

11. Union with regular language

12. Intersection with regular language

13. Difference with regular language

#CFL is Not Closure under

1. Intersection

2. Complement

3. Subset

4. Superset

5. Infinite Union

6. Difference, Symmetric difference

Q33. This Question from #DataStructure&Algorithm

A complete #N-ary tree is a Generic Tree.

It has Many children at every node.

The number of nodes for each node is not known in advance.

All levels must be completed except bottom.

Formula L = (n-1)*I + 1

Example L=41, I=10

41=(n-1)*10+1

4=n-1

n=5

Q34. This Question from #DataStructure&Algorithm

In a binary max-heap containing n elements, the smallest element is found in O(n) order.

Q35. This Question from #DataStructure&Algorithm #colorTree #bipartiteTree

Any tree is 2 colorable

A Graph G has no cycles of odd length if it is Bipartite

A Graph is 2 colorable if it is bipartite

Q36. This Question is related to the Theory of Computation

#RegularLanguage #ContectFreeLanguage

Context-FreeGrammar produces Context-Free Language and it applied to Pushdown Automata

Q37. This Question is related to the Theory of Computation #RegularLanguage #ContectFreeLanguage Q38. This Question is related to #ComputerOrganization #CPUDesign #ComputerArchitecture.

Arrange the following types of machines in the descending order of Complexity

-Single Instruction Single Data (#SISD)

- Multiple Instruction Multiple Data (#MISD)

-Single Instruction Multiple Data (#SIMD)

Q39. Which of the following is not Intermediate Code Form #Compiler:

HLL - AL Intermediate code form #PostfixNotation

Example – The postfix representation of the expression

(a – b) * (c + d) + (a – b) is : ab – cd + *ab -+.

#ThreeAddressCode Example –

The three address code for the expression

a + b * c + d

T 1 = b * c

T 2 = a + T 1

T 3 = T 2 + d

T 1 , T 2 , T 3 are temporary variables. #SyntaxTrees #quadruple

Q30. #DataStructureAlgo #CombinationalOptimizationalProblem #ArtificialIntelligence

This video has a discussion on 10 questions (Q41-50) asked in the UGC NET Examination June 2020 in the Subject of Computer Science and Application.

UGCNET #NOV2020 #ComputerScience&Applications

Q41: This Question is related to Asymptotic Notation describe the running time of an algorithm - how much time an algorithm takes with a given input, n.

There are three different notations:

big O - running time is the same for all cases

big Theta (Θ) - the worst-case running time, and

big Omega (Ω) - the best-case running time

Θ - the worst-case

Ω - the best

#DataStructure&Algo #BigOAnaysis #AsymptoticNotation #bigtheta #bigomega

Q42. #SOP #KMAP #SimplificationOfBooleanExpression

Q43. This Question is related to Linear Programming Problem

Q44. #CompilerDesign The symbol table is an important data structure used in a compiler. It is used To store the names of all entities in a structured form in one place. To verify if a variable has been declared. To implement type checking, by verifying assignments and expressions in the source code are semantically correct. To determine the scope of a name (scope resolution).

Q45. Minimum number of edges in Graph

Q46. Hill Climbing Algo

Types:-

Simple hill Climbing: A Neighbor node

Steepest-Ascent hill-climbing: All Neighbor nodes

Stochastic hill Climbing: Random Neighbor nodes

Complex, Large and take time more time #artificialIntellgence

A genetic algorithm is an adaptive heuristic search algorithm inspired by "Darwin's theory of evolution in Nature." #survivalforthefittest

Q47. #DBMS Conflicting operations: Two operations are said to be conflicting if all conditions satisfy:

They belong to different transactions

They operate on the same data item

At Least one of them is a written operation

THis video contains 10 Questions asked in UGC NET NOV 2020

THis video contains 10 Questions asked in UGC NET NOV 2020

THis video contains 10 Questions asked in UGC NET NOV 2020

THis video contains 10 Questions asked in UGC NET NOV 2020

THis video contains 10 Questions asked in UGC NET NOV 2020