GeeksforGeeks
x
×
Suggest a Topic
menu
    GeeksforGeeks
  • Skip to content
    • Tutorials
      • Algorithms
        • Analysis of Algorithms
          • Asymptotic Analysis
          • Worst, Average and Best Cases
          • Asymptotic Notations
          • Little o and little omega notations
          • Lower and Upper Bound Theory
          • Analysis of Loops
          • Solving Recurrences
          • Amortized Analysis
          • What does ‘Space Complexity’ mean?
          • Pseudo-polynomial Algorithms
          • Polynomial Time Approximation Scheme
          • A Time Complexity Question
        • Searching Algorithms
        • Sorting Algorithms
        • Graph Algorithms
        • Pattern Searching
        • Geometric Algorithms
        • Mathematical
        • Randomized Algorithms
        • Greedy Algorithms
        • Dynamic Programming
        • Divide and Conquer
        • Backtracking
        • Branch and Bound
        • All Algorithms
      • Data Structures
        • Arrays
        • Linked List
        • Stack
        • Queue
        • Binary Tree
        • Binary Search Tree
        • Heap
        • Hashing
        • Graph
        • Advanced Data Structure
        • Matrix
        • Strings
        • All Data Structures
      • Languages
        • C
        • C++
        • Java
        • Python
        • C#
        • Javascript
        • JQuery
        • SQL
        • PHP
        • Scala
        • Perl
        • Go Language
        • HTML
        • CSS
        • Kotlin
      • Interview Corner
        • Company Preparation
        • Top Topics
        • Practice Company Questions
        • Interview Experiences
        • Experienced Interviews
        • Internship Interviews
        • Competitive Programming
        • Design Patterns
        • Multiple Choice Quizzes
      • GATE
        • GATE CS Notes 2020
        • Last Minute Notes
        • GATE CS Solved Papers
        • GATE CS Orignal Papers and Official Keys
        • GATE 2020 Dates
        • GATE CS 2020 Syllabus
        • Important Topics for GATE CS
        • Sudo GATE 2020
      • ISRO CS
        • ISRO CS Solved Papers
        • ISRO CS Original Papers and Official Keys
        • ISRO CS Syllabus for Scientist/Engineer Exam
      • UGC NET CS
        • UGC NET CS Notes Paper II
        • UGC NET CS Notes Paper III
        • UGC NET CS Solved Papers
      • CS Subjects
        • Mathematics
          • First Order Logic
          • Combinatorics
          • Set Theory
          • Graph Theory
          • Linear Algebra
          • Probability
          • Calculus
        • Operating Systems
          • Processes, threads, CPU scheduling
          • Process Synchronization
          • Deadlock
          • Memory Management
          • File and Disk Management
        • DBMS
          • Entity Relationship Model
          • Relational Model
          • Normalisation
          • SQL
          • Transactions and concurrency control
        • Computer Networks
          • Basics
          • Data Link Layer
          • Network layer
          • Transport layer
          • Application layer
          • Network Security and Cryptography
        • Computer Organization and Architecture
          • Basics
          • ALU, data‐path and control unit
          • Pipelining
          • Memory Organisation
          • Input and Output Systems
        • Theory of Computation
          • Regular Languages and Finite Automata
          • Context Free Grammar and Context Free Languages
          • Turing Machine
        • Compiler Design
          • Introduction
          • Lexical Analysis
          • Syntax Analysis
          • Syntax Directed Translation
          • Runtime Environments
          • Code Generation and Optimization
        • Digital Logic
          • Boolean Algebra and Logic Gates
          • Combinational Logic Circuits
          • Flip-Flops and Sequential Circuits
        • Software Engineering
          • Introduction
          • Software Development Models & Architecture
          • Software Project Management
          • Software Requirements
          • Software Testing and Debugging
      • Web Technologies
        • HTML
        • CSS
        • JavaScript
        • PHP
        • JQuery
    • Students
      • Campus Ambassador Program
      • Project
      • Geek of the Month
      • Campus Geek of the Month
      • Placement Course
      • Competitive Programming
      • Testimonials
      • Geek on the Top
      • Careers
      • Internship
  • Courses
  • Home
  • All Algorithms
  • Analysis of Algorithms
  • Searching Algorithms
  • Sorting Algorithms
  • Graph Algorithms
  • Bit Algorithms
  • Pattern Searching
  • Geometric Algorithms
  • Mathematical Algorithms
  • Randomized Algorithms
  • Game Theory
  • Greedy Algorithms
  • Dynamic Programming
  • Divide and Conquer
  • Backtracking
  • Branch & Bound
  • All Data Structures
  • Array
  • LinkedList
  • Stack
  • Queue
  • Binary Tree
  • Binary Search Tree
  • Heap
  • Hashing
  • Graph
  • Advanced Data Structure
  • Matrix
  • Strings
  • C
  • C++
  • Java
  • Python
  • SQL
  • PHP
  • Javascript
  • Program Output
  • Company Prep
  • Top Topics
  • Practice Company Questions
  • Interview Experiences
  • Experienced Interviews
  • Internship Interviews
  • Competitive Programming
  • Design Patterns
  • Multiple Choice Quizzes
  • Campus Ambassador Program
  • Geek of the Month
  • Placement Course
  • Project
  • Competitive Programming
  • Testimonials
  • Geek on the Top
  • Careers
  • Internship
  • School Programming
  • GATE CS Corner
  • GATE Notes
  • Last Minute Notes
  • Official Papers
  • Gate 2018 Important Dates and Links
  • Operating Systems
  • DBMS
  • Computer Networks
  • Compiler Design
  • Web Technology
  • Computer Organization & Architecture
  • Digital Electronics
  • Engg. Mathematics
  • Theory of Computation
  • Advanced Topics
  • What’s Difference?
  • C
  • C++
  • Java
  • Python
  • Data Structures
  • Algorithms
  • Operating Systems
  • DBMS
  • Compiler Design
  • Computer Networks
  • Theory of Computation
  • Computer Organization
  • Software Engineering
  • HTML & XML
  • Engg. Mathematics
  • Aptitude
  • GBlog
  • Puzzles
  • What’s New?
    GeeksforGeeks
    Hire with us!
    • Write an Article
    • Courses @ GeeksforGeeks
    • Internships @ GeeksforGeeks
    • Coding Practice
    • How to write an Interview Experience?
    • Must Do Coding Questions Company-wise
    • Must Do Coding Questions Topic-wise
    • Basic
    • Easy
    • Medium
    • Hard
    • Expert
    • Step by Step Preparation
    • Company Preparation
    • Top Topics
    • Company Specific Practice
    • Software Design Patterns
    • Placements Preparation Course
    • Interview Corner
    • Recent Interview Experiences
    • GQ Home Page
    • Quiz Corner
    • LMNs
    • What's New ?
    • Leaderboard !!
    • Topic-wise Practice
    • Subjective Problems
    • Difficulty Level - School
    • Difficulty Level - Basic
    • Difficulty Level - Easy
    • Difficulty Level - Medium
    • Difficulty Level - Hard
    • Explore More...
    • C
    • C++
    • Java
    • Python
    • SQL
    • PHP
    • JavaScript
    • School Programming
    • Operating Systems
    • DBMS
    • Computer Networks
    • Engineering Mathematics
    • Design Patterns
    • Common Interview Puzzles
    • Web Technology
    • G-Facts
    • Computer Graphics
    • Image Processing
    • Project Ideas

    GATE | GATE MOCK 2017 | Question 21

    Consider a directed graph with n vertices and m edges such that all edges have same edge weights. Find the complexity of the best known… Read More »

    GATE
    GATE 2017 Mock
    GATE-GATE 2017 Mock

    GATE | GATE MOCK 2017 | Question 20

    (A) A (B) B (C) C (D) D Answer: (A) Explanation: Quiz of this Question My Personal Notes arrow_drop_up Save

    GATE
    GATE 2017 Mock
    GATE-GATE 2017 Mock

    GATE | GATE MOCK 2017 | Question 19

    Suppose a stack is to be implemented with a linked list instead of an array. What would be the effect on the time complexity of… Read More »

    GATE
    GATE 2017 Mock
    GATE-GATE 2017 Mock

    GATE | GATE MOCK 2017 | Question 18

    Which of the following statement is false ? (A) Indirect addressing can be used to pass array as a parameter. (B) Complex Instruction Set Computing(CISC)… Read More »

    GATE
    GATE 2017 Mock
    GATE-GATE 2017 Mock

    GATE | GATE MOCK 2017 | Question 17

    The complement of the function F = (A + B’)(C’ + D)(B’ + C) is: (A) A’B + CD’ + BC’ (B) AB’ + C’D… Read More »

    GATE
    GATE 2017 Mock
    GATE-GATE 2017 Mock

    GATE | GATE MOCK 2017 | Question 16

    The Boolean function f implemented in the figure shown below, using two input multiplexers is: (A) AB’C + ABC’ (B) A’B’C + A’BC’ (C) A’BC… Read More »

    GATE
    GATE 2017 Mock
    GATE-GATE 2017 Mock

    GATE | GATE MOCK 2017 | Question 15

    The initial state of a mod 10 up counter is 1000. What would be the state after 54 clock pulses? (A) 1000 (B) 0001 (C)… Read More »

    GATE
    GATE 2017 Mock
    GATE-GATE 2017 Mock

    GATE | GATE MOCK 2017 | Question 14

    (A) 1 (B) 2 (C) 3 (D) 0 Answer: (D) Explanation: It is echelon form. Rank of Q = 2 < n-1 We know that… Read More »

    GATE
    GATE 2017 Mock
    GATE-GATE 2017 Mock

    GATE | GATE MOCK 2017 | Question 13

    Let A = {a, b, c, d }, B = { p, q, r, s } denote sets. R : A –> B, R is… Read More »

    GATE
    GATE 2017 Mock
    GATE-GATE 2017 Mock

    GATE | GATE MOCK 2017 | Question 12

    Which of the below given sorting techniques has highest best-case runtime complexity. (A) Quick sort (B) Selection sort (C) Insertion sort (D) Bubble sort Answer:… Read More »

    GATE
    GATE 2017 Mock
    GATE-GATE 2017 Mock

    GATE | GATE MOCK 2017 | Question 11

    Find the Integral value of f(x) = x * sinx within the limits 0, π. (A) π (B) 2π (C) π/2 (D) 0 Answer: (A)… Read More »

    GATE
    GATE 2017 Mock
    GATE-GATE 2017 Mock

    GATE | GATE MOCK 2017 | Question 10

    Choose the missing number in the series: 9, 7, 12, 12, 15, 17, 18, 22, ? (A) 27 (B) 21 (C) 22 (D) 24 Answer:… Read More »

    GATE
    GATE 2017 Mock
    GATE-GATE 2017 Mock

    GATE | GATE MOCK 2017 | Question 9

    4.6

    Four different pens (1, 2, 3, 4) are to be distributed at random in four pen stands marked as 1, 2, 3, 4. What is… Read More »

    GATE
    GATE 2017 Mock
    GATE-GATE 2017 Mock

    GATE | GATE MOCK 2017 | Question 8

    ‘A’ sells a DVD to ‘B’ at a gain of 17% and ‘B’ then sells it to ‘C’ at a loss of 25%. If ‘C’… Read More »

    GATE
    GATE 2017 Mock
    GATE-GATE 2017 Mock

    GATE | GATE MOCK 2017 | Question 7

    3

    If (4446)x + (2222)x = (10001)x then value of (2342)x – (1656)x = (?)x (A) 453 (B) 353 (C) 893 (D) 686 Answer: (B) Explanation:… Read More »

    GATE
    GATE 2017 Mock
    GATE-GATE 2017 Mock
    Page 2,722 of 3,275« First«...102030...2,7202,7212,7222,7232,724...2,7302,7402,750...»Last »


    auto
    Most Popular Articles
    • Must Do Coding Questions for Companies like Amazon, Microsoft, Adobe, ...
    • Find the winner of the Game to Win by erasing any two consecutive similar alphabets
    • Find the integers that doesnot ends with T1 or T2 when squared and added X
    • Average
    • Perl | Reading a CSV File

    Most Visited Articles
    • Program to Encrypt a String using ! and @
    • Compare two strings considering only alphanumeric characters
    • Maximum non-attacking Knights that can be placed on an N*M Chessboard
    • Rat and Poisoned bottle Problem
    • Roots of the quadratic equation when a + b + c = 0 without using Shridharacharya formula

    ✍
    Write a Testimonial
    • GeeksforGeeks
    • 5th Floor, A-118,
    • Sector-136, Noida, Uttar Pradesh - 201305
    • feedback@geeksforgeeks.org
    • COMPANY
    • About Us
    • Careers
    • Privacy Policy
    • Contact Us
    • LEARN
    • Algorithms
    • Data Structures
    • Languages
    • CS Subjects
    • Video Tutorials
    • PRACTICE
    • Courses
    • Company-wise
    • Topic-wise
    • How to begin?
    • CONTRIBUTE
    • Write an Article
    • Write Interview Experience
    • Internships
    • Videos
    @geeksforgeeks, Some rights reserved