School Olympiads - National Cyber Olympiad & AI Foundation (NCO)

Achievers Section: Algorithmic Complexity & Logic Optimization question bank (Emerging Technologies & Achievers Section)

Practice 6 free School Olympiads - National Cyber Olympiad & AI Foundation (NCO) Emerging Technologies & Achievers Section - Achievers Section: Algorithmic Complexity & Logic Optimization questions with answers and step-by-step solutions.

Start free Book a demo

All Easy Hard

Q1.

[Achievers Section - 3 Marks]
Consider the following recursive function:

def fun(n):
    if n <= 1:
        return 1
    return n * fun(n - 2)

What will be the return value of fun(7)?

(A)

{'key': 'A', 'text': '105'}

(B)

{'key': 'B', 'text': '720'}

(C)

{'key': 'C', 'text': '48'}

(D)

{'key': 'D', 'text': '35'}

Show answer & solution

Verified Answer & Solution Locked

Q2.

In computing logic for Achievers Section: Algorithmic Complexity & Logic Optimization, what is the binary representation of the decimal number $19$?

(A)

{'key': 'A', 'text': '(10011)₂'}

(B)

{'key': 'B', 'text': '(10100)₂'}

(C)

{'key': 'C', 'text': '(10101)₂'}

(D)

{'key': 'D', 'text': '(10010)₂'}

Show answer & solution

Verified Answer & Solution Locked

Protected Questions

Unlock All 6 Questions in Achievers Section: Algorithmic Complexity & Logic Optimization

Log in or sign up free to access every question with complete solutions, create chapter practice tests, and track your performance.

Sign up free to access all 6 questions

Unlock every Achievers Section: Algorithmic Complexity & Logic Optimization question, generate papers, and practice at your own pace.

Start free