📚 Question Bank UGC NET Paper 2: Computer Science 26th Nov 2021
Tags
100
Questions
13
Subjects
Algorithms 9
Q#QuestionAnswerMarks
Q77 Two balanced binary trees are given with m and n elements, respectively. They can be merged into a b 2 +2.0
Q78 A data structure is required for storing a set of integers such that each of the following operatio 2 +2.0
Q79 Consider the following graph. Among the following sequences I. a b e g h f II. a b f 4 +2.0
Q84 Which of the given options provides the increasing order of asymptotic complexity of functions f1, 1 +2.0
Q90 Which of the following concepts can be used to identify loops? A. Depth first ordering B. Dom 4 +2.0
Q92 Consider the given tree below. Calculate the value at the root of the tree using alpha‐beta pruning 2 +2.0
Q96 In the following table, the left column contains the names of standard graph algorithms and the rig 1 +2.0
Q98 Given below are two statements Statement I : Breadth‐First Search is optimal when all the step 1 +2.0
Q99 Which among the following statement(s) is(are) FALSE? A. Greedy best‐first search is not optimal 3 +2.0
View all “Algorithms” questions across papers →
Artificial Intelligence 1
Q#QuestionAnswerMarks
Q86 Which agent deals with the happy and unhappy state? 1 +2.0
View all “Artificial Intelligence” questions across papers →
Compiler Design 3
Q#QuestionAnswerMarks
Q22 The reverse Polish notation of the following infix expression [A*{B+C*(D+E)}] / {F*(G+H)} is _______ 1 +2.0
Q76 The postfix form of the expression (A + B) * (C * D ‐ E) * F / G is _______. 3 +2.0
Q83 Given below are two statements Statement I : LL(1) and LR are examples of Bottom‐up parsers. 2 +2.0
View all “Compiler Design” questions across papers →
Computer Graphics 4
Q#QuestionAnswerMarks
Q26 In electronic mail, which of the following protocols allows the transfer of multimedia? 4 +2.0
Q73 Suppose a Bezier curve P(t) is defined by the following four control points in the xy-plane : P 0 & 1 +2.0
Q74 Given below are two statements Statement I : The maximum number of sides that a triangle might 4 +2.0
Q89 Which of the statements given below are correct? The midpoint (or Bresenham) algorithm for raste 4 +2.0
View all “Computer Graphics” questions across papers →
Computer Networks 8
Q#QuestionAnswerMarks
Q16 Which of the following statement is False? 2 +2.0
Q19 Given below are two statements Statement I : Telnet, Ftp, Http are application layer protocol 1 +2.0
Q23 Match List I with List II List I List II A. Data Link Lay 1 +2.0
Q24 The address of class B host is to be split into subnets with 6‐bit subnet number. What is the maximu 4 +2.0
Q25 In Ethernet when Manchester coding is used, the bit rate is _________. 1 +2.0
Q27 A message is encrypted using public key cryptography to send a message from sender to receiver. Whic 1 +2.0
Q29 Which of the following statements are true? A. X.25 is connection‐oriented network B. X.25 do 1 +2.0
Q30 Let G(x) be the generator polynomial used for CRC checking. The condition that should be satisfied b 1 +2.0
View all “Computer Networks” questions across papers →
Computer Organization and Architecture 7
Q#QuestionAnswerMarks
Q12 Which of the following is not an example of pseudo‐instruction? 4 +2.0
Q14 Given below are two statements Statement I : CISC computers have a large of number of addressi 1 +2.0
Q15 Which of the following statement is true? A. Control memory is part of the hardwired control uni 2 +2.0
Q20 Arrange the following in the increasing order of complexity. A. I/O Module B. I/O processor 4 +2.0
Q21 The cache coherence problem can be solved A. by having multiport memory B. allow only nonshar 2 +2.0
Q40 Given below are three statements related to interrupt handling mechanism A. Interrupt handler ro 2 +2.0
Q81 Suppose you have eight 'black and white' images taken with a 1‐megapixel camera and one &#39 2 +2.0
View all “Computer Organization and Architecture” questions across papers →
DBMS 11
Q#QuestionAnswerMarks
Q31 Suppose a B + tree is used for indexing a database file. Consider the following information : s 1 +2.0
Q32 Given a relation scheme R(x, y, z, w) with functional dependencies set F = {x → y, z → w} 3 +2.0
Q33 Which of the following is used to create a database schema? 2 +2.0
Q36 A company is consuming parts in the manufacturing of other products. Each of the part is either manu 1 +2.0
Q37 A transaction may be in one of the following states during its execution life cycle in concurrent e 2 +2.0
Q46 Consider following two statements : Statement I : Relational database schema represents the lo 1 +2.0
Q48 Which of the DBMS component ensures that concurrent execution of multiple operations on the database 4 +2.0
Q50 Given the following STUDENT‐COURSE scheme : STUDENT (Rollno, Name, courseno) COURSE (courseno, cour 1 +2.0
Q51 Given the following STUDENT‐COURSE scheme : STUDENT (Rollno, Name, Courseno) COURSE (Courseno, Cour 1 +2.0
Q62 A company stores products in a warehouse. Storage bins in this warehouse are specified by their aisl 4 +2.0
Q85 The order of a leaf node in a B+ tree is the maximum number of (value, data record pointer) pairs it 1 +2.0
View all “DBMS” questions across papers →
Digital Logic 6
Q#QuestionAnswerMarks
Q11 Match List I with List II List I List II A. Odd Function 2 +2.0
Q13 The characteristics of the combinational circuits are : A. Output at any time is function of inp 3 +2.0
Q17 The Octal equivalent of hexadecimal (D.C) 16 is : 1 +2.0
Q18 A digital computer has a common bus system for 8 registers 16 bits each. How many multiplexers are r 1 +2.0
Q28 Which of the following statements are true? A. Frequency division multiplexing technique can be 2 +2.0
Q58 Match List I with List II List I List II Identity Name 3 +2.0
View all “Digital Logic” questions across papers →
Engineering Mathematics 16
Q#QuestionAnswerMarks
Q41 📄 The marginal probability of cavity P(cavity) is ________. 1 +2.0
Q42 📄 The probability of a cavity, given evidence of a toothache, P(cavity | toothache) is _________. 2 +2.0
Q43 📄 The probability of a toothache, given evidence of a cavity, P(toothache | cavity) is ________. 2 +2.0
Q44 📄 P(cavity V toothache) is ________. 3 +2.0
Q45 📄 The probability for Cavity, given that either Toothache or Catch is true, P(Cavity | toothache V 4 +2.0
Q47 Consider the sentence below. There is a country that borders both India and Pakistan. Which o 1 +2.0
Q52 Which of the following is logically equivalent? A. ¬p → (q → r) and 1 +2.0
Q53 Which of these statements about the floor and ceiling functions are correct? Statement I :&nbsp 3 +2.0
Q54 For which value of n is Wheel graph W n  regular? 2 +2.0
Q55 Let (X, *) be a semigroup. Furthermore, for every a and b in X, if a ≠ b, then a*b ≠ b*a. 4 +2.0
Q56 Let us assume a person climbing the stairs can take one stair or two stairs at a time. How many ways 4 +2.0
Q57 Which of the following Graphs is(are) planar? A.  B.  C. Choose the corre 1 +2.0
Q59 Consider the following linear optimization problem : Maximize Z = 6x + 5y Subject to 2x ‐ 3y 3 +2.0
Q60 How many ways are there to assign 5 different jobs to 4 different employees if every employee is ass 3 +2.0
Q72 What is the transformation matrix M that transforms a square in the xy-plane defined by (1, 1) T , ( 1 +2.0
Q91 Given below are two statements Statement I : In an undirected graph, number of odd degree vert 1 +2.0
View all “Engineering Mathematics” questions across papers →
Operating Systems 9
Q#QuestionAnswerMarks
Q6 📄  The number of bits reserved for the frame offset is ______ 1 +2.0
Q7 📄 Find number of pages required for the given virtual address space 2 +2.0
Q8 📄 What is the minimum number of bits needed for the physical address? 2 +2.0
Q9 📄 What is the size of page table for handling the given virtual address space, given that each page ta 1 +2.0
Q10 📄 If a process of size 34KB is to be executed on this machine, then what will be the size of internal 4 +2.0
Q34 Match List I with List II List I List II 2 +2.0
Q35 Consider the following 3 processes with the length of the CPU burst time given in milliseconds : 3 +2.0
Q38 In a file allocation system, the following allocation schemes are used : A. Contiguous B. Ind 2 +2.0
Q39 Given memory access time as p nanoseconds and additional q nanoseconds for handling the page fault. 1 +2.0
View all “Operating Systems” questions across papers →
Programming and Data Structure 9
Q#QuestionAnswerMarks
Q49 Given a fixed‐length record file that is ordered on the key field. The file needs B disk blocks to s 4 +2.0
Q68 The V components in MVC are responsible for : 1 +2.0
Q75 A double‐ended queue (dequeue) supports adding and removing items from both the ends of the queue. T 2 +2.0
Q80 Consider the following recursive function F() in Java that takes an integer value and returns a str 4 +2.0
Q87 What does the following function f() in 'C' return? int f(unsigned int N) {unsigned int 2 +2.0
Q88 Match List I with List II List I List II (Programming Paradig 1 +2.0
Q93 Which of the statements given below is/are correct? It is always important and useful to include 4 +2.0
Q97 A hash function h defined as h(key) = key mod 7, with linear probing, is used to insert the keys 44, 3 +2.0
Q100 Match List I with List II List I List II 1 +2.0
View all “Programming and Data Structure” questions across papers →
Software Engineering 9
Q#QuestionAnswerMarks
Q1 Match List I with List II List I List II 4 +2.0
Q2 In the context of Software Configuration Management (SCM), what kind of files should be committed t 1 +2.0
Q3 Identify the correct order of the following five levels of Capability Maturity Model (from lower to 4 +2.0
Q4 Given below are two statements, one is labelled as Assertion A and the other is labelled as Reason 1 +2.0
Q5 Given below are two statements Statement I : Cleanroom software process model incorporates the 3 +2.0
Q67 In software testing, beta testing is the testing performed by _______. 2 +2.0
Q69 In software engineering, what kind of notation do formal methods predominantly use? 3 +2.0
Q70 If every requirement stated in the Software Requirement Specification (SRS) has only one interpretat 3 +2.0
Q71 A system has 99.99% uptime and has a mean-time-between-failure of 1 day. How fast does the system ha 1 +2.0
View all “Software Engineering” questions across papers →
Theory of Computation 8
Q#QuestionAnswerMarks
Q61 Which of the following languages are not regular? A. L = {(01) n  0 k | n > k, k >= 4 +2.0
Q63 Any string of terminals that can be generated by the following context free grammar (where S is sta 4 +2.0
Q64 Let L 1 = {0 n 1 n  0 m | n >= 1, m >= 1} L 2 = {0 n  1 m 0 m | n >= 1 +2.0
Q65 Given below are two statements Statement I : The family of context free languages is closed un 1 +2.0
Q66 What is the minimum number of states required to the finite automaton equivalent to the transition 3 +2.0
Q82 Match List I with List II List I List II 3 +2.0
Q94 Find the regular expression for the language accepted by the automata given below. 2 +2.0
Q95 What language is accepted by the pushdown automation M = ({q 0 , q 1 , q2}, {a, b}, {a, b, z}, & 4 +2.0
View all “Theory of Computation” questions across papers →