1.
a. 01 bit= 2 colors
b. 02 bit= 4 colors
c. 03 bit= 8 colors
d. 04 bit= 16 colors
e. 08 bit= 256 colors
f. 16 bit= 65536 colors
2.
a. There are around 4096*2160=8847360 pixels present in a 4k image.
b.The number of blocks will be 138,240 which comes from the formula= total pixels/size of the block.
10 marks Question#3 Answer the following Questions 1. How many colors do we have at the...
C++ program: The aim of this homework assignment is to practice writing hierarchy of classes. Design a hierarchy of Files. You have two different kinds of Files, Text File and an Image File. The files are identified by their name and type, which is identified by either txt or gif extension. An Image file has dimensions of pixel rows and pixel columns. Each pixel has a color depth that can be represented by number of bits. (8 bits is one...
We have the symbols A, B, C, D, E, F, G, H with frequencies 1, 1, 2, 4, 8, 16, 32, 64. Show the Huffman tree and Huffman code for the symbols. How much compression does a 1000 digit file use when using this Huffman code based on an 8-bit ASCII code (ie, ISO 8859-1)?
*Java* You will write a program to do the following: 1. Read an input file with a single line of text. Create a method named load_data. 2. Determine the frequency distribution of every symbol in the line of text. Create a method named 3. Construct the Huffman tree. 4. Create a mapping between every symbol and its corresponding Huffman code. 5. Encode the line of text using the corresponding code for every symbol. 6. Display the results on the screen....
In lectures we discussed how bitmap images are stored as a grid of pixel values. Each pixel has a colour value, and colour can be encoded using the RGB encoding scheme. In lectures we also discussed using the RLE compression technique. Examples of the RLE technique being used to compress text were given. Instead of storing every single character individually, if there is a sequential run of identical characters, data on one character is stored along with a count of...
a) Suppose we have a 64 KB, direct-mapped cache with 8-word blocks. Determine how many bits are required for the tag, index, and offset fields for a 32-bit memory address. b) If instead, we use a 64 KB, 4-way set-associative cache with 8-word blocks, how many bits will be required for the tag, index, and offset fields for a 32-bit address? c) What type of cache is shown in problem 2? How many bits are required for this cache’s tag,...
. Huffman Encoding (a.) (6 points) Suppose a certain file contains only the following letters with the corresponding frequencies 1 AİB 73 9 30 44 130 28 16 In a fixed-length encoding scheme, cach character is given a binary representation with the same number of bits. What is the minimum number of bits required to represent each letter of this file under fixed-length encoding scheme? Describe how to encode all seven letters in this file using the number of bits...
answer for all questions.... How do modern operating systems solve this? [3 marks] i) This is a snapshot of a page table and a translation look aside buffer (TLB) of an operating system (Assume that these are the only populated entries). Toble 1: Page Table Entry Virtual Page Page Frame Time Loaded Time R bit M bit number Referenced 2 0 60 161 0 1 1 1 130 0 160 1 2 26 162 0 1 30 3 20 163...
It is a C++ program by using inheritance and vectors My professor said that all the files should be separate. like File.cpp, File.h, Text.cpp,Text.h,Main.cpp I already have these files File.cpp #include "File.h" // Constructor of File that takes File name and type as arguments File::File(string type, string name) { this->type = type; this->name = name; } //returns the type. string File::getType() { return type; } //returns the name of file. string File::getName() { return name; } File.h #ifndef __FILE_H__ #define...
3. 12+2-4 points] We are comparing the two caches in Problem 1 and Problem 2. Suppose both caphes have a hit time of 2 cycles. The cache in Problem 1 has a miss penalty of 15 cycles. The one in Problem 2 has a miss penalty of 25 cycles. Calculate the total time taken (in cycles) for all accesses, for each cache. Which cache is better- the one in Problem 1 or Problem 2? 3. 12+2-4 points] We are comparing...
RESULTS: Analyzing your data Answer the following questions: 1) How many bands do you see in the "unculanes? If there are more than one bad explain the nature or origin of the other bands? If there are more than one band can you 2) Why did you have to electrophorese uncut DNA? 3) What size of fragments were you expecting when you digested the known samples of pBR322 with the enzymes you used? 4) What are the sizes of the...