GATE CSE 2003 | Complexity Analysis and Asymptotic Notations Question 49 | Algorithms

GATE CSE 2003

MCQ (Single Correct Answer)

-0.3

Consider an array multiplier for multiplying two n bit numbers. If each gate in the circuit has a unit delay, the total delay of the multiplier is

$$\Theta \,(1)$$

$$\Theta \,(\log n)$$

$$\Theta \,(n)$$

$$\Theta \,({n^2})$$

GATE CSE 2002

MCQ (Single Correct Answer)

-0.3

In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is

log n

n/2

Log₂ n - 1

GATE CSE 2001

MCQ (Single Correct Answer)

-0.3

Let f(n) = n² log n and g(n) = n(log n)¹⁰ be two positive functions of n. Which of the following statements is correct?

f(n) = O(g(n)) and g(n) ≠ O(f(n))

g(n) = O(f(n)) and f(n) ≠ O(g(n))

f(n) ≠ O(g(n)) and g(n) ≠ O(f(n))

f(n) = O(g(n)) and g(n) = O(f(n))

GATE CSE 1999

MCQ (Single Correct Answer)

-0.3

The maximum gate delay for any output to appear in an array multiplier for multiplying two n bit number is

O (n²)

O (n)

O (log n)

O (1)

PREVIOUS NEXT

GATE CSE Subjects

Theory of Computation

Finite Automata and Regular Language Push Down Automata and Context Free Language Undecidability Recursively Enumerable Language and Turing Machine

Operating Systems

Process Concepts and Cpu Scheduling Synchronization and Concurrency Deadlocks Memory Management File System IO and Protection

Algorithms

Complexity Analysis and Asymptotic Notations Searching and Sorting Divide and Conquer Method Greedy Method Dynamic Programming P and NP Concepts

Digital Logic

K Maps Boolean Algebra Combinational Circuits Number Systems Sequential Circuits

Database Management System

Er Diagrams Functional Dependencies and Normalization Structured Query Language Relational Algebra Transactions and Concurrency File Structures and Indexing

Data Structures

Arrays Stacks and Queues Linked List Trees Graphs Hashing

Computer Networks

Concepts of Layering Data Link Layer and Switching Network Layer Application Layer Protocol Routing Algorithm TCP UDP Sockets and Congestion Control Lan Technologies and Wi-Fi Network Security

Software Engineering

Compiler Design

Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization

Web Technologies

General Aptitude

Verbal Ability Logical Reasoning Numerical Ability

Discrete Mathematics

Set Theory & Algebra Linear Algebra Graph Theory Combinatorics Mathematical Logic Probability Calculus

Programming Languages

Basic of Programming Language Function and Recursion Pointer and Structure in C

Computer Organization

Computer Arithmetic Pipelining Machine Instructions and Addressing Modes Memory Interfacing IO Interface Alu Data Path and Control Unit Secondary Memory