The Gateway to Computer Science Excellence

0 votes

Best answer

Here we are converting a binary number to octal that is we are converting a number from base 2 system to base 8 i.e. 2^{ 3.}

Hence we have to take every 3 digits from least significant bit and convert it to octal form.

for the given number 1011101011. Taking every 3 digits from LSB , we get 001 | 011 | 101 | 011 (we have appended 2 zeros at the beginning). Now 001=1; 011=3; 101=5; 011= 3. Hence answer is 1353 in octal

- All categories
- General Aptitude 1.9k
- Engineering Mathematics 7.5k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.3k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.1k
- Non GATE 1.5k
- Others 1.5k
- Admissions 595
- Exam Queries 576
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 17

50,650 questions

56,242 answers

194,285 comments

95,933 users