UGC NET Paper 2 Computer Science – July 2018 – Question Paper with Answer Key
Solved by The Binary Brothers: every question has the correct answer and an explanation. Open any question for its full solution, or practise it in the unit-wise mock tests.
The definitions in an XML document are said to be __________ when the tagging system and definitions in the DTD are all in compliance.
- well-formed
- reasonable
- valid
- logical
Consider the JavaScript code:
var y = "12";
function f() {
var y = "6";
alert(this.y);
function g() { alert(y); }
g();
}
f();If M is the number of alert dialog boxes generated by this code and D1, D2, …, DM are the contents displayed in each, then:
- M=3; D1 displays ”12”; D2 displays ”6”; D3 displays ”12”.
- M=3; D1 displays ”6”; D2 displays ”12”; D3 displays ”6”.
- M=2; D1 displays ”6”; D2 displays ”12”.
- M=2; D1 displays ”12”; D2 displays ”6”
What is the output of the following Java program?
class simple {
public static void main(String[] args) {
simple obj = new simple();
obj.start();
}
void start() {
long[] P = {3, 4, 5};
long[] Q = method(P);
System.out.print(P[0] + P[1] + P[2] + ":");
System.out.print(Q[0] + Q[1] + Q[2]);
}
long[] method(long[] R) {
R[1] = 7;
return R;
}
} // end of class- 12 : 15
- 15 : 12
- 12 : 12
- 15 : 15
What is the output of the following C program? (Assume little-endian representation, with the least significant byte at the lowest address, and a two-byte short int.)
#include <stdio.h>
int main()
{
union saving {
short int one;
char two[2];
};
union saving m;
m.two[0] = 5;
m.two[1] = 2;
printf("%d, %d, %d\n", m.two[0], m.two[1], m.one);
}- 5, 2, 1282
- 5, 2, 52
- 5, 2, 25
- 5, 2, 517
Given below are three implementations of swap() in C++:
(a) void swap(int a, int b) { int temp; temp = a; a = b; b = temp; } called as swap(p, q);
(b) void swap(int &a, int &b) { int temp; temp = a; a = b; b = temp; } called as swap(p, q);
(c) void swap(int *a, int *b) { int *temp; temp = a; a = b; b = temp; } called as swap(&p, &q);with int p = 0, q = 1 in main(). Which of these would actually swap the contents of p and q?
- (a) only
- (b) only
- (c) only
- (b) and (c) only
In Java, which of the following statements is/are True ?
S1 : The ‘final’ keyword applied to a class definition prevents the class from being extended through derivation.
S2 : A class can only inherit one class but can implement multiple interfaces.
S3 : Java permits a class to replace the implementation of a method that it has inherited. It is called method overloading.
- S1 and S2 only
- S1 and S3 only
- S2 and S3 only
- All of S1, S2 and S3
Which of the following statements is/are True ? P : C programming language has a weak type system with static types. Q : Java programming language has a strong type system with static types.
- P only
- Q only
- Both P and Q
- Neither P nor Q
A graphic display system has a frame buffer that is 640 pixels wide, 480 pixels high and 1 bit of color depth. If the access time for each pixel on the average is 200 nanoseconds, then the refresh rate of this frame buffer is approximately :
- 16 frames per second
- 19 frames per second
- 21 frames per second
- 23 frames per second
Which of the following statements is/are True regarding the solution to the visibility problem in 3D graphics ?
S1 : The Painter’s algorithm sorts polygons by depth and then paints (scan - converts) each Polygon on to the screen starting with the most nearest polygon.
S2 : Backface Culling refers to eliminating geometry with backfacing normals.
- S1 only
- S2 only
- Both S1 and S2
- Neither S1 nor S2 2 0 2
Consider the matrix M = [2 0 2; 0 1 1; 0 0 1] representing a set of planar (2D) geometric transformations in homogeneous coordinates. Which of the following statements about M is true?
- M represents first, a scaling of vector (2, 1) followed by translation of vector (1, 1)
- M represents first, a translation of vector (1, 1) followed by scaling of vector (2, 1)
- M represents first, a scaling of vector (3, 1) followed by shearing of parameters (−1, 1)
- M represents first, a shearing of parameters (−1, 1) followed by scaling of vector (3, 1)
For a software system P: estimated size 33,480 LOC; average productivity 620 LOC per person-month; 6 developers; average salary ₹50,000 per month. If E, D and C are the estimated effort (person-months), development time (months) and cost (₹ lakh), then (E, D, C) =
- (48, 8, 24)
- (54, 9, 27)
- (60, 10, 30)
- (42, 7, 21)
Match the following in Software Engineering :

- (a) (b) (c) (d) (ii) (iii) (iv) (i)
- (a) (b) (c) (d) (iii) (i) (iv) (ii)
- (a) (b) (c) (d) (iv) (i) (ii) (iii)
- (a) (b) (c) (d) (iii) (iv) (i) (ii)
- Synchronisation
- Versioning and Revision history
- Syntax highlighting
- Project forking
A software system crashed 20 times in the year 2017 and for each crash, it took 2 minutes to restart. Approximately, what was the software availability in that year ?
- 96.9924%
- 97.9924%
- 98.9924%
- 99.9924%
Match the 5 CMM Maturity levels/CMMI staged representations in List- I with their characterizations in List-II

- (a) (b) (c) (d) (e) (iv) (v) (i) (iii) (ii)
- (a) (b) (c) (d) (e) (i) (ii) (iv) (v) (iii)
- (a) (b) (c) (d) (e) (v) (iv) (ii) (iii) (i)
- (a) (b) (c) (d) (e) (iv) (v) (ii) (iii) (i)
P: Common coupling occurs when one module controls the flow of another module by passing it information on what to do.
Q: In data coupling, the complete data structure is passed from one module to another through parameters.
R: Stamp coupling occurs when modules share a composite data structure and use only parts of it.
- P and Q only
- P and R only
- Q and R only
- All of P, Q and R
- adapter
- decorator
- delegation
- proxy
P: Allow legacy software to quickly adapt to the changing requirements.
Q: Upgrade to newer technologies/platforms/paradigm (for example, object-oriented).
R: Improve software maintainability.
S: Allow change in the functionality and architecture of the software.
- P, R and S only
- P and R only
- P, Q and S only
- P, Q and R only
- Formal specification
- Dynamic verification
- Incremental development
- Statistical testing of the system
P: Refactoring is the process of changing a software system in such a way that it does not alter the external behaviour of the code yet improves the internal architecture.
Q: An example of refactoring is adding new features to satisfy a customer requirement discovered after a project is shipped.
Which of the above statements is/are true?
- P only
- Q only
- Both P and Q
- Neither P nor Q
The solution of the recurrence relation T(m) = T(3 m/4) + 1 is :
- θ (lg m)
- θ (m)
- θ (mlg m)
- θ (lglg m)
Consider the array A=<4, 1, 3, 2, 16, 9, 10, 14, 8, 7>. After building heap from the array A, the depth of the heap and the right child of max-heap are _________ and _________ respectively. (Root is at level 0).
- 3, 14
- 3, 10
- 4, 14
- 4, 10
A hash function 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 0 to 6. What will be the location of key 18?
- 3
- 4
- 5
- 6
Which of the following algorithms solves the single-source shortest paths ?
- Prim’s algorithm
- Floyd - Warshall algorithm
- Johnson’s algorithm
- Dijkstra’s algorithm
A text is made up of the characters A, B, C, D, E each occurring with the probability 0.08, 0.40, 0.25, 0.15 and 0.12 respectively. The optimal coding technique will have the average length of :
- 2.4
- 1.87
- 3.0
- 2.15
A binary search tree in which every non-leaf node has non-empty left and right subtrees is called a strictly binary tree. Such a tree with 19 leaves :
- cannot have more than 37 nodes
- has exactly 37 nodes
- has exactly 35 nodes
- cannot have more than 35 nodes
Match the following with respect to algorithm paradigms :

- (a) (b) (c) (d) (iv) (i) (iii) (ii)
- (a) (b) (c) (d) (iv) (iii) (i) (ii)
- (a) (b) (c) (d) (iii) (iv) (ii) (i)
- (a) (b) (c) (d) (iv) (iii) (ii) (i)
The maximum number of comparisons needed to sort 9 items using radix sort is (assume each item is 5 digit octal number) :
- 45
- 72
- 360
- 450
A 5-ary tree is tree in which every internal node has exactly 5 children. The number of left nodes in such a tree with 8 internal nodes will be :
- 30
- 33
- 45
- 125
Consider a Boolean function of ‘n’ variables. The order of an algorithm that determines whether the Boolean function produces a output 1 is :
- Logarithmic
- Linear
- Quadratic
- Exponential
Two finite state machines are said to be equivalent if they :
- Have the same number of edges
- Have the same number of states
- Recognize the same set of tokens
- Have the same number of states and edges
The finite state machine given in figure below recognizes :

- any string of odd number of a’s
- any string of odd number of b’s
- any string of even number of a’s and odd number of b’s
- any string of odd number of a’s and odd number of b’s
A pushdown automata behaves like a Turing machine when the number of auxiliary memory is :
- 0
- 1
- 1 or more
- 2 or more
Pushdown automata can recognize language generated by_________.
- Only context free grammar
- Only regular grammar
- Context free grammar or regular grammar
- Only context sensitive grammar
To obtain a string of n Terminals from a given Chomsky normal form grammar, the number of productions to be used is :
- 2n − 1
- 2n
- n + 1
- n²
Consider the two grammars: G₁: S → SbS | a G₂: S → aB | ab, A → AAB | a, B → ABb | b Which of the following options is correct?
- Only G₁ is ambiguous
- Only G₂ is ambiguous
- Both G₁ and G₂ are ambiguous
- Both G₁ and G₂ are not ambiguous
Context-sensitive language can be recognized by a :
- Finite state machine
- Deterministic finite automata
- Non-deterministic finite automata
- Linear bounded automata
The set A= { 0n1n2n | n= 1, 2, 3,..............} is an example of a grammar that is :
- Context-sensitive
- Context-free
- Regular
- None of the above
A bottom-up parser generates :
- Left-most derivation in reverse
- Right-most derivation in reverse
- Left-most derivation
- Right-most derivation
Consider the statements: S₁: There exists no algorithm for deciding whether any two Turing machines M₁ and M₂ accept the same language. S₂: The problem of determining whether a Turing machine halts on any input is undecidable. Which of the following options is correct?
- Both S₁ and S₂ are correct
- Both S₁ and S₂ are not correct
- Only S₁ is correct
- Only S₂ is correct
A slotted ALOHA network transmits 200-bit frames using a shared channel with a 200 Kbps bandwidth. Find the throughput of the system, if the system (all stations put together) produces 250 frames per second :
- 49
- 368
- 149
- 151
The period of a signal is 100 ms. Its frequency is _________.
- 10³ Hz
- 10⁻² kHz
- 10⁻³ kHz
- 10⁵ Hz
The dotted-decimal notation of the following IPV4 address in binary notation is _________.10000001 00001011 00001011 11101111
- 111.56.45.239
- 129.11.10.238
- 129.11.11.239
- 111.56.11.239
Which of the following statements are true ?
(a) Advanced Mobile Phone System (AMPS) is a second generation cellular phone system.
(b) IS - 95 is a second generation cellular phone system based on CDMA and DSSS.
(c) The Third generation cellular phone system will provide universal personnel communication.
- (a) and (b) only
- (b) and (c) only
- (a), (b) and (c)
- (a) and (c) only
Match the following symmetric block ciphers with corresponding block and key sizes :

- a- iv, b-ii, c-i, d-iii
- a- ii, b-iv, c-i, d-iii
- a- ii, b-iv, c-iii, d-i
- a- iv, b-ii, c-iii, d-i
Which of the following statements is/are true?
(a) Three broad categories of Networks are
(i) Circuit Switched Networks
(ii) Packet Switched Networks
(iii) Message Switched Networks
(b) Circuit Switched Network resources need not be reserved during the setup phase.
(c) In packet switching there is no resource allocation for packets.
- (a) and (b) only
- (b) and (c) only
- (a) and (c) only
- (a), (b) and (c)
In Challenge-Response authentication the claimant ________.
- Proves that she knows the secret without revealing it
- Proves that she doesn’t know the secret
- Reveals the secret
- Gives a challenge
Decrypt the message “WTAAD” using the Caesar Cipher with key=15.
- LIPPS
- HELLO
- OLLEH
- DAATW
To guarantee correction of up to t errors, the minimum Hamming distance d in a block code min must be ________.
- t+1
- t−2
- 2t−1
- 2t+1
Encrypt the message "HELLO MY DEARZ" using a transposition cipher with key: plaintext positions 2 4 1 3 → ciphertext positions 1 2 3 4.
- HLLEO YM AEDRZ
- EHOLL ZYM RAED
- ELHL MDOY AZER
- ELHL DOMY ZAER
At a particular time of computation, the value of a counting semaphore is 10. Then 12 P operations and “x” V operations were performed on this semaphore. If the final value of semaphore is 7, x will be :
- 8
- 9
- 10
- 11
In a paged memory, the page hit ratio is 0.40. The time required to access a page in secondary memory is equal to 120 ns. The time required to access a page in primary memory is 15 ns. The average time required to access a page is ________.
- 105
- 68
- 75
- 78
In a multi-user operating system, 30 requests are made to use a particular resource per hour, on an average. The probability that no requests are made in 40 minutes, when arrival pattern is a poisson distribution, is ______.
- e⁻¹⁵
- 1 − e⁻¹⁵
- 1 − e⁻²⁰
- e⁻²⁰
Normally user programs are prevented from handling I/O directly by I/O instructions in them. For CPUs having explicit I/O instructions, such I/O protection is ensured by having the I/O instructions privileged. In a CPU with memory mapped I/O, there is no explicit I/O instruction. Which one of the following is true for a CPU with memory mapped I/O ?
- I/O protection is ensured by operating system routines.
- I/O protection is ensured by a hardware trap.
- I/O protection is ensured during system configuration.
- I/O protection is not possible.
Which UNIX/Linux command is used to make all files and sub-directories in the directory “progs” executable by all users ?
- chmod− R a+x progs
- chmod −R 222 progs
- chmod−X a+x progs
- chmod −X 222 progs
Which of the following statements are true ?
(a) External Fragmentation exists when there is enough total memory space to satisfy a request but the available space is contiguous.
(b) Memory Fragmentation can be internal as well as external.
(c) One solution to external Fragmentation is compaction.
- (a) and (b) only
- (a) and (c) only
- (b) and (c) only
- (a), (b) and (c)
Page information in memory is also called as Page Table. The essential contents in each entry of a page table is/are _________.
- Page Access information
- Virtual Page number
- Page Frame number
- Both virtual page number and Page Frame Number
Consider a virtual page reference string 1, 2, 3, 2, 4, 2, 5, 2, 3, 4. Suppose LRU page replacement algorithm is implemented with 3 page frames in main memory. Then the number of page faults are_________.
- 5
- 7
- 9
- 10
Consider the following three processes, with arrival time and CPU burst time in milliseconds: P1 (arrival 0, burst 7), P2 (arrival 1, burst 4), P3 (arrival 2, burst 8). The Gantt chart for the preemptive SJF scheduling algorithm is
In which of the following scheduling criteria, context switching will never take place?
- ROUND ROBIN
- Preemptive SJF
- Non-preemptive SJF
- Preemptive priority
In RDBMS, which type of Join returns all rows that satisfy the join condition ?
- Inner Join
- Outer Join
- Semi Join
- Anti Join
Consider a relation book (title, price) which contains the titles and prices of different books. Assuming that no two books have the same price, what does the following SQL query list ? Select title from book as B where (select count (*) from book as T where T.price > B.price) < 7
- Titles of the six most expensive books.
- Title of the sixth most expensive books.
- Titles of the seven most expensive books.
- Title of the seventh most expensive books.
In a Hierachical database, a hashing function is used to locate the ________.
- Collision
- Root
- Foreign Key
- Records
Relations produced from E - R Model will always be in ________.
- 1 NF
- 2 NF
- 3 NF
- 4 NF
Consider the following schedules involving two transactions: S₁: r₁(X); r₁(Y); r₂(X); r₂(Y); w₂(Y); w₁(X) S₂: r₁(X); r₂(X); r₂(Y); w₂(Y); r₁(Y); w₁(X) Which one of the following statements is correct?
- Both S₁ and S₂ are conflict serializable
- Both S₁ and S₂ are not conflict serializable
- S₁ is conflict serializable and S₂ is not
- S₁ is not conflict serializable and S₂ is
For a database relation R(a, b, c, d) where the domains of a, b, c and d include only atomic values, and only the following functional dependencies and those that can be inferred from them hold :
a → c
b → d The relation is in _________.
- First normal form but not in second normal form
- Second normal form but not in third normal form
- Third normal form
- BCNF
A many-to-one relationship exists from entity set r₁ to entity set r₂. If Pk(r) denotes the primary key of relation r, how is it represented using functional dependencies?
- Pk(r₁) → Pk(r₂)
- Pk(r₂) → Pk(r₁)
- Pk(r₂) → Pk(r₁) and Pk(r₁) → Pk(r₂)
- Pk(r₂) → Pk(r₁) or Pk(r₁) → Pk(r₂)
Database systems that store each relation in a separate operating system file may use the operating system's authorization scheme, instead of defining a special scheme themselves. In this case, which of the following is false?
- The administrator enjoys more control on the grant option.
- It is difficult to differentiate among the update, delete and insert authorizations.
- Cannot store more than one relation in a file.
- Operations on the database are speeded up as the authorization procedure is carried out at the operating system level. R (a, b, c) R (x, y, z)
Let R₁(a, b, c) and R₂(x, y, z) be relations in which a is a foreign key of R₁ referring to the primary key of R₂. Consider: (a) insert into R₁, (b) insert into R₂, (c) delete from R₁, (d) delete from R₂. Which is correct about the referential integrity constraint?
- Operations (a) and (b) will cause violation.
- Operations (b) and (c) will cause violation.
- Operations (c) and (d) will cause violation.
- Operations (d) and (a) will cause violation.
Consider a hash table of size seven, with starting index zero, and a hash function (7x+3) mod 4. Assuming the hash table is initially empty, which of the following is the contents of the table when the sequence 1, 3, 8, 10 is inserted into the table using closed hashing ? Here “__” denotes an empty location in the table.
- 3, 10, 1, 8, __ , __ , __
- 1, 3, 8, 10, __ , __ , __
- 1, __ , 3, __ , 8, __ , 10
- 3, 10, __ , __ , 8, __ , __
In Artificial Intelligence (AI), an environment is uncertain if it is ________.
- Not fully observable and not deterministic
- Not fully observable or not deterministic
- Fully observable but not deterministic
- Not fully observable but deterministic
In Artificial Intelligence (AI), a simple reflex agent selects actions on the basis of_________.
- current percept, completely ignoring rest of the percept history.
- rest of the percept history, completely ignoring current percept.
- both current percept and complete percept history.
- More than one of the above (E) None of the above
In heuristic search algorithms in Artificial Intelligence (AI), if a collection of admissible h … … . h heuristics 1 m is available for a problem and none of them dominates any of the others, which should we choose?
- h(n) = max{h₁(n), …, hₘ(n)}
- h(n) = min{h₁(n), …, hₘ(n)}
- h(n) = avg{h₁(n), …, hₘ(n)}
- h(n) = sum{h₁(n), …, hₘ(n)}
Consider the following sentences about A* search:
(a) A* expands all nodes with f(n) < C*.
(b) A* expands no nodes with f(n) ≥ C*.
(c) Pruning is integral to A*. Here C* is the cost of the optimal solution path. Which is correct?
- Both statement (a) and statement (b) are true.
- Both statement (a) and statement (c) are true.
- Both statement (b) and statement (c) are true.
- All the statements (a), (b) and (c) are true.
Consider a vocabulary with only four propositions A, B, C and D. How many models are there for the sentence B ∨ C?
- 10
- 12
- 15
- 16
Consider the following statements:
(a) False ⊨ True
(b) If α ⊨ (β ∧ γ) then α ⊨ β and α ⊨ γ. Which of the following is correct?
- Both statement (a) and statement (b) are false.
- Statement (a) is true but statement (b) is false.
- Statement (a) is false but statement (b) is true.
- Both statement (a) and statement (b) are true.
Consider the following English sentence : “Agra and Gwalior are both in India”. A student has written a logical sentence for the above English sentence in First-Order Logic using predicate In(x, y), which means x is in y, as follows : In(Agra, India) V In(Gwalior, India) Which one of the following is correct with respect to the above logical sentence ?
- It is syntactically valid but does not express the meaning of the English sentence.
- It is syntactically valid and expresses the meaning of the English sentence also.
- It is syntactically invalid but expresses the meaning of the English sentence.
- It is syntactically invalid and does not express the meaning of the English sentence.
Consider the following two sentences :
(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 ?
- Both sentence (a) and sentence (b) are false.
- Both sentence (a) and sentence (b) are true.
- Sentence (a) is true but sentence (b) is false.
- Sentence (a) is false but sentence (b) is true.
A knowledge base contains just one sentence, ∃x AsHighAs (x, Everest). Consider the following two sentences obtained after applying existential instantiation.
(a) AsHighAs (Everest, Everest)
(b) AsHighAs (Kilimanjaro, Everest) Which of the following is correct with respect to the above sentences ?
- Both sentence (a) and sentence (b) are sound conclusions.
- Both sentence (a) and sentence (b) are unsound conclusions.
- Sentence (a) is sound but sentence (b) is unsound.
- Sentence (a) is unsound but sentence (b) is sound.
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 ?
- 2, 598, 960
- 3, 468, 960
- 3, 958, 590
- 2, 645, 590
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 :
- O(E · f)
- O(E² · f)
- O(E · f²)
- O(E² · f²)
Which of the following statements is false about convex minimization problem ?
- If a local minimum exists, then it is a global minimum
- The set of all global minima is convex set
- The set of all global minima is concave set
- For each strictly convex function, if the function has a minimum, then the minimum is unique
The following LPP: Maximize z = 100x₁ + 2x₂ + 5x₃ subject to 14x₁ + x₂ − 6x₃ + 3x₄ = 7, 32x₁ + x₂ − 12x₃ ≤ 10, 3x₁ − x₂ − x₃ ≤ 0, x₁, x₂, x₃, x₄ ≥ 0, has
- Solution: x₁ = 100, x₂ = 0, x₃ = 0
- Unbounded solution
- No solution
- Solution: x₁ = 50, x₂ = 70, x₃ = 60
Digital data from a sensor can fill 0 to 32 buffers. Let the sample space be S = {0, 1, 2, …, 32}, where j means j buffers are full, and p(i) = (33 − i)/561. Let A be the event that an even number of buffers are full. Then p(A) is
- 0.515
- 0.785
- 0.758
- 0.485 ¬∃xQ(x)
Match the following in List - I and List - II, for a function f :

- a − (i), b − (ii), c − (iii)
- a − (iii), b − (ii), c − (i)
- a − (ii), b − (i), c − (iii)
- a − (ii), b − (iii), c − (i)
Which of the relations on {0, 1, 2, 3} is an equivalence relation ?
- { (0, 0) (0, 2) (2, 0) (2, 2) (2, 3) (3, 2) (3, 3) }
- { (0, 0) (1, 1) (2, 2) (3, 3) }
- { (0, 0) (0, 1) (0, 2) (1, 0) (1, 1) (1, 2) (2, 0) }
- { (0, 0) (0, 2) (2, 3) (1, 1) (2, 2) }
Which of the following is an equivalence relation on the set of all functions from Z to Z?
- {(f, g) | f(x) − g(x) = 1 ∀x ∈ Z}
- {(f, g) | f(0) = g(0) or f(1) = g(1)}
- {(f, g) | f(0) = g(1) and f(1) = g(0)}
- {(f, g) | f(x) − g(x) = k for some k ∈ Z}
Which of the following statements is true?

- (Z, ≤) is not totally ordered
- The set inclusion relation ⊆ is a partial ordering on the power set of a set S
- (Z, ≠) is a poset
- The directed graph shown is not a partial order
CMOS is a Computer Chip on the motherboard, which is :
- RAM
- ROM
- EPROM
- Auxillary storage
In RS flip-flop, the output of the flip-flop at the time (t+1) is the same as the output at time t, after the occurrence of a clock pulse if :
- S=R=1
- S=0, R=1
- S=1, R=0
- S=R=0
Match the terms in List - I with the options given in List - II :

- (a)-ii (b)-i (c)-iii
- (a)-ii (b)-iii (c)-i
- (a)-ii (b)- i (c)- iv
- (a)-iv (b)-ii (c)-i
What does the following logic diagram represent?

- Synchronous Counter
- Ripple Counter
- Combinational Circuit
- Mod 2 Counter
The hexadecimal equivalent of the binary integer number 110101101 is :
- D24
- 1 B D
- 1 A E
- 1 A D
Perform the following operation for the binary equivalent of the decimal numbers (−14) + (−15) 10 10 The solution in 8 bit representation is :
- 11100011
- 00011101
- 10011101
- 11110011
Match the items in List - I and List - II :

- (a) (b) (c) (ii) (i) (iv)
- (a) (b) (c) (ii) (iv) (iii)
- (a) (b) (c) (iii) (i) (ii)
- (a) (b) (c) (iii) (iv) (ii)
Which of the following mapping is not used for mapping process in cache memory ?
- Associative mapping
- Direct mapping
- Set-Associative mapping
- Segmented - page mapping
Simplify the following using K-map : F(A,B,C,D) = 𝛴 (0,1,2,8,9,12,13) d(A,B,C,D) = 𝛴 (10, 11,14,15) d stands for don't care condition.
- A+ B'D'+BC
- A+ B'D' + B'C'
- A'+ B'C'
- A'+ B'C'+ B'D'
In 8085 microprocessor, what is the output of following program? LDA 8000 H MVI B, 30 H ADD B STA 8001H
- Read a number from input port and store it in memory
- Read a number from input device with address 8000 H and store it in memory at location 8001 H
- Read a number from memory at location 8000 H and store it in memory location 8001 H
- Load A with data from input device with address 8000 H and display it on the output device with address 8001 H
Answer key
- 1 – C
- 2 – D
- 3 – D
- 4 – D
- 5 – B
- 6 – A
- 7 – C
- 8 – A
- 9 – B
- 10 – B
- 11 – B
- 12 – C
- 13 – C
- 14 – D
- 15 – D
- 16 – C
- 17 – D
- 18 – D
- 19 – B
- 20 – A
- 21 – A
- 22 – B
- 23 – C
- 24 – D
- 25 – D
- 26 – B
- 27 – D
- 28 – C
- 29 – B
- 30 – D
- 31 – C
- 32 – D
- 33 – D
- 34 – C
- 35 – A
- 36 – C
- 37 – D
- 38 – A
- 39 – B
- 40 – A
- 41 – A
- 42 – B
- 43 – C
- 44 – B
- 45 – B
- 46 – C
- 47 – A
- 48 – B
- 49 – D
- 50 – C
- 51 – B
- 52 – D
- 53 – D
- 54 – A
- 55 – A
- 56 – C
- 57 – C
- 58 – B
- 59 – B
- 60 – C
- 61 – A
- 62 – C
- 63 – B
- 64 – A
- 65 – D
- 66 – A
- 67 – A
- 68 – D
- 69 – D
- 70 – A
- 71 – B
- 72 – A
- 73 – A
- 74 – A
- 75 – B
- 76 – D
- 77 – A
- 78 – B
- 79 – D
- 80 – A
- 81 – A
- 82 – C
- 83 – B
- 84 – A
- 85 – B
- 86 – A
- 87 – D
- 88 – B
- 89 – D
- 90 – B
- 91 – A
- 92 – D
- 93 – B
- 94 – B
- 95 – D
- 96 – A
- 97 – D
- 98 – D
- 99 – B
- 100 – C



