ExamSIDE (Powered by ExamGOAL)
Questions
PREVIOUS NEXT
1
GATE CSE 2002
MCQ (Single Correct Answer)
+1
-0.3
The solution to the recurrence equation
T(2k) = 3 T(2k-1) + 1, T (1) = 1, is:
A
2k
B
(3k+1 - 1)/2
C
3 log 2K
D
2 log 3K
2
GATE CSE 2001
MCQ (Single Correct Answer)
+1
-0.3
Randomized quicksort is an extension of quicksort where the pivot is chosen randomly. What is the worst case complexity of sorting n numbers using randomized quicksort?
A
O(n)
B
O(n Log n)
C
O(n2)
D
O(n!)
3
GATE CSE 2000
MCQ (Single Correct Answer)
+1
-0.3
Let s be a sorted array of n integers. Let t(n) denote the time taken for the most efficient algorithm to determined if there are two elements with sum less than 1000 in s. which of the following statements is true?
A
t (n) is O(1)
B
n < t (n) < $$n\log _2^n$$
C
$$n\log _2^n$$ < t (n) < $$\left( {\matrix{ n \cr 2 \cr } } \right)$$
D
t(n) = $$\left( {\matrix{ n \cr 2 \cr } } \right)$$
4
GATE CSE 1999
MCQ (Single Correct Answer)
+1
-0.3
A sorting technique is called stable if:
A
It takes O(nlog n)time
B
It maintains the relative order of occurrence of non-distinct elements
C
It uses divide and conquer paradigm
D
It takes O(n) space
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 File System IO and Protection Deadlocks Memory Management
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
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
Concepts of Layering Lan Technologies and Wi-Fi Data Link Layer and Switching Network Layer Routing Algorithm TCP UDP Sockets and Congestion Control Application Layer Protocol Network Security
Software Engineering
Software Engineering
Compiler Design
Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization
Web Technologies
Web Technologies
General Aptitude
Numerical Ability 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 Machine Instructions and Addressing Modes IO Interface Pipelining Alu Data Path and Control Unit Secondary Memory
EXAM MAP
Joint Entrance Examination
JEE MainJEE AdvancedWB JEEBITSATMHT CETKCETCOMEDKVITEEE
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12