adplus-dvertising
frame-decoration

Question

Express -15 as a 6-bit signed binary number.

a.

001111

b.

101111

c.

101110

d.

001110

Answer: (b).101111

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Express -15 as a 6-bit signed binary number.

Similar Questions

Discover Related MCQs

Q. To implement a stack using queue(with only enqueue and dequeue operations), how many queues will you need?

Q. After performing these set of operations, what does the final list look contain?

InsertFront(10);

InsertFront(20);

InsertRear(30);

DeleteFront();

InsertRear(40);

InsertRear(10);

DeleteRear();

InsertRear(15);

display();

Q. What is the time complexity of deleting from the rear end of the dequeue implemented with a singly linked list?

Q. What are the applications of dequeue?

Q. What is a dequeue?

Q. What is the time complexity to insert a node based on position in a priority queue?

Q. What are the advantages of priority queues?

Q. What is not a disadvantage of priority scheduling in operating systems?

Q. What is the time complexity to insert a node based on key in a priority queue?

Q. Which of the following is not an application of priority queue?

Q. With what data structure can a priority queue be implemented?

Q. The essential condition which is checked before deletion in a linked queue is?

Q. The essential condition which is checked before insertion in a linked queue is?

Q. In linked list implementation of a queue, the important condition for a queue to be empty is?

Q. In linked list implementation of a queue, from where is the item deleted?

Q. In case of insertion into a linked queue, a node borrowed from the __________ list is inserted in the queue.

Q. In linked list implementation of a queue, front and rear pointers are tracked. Which of these pointers will change during an insertion into EMPTY queue?

Q. In linked list implementation of a queue, front and rear pointers are tracked. Which of these pointers will change during an insertion into a NONEMPTY queue?

Q. In linked list implementation of a queue, where does a new element be inserted?

Q. In linked list implementation of queue, if only front pointer is maintained, which of the following operation take worst case linear time?