GeeksforGeeks
Courses Suggest an Article
×
Suggest a Topic
Skip to content
  • Algo ▼
    • Analysis of Algorithms
    • Topicwise ►
      • Searching Algorithms
      • Sorting Algorithms
      • Graph Algorithms
      • Bit Algorithms
      • Pattern Searching
      • Geometric Algorithms
      • Mathematical Algorithms
      • Randomized Algorithms
      • Game Theory
    • Algorithm Paradigms ►
      • Greedy Algorithms
      • Dynamic Programming
      • Divide and Conquer
      • Backtracking
      • Branch & Bound
    • All Algorithms
  • DS ▼
    • Array
    • LinkedList
    • Stack
    • Queue
    • Tree based DS ►
      • Binary Tree
      • Binary Search Tree
      • Heap
    • Hashing
    • Graph
    • Advanced Data Structure
    • Matrix
    • Strings
    • All Data Structures
  • Languages ▼
    • C
    • C++
    • Java
    • Python
    • C#
    • PHP
    • JavaScript
    • SQL
    • HTML
    • CSS
    • Program Output
  • Interview ▼
    • Company Prep
    • Top Topics
    • Practice Company Questions
    • Interview Experiences
    • Experienced Interviews
    • Internship Interviews
    • Competitive Programming
    • Design Patterns
    • Multiple Choice Quizzes
  • Students ▼
    • Campus Ambassador Program
    • Project
    • Geek of the Month
    • Placement Course
    • Competitive Programming
    • Testimonials
    • Geek on the Top
    • Careers
    • Internship
    • School Programming
  • GATE ▼
    • GATE Notes
    • GATE CS Corner
    • Last Minute Notes
    • GATE 2019
    • GATE Official Papers
    • ISRO CS Exam
    • UGC NET Papers
    • UGC NET CS Paper II
    • UGC NET CS Paper III
  • CS Subjects ▼
    • Core Subjects ►
      • Engg. Mathematics
      • Operating Systems
      • Computer Networks
      • DBMS
      • Compiler Design
      • Theory of Computation
      • Digital Electronics
      • Computer Organization & Architecture
      • Software Engineering
      • Microprocessor
    • Web Technology
    • Advanced Topics
    • Machine Learning
    • Computer Graphics
    • What’s Difference?
  • Quizzes ▼
    • Languages ►
      • C
      • C++
      • Java
      • Python
    • CS Subjectwise ►
      • Data Structures
      • Algorithms
      • Operating Systems
      • DBMS
      • Compiler Design
      • Computer Networks
      • Theory of Computation
      • Computer Organization
      • Software Engineering
    • HTML & XML
    • Engg. Mathematics
    • Aptitude
  • GBlog
  • Puzzles
  • Practice
  • 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 CS 2013 | Question 54

3.5

Relation R has eight attributes ABCDEFGH. Fields of R contain only atomic values. F = {CH -> G, A -> BC, B -> CFH, E… Read More »

GATE
GATE-CS-2013
GATE-GATE CS 2013

GATE | GATE CS 2013 | Question 65

Consider the same data as above question. What is the minimum number of page colours needed to guarantee that no two synonyms map to different… Read More »

GATE
GATE-CS-2013
GATE-GATE CS 2013

GATE | GATE CS 2013 | Question 65

3

A computer uses 46-bit virtual address, 32-bit physical address, and a three-level paged page table organization. The page table base register stores the base address… Read More »

GATE
GATE-CS-2013
GATE-GATE CS 2013

GATE | GATE CS 2013 | Question 51

In the above question, if array A is made to hold the string “abcde”, which of the above four test cases will be successful in… Read More »

GATE
GATE-CS-2013
GATE-GATE CS 2013

GATE | GATE CS 2013 | Question 50

The procedure given below is required to find and replace certain characters inside an input character string supplied in array A. The characters to be… Read More »

GATE
GATE-CS-2013
GATE-GATE CS 2013

GATE | GATE CS 2013 | Question 49

Consider the same data as above question. What is the minimum number of registers needed in the instruction set architecture of the processor to compile… Read More »

GATE
GATE-CS-2013
GATE-GATE CS 2013

GATE | GATE CS 2013 | Question 48

The following code segment is executed on a processor which allows only register operands in its instructions. Each instruction can have atmost two source operands… Read More »

GATE
GATE-CS-2013
GATE-GATE CS 2013

GATE | GATE CS 2013 | Question 47

4.3

(A) A (B) B (C) C (D) D Answer: (A) (D) Explanation:   Given statement is : ¬ ∃ x ( ∀y(α) ∧ ∀z(β) )… Read More »

GATE
GATE-CS-2013
GATE-GATE CS 2013

GATE | GATE CS 2013 | Question 65

5

A RAM chip has a capacity of 1024 words of 8 bits each (1K × 8). The number of 2 × 4 decoders with enable… Read More »

GATE
GATE-CS-2013
GATE-GATE CS 2013

GATE | GATE CS 2013 | Question 65

5

Consider an instruction pipeline with five stages without any branch prediction: Fetch Instruction (FI), Decode Instruction (DI), Fetch Operand (FO), Execute Instruction (EI) and Write… Read More »

GATE
GATE-CS-2013
GATE-GATE CS 2013

GATE | GATE CS 2013 | Question 44

3

Consider the following operation along with Enqueue and Dequeue operations on queues, where k is a global parameter. MultiDequeue(Q){ m = k while (Q is… Read More »

GATE
GATE-CS-2013
GATE-GATE CS 2013

GATE | GATE CS 2013 | Question 43

The preorder traversal sequence of a binary search tree is 30, 20, 10, 15, 25, 23, 39, 35, 42. Which one of the following is… Read More »

GATE
GATE-CS-2013
GATE-GATE CS 2013

GATE | GATE CS 2013 | Question 42

What is the return value of f(p,p), if the value of p is initialized to 5 before the call? Note that the first parameter is… Read More »

GATE
GATE-CS-2013
GATE-GATE CS 2013

GATE | GATE CS 2013 | Question 41

Which of the following is/are undecidable? (A) 3 only (B) 3 and 4 only (C) 1, 2 and 3 only (D) 2 and 3 only… Read More »

GATE
GATE-CS-2013
GATE-GATE CS 2013

GATE | GATE CS 2013 | Question 65

Consider the following two sets of LR(1) items of an LR(1) grammar. X -> c.X, c/d X -> .cX, c/d X -> .d, c/d X… Read More »

GATE
GATE-CS-2013
GATE-GATE CS 2013
Page 2,052 of 2,172« First«...102030...2,0502,0512,0522,0532,054...2,0602,0702,080...»Last »

Most Popular Articles
  • Must Do Coding Questions for Companies like Amazon, Microsoft, Adobe, ...
  • Must Do Coding Questions Company-wise
  • Why array index starts from zero ?
  • string find in C++
  • Taking input from console in Python

Most Visited Articles
  • Python list sort()
  • How do I become a good Java programmer?
  • How to prepare for GATE CSE - 2019
  • GATE CSE Test Series - 2019 | Sudo GATE
  • Practice for cracking any coding interview

Most Trending Articles
  • Implementing a Linked List in Java using Class
  • OOPs | Object Oriented Design
  • How to get rid of Java TLE problem
  • Implement a stack using singly linked list
  • Remove duplicates from unsorted array
  • Introduction to HTML CSS | Learn to Design your First Website in Just 1 Week
  • HTML Course | Structure of an HTML Document
  • HTML Course | First Web Page | Printing Hello World
  • HTML Course | Basics of HTML
  • Taking input in Python
  • Taking multiple inputs from user in Python
  • Amazon Interview Experience SDE Off Campus
  • Amazon Interview Experience SDE-1
  • Amazon Interview Experience SDE 1 (2.5 Years Experienced)
  • Amazon Interview Experience SDE1

  • GeeksforGeeks
  • 710-B, Advant Navis Business Park,
  • Sector-142, 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
  • Company-wise
  • Topic-wise
  • Contests
  • Subjective Questions
  • CONTRIBUTE
  • Write an Article
  • Write Interview Experience
  • Internships
  • Videos
@geeksforgeeks, Some rights reserved