What You Will Learn!
- Prepration of UGC NET Paper I & Paper II: Here is my best approach to reviewing the question and understanding with a better explanation.
- Explanation of each Question with Heuristic Aproach. This Course cover 12 Videos
- Self learn envirionment
- All videos are related to the Topic are explained with best content
Description
This Course has solved 150 Questions of UGC NET.
50 Questions of Paper I which is a Common Paper for All Subjects
100 Questions of Paper-II of Computer Application & Internet.
UGC NET NOV 2020
This Course has two videos for Paper I & 10 videos for Paper-II.
Syllabus Covered
This play List Cover Video Lecture on the Topics
1. Discrete Structures and Optimization
2. Computer System Architecture
3. Programming Languages and Computer Graphics
4. Database Management Systems
5. System Software and Operating System
6. Software Engineering
7. Data Structures and Algorithms
8. Theory of Computation and Compilers
9. Data Communication and Computer
10. NetworksArtificial Intelligence (AI)
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
I have 18 Years of Teaching Experience and have MTech in Computer Science. In all the videos heuristics approach is followed so that students can easily understand the Explanation of Each Question.
The language used is Hindi.
Who Should Attend!
- MCA MSc
