Test Series Flashcards
Revise imp topics
|x + 1| Range and Values (Functions)
General Aptitude
Arithmetic Progression (Sequence and Series)
General Aptitude
Dice face Values from given figure
General Aptitude
Triangles
General Aptitude
Venn Diagram
General Aptitude
Circle and Line Distance on XY Plane
General Aptitude
under, on, if, to, by, etc… in English
General Aptitude
Area and Perimiter and Pevement of Square Field
General Aptitude
Mirror image and Water image
General Aptitude
Singular noun
General Aptitude
Total 2 input NAND Gate Required in combinational circuits (Ex. Full Subtractor, Adder etc)
Digital Logic
Predicate Logic
Discrete Mathematics
Control Memory and Size calculation
Computer Organization
PC (Program Counter)
Computer Organization
STACK implementation LIFO
Data Structures
flags in instructions
Computer Organization
minimum resources required to avoid Deadlock
Operating System
child processes using fork()
Operating System
factors and divisable numbers in given Range
General Aptitude
unsigned integer
Programming in C
in Unambiguous Grammar and LMD and RMD may not be equal
parse trees can be equal but not derivation
Compiler Design
LL(1) Parser = Top Down Parser
and LL(1) Grammar
Compiler Design
Recursion and Functions
Programming in C
Static variables
Programming in C
Bitwise operators
Programming in C
Ternary Operator (?:)
Programming in C
Time and Space complexity of Linked List searching and different data structures
Algorithms
DFA and states count and cycles
Theory of Computation
Subnet Mask in IPv4
Computer Networks
base conversion in Numbers
Digital Logic
Regular Expressions and it’s Properties, Standard Rules of conversion (star -> plus etc…)
Theory of Computation
User level Threads and Kernel Level Threads.
In case of Computing transparent means functioning without being aware
Operating System
Thread resources Sharing
Stack, Registers, etc…
Operating System
Super Keys permutation from given candidate keys
Database Management
Resulting Rank in Matrix Multiplication.
Rank(AB) <= min(Rank(A), Rank(B))
Linear Algebra.
Engineering Mathematics
bit stuffing
Computer Networks
Conditional Probability and Principle Inclusion Exclusion
Engineering Mathematics
Multiplexers
Digital Logic
Limits using L’hospital’s Rule
Calculus
Engineering Mathematics
Recurrence Relation and Time Complexity in Big O notation
Algorithms
Geometric Progression
General Aptitude
token generation of given C program
Compiler Design
Min, Max-Heap
Data Structures
Predicate Logic English Translation
Discrete Mathematics
Distributive Properties in Quantifiers
Discrete Mathematics
Expected Random Variable Value in Probability
Engineering Mathematics
Preemptive Priority Process Scheduling to find Average WT, TAT, etc…
Operating System
CSMA/CD minimum frame size and bandwidth, etc…
Computer Networks
Selective Repeat Protocol
Computer Networks
Boolean Algebra
Digital Logic
Union, Intersection and Cross Product of DFA
Theory of Computation
Foreign Key and referential integrity
Database Management
Permutations in Arrangement
Discrete Mathematics
Relation between Implication (->) and conjunction (^) operation
Discrete Mathematics
Total Concurrent Schedules Possible formula and concept in Transaction Control
Database Management
link
Profit Loss
General Aptitude
Angles of Hexagon, Area Triangle (Geometry)
General Aptitude
Combinations in Combinationtorics
General Aptitude
Pie chart in Data interpretation
General Aptitude
Percentage Increase/Decrease
General Aptitude
Number Sets (Z, N, Q, R, etc…)
General Aptitude
Despite of (Idoms and Phrases)
General Aptitude
Clock and Mirror images
General Aptitude
Minimal Cover of Functional Dependencies
Database Management
B-Tree and B+tree and it’s building
Data Structures
the fraction of memory’s total time used in refreshing in DRAM
Computer Organization
Vertical and Horizontal Microprogramming
Computer Organization
TCP/IP Sessions and Header
Computer Networks
https://www.geeksforgeeks.org/services-and-segment-structure-in-tcp/
Minterms in boolean function
Digital Logic
Page Faults and page replacement policies in various techniques, FCFS, LRU etc… and Belady’s Anamaly
Operating System
inode in UNIX, doubly, singly, direct, indirect pointers and it’s size etc..
Operating System
link
Equivalance Relation and Number of possible equivalance relations. Bell Triangle and Bell number
Discrete Mathematics
Greedy approach for File merge
Algorithms
Integration using substitution (t dt)
Engineering Mathematics
Difference between Packet Switching and Circuit Switching
Computer Networks
boolean Function minimization
Digital Logic
RR and SR conflict rules in CLR and LALR
RR may or may not
SR definetly depends
Compiler design
Closure (I, +) etc in LR(0) grammar
Compiler Design
Types of Addressing Modes
Computer Organization
ALOHA and Slotted ALOHA channel
Computer Networks
Safe Unsafe States Banker’s algorithm and Deadlock
Operating System
Greedy Approach in Job scheduling profit and deadline
Algorithms
LCM and HCF
General Aptitude
Hexagon, Triangle, Square… inscribed in circle
General Aptitude
use of trignometry in angle of alivation etc… tower, mountain…
General Aptitude
digit in units place and ten’s place etc…
General Aptitude
Insersion, deletion and traversal of Singly linked list
Data Structures
Decidable and Undecidable Properties
Theory of Computation
ICMP, IGMP, OSPF, UDP common property
Computer Network
Vertex coloring in graph theory
Chromatic index != chromatic number
Discrete Mathematics
isomorphic graphs in graph theory
Discrete Mathematics
Instruction Register(IR) and it’s properties
Computer Organization
Recursive and Iterative Program properties
Programming in C
Eulerian Circuit in Graph theory
Discrete Mathematics
Flip Flop and Synchronization
Digital Logic
floating point representation
Digital Logic
First and Follow of a Variable in Given Grammar
Compiler Design
Maxterms of a boolean function from given K-Map
Digital Logic
Closure Properties of All languages
Theory of Computation
inverse of matrix
Engineering Mathematics
SNMP, TFTP, BOOTP, RIP common property
Computer Networks
(Page4)
https://www.geeksforgeeks.org/protocols-application-layer/
Program Counter increment values based on instruction size
Computer Organization
Rank, Nullity and Column space of Matrix
Engineering Mathematics
DNS, IMAP, POP3, FTP, TELNET, HTTP, SMTP
Computer Networks
Subnetting in CIDR (classless)
Computer Networks
Prefix conversion of expression
Data Structures
ICMP
Computer Networks
Compound Interest
General Aptitude
Time and Work
General Aptitude
Time, Distance, Speed of Boats and streams
General Aptitude
Synnonyms and Antonyms
General Aptitude
Clock and Angles between hands
General Aptitude
Flip Flop Tables
Digital Logic
Inplace and stability of sorting algorithms
Algorithms
Semaphore
Operating System
Time required for a program to get executed given cycle per instruction and Clock Rate
Computer Organization
link
Modified Shift Register
Digital Logic
DCFL, CFL recognization
Theory of Computation
Structures
Programming in C
Turing Machine properties, decidable and undecidable, Countable and uncountable
Theory of Computation
link
Total Number of Onto and Into, one-one, Bijection functions possible on set
Discrete Mathematics
link
Lattice, complete lattice, total order, distributable etc…
Discrete Mathematics
Continuity and Differentiability of function
Engineering Mathematics
IEEE standard floating point representation in single(1.8.23) and double(1.11.52)
Digital Logic
link
Minimum temporary variable count in normal vs Single assignment form
IMP
Polling in Transmission
Computer Networks
(page 1)
Randomized exponential backoff
Computer Networks
Bipertite Graphs
Discrete Mathematics
“Even though” and it’s usage
General Aptitude
Identifying Recursive Languages
Theory of Computation
SQL and Relational Algebra differences
Database Management
Best Fit, Worst Fit, Next Fit, First Fit in partition scheme
Operating System
Properties of Inverse of Matrix
Engineering Mathematics
link
Relocation, Scope resolution, parsing in Compiler
Compiler Design
unique literal count in boolean function
Digital Logic
Rank nullity theorem
Engineering Mathematics
link
Link State Routing
Computer Networks
link
Sparse wighted undirect graph minimum spanning tree algorithm using minheap
Algorithms
Undirected graph to Acyclic directed graph conversion how many ways
Discrete Mathematics
link
Insertion sort worst case properties
Algorithms
use of ALL, EXIST in SQL
Database Management
Weighted and Non-weighted binary code formats. i.e. BCD, XS3, 2’sComp, 1’sComp etc..
Digital Logic
Concave and Convex Functions
Engineering Mathematics
Relative Addressing Mode
Computer Organization
link
Cardinality of subset
Discrete Mathematics
Pigeon Hole Principle
Discrete Mathematics
link
Line Graph Concept in Graph Theory
Discrete Mathematics
Deadlock Prevention or avoidance techniques
Operating System
link
ER diagram and Relational model properties
Database Management
link
Calendar Same Year repeat (2003-2014)
General Aptitude
Sequence missing number find IQ
General Aptitude
Directions
General Aptitude
Recoverable, Strict Recoverable and Irrecoverable Schedules
Database Management
link
Identifying Ambiguous grammar
Theory of Computation
link
Total Spanning Tree for Bipartite Complete Graphs K3,3
Discrete Mathematics
link
Interrupt I/O and Programmed I/O
Computer Organization
Normalization of Functional Dependency
1NF, 2NF, 3NF, BCNF
Database Management
Countable and Uncountable, finite and infinite set
2^n = not countable
Theory of Computation
link
Write through, write back ,inclusion property in L-cache architecture
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
DBA in Subnetting and IP addresses
Computer Networks
Limit of Summation technique
Engineering Mathematics
Pumping Lemma, Kleene’s Theorem and DCFL
Theory of Computation
There Exist Unique (E!) in Quantifiers
Discrete Mathematics
Joins in SQL and Relational Algebra
Database management
link
Removal of Static Hazard in boolean function
Digital Logic
link
Properties of Relation (reflexive, transitive,…)
Discrete Mathematics
Unicast, Multicast and Broadcast addresses in MAC address
Computer Networks
Degree of Multiprogramming
Operating System
Total BST possible Formula derivation using recurrence
Data Structures
Maximum reduce moves by a bottom up parser for a grammar with no epsilon and unit production for n tokens
n - 1
Compiler Design
link
Perimeter of given shape
General Aptitude
cyclic quadrilateral
General Aptitude
Contradictory usage of “while” in English
General Aptitude
incidence matrix of given graph and it’s Rank
Discrete Mathematics
Repeater and Hub difference
Computer Networks
GFG
Classfull IPv4
Computer Networks
Best sorting algorithm for Linked List
Merge Sort
Algorithms.
Asymptotic comparison between greater value of functions
Algorithms
Ex. logn < n
Rotations in AVL tree (self balancing Binary Search Tree)
Algorithms
link
Difference between Array and Linked List
Data Structures
Overflow conditions in 2’s compliment binary add sub operation
Digital Logic
Functionalities of Linker and Loader
Compiler Design
link
Recurrence relation of a kind:
T(&n) + T((1-&)n) + n
& = Alpha
nlogn (base = min(recip(&), recip(1-&))
Algorithms
Dual of a function
Digital Logic
link
lossless and dependency preserving decomposition
Database Management
Mixture and Alligation
General Aptitude
link
Simple Interest
General Aptitude
Train speed and distance
General Aptitude
Longest Common Subsequence
Algorithms
Perfect Matching, Maximum Matching, Vertex Cover in Graph
Discrete Mathematics
Control Flow Graph
Computer Organization
Error Detection
Computer Network
Parenthisation to minimize matrix multiplication
Divide from smallest
Algorithms
Deletion of root node in binary search tree
Data Structures
Viable Prefix
Compiler Design
link
Speed up in pipelining
Computer Organization
link
Port Numbers of Application Layer Protocols
Computer Networks
link
Correct/Incorrect binary search sequence
Data Structure
L U Decomposition
Engineering Mathematics
link
Cut edge, Cut vertex and Articulation Point in Graph Theory
Discrete Mathematics
Knapsack problem
Algorithms
Poisson Distribution
Engineering Mathematics
biconnected graph
Discrete Mathematics
Strongly Connected Graph and Components
Discrete Mathematics
increment decrement (++) (–) operator
Programming in C
Count to infinity problem, Path Vector, Poison reverse, Distance Vector Routing, Split horizon
Computer Networks
Planar simple connected graph face, edge, vertices formula
R + V = E + 2
R + V = E + K + 1
Discrete Mathematics
Tautology and Contradiction.
Discrete mathematics
Conflict Serializable and View Serializable
Database Management
Orthogonal Matrix
Engineering Mathematics
Offset need to return to the loop in instructions of 4 Bytes
Computer Organization
Quadratic Probing in Hash table
Data Structures
TLB, Physical Address, Virtual Address, Page
Operating System
implicants, Prime implicants, Essential Prime implicants
Digital Logic
link
Chomsky normal form
2n - 1
Compiler Design
link
Area of Octagon, Trapezium
General Aptitude
Tournament Graph
Discrete Mathematics
Bridge and it’s Properties
Computer Networks
link
Eigen values and Eigen Vectors, Liearly independent eigen vectors
Engineering Mathematics
link
Turing identifiable/Recognizable = REL
Turing decidable = REC
Theory of Computation
Static and Dynamic Scoping of variable
Programming in C
Row major order and Column major order
No one is better but there are differences.
Data Structures
link
Adjacency list and matrix differences in Graph
Discrete Mathematics
link
Primary clustering and secondary clustering in hashing
Algorithms
Linear probing, Quadratic probing and Double hashing
Algorithms
Difference between OSPF and RIP
Computer Networks
cache tag directory with extra bits
Computer Organization
Page Replacements and Fault time
Operating System
link
Balanced Parentheses is DCFL and can be recognized by DPDA
Theory of Computation
Difference between DCFL and CFL
Theory of Computation
link
Context Sensitive Grammar Identification
Theory of Computation
Distribution Problem in Permutation and Combination
Discrete Mathematics
Logarithms
General Aptitude
Area and Volume of 3D objects
General Aptitude
Gerund, Possesive Case
English
General Aptitude
Strongly Connected Components in Directed Graph
Discrete Mathematics
link
Discovery time and finish time in graph traversal of node
Discrete Mathematics
Greibach Normal Form
Compiler Design
link
Register Calculation in RISC processor
Computer Organization
link
convert invalid radix using correction number
Digital Logic
CRC reminder calculation
Computer Networks
link
Radix Sort and Counting Sort
Algorithms
Tuple Calculus
Database Management
link
Possible Candidate Key Based on given Relation instance
Must not contain duplicate values
Database Management
Micro operations involving MBR, MAR, PC, IR
Computer Organization
Associativity and Priority of Operators in Grammar
Compiler Design
Division Operator in Relational Algebra
Database Management
TCP Additive Increase Multiplicative Decrease (AIMD)
Computer Networks
Dijkstra’s Algorithm
Algorithms
link
optimal page replacement Algorithm
Operating System
use of different bits in page replacement in Demand paging
Operating System
Upper and Lower bound of Poset in Hasse diagram
Discrete Mathematics
DAG Representation of given arithmetic register operations
Computer Organization
Compulsory, Conflict, Capacity Miss in cache
Computer Organization
Diagonalization of a Matrix
Engineering Mathematics
Blood Relation
General Aptitude
How many squares, Rectangles, Triangles in given image
General Aptitude
integration of |x^2 - 4| over given range.
Engineering Mathematics
Closure with operations with Regular languages on other language.
i.e. DCFL ^ REG
Theory of Computation
LL(1) parsing table possible size. (given Variable and Terminal Count)
Compiler Design
Memory Partition and Pointer Size
Operating System
Back off Race and Win probability in Ethernet
Computer Networks
in IPv4 packet Number of Interfaces between 2 hosts given n routers
Computer networks
link
Counting of Neutral Functions
Digital Logic
link
number of Myhil Nerode equivalence class of given language
DFA states
Theory of Computation
link
Postfix Expression Evaluation
Data Structures
link
Determinant and Adjoint properties of Matrix
Engineering Mathematics
Disk Size based on Sectors, Track, platter etc…
Operating System
link
Stack Pointer Register
Computer Organization
CRC Generator and error polynomials
Computer Networks
link
CPU Enhancement and speed up (Amdhal’s Law)
Computer Organization
link
Hamming distance and possible error detection
Computer Networks
link
Conflict Equivalant Schedules
Database Management
Peterson’s Solution in Deadlock
Operating System
link
Averages
General Aptitude
Remove epsilon productions from given grammar
Compiler Design
LBA, DBA and Loopback address functions and IP addresses
Computer Networks
Identify given Turing Machine and which language does given TM recognizes
Theory of Computation
link
NIC Network interface card bits in ethernet network
48 bits
Computer Networks
Recurrence Relation Solving in Mathematics
Discrete Mathematics
Address Resolution Protocol (ARP)
Computer Networks
link
3 Address code output and memory location of perticular instruction
Compiler Design
Operator Grammar given and evaluate given expression based on associativity and priority
Stalls and branch penalty in pipeline due to branch instruction and hazards
Computer Organization
Difference between Level, Height, and Depth in Tree Data Structure
L = H + 1
H = D (in reverse)
Data Structures
Stack and Queue Operations
Data Structures
Multiplexers required to generate equivalent bigger multiplexer
i.e. 8x1 to 256x1
Ceil((256-1)/(8-1)) = 37
Digital Logic
Right Circular Cone in Cube. volume and area etc…
General Aptitude
Switch from user mode to kernel mode in which cases…
Operating System
link
TCP header given and find total number of IP fragments in given MTU
Computer Networks
Minimum, Maximum and Some fixed standard values in IEEE floating point representation standard
Digital Logic
Time complexity of Matrix chain multiplication, Bellman-ford sspath, Floyd Warshall, Dijkstra
Algorithms
Satisfiable Boolean Expression
Discrete Mathematics
Permutations in circular Table
Discrete Mathematics
link
Addressing modes required in Relocation
Computer Organization
static and dynamic branch prediction in pipelining
Computer Organization
Topological Ordering and Sort in Graph
Algorithms
Skewed Full binary tree and it’s maximum height possible given n nodes.
Data Structures
Unit’s Place and cyclicity
General Aptitude
Expected Number of inversions in Array
Data Structures
identify which language does given PDA accepts
Theory of Computation
Size of the ROM required to store table of multiplication, addition of n bit numbers
Computer Organization
Pairwise Disjoint Subsets
Discrete Mathematics
Limitations of Relational Algebra
Database Management
Determining if given language is Recursively Enumerable or not.
Rice’s Theorem (superset of language should have equal or more cardinality)
Theory of Computation
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.
Computer Organization
making Decoder using MUX, AND gate, OR gate.
or minor Decoder. (i.e. 4X8 using 2X4 etc.)
Digital Logic
link
Number of Edge Disjoint Hamiltonian Cycles in a complete Kn graph.
Discrete Mathematics.
Formula to find Expected number of dice rolls required to get n consecutive 6’s
Engineering Mathematics
LINK
Independence number of given graph
Discrete Mathematics
Use of DISTINCT in SQL
Database Management System
Bitmap Approach in file System management
1 bit for each disk block.
Computer Organization
Equalities (<, >, <=, >=, ==)
General Aptitude
Paper Fold and Pattern cutout
General Aptitude
Quatient Operation (/ division by language)
Regular / any lang = Regular
Theory of Computation
Persistent and Non persistent HTTP connection.
Computer Networks
link
2-3 Tree and insertion and deletion of a node
Data Structures
minimal SOP and POS expression using K-map of given function.
Digital Logic
number of 1:2 DEMUX required to create
1:64 DEMUX
Digital Logic
Packet Filter Firewall and filtering table
Computer Networks
link
Self Complimentary BCD code
sum = 9 (2421, 5211, etc…)
Digital Logic
TCP and congestion window and avoidance algorithm(additive)
Computer Networks
Many-one, one-one different indications in ER diagram
Database Management
Binomial Expansion (a+b)^n
Discrete Mathematics
Logic Inference in Predicate Logic
Discrete Mathematics
Group Properties and operations
Discrete Mathematics
Cube painting and cutting and finding 3 side colored, 1 side colored, 2 side colored, and non colored cubes.
General Aptitude
Extern keyword and linker error
Programming in C
DNS, DHCP, RIP use UDP.
HTTP use TCP
Computer networks
minimum pumping length and infinite closure of Regular Languages
Theory of Computation
use of “LIKE” in SQL
Database Management
Complete Graph, hyper cube graph, Cycle Graph, Wheel Graph
Discrete Mathematics
AND, OR, XOR etc on given Function Minterms. i.e. E(0,1,2,5)
Digital Logic
link
Process Scheduling having I/O time.
Operating System
Longest Remaining Time and Shortest Remaining Time first in Process Scheduling
Do calculations in time units of ‘1’ (i.e. 0 - 1- 2- 3 etc…)
Operating System
Temporal Locality and Spatial Locality and Hit Rate in Cache Specification
Computer Organization
if LL(k) for k >= 2 but not LL(1) then G is in….
Left Recursion or Left Factoring?
Left Factoring.
Theory of Computation
Total Possible parse trees of given grammar for given string (i.e. “aaaa”)
Theory of Computation
link
Possible Comparisons while merging 2 lists of distinct integers
Algorithms
BST operation cummutative properties
Neither insertion nor deletion is cummutative in a BST.
Data Structures
Precedence of “++” and “*”
++ > *
Programming
Split Given CIDR IP address into many different IP address each requiring different amount of hosts
Computer Networks
link
Multilevel Feedback queue scheduling
Operating System
Child Process Properties when created by Fork() call.
Operating System
link
Go Back N ARQ
Computer Networks
Number of States in DFA having exactly, atleast, atmost n, m a’s, b’s etc…
Theory of Computation
Union operation of Any language with Regular Language
Theory of Computation
Exponential distribution of Random variable Probability
Engineering Mathematics
Time Complexity of Every common algorithms (i.e., LCS, TOH, Merge Sort, Heapify, etc…)
Algorithms
Segmented Paging
Operating System
link
Instruction Halt and return address pushed to stack
Computer Organization
link
Cycle Prime implicant K-map
Digital Logic
Given set of instructions with different stage cycles in pipeline. Find total cycles required to execute all.
Computer Organization
Removal of Left Recursion. in normal, S-attributed and SDT grammar
Theory of Computation
link
Integer sum problem in distribution
C(n+r-1,r)
Discrete Mathematics
Circle incribed in Triangle find radius. etc…
General Aptitude
Grammar with no termination do not generate any string.
i.e. empty language
Theory of Computation
Maximum, Minimum in floating point representation
S = 0|1
BE = 11111110
M = all 1’s
Computer Organization
Weak entity and identifying relationship in ER diagram
Database Management
decimal numbers that can not be represented in finite binary bits.
0.2, 0.3 etc…
Digital Logic
iterative summation = Sigma
iterative multiplication = Pie
Engineering Mathematics
Necessary condition for Deadlock
Operating System
use of Aggregate functions in SQL
Database Management
use of EXCEPT in SQL
Set difference (A - B)
removes duplicate as it is set
Database Management
Types of errors,
Lexical, Syntax, Semantic, Logical, etc
Compiler Design
Free List method in disk block addressing in one block of disk etc…
Operating System
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.)
Computer Organization
Conditional Probability based on Truth Lie
Engineering Mathematics
difference between number of HTTP connection required for some web page having some objects in Persistent vs Non persistent HTTP
Computer Networks
mod 10 ripple counter
Digital Logic
link
various pointer runtime errors… dangling pointer, memory leak, invalid value excess of freed variable
Programming in C
Shared Exclusive lock and 2PL
Database Management
link
3 address code implimentation forms
Compiler Design
find nth smallest element in Minheap
Algorithms
link
Generating Functions
Discrete Mathematics
link
Tower of Hanoi Problem
Algorithms
Properties of Idempotent Matrix
Engineering Mathematics
Difference between with and without operand forwarding in cycles
Computer Organization
Derangement problem in permutation
Discrete Mathematics
link
Stateful and Stateless protocol
Computer Networks
link
Hamming coded message parity bit detect
Computer Networks
Glitch Delay while using different delayed logic operators.
i.e. and = 4ms, not = 1ms etc…
Digital Logic
Explicit I/O instruction and memory-mapped I/O instruction
Computer Organizaton
Number of Min heaps possible with n distinct keys
Data Structures
link
Minima Maxima of function
Engineering Mathematics
Identify if given configuration is turing recognizable or not
Theory of Computation
Stalls and Cycles calculation in branch instruction and prediction
Computer Organizaton
link
Liveness analysis in block diagram
Compiler Design
link
Sequential feedback circuits
Digital Logic
Gray code
Digital Logic
Compement of an element in lattice
Discrete Mathematics
switch case properties
Programming in C
DMA and cycle stealing
Computer Organization
Divisible by 8 (to consider byte) in IPv4 fragmentation
Computer Networks
link
Booth’s Algorithm for multiplication
Computer Organization
Equivalance class and Partitions
Discrete Mathematics
link
Latency in associative and direct mapped cache using mux and comparator
Computer Organization
Sliding Window protocol
Computer Organization
Operator Grammar
Compiler Design
Hop count in given packet switching network specification
Computer Networks
Expected Time to search/insert/delete in hash table
Data Structures
Relocation sequence performed by relocation loader
Compiler Design
Fermat’s Little Theorem and Mod function
General Aptitude
link
Primitive and Derived Instructions specifications given and find number of possible instructions.
Expand opcode technique
Computer Organization
link
Expected number in binomial Distribution probability = n * p
Engineering Mathematics
link
count of Diagonals in any polygon
n(n-3)/2
General Aptitude
Work of stages in compiler
Compiler Design
eular totient function
Discrete Mathematics
Array and Page Faults
Operating System
Largest Denormalized Sub Normal Value
Computer Organization
Internal and External Fragmentation in Paging
Operating System
link
edge trigger effect in ripple up/down counter
Digital Logic
Extra tag space required in given cache configuration
Computer Organization
Eigen Value Properties for matrix power and adjoint, and inverse…
Engineering Mathematics
link
Stack size calculation for recursive function successfully run on maximum n input
Algorithms
Public Key Cryptography
Computer Networks
link
