Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

Exam Revision > Test Series > Flashcards

Test Series Flashcards

Revise imp topics

1
Q

|x + 1| Range and Values (Functions)

A

General Aptitude

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Arithmetic Progression (Sequence and Series)

A

General Aptitude

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Dice face Values from given figure

A

General Aptitude

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Triangles

A

General Aptitude

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Venn Diagram

A

General Aptitude

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Circle and Line Distance on XY Plane

A

General Aptitude

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

under, on, if, to, by, etc… in English

A

General Aptitude

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Area and Perimiter and Pevement of Square Field

A

General Aptitude

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Mirror image and Water image

A

General Aptitude

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Singular noun

A

General Aptitude

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Load Factor and Hash Table

A

Algorithms
link
link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Total 2 input NAND Gate Required in combinational circuits (Ex. Full Subtractor, Adder etc)

A

Digital Logic

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Sorting Algorithms

A

Algorithms
link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Mealy Machine and Moore Machine

A

Digital Logic
link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Predicate Logic

A

Discrete Mathematics

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

ROM

A

Computer Organization
link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

Control Memory and Size calculation

A

Computer Organization

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q

PC (Program Counter)

A

Computer Organization

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
19
Q

Micro Programmed CU

A

Computer Organization
link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
20
Q

STACK implementation LIFO

A

Data Structures

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
21
Q

flags in instructions

A

Computer Organization

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
22
Q

epsilon-NFA

A

Theory of Computation
link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
23
Q

minimum resources required to avoid Deadlock

A

Operating System

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
24
Q

child processes using fork()

A

Operating System

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
25
Q

factors and divisable numbers in given Range

A

General Aptitude

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
26
Q

Indexing and indexfile

A

Database Management
link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
27
Q

unsigned integer

A

Programming in C

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
28
Q

in Unambiguous Grammar and LMD and RMD may not be equal

parse trees can be equal but not derivation

A

Compiler Design

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
29
Q

LL(1) Parser = Top Down Parser
and LL(1) Grammar

A

Compiler Design

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
30
Q

Power of different parser (i.e. LALR > SLR)

A

Compiler Design

link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
31
Q

LR(k) Grammar

A

Compiler Design

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
32
Q

Recursion and Functions

A

Programming in C

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
33
Q

Static variables

A

Programming in C

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
34
Q

Bitwise operators

A

Programming in C

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
35
Q

Ternary Operator (?:)

A

Programming in C

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
36
Q

Time and Space complexity of Linked List searching and different data structures

A

Algorithms

link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
37
Q

DFA and states count and cycles

A

Theory of Computation

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
38
Q

Subnet Mask in IPv4

A

Computer Networks

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
39
Q

base conversion in Numbers

A

Digital Logic

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
40
Q

NFA and Equality

A

Theory of Computation
link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
41
Q

Regular Expressions and it’s Properties, Standard Rules of conversion (star -> plus etc…)

A

Theory of Computation

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
42
Q

User level Threads and Kernel Level Threads.

In case of Computing transparent means functioning without being aware

A

Operating System

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
43
Q

Thread resources Sharing

Stack, Registers, etc…

A

Operating System

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
44
Q

Super Keys permutation from given candidate keys

A

Database Management

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
45
Q

Resulting Rank in Matrix Multiplication.
Rank(AB) <= min(Rank(A), Rank(B))
Linear Algebra.

A

Engineering Mathematics

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
46
Q

bit stuffing

A

Computer Networks

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
47
Q

RISC processor charecteristics

A

Computer Organization
link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
48
Q

Binary Search tree Nodes and Height counting

A

Algorithms
link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
49
Q

Maximum Comparison for Maximum and minimum

Divide and Conquer min max algo

A

Algorithms
link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
50
Q

Conditional Probability and Principle Inclusion Exclusion

A

Engineering Mathematics

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
51
Q

Multiplexers

A

Digital Logic

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
52
Q

Limits using L’hospital’s Rule

Calculus

A

Engineering Mathematics

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
53
Q

Recurrence Relation and Time Complexity in Big O notation

A

Algorithms

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
54
Q

Geometric Progression

A

General Aptitude

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
55
Q

token generation of given C program

A

Compiler Design

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
56
Q

Min, Max-Heap

A

Data Structures

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
57
Q

Predicate Logic English Translation

A

Discrete Mathematics

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
58
Q

Distributive Properties in Quantifiers

A

Discrete Mathematics

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
59
Q

Expected Random Variable Value in Probability

A

Engineering Mathematics

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
60
Q

Preemptive Priority Process Scheduling to find Average WT, TAT, etc…

A

Operating System

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
61
Q

CSMA/CD minimum frame size and bandwidth, etc…

A

Computer Networks

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
62
Q

Array, String and Pointers

A

Programming in C

link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
63
Q

Selective Repeat Protocol

A

Computer Networks

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
64
Q

Boolean Algebra

A

Digital Logic

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
65
Q

IPv4 Header

A

Computer Networks
link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
66
Q

Set Associative Cache and its TAG, SET index and Size calculation

A

Computer Organisation
link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
67
Q

Union, Intersection and Cross Product of DFA

A

Theory of Computation

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
68
Q

Master’s Theorem to solve Recursion Relation

A

Algorithms
link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
69
Q

SDT (Syntax Directed Tree) evaluation

A

Compiler Design
link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
70
Q

Foreign Key and referential integrity

A

Database Management

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
71
Q

Permutations in Arrangement

A

Discrete Mathematics

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
72
Q

Relation between Implication (->) and conjunction (^) operation

A

Discrete Mathematics

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
73
Q

Token bucket algorithm for congestion control

A

Computer Networks
link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
74
Q

Paging, Virtual Address, Page Table Size etc…

A

Operating System
link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
75
Q

Total Concurrent Schedules Possible formula and concept in Transaction Control

A

Database Management
link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
76
Q

Profit Loss

A

General Aptitude

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
77
Q

Angles of Hexagon, Area Triangle (Geometry)

A

General Aptitude

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
78
Q

Combinations in Combinationtorics

A

General Aptitude

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
79
Q

Pie chart in Data interpretation

A

General Aptitude

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
80
Q

Percentage Increase/Decrease

A

General Aptitude

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
81
Q

Number Sets (Z, N, Q, R, etc…)

A

General Aptitude

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
82
Q

Despite of (Idoms and Phrases)

A

General Aptitude

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
83
Q

Clock and Mirror images

A

General Aptitude

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
84
Q

Minimal Cover of Functional Dependencies

A

Database Management

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
85
Q

B-Tree and B+tree and it’s building

A

Data Structures

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
86
Q

the fraction of memory’s total time used in refreshing in DRAM

A

Computer Organization

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
87
Q

AVL Trees and it’s Properties

A

Data Structures
link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
88
Q

CSCAN, FCFS, SSTF in disc cylindar requests

A

Operating System
link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
89
Q

Vertical and Horizontal Microprogramming

A

Computer Organization

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
90
Q

TCP/IP Sessions and Header

A

Computer Networks

https://www.geeksforgeeks.org/services-and-segment-structure-in-tcp/

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
91
Q

Minterms in boolean function

A

Digital Logic

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
92
Q

Find Recurrence relation from given program

A

Algorithms

link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
93
Q

Cache hit and penalty

A

Computer Organization
link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
94
Q

POSET and Boolean Algebra

A

Discrete Mathematics
link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
95
Q

Candidate keys from given Functional dependencies

A

Database Management
link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
96
Q

Properties of Asymptotic Notation

A

Algorithms

link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
97
Q

Page Faults and page replacement policies in various techniques, FCFS, LRU etc… and Belady’s Anamaly

A

Operating System

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
98
Q

inode in UNIX, doubly, singly, direct, indirect pointers and it’s size etc..

A

Operating System
link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
99
Q

Equivalance Relation and Number of possible equivalance relations. Bell Triangle and Bell number

A

Discrete Mathematics

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
100
Q

Greedy approach for File merge

A

Algorithms

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
101
Q

BFS traversal of Graph in Graph Theory

A

Discrete Mathematics
link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
102
Q

Integration using substitution (t dt)

A

Engineering Mathematics

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
103
Q

Difference between Packet Switching and Circuit Switching

A

Computer Networks

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
104
Q

boolean Function minimization

A

Digital Logic

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
105
Q

RR and SR conflict rules in CLR and LALR

A

RR may or may not
SR definetly depends
Compiler design

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
106
Q

inorder, preorder and postorder tree traversal and finding tree

A

Data Structures
link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
107
Q

Possible Subwords of given word in combinatorics

A

Discrete Mathematics
link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
108
Q

Identify Regular Language

A

Theory of Computation
link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
109
Q

Closure (I, +) etc in LR(0) grammar

A

Compiler Design

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
110
Q

Types of Addressing Modes

A

Computer Organization

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
111
Q

2PL and TimeStamp and Conflict Serializability in Deadlock

A

Database Management
link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
112
Q

ALOHA and Slotted ALOHA channel

A

Computer Networks

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
113
Q

Stop and Wait ARQ protocol

A

Computer Networks
link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
114
Q

Modified Quick Sort

A

Algorithms
link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
115
Q

Safe Unsafe States Banker’s algorithm and Deadlock

A

Operating System

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
116
Q

Greedy Approach in Job scheduling profit and deadline

A

Algorithms

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
117
Q

LCM and HCF

A

General Aptitude

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
118
Q

Root equation and it’s properties. (b^2-4ac)

A

General Aptitude
link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
119
Q

Hexagon, Triangle, Square… inscribed in circle

A

General Aptitude

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
120
Q

use of trignometry in angle of alivation etc… tower, mountain…

A

General Aptitude

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
121
Q

digit in units place and ten’s place etc…

A

General Aptitude

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
122
Q

Insersion, deletion and traversal of Singly linked list

A

Data Structures

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
123
Q

cache mapping methods

A

Computer Organization

link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
124
Q

Decidable and Undecidable Properties

A

Theory of Computation

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
125
Q

Index types (clustering, primary, secondary)

A

Database Management
link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
126
Q

ICMP, IGMP, OSPF, UDP common property

A

Computer Network

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
127
Q

Vertex coloring in graph theory

Chromatic index != chromatic number

A

Discrete Mathematics

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
128
Q

isomorphic graphs in graph theory

A

Discrete Mathematics

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
129
Q

Instruction Register(IR) and it’s properties

A

Computer Organization

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
130
Q

Recursive and Iterative Program properties

A

Programming in C

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
131
Q

Eulerian Circuit in Graph theory

A

Discrete Mathematics

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
132
Q

Flip Flop and Synchronization

A

Digital Logic

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
133
Q

floating point representation

A

Digital Logic

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
134
Q

First and Follow of a Variable in Given Grammar

A

Compiler Design

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
135
Q

Maxterms of a boolean function from given K-Map

A

Digital Logic

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
136
Q

Closure Properties of All languages

A

Theory of Computation

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
137
Q

Closure in functional dependency

A

Database Management
link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
138
Q

Possible Spanning Trees and cayley’s theorem

A

Algorithms
link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
139
Q

inverse of matrix

A

Engineering Mathematics

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
140
Q

SNMP, TFTP, BOOTP, RIP common property

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
141
Q

Sum of degree theorem in Graph Theory

A

Discrete Mathematics
link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
142
Q

Program Counter increment values based on instruction size

A

Computer Organization

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
143
Q

Rank, Nullity and Column space of Matrix

A

Engineering Mathematics

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
144
Q

DNS, IMAP, POP3, FTP, TELNET, HTTP, SMTP

A

Computer Networks

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
145
Q

Disk time read write

A

Computer Organization
link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
146
Q

Subnetting in CIDR (classless)

A

Computer Networks

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
147
Q

dependency and hazards in Pipelining

A

Computer Organization
link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
148
Q

Minimum Spanning Tree Algorithms

A

Algorithms
link
link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
149
Q

Prefix conversion of expression

A

Data Structures

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
150
Q

ICMP

A

Computer Networks

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
151
Q

Functionaly Complete Set

A

Digital Logic
link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
152
Q

Compound Interest

A

General Aptitude

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
153
Q

Time and Work

A

General Aptitude

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
154
Q

Trignometry Equations

A

General Aptitude
link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
155
Q

Time, Distance, Speed of Boats and streams

A

General Aptitude

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
156
Q

Synnonyms and Antonyms

A

General Aptitude

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
157
Q

Centroid of triangle

A

General Aptitude
link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
158
Q

Clock and Angles between hands

A

General Aptitude

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
159
Q

Flip Flop Tables

A

Digital Logic

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
160
Q

Inplace and stability of sorting algorithms

A

Algorithms

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
161
Q

Possible binary trees from n unlabled or labled nodes

A

Data Structures
link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
162
Q

Semaphore

A

Operating System

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
163
Q

Refinement of Set

A

Discrete Mathematics
link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
164
Q

Code optimization techniques

A

Compiler Design
link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
165
Q

Time required for a program to get executed given cycle per instruction and Clock Rate

A

Computer Organization
link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
166
Q

Solution of the system of equation

A

Engineering Mathematics
link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
167
Q

Modified Shift Register

A

Digital Logic

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
168
Q

DCFL, CFL recognization

A

Theory of Computation

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
169
Q

Structures

A

Programming in C

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
170
Q

Multiplexer requirement to generate n variable boolean function

A

Digital Logic
link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
171
Q

Huffman Encoding

A

Algorithms
link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
172
Q

Ripple counter and other counters

A

Digital Logic
link
link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
173
Q

Turing Machine properties, decidable and undecidable, Countable and uncountable

A

Theory of Computation
link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
174
Q

Total Number of Onto and Into, one-one, Bijection functions possible on set

A

Discrete Mathematics
link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
175
Q

Lattice, complete lattice, total order, distributable etc…

A

Discrete Mathematics

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
176
Q

Cycle count in pipelining using operand forwarding

A

Computer Organization
link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
177
Q

Continuity and Differentiability of function

A

Engineering Mathematics

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
178
Q

IEEE standard floating point representation in single(1.8.23) and double(1.11.52)

A

Digital Logic
link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
179
Q

Minimum temporary variable count in normal vs Single assignment form

IMP

A

“in single assignment form every expression will have its own register/variable.”
Compiler Design
link
link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
180
Q

Polling in Transmission

A

Computer Networks
(page 1)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
181
Q

Push Down Automata

A

Theory of Computation
link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
182
Q

Randomized exponential backoff

A

Computer Networks

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
183
Q

Bipertite Graphs

A

Discrete Mathematics

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
184
Q

Interrupt Driven Input/Output

A

Computer Organisation
link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
185
Q

“Even though” and it’s usage

A

General Aptitude

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
186
Q

Dining philosopher, Starvation and Deadlock

A

Operating System
link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
187
Q

Group By clause and Having in SQL

A

Database Management
link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
188
Q

DFS Forward edge, back edge, tree edge and cross edge of traversal

A

Algorithms
link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
189
Q

Identifying Recursive Languages

A

Theory of Computation

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
190
Q

SQL and Relational Algebra differences

A

Database Management

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
191
Q

Best Fit, Worst Fit, Next Fit, First Fit in partition scheme

A

Operating System

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
192
Q

Properties of Inverse of Matrix

A

Engineering Mathematics
link

193
Q

Relocation, Scope resolution, parsing in Compiler

A

Compiler Design

194
Q

unique literal count in boolean function

A

Digital Logic

195
Q

Rank nullity theorem

A

Engineering Mathematics
link

196
Q

Link State Routing

A

Computer Networks
link

197
Q

Sparse wighted undirect graph minimum spanning tree algorithm using minheap

A

Algorithms

198
Q

Undirected graph to Acyclic directed graph conversion how many ways

A

Discrete Mathematics
link

199
Q

Insertion sort worst case properties

A

Algorithms

200
Q

use of ALL, EXIST in SQL

A

Database Management

201
Q

Weighted and Non-weighted binary code formats. i.e. BCD, XS3, 2’sComp, 1’sComp etc..

A

Digital Logic

202
Q

Concave and Convex Functions

A

Engineering Mathematics

203
Q

Relative Addressing Mode

A

Computer Organization
link

204
Q

Cardinality of subset

A

Discrete Mathematics

205
Q

Pigeon Hole Principle

A

Discrete Mathematics
link

206
Q

Line Graph Concept in Graph Theory

A

Discrete Mathematics

207
Q

Deadlock Prevention or avoidance techniques

A

Operating System
link

208
Q

ER diagram and Relational model properties

A

Database Management
link

209
Q

Calendar Same Year repeat (2003-2014)

A

General Aptitude

210
Q

Sequence missing number find IQ

A

General Aptitude

211
Q

Directions

A

General Aptitude

212
Q

Recoverable, Strict Recoverable and Irrecoverable Schedules

A

Database Management
link

213
Q

Identifying Ambiguous grammar

A

Theory of Computation
link

214
Q

Total Spanning Tree for Bipartite Complete Graphs K3,3

A

Discrete Mathematics
link

215
Q

Interrupt I/O and Programmed I/O

A

Computer Organization

216
Q

Normalization of Functional Dependency
1NF, 2NF, 3NF, BCNF

A

Database Management

217
Q

Countable and Uncountable, finite and infinite set

A

2^n = not countable
Theory of Computation
link

218
Q

Write through, write back ,inclusion property in L-cache architecture

A

Computer Organization
https://www.geeksforgeeks.org/write-through-and-write-back-in-cache/
If all blocks in the higher level cache are also present in the lower level cache, then the lower level cache is said to be inclusive of the higher

219
Q

DBA in Subnetting and IP addresses

A

Computer Networks

220
Q

Limit of Summation technique

A

Engineering Mathematics

221
Q

Pumping Lemma, Kleene’s Theorem and DCFL

A

Theory of Computation

222
Q

There Exist Unique (E!) in Quantifiers

A

Discrete Mathematics

223
Q

Joins in SQL and Relational Algebra

A

Database management
link

224
Q

Removal of Static Hazard in boolean function

A

Digital Logic
link

225
Q

Properties of Relation (reflexive, transitive,…)

A

Discrete Mathematics

226
Q

Unicast, Multicast and Broadcast addresses in MAC address

A

Computer Networks

227
Q

Degree of Multiprogramming

A

Operating System

228
Q

Total BST possible Formula derivation using recurrence

A

Data Structures

229
Q

Maximum reduce moves by a bottom up parser for a grammar with no epsilon and unit production for n tokens

A

n - 1
Compiler Design
link

230
Q

Perimeter of given shape

A

General Aptitude

231
Q

cyclic quadrilateral

A

General Aptitude

232
Q

Contradictory usage of “while” in English

A

General Aptitude

233
Q

incidence matrix of given graph and it’s Rank

A

Discrete Mathematics

234
Q

Repeater and Hub difference

A

Computer Networks
GFG

235
Q

Classfull IPv4

A

Computer Networks

236
Q

Best sorting algorithm for Linked List

A

Merge Sort
Algorithms.

237
Q

Asymptotic comparison between greater value of functions

A

Algorithms
Ex. logn < n

238
Q

Rotations in AVL tree (self balancing Binary Search Tree)

A

Algorithms
link

239
Q

Difference between Array and Linked List

A

Data Structures

240
Q

Overflow conditions in 2’s compliment binary add sub operation

A

Digital Logic

241
Q

Functionalities of Linker and Loader

A

Compiler Design
link

242
Q

Recurrence relation of a kind:
T(&n) + T((1-&)n) + n

& = Alpha

A

nlogn (base = min(recip(&), recip(1-&))
Algorithms

243
Q

Dual of a function

A

Digital Logic
link

244
Q

lossless and dependency preserving decomposition

A

Database Management

245
Q

Mixture and Alligation

A

General Aptitude
link

246
Q

Simple Interest

A

General Aptitude

247
Q

Train speed and distance

A

General Aptitude

248
Q

Longest Common Subsequence

A

Algorithms

249
Q

Perfect Matching, Maximum Matching, Vertex Cover in Graph

A

Discrete Mathematics

link

250
Q

Control Flow Graph

A

Computer Organization

251
Q

Error Detection

A

Computer Network

252
Q

Parenthisation to minimize matrix multiplication

A

Divide from smallest
Algorithms

253
Q

Deletion of root node in binary search tree

A

Data Structures

254
Q

Viable Prefix

A

Compiler Design
link

255
Q

Speed up in pipelining

A

Computer Organization
link

256
Q

Port Numbers of Application Layer Protocols

A

Computer Networks
link

257
Q

Correct/Incorrect binary search sequence

A

Data Structure

258
Q

L U Decomposition

A

Engineering Mathematics
link

259
Q

Cut edge, Cut vertex and Articulation Point in Graph Theory

A

Discrete Mathematics

260
Q

Knapsack problem

A

Algorithms

261
Q

Poisson Distribution

A

Engineering Mathematics

262
Q

biconnected graph

A

Discrete Mathematics

263
Q

Strongly Connected Graph and Components

A

Discrete Mathematics

264
Q

increment decrement (++) (–) operator

A

Programming in C

265
Q

Count to infinity problem, Path Vector, Poison reverse, Distance Vector Routing, Split horizon

A

Computer Networks

266
Q

Planar simple connected graph face, edge, vertices formula

A

R + V = E + 2
R + V = E + K + 1
Discrete Mathematics

267
Q

Tautology and Contradiction.

A

Discrete mathematics

268
Q

Conflict Serializable and View Serializable

A

Database Management

269
Q

Orthogonal Matrix

A

Engineering Mathematics

270
Q

Offset need to return to the loop in instructions of 4 Bytes

A

Computer Organization

271
Q

Quadratic Probing in Hash table

A

Data Structures

272
Q

TLB, Physical Address, Virtual Address, Page

A

Operating System

273
Q

implicants, Prime implicants, Essential Prime implicants

A

Digital Logic
link

274
Q

Chomsky normal form

A

2n - 1
Compiler Design
link

275
Q

Area of Octagon, Trapezium

A

General Aptitude

276
Q

Tournament Graph

A

Discrete Mathematics

277
Q

Bridge and it’s Properties

A

Computer Networks
link

278
Q

Eigen values and Eigen Vectors, Liearly independent eigen vectors

A

Engineering Mathematics
link

279
Q

Turing identifiable/Recognizable = REL
Turing decidable = REC

A

Theory of Computation

280
Q

Static and Dynamic Scoping of variable

A

Programming in C

281
Q

Row major order and Column major order

A

No one is better but there are differences.
Data Structures
link

282
Q

Adjacency list and matrix differences in Graph

A

Discrete Mathematics
link

283
Q

Primary clustering and secondary clustering in hashing

A

Algorithms

link

284
Q

Linear probing, Quadratic probing and Double hashing

A

Algorithms

285
Q

Difference between OSPF and RIP

A

Computer Networks

286
Q

cache tag directory with extra bits

A

Computer Organization

287
Q

Page Replacements and Fault time

A

Operating System
link

288
Q

Balanced Parentheses is DCFL and can be recognized by DPDA

A

Theory of Computation

289
Q

Difference between DCFL and CFL

A

Theory of Computation
link

290
Q

Context Sensitive Grammar Identification

A

Theory of Computation

291
Q

Distribution Problem in Permutation and Combination

A

Discrete Mathematics

292
Q

Logarithms

A

General Aptitude

293
Q

Area and Volume of 3D objects

A

General Aptitude

294
Q

Gerund, Possesive Case

A

English
General Aptitude

295
Q

Strongly Connected Components in Directed Graph

A

Discrete Mathematics
link

296
Q

Discovery time and finish time in graph traversal of node

A

Discrete Mathematics

297
Q

Greibach Normal Form

A

Compiler Design
link

298
Q

Register Calculation in RISC processor

A

Computer Organization
link

299
Q

convert invalid radix using correction number

A

Digital Logic

300
Q

CRC reminder calculation

A

Computer Networks
link

301
Q

Radix Sort and Counting Sort

A

Algorithms

link

302
Q

Tuple Calculus

A

Database Management
link

303
Q

Possible Candidate Key Based on given Relation instance

A

Must not contain duplicate values
Database Management

304
Q

Micro operations involving MBR, MAR, PC, IR

A

Computer Organization

305
Q

Associativity and Priority of Operators in Grammar

A

Compiler Design

306
Q

Division Operator in Relational Algebra

A

Database Management

307
Q

TCP Additive Increase Multiplicative Decrease (AIMD)

A

Computer Networks

link

308
Q

Dijkstra’s Algorithm

A

Algorithms
link

309
Q

optimal page replacement Algorithm

A

Operating System

310
Q

use of different bits in page replacement in Demand paging

A

Operating System

311
Q

Upper and Lower bound of Poset in Hasse diagram

A

Discrete Mathematics

312
Q

DAG Representation of given arithmetic register operations

A

Computer Organization

313
Q

Compulsory, Conflict, Capacity Miss in cache

A

Computer Organization

314
Q

Diagonalization of a Matrix

A

Engineering Mathematics

315
Q

Blood Relation

A

General Aptitude

316
Q

How many squares, Rectangles, Triangles in given image

A

General Aptitude

317
Q

integration of |x^2 - 4| over given range.

A

Engineering Mathematics

318
Q

Closure with operations with Regular languages on other language.
i.e. DCFL ^ REG

A

Theory of Computation

319
Q

LL(1) parsing table possible size. (given Variable and Terminal Count)

A

Compiler Design

320
Q

Memory Partition and Pointer Size

A

Operating System

321
Q

Back off Race and Win probability in Ethernet

A

Computer Networks

322
Q

in IPv4 packet Number of Interfaces between 2 hosts given n routers

A

Computer networks
link

323
Q

Counting of Neutral Functions

A

Digital Logic
link

324
Q

number of Myhil Nerode equivalence class of given language

A

DFA states
Theory of Computation
link

325
Q

Postfix Expression Evaluation

A

Data Structures
link

326
Q

Determinant and Adjoint properties of Matrix

A

Engineering Mathematics

327
Q

Disk Size based on Sectors, Track, platter etc…

A

Operating System
link

328
Q

Stack Pointer Register

A

Computer Organization

329
Q

CRC Generator and error polynomials

A

Computer Networks
link

330
Q

CPU Enhancement and speed up (Amdhal’s Law)

A

Computer Organization
link

331
Q

Hamming distance and possible error detection

A

Computer Networks
link

332
Q

Conflict Equivalant Schedules

A

Database Management

333
Q

Peterson’s Solution in Deadlock

A

Operating System
link

334
Q

Averages

A

General Aptitude

335
Q

Remove epsilon productions from given grammar

A

Compiler Design

336
Q

LBA, DBA and Loopback address functions and IP addresses

A

Computer Networks

337
Q

Identify given Turing Machine and which language does given TM recognizes

A

Theory of Computation
link

338
Q

NIC Network interface card bits in ethernet network

A

48 bits
Computer Networks

339
Q

Recurrence Relation Solving in Mathematics

A

Discrete Mathematics

340
Q

Address Resolution Protocol (ARP)

A

Computer Networks
link

341
Q

3 Address code output and memory location of perticular instruction

A

Compiler Design

342
Q

Operator Grammar given and evaluate given expression based on associativity and priority

A

Compiler Design
concept
example

343
Q

Possible View equal serial schedules

A

Database Management

link
link

344
Q

Stalls and branch penalty in pipeline due to branch instruction and hazards

A

Computer Organization

345
Q

Difference between Level, Height, and Depth in Tree Data Structure

A

L = H + 1
H = D (in reverse)
Data Structures

346
Q

Stack and Queue Operations

A

Data Structures

347
Q

Multiplexers required to generate equivalent bigger multiplexer
i.e. 8x1 to 256x1

A

Ceil((256-1)/(8-1)) = 37
Digital Logic

348
Q

Right Circular Cone in Cube. volume and area etc…

A

General Aptitude

349
Q

Switch from user mode to kernel mode in which cases…

A

Operating System
link

350
Q

TCP header given and find total number of IP fragments in given MTU

A

Computer Networks

351
Q

Minimum, Maximum and Some fixed standard values in IEEE floating point representation standard

A

Digital Logic

352
Q

Time complexity of Matrix chain multiplication, Bellman-ford sspath, Floyd Warshall, Dijkstra

A

Algorithms

link

353
Q

Satisfiable Boolean Expression

A

Discrete Mathematics

354
Q

Permutations in circular Table

A

Discrete Mathematics
link

355
Q

Addressing modes required in Relocation

A

Computer Organization

356
Q

static and dynamic branch prediction in pipelining

A

Computer Organization

357
Q

Topological Ordering and Sort in Graph

A

Algorithms

link

358
Q

Skewed Full binary tree and it’s maximum height possible given n nodes.

A

Data Structures

359
Q

Unit’s Place and cyclicity

A

General Aptitude

360
Q

Expected Number of inversions in Array

A

Data Structures

link

361
Q

identify which language does given PDA accepts

A

Theory of Computation

362
Q

Size of the ROM required to store table of multiplication, addition of n bit numbers

A

Computer Organization

363
Q

Pairwise Disjoint Subsets

A

Discrete Mathematics

364
Q

Limitations of Relational Algebra

A

Database Management

365
Q

Determining if given language is Recursively Enumerable or not.
Rice’s Theorem (superset of language should have equal or more cardinality)

A

Theory of Computation

366
Q

If block size is not given take it equal to word size.
If word size not given then take is equal to 1 Byte.
in Cache specification.

A

Computer Organization

367
Q

making Decoder using MUX, AND gate, OR gate.
or minor Decoder. (i.e. 4X8 using 2X4 etc.)

A

Digital Logic
link

368
Q

Number of Edge Disjoint Hamiltonian Cycles in a complete Kn graph.

A

Discrete Mathematics.

link

369
Q

Formula to find Expected number of dice rolls required to get n consecutive 6’s

A

Engineering Mathematics
LINK

370
Q

Independence number of given graph

A

Discrete Mathematics

link

371
Q

Use of DISTINCT in SQL

A

Database Management System

372
Q

Bitmap Approach in file System management

A

1 bit for each disk block.
Computer Organization

373
Q

Equalities (<, >, <=, >=, ==)

A

General Aptitude

374
Q

Paper Fold and Pattern cutout

A

General Aptitude

375
Q

Quatient Operation (/ division by language)
Regular / any lang = Regular

A

Theory of Computation

link

376
Q

Persistent and Non persistent HTTP connection.

A

Computer Networks
link

377
Q

2-3 Tree and insertion and deletion of a node

A

Data Structures

378
Q

minimal SOP and POS expression using K-map of given function.

A

Digital Logic

379
Q

number of 1:2 DEMUX required to create
1:64 DEMUX

A

Digital Logic

380
Q

Packet Filter Firewall and filtering table

A

Computer Networks
link

381
Q

Self Complimentary BCD code

A

sum = 9 (2421, 5211, etc…)
Digital Logic

382
Q

TCP and congestion window and avoidance algorithm(additive)

A

Computer Networks

383
Q

Many-one, one-one different indications in ER diagram

A

Database Management

384
Q

Binomial Expansion (a+b)^n

A

Discrete Mathematics

385
Q

Logic Inference in Predicate Logic

A

Discrete Mathematics

386
Q

Group Properties and operations

A

Discrete Mathematics

387
Q

Cube painting and cutting and finding 3 side colored, 1 side colored, 2 side colored, and non colored cubes.

A

General Aptitude

388
Q

Extern keyword and linker error

A

Programming in C

389
Q

DNS, DHCP, RIP use UDP.
HTTP use TCP

A

Computer networks

390
Q

minimum pumping length and infinite closure of Regular Languages

A

Theory of Computation

391
Q

use of “LIKE” in SQL

A

Database Management

392
Q

Complete Graph, hyper cube graph, Cycle Graph, Wheel Graph

A

Discrete Mathematics

393
Q

AND, OR, XOR etc on given Function Minterms. i.e. E(0,1,2,5)

A

Digital Logic
link

394
Q

Process Scheduling having I/O time.

A

Operating System

link

395
Q

Longest Remaining Time and Shortest Remaining Time first in Process Scheduling

A

Do calculations in time units of ‘1’ (i.e. 0 - 1- 2- 3 etc…)
Operating System

396
Q

Temporal Locality and Spatial Locality and Hit Rate in Cache Specification

A

Computer Organization

link

397
Q

if LL(k) for k >= 2 but not LL(1) then G is in….
Left Recursion or Left Factoring?

A

Left Factoring.
Theory of Computation

398
Q

Total Possible Subgraph of given Graph

A

Discrete Mathematics
link
link

399
Q

Total Possible parse trees of given grammar for given string (i.e. “aaaa”)

A

Theory of Computation
link

400
Q

Possible Comparisons while merging 2 lists of distinct integers

A

Algorithms

401
Q

BST operation cummutative properties

A

Neither insertion nor deletion is cummutative in a BST.
Data Structures

402
Q

Precedence of “++” and “*”

A

++ > *
Programming

403
Q

Split Given CIDR IP address into many different IP address each requiring different amount of hosts

A

Computer Networks
link

404
Q

Multilevel Feedback queue scheduling

A

Operating System

405
Q

Priority Inversion in Deadlock

A

Operating System
link
link

406
Q

Child Process Properties when created by Fork() call.

A

Operating System
link

407
Q

Go Back N ARQ

A

Computer Networks

link

408
Q

Number of States in DFA having exactly, atleast, atmost n, m a’s, b’s etc…

A

Theory of Computation

409
Q

Union operation of Any language with Regular Language

A

Theory of Computation

410
Q

Exponential distribution of Random variable Probability

A

Engineering Mathematics

link

411
Q

Time Complexity of Every common algorithms (i.e., LCS, TOH, Merge Sort, Heapify, etc…)

A

Algorithms

412
Q

Segmented Paging

A

Operating System
link

413
Q

Instruction Halt and return address pushed to stack

A

Computer Organization
link

414
Q

Cycle Prime implicant K-map

A

Digital Logic

415
Q

Given set of instructions with different stage cycles in pipeline. Find total cycles required to execute all.

A

Computer Organization

416
Q

Removal of Left Recursion. in normal, S-attributed and SDT grammar

A

Theory of Computation
link

417
Q

Integer sum problem in distribution

A

C(n+r-1,r)
Discrete Mathematics

418
Q

Circle incribed in Triangle find radius. etc…

A

General Aptitude

419
Q

Grammar with no termination do not generate any string.
i.e. empty language

A

Theory of Computation

420
Q

Maximum, Minimum in floating point representation

A

S = 0|1
BE = 11111110
M = all 1’s
Computer Organization

link

421
Q

Weak entity and identifying relationship in ER diagram

A

Database Management

link

422
Q

decimal numbers that can not be represented in finite binary bits.

A

0.2, 0.3 etc…
Digital Logic

423
Q

iterative summation = Sigma
iterative multiplication = Pie

A

Engineering Mathematics

424
Q

Necessary condition for Deadlock

A

Operating System

425
Q

use of Aggregate functions in SQL

A

Database Management

426
Q

use of EXCEPT in SQL

A

Set difference (A - B)
removes duplicate as it is set
Database Management

link

427
Q

Types of errors,
Lexical, Syntax, Semantic, Logical, etc

A

Compiler Design

428
Q

Free List method in disk block addressing in one block of disk etc…

A

Operating System

429
Q

Endian-ness mechanisms (little endian, big endian) when required? and CPU interfaced with how many cells of memory based on it’s word configuration(i.e. 32 bit or 64 bit or anything else.)

A

Computer Organization

430
Q

Conditional Probability based on Truth Lie

A

Engineering Mathematics

link

431
Q

difference between number of HTTP connection required for some web page having some objects in Persistent vs Non persistent HTTP

A

Computer Networks

432
Q

mod 10 ripple counter

A

Digital Logic
link

433
Q

various pointer runtime errors… dangling pointer, memory leak, invalid value excess of freed variable

A

Programming in C

434
Q

Shared Exclusive lock and 2PL

A

Database Management
link

435
Q

3 address code implimentation forms

A

Compiler Design

436
Q

find nth smallest element in Minheap

A

Algorithms
link

437
Q

Generating Functions

A

Discrete Mathematics
link

438
Q

Tower of Hanoi Problem

A

Algorithms

439
Q

Properties of Idempotent Matrix

A

Engineering Mathematics

link

440
Q

Difference between with and without operand forwarding in cycles

A

Computer Organization

441
Q

Derangement problem in permutation

A

Discrete Mathematics
link

442
Q

Stateful and Stateless protocol

A

Computer Networks
link

443
Q

Hamming coded message parity bit detect

A

Computer Networks

link

444
Q

Glitch Delay while using different delayed logic operators.
i.e. and = 4ms, not = 1ms etc…

A

Digital Logic

445
Q

Explicit I/O instruction and memory-mapped I/O instruction

A

Computer Organizaton

446
Q

Number of Min heaps possible with n distinct keys

A

Data Structures
link

447
Q

Minima Maxima of function

A

Engineering Mathematics

448
Q

Identify if given configuration is turing recognizable or not

A

Theory of Computation

449
Q

Stalls and Cycles calculation in branch instruction and prediction

A

Computer Organizaton
link

450
Q

Liveness analysis in block diagram

A

Compiler Design
link

451
Q

Sequential feedback circuits

A

Digital Logic

452
Q

Gray code

A

Digital Logic

453
Q

Compement of an element in lattice

A

Discrete Mathematics

454
Q

switch case properties

A

Programming in C

455
Q

DMA and cycle stealing

A

Computer Organization

456
Q

Divisible by 8 (to consider byte) in IPv4 fragmentation

A

Computer Networks
link

457
Q

Booth’s Algorithm for multiplication

A

Computer Organization

458
Q

Equivalance class and Partitions

A

Discrete Mathematics
link

459
Q

Latency in associative and direct mapped cache using mux and comparator

A

Computer Organization

460
Q

Sliding Window protocol

A

Computer Organization

461
Q

Operator Grammar

A

Compiler Design

462
Q

Hop count in given packet switching network specification

A

Computer Networks

463
Q

Expected Time to search/insert/delete in hash table

A

Data Structures

464
Q

Relocation sequence performed by relocation loader

A

Compiler Design

link

465
Q

Fermat’s Little Theorem and Mod function

A

General Aptitude
link

466
Q

Primitive and Derived Instructions specifications given and find number of possible instructions.
Expand opcode technique

A

Computer Organization
link

467
Q

Expected number in binomial Distribution probability = n * p

A

Engineering Mathematics
link

468
Q

count of Diagonals in any polygon

A

n(n-3)/2
General Aptitude

469
Q

Work of stages in compiler

A

Compiler Design

470
Q

eular totient function

A

Discrete Mathematics

471
Q

Array and Page Faults

A

Operating System

472
Q

cyclic group and subgroup

A

Discrete Mathematics
link
link

473
Q

Largest Denormalized Sub Normal Value

A

Computer Organization

474
Q

Internal and External Fragmentation in Paging

A

Operating System
link

475
Q

edge trigger effect in ripple up/down counter

A

Digital Logic

476
Q

Extra tag space required in given cache configuration

A

Computer Organization

477
Q

Eigen Value Properties for matrix power and adjoint, and inverse…

A

Engineering Mathematics
link

478
Q

Stack size calculation for recursive function successfully run on maximum n input

A

Algorithms

479
Q

Public Key Cryptography

A

Computer Networks
link

Exam Revision (4 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions