Bissoy.com
Doctors Medicines MCQs Q&A

Related Questions

Suppose we transfer a file written on a little endian machine to a big endian machine and there is no transformation from little endian to big endian, then what happens?
An array of 2 two byte integers is stored in big endian machine in byte addresses as shown below. What will be its storage pattern in little endian machine? Address Data 0 × 104 78 0 × 103 56 0 × 102 34 0 × 101 12
x86 architecture uses big endian or little endian addressing mechanism?
In Little Endian data format, the data is stored as
Which of the following statements are true?
Statement I Big data refers to no precise quantity, but generally refers to data in the range of Petabytes and Exabyte, i.e. billions to trillions of records, all from various sources. Big data is generated much faster. than traditional data in much larger quantities.
Statement II Big data interests industries because they are able to learn more patterns and curious variances than smaller data sets, with the capability to provide valuable insights into consumer behaviour, weather systems, financial market activity, or other phenomena.
Statement III Various departments and product lines use various applications within most organisations and store data in separate datasets. These separate databases may contain similar data, but data from one data base to another is not always consistent. This is called data silo.
What is simplified Boolean equation of a logic circuit, If the circuit output is 1 for following inputs? ABCD = 0010 ABCD = 0110 ABCD = 1000 ABCD = 1100 And output is zero for all other inputs
What is the output of the following ‘c’ code assuming it runs on a byte addressed little endian machine?
Consider the following program main() { int x = 1; printf (“%d”, (*char(char *)&x)) ; } Assuming required header files are included and if the machine in which this program is executed is little-endian, then the output will be
In a press there are three types of printing machines A, B, and C. Machine A can print ten thousand pages in 8 hours, machine B can do the same task in 10 hours, and machine C can do the same task in 12 hours. All three machines start the task at 9∶00 a.m. Machine A breaks down at 11∶00 a.m. and machines B and C continue working. At 12∶00 noon machine B also breaks down and machine C alone has to complete the remaining task. What is the approximate time of completion of the task?
Suppose we want to design a synchronous circuit that processes a string of 0’s and 1’s. Given a string, it produces another string by replacing the first 1 in any subsequence of consecutive 1’s by a 0. Consider the following example. Input sequence: 00100011000011100 Output sequence: 00000001000001100 A Mealy Machine is a state machine where both the next state and the output are functions of the present state and the current input. The above mentioned circuit can be designed as a two-state Mealy machine. The states in the Mealy machine can be represented using Boolean values 0 and 1. We denote the current state, the next state, the next incoming bit, and the output bit of the Mealy machine by the variables s, t, b and y respectively. Assume the initial state of the Mealy machine is 0. What are the Boolean expressions corresponding to t and y in terms of s and b ?