GATE CSE 2002 | Complexity Analysis and Asymptotic Notations Question 48 | Algorithms

PREVIOUS NEXT

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)

GATE CSE 1997

MCQ (Single Correct Answer)

-0.3

The concatenation of two lists is to be performed on 0(1) time. Which of the following implementations of a list should be used?

Singly linked list

Doubly linked list

Circular doubly linked list

Array implementation of list

PREVIOUS NEXT

GATE CSE Subjects

Theory of Computation

Undecidability Finite Automata and Regular Language Push Down Automata and Context Free Language 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 P and NP Concepts Dynamic Programming

Digital Logic

Number Systems Boolean Algebra K Maps Combinational Circuits Sequential Circuits

Database Management System

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

Data Structures

Arrays Stacks and Queues Linked List Trees Graphs Hashing

Computer Networks

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

Software Engineering

Compiler Design

Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization

Web Technologies

General Aptitude

Numerical Ability Logical Reasoning Verbal Ability

Discrete Mathematics

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

Programming Languages

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

Computer Organization

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