Data Structure Questions and Answers-Decimal to Binary using Stacks

 

 Buy/Download all MCQ Ebook   >>>Click Here<<<

Data Structure Questions and Answers-Decimal to Binary using Stacks

Click on any option to know the CORRECT ANSWERS

Question 1
Express -15 as a 6-bit signed binary number.
A
1111
B
101111
C
101110
D
1110
Commerce Questions answers

Question 1 Explanation: 
The first 4 1s from the right represent the number 15, 2 more bits are padded to make it 6 digits and the leftmost bit is a 1 to represent that it is -15.

Question 2
Which of the following code snippet is used to convert decimal to binary numbers?
A

public void convertBinary(int num) { int bin[] = new int[50]; int index = 0; while(num > 0) 
B

public void convertBinary(int num) { int bin[] = new int[50]; int index = 0; while(num > 0) 
C

public void convertBinary(int num) { int bin[] = new int[50]; int index = 0; while(num > 0) 
D

public void convertBinary(int num) { int bin[] = new int[50]; int index = 0; while(num > 0) 
Reasoning Questions answers

Question 2 Explanation: 
Take the modulus by 2 of the number and store in an array while halving the number during each iteration and then display the contents of the array.

Question 3
Which is the predefined method available in Java to convert decimal to binary numbers?
A
toBinaryInteger(int)
B
toBinaryValue(int)
C
toBinaryNumber(int)
D
toBinaryString(int)
UPSC test Questions answers

Question 3 Explanation: 
The method toBinaryString() takes an integer argument and is defined in java.lang package. Usage is java.lang.Integer.toBinaryString(int) this returns the string representation of the unsigned integer value.

Question 4
Using stacks, how to obtain the binary representation of the number?
A

public void convertBinary(int num) { Stack<Integer> stack = new Stack<Integer>(); while (num != 0) { int digit = num /
B

public void convertBinary(int num) { Stack<Integer> stack = new Stack<Integer>(); while (num != 0) { int digit = num % 
C
correctchoice

public void convertBinary(int num) { Stack<Integer> stack = new Stack<Integer>(); while (num != 0) { int digit = num NTA NET Questions answers 

Question 4 Explanation: 
Here instead of adding the digits to an array, you push it into a stack and while printing, pop it from the stack.

Question 5
What is the time complexity for converting decimal to binary numbers?
A
O(1)
B
O(n)
C
O(logn)
D
O(nlogn)
English literature Questions answers

Question 5 Explanation: 
Since each time you are halving the number, it can be related to that of a binary search algorithm, hence the complexity is O(logn).

There are 5 questions to complete.

 

 Buy/Download all MCQ Ebook >>>CLICK HERE<<<