HOME - GATEBOOKALL COURSESTESTIMONIALSDISCUSSION FORUMABOUTSHOPCOMPUTER ORGANIZATION GATEBOOK is the best online coaching for gate cse in India for GATE computer science preparation. We have 3 courses ProGATE, SimpleGATE, and MissionIIT. SimpleGATE is the most affordable course, in which you will be given only videos. In ProGATE, SimpleGATE course, and MissionIIT course all contain videos. In all courses, doubts will be answered under the videos.

ALL COURSES

Data Structures and Algorithms. See more Basic Maths. See more Operating Systems. See more

TEST SERIES

Questions will be opened for discussion on next day, and key will be published in a day. Once the ranks are announced you would able to check your results in Taken Exams. Tests will be available to attempt till GATE 2022, but they will not be considered for Ranking. Enroll Here View Tests. Subject. DATABASE MANAGEMENT SYSTEMS Syllabus: Databases ER‐model. Relational model: relational algebra, tuple calculus, SQL. Integrity constraints, normal forms. File organization, indexing THEORY OF COMPUTATION Theory of computation. Regular expressions and finite automata. Context-free grammars and push-down automata. Regular and context-free languages, pumping lemma. Turing machines and undecidability. Very important topics: Regular expressions and finite automata. Context-free grammars and push-down automata. Regular and context-free

languages.

DIGITAL LOGIC

OOK Digital Logic The Gatebook May 2018 1 Boolean Algebra 1.When a 2-input NAND gate has all its input lines and output line in-verted,

it becomes:

HOME - GATEBOOKALL COURSESTESTIMONIALSDISCUSSION FORUMABOUTSHOPCOMPUTER ORGANIZATION GATEBOOK is the best online coaching for gate cse in India for GATE computer science preparation. We have 3 courses ProGATE, SimpleGATE, and MissionIIT. SimpleGATE is the most affordable course, in which you will be given only videos. In ProGATE, SimpleGATE course, and MissionIIT course all contain videos. In all courses, doubts will be answered under the videos.

ALL COURSES

Data Structures and Algorithms. See more Basic Maths. See more Operating Systems. See more

TEST SERIES

Questions will be opened for discussion on next day, and key will be published in a day. Once the ranks are announced you would able to check your results in Taken Exams. Tests will be available to attempt till GATE 2022, but they will not be considered for Ranking. Enroll Here View Tests. Subject. DATABASE MANAGEMENT SYSTEMS Syllabus: Databases ER‐model. Relational model: relational algebra, tuple calculus, SQL. Integrity constraints, normal forms. File organization, indexing THEORY OF COMPUTATION Theory of computation. Regular expressions and finite automata. Context-free grammars and push-down automata. Regular and context-free languages, pumping lemma. Turing machines and undecidability. Very important topics: Regular expressions and finite automata. Context-free grammars and push-down automata. Regular and context-free

languages.

DIGITAL LOGIC

OOK Digital Logic The Gatebook May 2018 1 Boolean Algebra 1.When a 2-input NAND gate has all its input lines and output line in-verted,

it becomes:

ABOUT - GATEBOOK

About Gatebook. GATE BOOK is a complete book for your GATE computer science preparation. Watch lectures from the GATEBOOK. Read concepts in GATEBOOK. Solve practice questions in GATEBOOK. Write exams in GATEBOOK. Discuss all your queries/doubts in GATEBOOK. Join the best colleges in India. So simple, That is it all SIMPLEGATE - GATEBOOK Complete topic wise video lectures for all subjects to understand every topic in deep Validity - 1 Year

DIGITAL LOGIC

Digital Logic. Boolean algebra. Combinational and sequential circuits. Minimization. Number representations and computer arithmetic (fixed and floating-point). Very important topics: Boolean algebra. Combinational and sequential circuits. Minimization. Text COMPUTER ORGANIZATION Basis Behind Booth’s Recoded Multiplier. Booth Modified Algorithm. Floating Point Representation 1. Floating Point Representation Part2. Floating Point Representation Part3. Special Values in Floating Point Representation. Guard bits and Truncation. GATE problems related to Floating Point Numbers. Addressing Modes 9 Topics. PROGATE - 2022 - GATEBOOK 1 review for ProGATE – 2022. There are no reviews yet. Be the first to review “ProGATE – 2022” Cancel reply You must be logged in to

post a review.

DATA STRUCTURES AND ALGORITHMS Programming and Data Structures Programming in C, Arrays, Recursion, stacks, queues, linked lists, trees, binary search trees, binary

heaps, graphs.

THEGATEBOOK

Graph theory notes and practice questions-Part 1 THEGATEBOOK Complete book for gate preparation Test series Online Lectures

www.thegatebook.in

OPERATING SYSTEMS

CPU scheduling. Memory management and virtual memory. File systems. Very important topics: Processes, Deadlock, CPU scheduling,Memory management and virtual memory, inter‐process communication, concurrency and synchronization. Text Books: Operating System Principles by Galvin. 4 MEMORY HIERARCHY, CACHE, MAIN MEMORY AND SECONDARY STORAGE OOK Mail to getgatebook@gmail.com for online lectures www.thegatebook.in 15.A CPU has 32-bit memory address and a 1024 KB cache memory. The cache is organized as a 16-way set associative cache with cache block size MAIL TO GETGATEBOOK@GMAIL.COM FOR ONLINE LECTURES WWW OOK Mail to getgatebook@gmail.com for online lectures www.thegatebook.in 5.The stage delays in a ve stage pipeline are 950,500,1150,600 and 790 pi- HOME - GATEBOOKALL COURSESTESTIMONIALSDISCUSSION FORUMABOUTSHOPCOMPUTER ORGANIZATION GATEBOOK is the best online coaching for gate cse in India for GATE computer science preparation. We have 3 courses ProGATE, SimpleGATE, and MissionIIT. SimpleGATE is the most affordable course, in which you will be given only videos. In ProGATE, SimpleGATE course, and MissionIIT course all contain videos. In all courses, doubts will be answered under the videos.

ALL COURSES

Data Structures and Algorithms. See more Basic Maths. See more Operating Systems. See more

TEST SERIES

Questions will be opened for discussion on next day, and key will be published in a day. Once the ranks are announced you would able to check your results in Taken Exams. Tests will be available to attempt till GATE 2022, but they will not be considered for Ranking. Enroll Here View Tests. Subject. DATABASE MANAGEMENT SYSTEMS Syllabus: Databases ER‐model. Relational model: relational algebra, tuple calculus, SQL. Integrity constraints, normal forms. File organization, indexing 3 COMBINATIONAL CIRCUITS OOK Mail to getgatebook@gmail.com for online lectures www.thegatebook.in 3 Combinational Circuits 1.In a combinational circuit, the output at any time depends only on:

DIGITAL LOGIC

OOK Digital Logic The Gatebook May 2018 1 Boolean Algebra 1.When a 2-input NAND gate has all its input lines and output line in-verted,

it becomes:

HOME - GATEBOOKALL COURSESTESTIMONIALSDISCUSSION FORUMABOUTSHOPCOMPUTER ORGANIZATION GATEBOOK is the best online coaching for gate cse in India for GATE computer science preparation. We have 3 courses ProGATE, SimpleGATE, and MissionIIT. SimpleGATE is the most affordable course, in which you will be given only videos. In ProGATE, SimpleGATE course, and MissionIIT course all contain videos. In all courses, doubts will be answered under the videos.

ALL COURSES

Data Structures and Algorithms. See more Basic Maths. See more Operating Systems. See more

TEST SERIES

Questions will be opened for discussion on next day, and key will be published in a day. Once the ranks are announced you would able to check your results in Taken Exams. Tests will be available to attempt till GATE 2022, but they will not be considered for Ranking. Enroll Here View Tests. Subject. DATABASE MANAGEMENT SYSTEMS Syllabus: Databases ER‐model. Relational model: relational algebra, tuple calculus, SQL. Integrity constraints, normal forms. File organization, indexing 3 COMBINATIONAL CIRCUITS OOK Mail to getgatebook@gmail.com for online lectures www.thegatebook.in 3 Combinational Circuits 1.In a combinational circuit, the output at any time depends only on:

DIGITAL LOGIC

OOK Digital Logic The Gatebook May 2018 1 Boolean Algebra 1.When a 2-input NAND gate has all its input lines and output line in-verted,

it becomes:

TEST SERIES

Questions will be opened for discussion on next day, and key will be published in a day. Once the ranks are announced you would able to check your results in Taken Exams. Tests will be available to attempt till GATE 2022, but they will not be considered for Ranking. Enroll Here View Tests. Subject. COMPUTER ORGANIZATION Basis Behind Booth’s Recoded Multiplier. Booth Modified Algorithm. Floating Point Representation 1. Floating Point Representation Part2. Floating Point Representation Part3. Special Values in Floating Point Representation. Guard bits and Truncation. GATE problems related to Floating Point Numbers. Addressing Modes 9 Topics.

DISCRETE MATHS

Lesson Content. 0% Complete 0/7 Steps. L1- Properties-reflexive, symmetric, transitive, anti-symmetric, asymmetric, irreflexive. L2-Equivalence relations. L3- Equivalence relations, gate problems on equivalence relations. L4- Reflexive symmetric and transitive closures. L5- Partial order relations, hasse diagrams.

DIGITAL LOGIC

Digital Logic. Boolean algebra. Combinational and sequential circuits. Minimization. Number representations and computer arithmetic (fixed and floating-point). Very important topics: Boolean algebra. Combinational and sequential circuits. Minimization. Text DATA STRUCTURES AND ALGORITHMS Programming and Data Structures Programming in C, Arrays, Recursion, stacks, queues, linked lists, trees, binary search trees, binary

heaps, graphs.

4 MEMORY HIERARCHY, CACHE, MAIN MEMORY AND SECONDARY STORAGE OOK Mail to getgatebook@gmail.com for online lectures www.thegatebook.in 15.A CPU has 32-bit memory address and a 1024 KB cache memory. The cache is organized as a 16-way set associative cache with cache block size

THEGATEBOOK

Graph theory notes and practice questions-Part 1 THEGATEBOOK Complete book for gate preparation Test series Online Lectures

www.thegatebook.in

GRAPH THEORY

Chapter 8 Graph Theory 1. Suppose that d 1;d 2;:::;d n is a graphic sequence. Show that there is a simple graph with vertices v 1;v 2;:::;v n such that deg(v i) = d i for i= 1;2;:::;nand v i is adjacent to v 2;:::;v d i+1 2. Show that a sequence d 1;d 2;:::;d n of non negative in non increasing order is a graphic sequence if and only if the sequence obtained by reordering PART VI ANSWERS AND DISCUSSION FUNCTIONS *$7(%22. Join GATE BOOK for deep learning xb= b!(2) bxb= bb xb= b!(3) From (2) and (3) xb= bxfor every element b2Ghence xis an identity element. Now we need to show inverse.

3 STACKS AND QUEUES

OOK Mail to getgatebook@gmail.com for online lectures www.thegatebook.in (B) 4050 (C) 5040 (D) 5050 3 Stacks and Queues 1.Which one of the following is an application of Stack Data

Structure?

HOME - GATEBOOKALL COURSESTESTIMONIALSDISCUSSION FORUMABOUTSHOPCOMPUTER ORGANIZATION GATEBOOK is the best online coaching for gate cse in India for GATE computer science preparation. We have 3 courses ProGATE, SimpleGATE, and MissionIIT. SimpleGATE is the most affordable course, in which you will be given only videos. In ProGATE, SimpleGATE course, and MissionIIT course all contain videos. In all courses, doubts will be answered under the videos.

ALL COURSES

Data Structures and Algorithms. See more Basic Maths. See more Operating Systems. See more

TEST SERIES

Questions will be opened for discussion on next day, and key will be published in a day. Once the ranks are announced you would able to check your results in Taken Exams. Tests will be available to attempt till GATE 2022, but they will not be considered for Ranking. Enroll Here View Tests. Subject. DATABASE MANAGEMENT SYSTEMS Syllabus: Databases ER‐model. Relational model: relational algebra, tuple calculus, SQL. Integrity constraints, normal forms. File organization, indexing 3 COMBINATIONAL CIRCUITS OOK Mail to getgatebook@gmail.com for online lectures www.thegatebook.in 3 Combinational Circuits 1.In a combinational circuit, the output at any time depends only on:

DIGITAL LOGIC

OOK Digital Logic The Gatebook May 2018 1 Boolean Algebra 1.When a 2-input NAND gate has all its input lines and output line in-verted,

it becomes:

HOME - GATEBOOKALL COURSESTESTIMONIALSDISCUSSION FORUMABOUTSHOPCOMPUTER ORGANIZATION GATEBOOK is the best online coaching for gate cse in India for GATE computer science preparation. We have 3 courses ProGATE, SimpleGATE, and MissionIIT. SimpleGATE is the most affordable course, in which you will be given only videos. In ProGATE, SimpleGATE course, and MissionIIT course all contain videos. In all courses, doubts will be answered under the videos.

ALL COURSES

Data Structures and Algorithms. See more Basic Maths. See more Operating Systems. See more

TEST SERIES

Questions will be opened for discussion on next day, and key will be published in a day. Once the ranks are announced you would able to check your results in Taken Exams. Tests will be available to attempt till GATE 2022, but they will not be considered for Ranking. Enroll Here View Tests. Subject. DATABASE MANAGEMENT SYSTEMS Syllabus: Databases ER‐model. Relational model: relational algebra, tuple calculus, SQL. Integrity constraints, normal forms. File organization, indexing 3 COMBINATIONAL CIRCUITS OOK Mail to getgatebook@gmail.com for online lectures www.thegatebook.in 3 Combinational Circuits 1.In a combinational circuit, the output at any time depends only on:

DIGITAL LOGIC

OOK Digital Logic The Gatebook May 2018 1 Boolean Algebra 1.When a 2-input NAND gate has all its input lines and output line in-verted,

it becomes:

TEST SERIES

Questions will be opened for discussion on next day, and key will be published in a day. Once the ranks are announced you would able to check your results in Taken Exams. Tests will be available to attempt till GATE 2022, but they will not be considered for Ranking. Enroll Here View Tests. Subject. COMPUTER ORGANIZATION Basis Behind Booth’s Recoded Multiplier. Booth Modified Algorithm. Floating Point Representation 1. Floating Point Representation Part2. Floating Point Representation Part3. Special Values in Floating Point Representation. Guard bits and Truncation. GATE problems related to Floating Point Numbers. Addressing Modes 9 Topics.

DISCRETE MATHS

Lesson Content. 0% Complete 0/7 Steps. L1- Properties-reflexive, symmetric, transitive, anti-symmetric, asymmetric, irreflexive. L2-Equivalence relations. L3- Equivalence relations, gate problems on equivalence relations. L4- Reflexive symmetric and transitive closures. L5- Partial order relations, hasse diagrams.

DIGITAL LOGIC

Digital Logic. Boolean algebra. Combinational and sequential circuits. Minimization. Number representations and computer arithmetic (fixed and floating-point). Very important topics: Boolean algebra. Combinational and sequential circuits. Minimization. Text DATA STRUCTURES AND ALGORITHMS Programming and Data Structures Programming in C, Arrays, Recursion, stacks, queues, linked lists, trees, binary search trees, binary

heaps, graphs.

4 MEMORY HIERARCHY, CACHE, MAIN MEMORY AND SECONDARY STORAGE OOK Mail to getgatebook@gmail.com for online lectures www.thegatebook.in 15.A CPU has 32-bit memory address and a 1024 KB cache memory. The cache is organized as a 16-way set associative cache with cache block size

THEGATEBOOK

Graph theory notes and practice questions-Part 1 THEGATEBOOK Complete book for gate preparation Test series Online Lectures

www.thegatebook.in

GRAPH THEORY

Chapter 8 Graph Theory 1. Suppose that d 1;d 2;:::;d n is a graphic sequence. Show that there is a simple graph with vertices v 1;v 2;:::;v n such that deg(v i) = d i for i= 1;2;:::;nand v i is adjacent to v 2;:::;v d i+1 2. Show that a sequence d 1;d 2;:::;d n of non negative in non increasing order is a graphic sequence if and only if the sequence obtained by reordering PART VI ANSWERS AND DISCUSSION FUNCTIONS *$7(%22. Join GATE BOOK for deep learning xb= b!(2) bxb= bb xb= b!(3) From (2) and (3) xb= bxfor every element b2Ghence xis an identity element. Now we need to show inverse.

3 STACKS AND QUEUES

OOK Mail to getgatebook@gmail.com for online lectures www.thegatebook.in (B) 4050 (C) 5040 (D) 5050 3 Stacks and Queues 1.Which one of the following is an application of Stack Data

Structure?

THE GATEBOOK

Sign In

Sign In

Reset Password

* Home

* Video Courses Details

* Courses We Offer

* Test series 2020

* Discussion Forum

* Testimonials

* About

* Contact Us

Home HomeVideo Courses DetailsCourses We OfferTest series 2020Discussion ForumTestimonialsAboutContact Us PROGATE FOR 2021: 15,000₹ * COMPLETE TOPIC WISE VIDEO LECTURES FOR ALL SUBJECTS TO UNDERSTAND

EVERY TOPIC IN DEEP

* _Discussion forum to clear all the doubts and interact with fellow

aspirants_

* COMPLETE TEST SERIES WITH DETAILED SOLUTIONS * _Preparation plan and strategy, along with resources and practice questions for each topic_ GATE CS TEST SERIES FOR 2020: 1,000₹ * 70 DIFFERENT TESTS TO CHECK AND IMPROVE THE PREPARATION AT VARIOUS STAGES WITH DETAILED SOLUTIONS * _500₹ reward for top 10 performers in each test_ * COMPLETE PREPARATION PLAN ALIGNING WITH THE PRACTICE TESTS TO

MONITOR PERFORMANCE

* _20 Grand Tests and 3 MOCK GATE tests with GATE level questions_ PROGATE 2021: 9,000₹ * COMPLETE TOPIC WISE VIDEO LECTURES FOR ALL SUBJECTS TO UNDERSTAND

EVERY TOPIC IN DEEP

* _Discussion forum to clear all the doubts and interact with fellow

aspirants_

* Complete test series with detailed solutions * VALID FOR 6 MONTHS Please visit our our YOUTUBE CHANNEL

for

sample videos and mail us at GETGATEBOOK@GMAIL.COM for further

information

� GATEBOOK

* Home

* Video Courses Details

* Courses We Offer

* Test series 2020

* Discussion Forum

* Testimonials

* About

* Contact Us