Register

go class test series

• retagged by
504 views
0 0 votes

In a certain implementation of strings, characters are 8 bits long and words are 36 bits long. Characters are packed into double words so that no space is lost. How many words of memory does a k-character string require? (If the string does not occupy an integral number of double words, enough binary zeros are appended to reach the next single word boundary.)

 A. [2k/9]  floor

B. [k/9]  ceil

C. 2[k/9] floor

 D. [2k/9] ceil

2 Answers

Voting & Accepting an answer helps improve the community
← Previous · #SelfDoubtNext → · Even-odd function
← Previous in category · CPU performanceNext in category → · Unacademy Quiz
Position:
Show:

Related questions

0 0 votes
0 0 answers
811
811 views
deepanshu sharma 3 asked Nov 16, 2018
811 views
class test
Find how much disk space (in surfaces) will be required to store 300,000 120-byte logical records, if the disk is fixed sector with 512 bytes/sector, with 96 sectors/trac...
75 75 votes
4 answers 4 answers
24.6k
24.6k views
go_editor asked Sep 29, 2014
24,628 views
GATE CSE 2011 | Question: 28
On a non-pipelined sequential processor, a program segment, which is the part of the interrupt service routine, is given to transfer $500$ bytes from an I/O device to mem...
79 79 votes
11 answers 11 answers
33.9k
33.9k views
go_editor asked Sep 28, 2014
33,887 views
GATE CSE 2014 | Set 1 | Question: 43
Consider a $6$-stage instruction pipeline, where all stages are perfectly balanced. Assume that there is no cycle-time overhead of pipelining. When an application is exec...
199 199 votes
9 answers 9 answers
78.7k
78.7k views
Kathleen asked Sep 22, 2014
78,743 views
GATE CSE 2005 | Question: 68
A $5$ stage pipelined CPU has the following sequence of stages:IF – instruction fetch from instruction memoryRD – Instruction decode and register readEX – Execute: ALU op...