Other Programming & Computer Science Answers

Develop a testbench for the following parity checker

module parity checker(
input [7:0] bitt,
output reg ans
);

integer count = 0;
integer i = 0;

always@(bitt)
begin
count = 0;
for(i=0; i<=7; i=i+1)
begin
if(bitt[i]==1)
count = count + 1;
end
if(count%2==0) //even parity
ans = 1;
else
ans = 0;

end

endmodule

Verify the testbench using the following numbers: 0, 5, 86, 111.

Type out your testbench code and verify that it works using a computer program (modelsim or EDA playground)

Consider the following CFG grammar,
S → aABe
A → Abc | b
B → d
where 'a', 'b', 'c' and 'd' are terminals, and 'S' (start symbol), 'A' and 'B'
are non-terminals.
a) Parse the sentence " abbcbcde " using right-most derivations.
b) Parse the sentence " abbcbcde " using left-most derivations.
c) Draw the parse tree.

“Brains are to intelligence as wings are to flight”. Explain.

Q1)True or False? Justify your answer. Assume cost is always non-negative.
a) Assume that a rook can move on a chessboard any number of squares in a straight line, vertically or horizontally, but cannot jump over other pieces. Manhattan distance is an admissible heuristic for the problem of moving the rook from square A to square B in the smallest number of moves.
b) A* tree search is optimal if the heuristic is consistent.
c) The Euclidean distance is an admissible heuristic for Pacman path-planning
problems.
d) Azeroheuristicisconsistent.
e) The sum of several admissible heuristics is still an admissible heuristic.
f) The admissibility of a heuristic for A* search implies consistency as well.

In 2008, what kind of network did NASA test?

What worm struck Internet in 2001?

BITNET, one of the predecessor of the Internet, was launched in 1981. What does BITNET stand for?

Why does Amazon need a firewall?

Assume OS1 is a normal Linux system (e.g Ubuntu 12.04). What types of system calls does it have? (Give at least 4 broad categories and broadly describe each)