A non pipelined single cycle processor operating at 100 MHz is converted into a synchronous pipelined processor with five stages requiring 2.5 nsec, 1.5 nsec,… Read More

Consider a CPU where all the instructions require 7 clock cycles to complete execution. There are 140 instructions in the instruction set. It is found… Read More

Given a huge file having dynamic data, write a program to read last n lines from the file at any point without reading the entire… Read More

Wriiten Test One coding question of form minimum cost to travel from 0,0 to N-1,M-1, remaining MCQ for time complexity of running code,other technical questions… Read More

Assume that EA = (X)+ is the effective address equal to the contents of location X, with X incremented by one word length after the… Read More

Consider the following state diagram and its realization by a JK flip flop The combinational circuit generates J and K in terms of x, y… Read More

Consider the following two finite automata. M1 accepts L1 and M2 accepts L2. Which one of the following is TRUE? (A) L1 = L2 (B)… Read More

Which of the following languages is (are) non-regular? L1 = {0m1n | 0 ≤ m ≤ n ≤ 10000} L2 = {w | w reads… Read More

Consider a CFG with the following productions. S → AA | B A → 0A | A0 | 1 B → 0B00 | 1 S… Read More

Consider the following languages. L1 = {ai bj ck | i = j, k ≥ 1} L1 = {ai bj | j = 2i, i… Read More

If the final states and non-final states in the DFA below are interchanged, then which of the following languages over the alphabet {a,b} will be… Read More

If f(x) is defined as follows, what is the minimum value of f(x) for x ∊ (0, 2] ? (A) 2 (B) 2(1/12) (C) 2(1/6)… Read More

If M is a square matrix with a zero determinant, which of the following assertion (s) is (are) correct? (S1) Each row of M can… Read More

Consider the following Hasse diagrams. Which all of the above represent a lattice? (A) (i) and (iv) only (B) (ii) and (iii) only (C) (iii)… Read More

G is a simple undirected graph. Some vertices of G are of odd degree. Add a node v to G and make it adjacent to… Read More