Top Sites>Gate Vidyalay | A temple of learning for GATE, NET, PSU's

User-agent: *
Disallow: /wp-admin/
Allow: /wp-admin/admin-ajax.php

Sitemap: https://www.gatevidyalay.com/sitemap.xml
Sitemap: https://www.gatevidyalay.com/sitemap.rss

Generated by All in One SEO v4.9.5.1, this is an llms.txt file, used by LLMs to index the site.

# Gate Vidyalay

A temple of learning for GATE, NET, PSUs

## Sitemaps

- [XML Sitemap](https://www.gatevidyalay.com/sitemap.xml): Contains all public & indexable URLs for this website.

## Posts

- [5 Free And Paid Turnitin Alternatives](https://www.gatevidyalay.com/turnitin-alternatives/) - The 5 plagiarism checkers discussed here are more than enough to shift you from Turnitin. Each tool offers flexible options for both free & paid users.
- [GATE 2026: Complete Exam Information](https://www.gatevidyalay.com/gate-2026-complete-exam-information/) - GATE is conducted for admission to the PG engineering programs. Students must clear their BE/B.Tech. course or are in their final year to appear for this exam
- [From FAQ to Face-Time:Answering with Avatars](https://www.gatevidyalay.com/from-faq-to-face-timeanswering-with-avatars/)
- [Smart Way To Get More Views From Old Content](https://www.gatevidyalay.com/smart-way-to-get-more-views-from-old-content/) - A better way to grow is to focus on what you already have in your library. When you use earlier content, you make your work go further and reach more people.
- [Video Formula:How to Create Viral Content](https://www.gatevidyalay.com/video-formulahow-to-create-viral-content/) - If you want your content to be seen by lots of people, you can use services that help your videos get more views. This helps your video grow & get traction.
- [Ways To Increase Views Across Social Platforms](https://www.gatevidyalay.com/ways-to-increase-views-across-social-platforms/) - When you use smart steps the right way and keep working at it, you can reach more people. This way, your posts will get the right amount of attention.
- [Bachelor of Technology Degree in 2025](https://www.gatevidyalay.com/bachelor-of-technology-degree-in-2025/) - A Bachelor of Technology isn’t just a degree. It’s a toolbox. You don’t need to follow one path. You can mix fields. You can learn new things after graduation.
- [Northeastern Vs University of North Texas](https://www.gatevidyalay.com/northeastern-vs-university-of-north-texas/) - Understand the UNT and Northern acceptance rate comparison based on different factors. Know why acceptance rate matters and how to choose the best college.
- [How to Get Into Top Computer Science Program](https://www.gatevidyalay.com/how-to-get-into-top-computer-science-program/) - Getting into a top CS program requires planning, dedication & standout application. Consider consulting a college admissions counselor to refine your strategy.
- [Get Into an Ivy League for Computer Science](https://www.gatevidyalay.com/get-into-an-ivy-league-for-computer-science/) - How to Get Into an Ivy League for Computer Science: Getting into Ivy League for computer science requires academic excellence, projects & compelling narrative.
- [Round Robin | Round Robin Scheduling | Examples](https://www.gatevidyalay.com/round-robin-round-robin-scheduling-examples/) - Round Robin Scheduling is a CPU scheduling algorithm that assigns CPU on basis of FCFS for fixed time called as time quantum. Round Robin Scheduling Example. Round Robin Scheduling is FCFS Scheduling with preemptive mode.
- [How To Encourage Logical Reasoning In Kids](https://www.gatevidyalay.com/how-to-encourage-logical-reasoning-in-kids/) - The best schools in Bangalore India focus on integrating methods. Here, we highlight engaging activities that encourage critical thinking & logical reasoning.
- [How Forex Market Promotes Economic Perspective](https://www.gatevidyalay.com/how-forex-market-promotes-economic-perspective/) - This article explores how forex trading contributes to economic & political forecasting, the role of forex robots their broader impact on the global economy.
- [Top 10 Workbooks for Kids to Boost Early Learning Skills](https://www.gatevidyalay.com/top-10-workbooks-for-kids-to-boost-early-learning-skills/) - Top 10 Workbooks for Kids to Boost Early Learning Skills- When it comes to choosing the right workbook for hild, understanding the types available is crucial.
- [IBPS PO Data Analysis and Interpretation](https://www.gatevidyalay.com/ibps-po-data-analysis-and-interpretation/) - How to prepare for IBPS PO Exam? Preparing for IBPS PO exam demands a sharp eye for detail, the ability to think critically, and quick decision-making skills.
- [Forex Trading:Smart Skill for GATE Aspirants](https://www.gatevidyalay.com/forex-tradingsmart-skill-for-gate-aspirants/) - For GATE aspirants looking to enhance their financial knowledge and develop valuable life skills, forex trading offers an exciting opportunity.
- [GATE Important Topics for CSE](https://www.gatevidyalay.com/gate-important-topics-for-cse-gate-2019/) - In this article, all the topics from all the subjects which are extremely important from the GATE examination point of view for CSE students have been brought out. Prepare them well to get the best results.
- [How To Download Free Video Lectures?](https://www.gatevidyalay.com/how-to-download-free-video-lectures/) - How to download videos- This article discusses the methods to download your desired videos to watch them even without internet and explains their pros and cons.
- [Why Is Plagiarism Unacceptable In Resume?](https://www.gatevidyalay.com/why-is-plagiarism-unacceptable-in-resume/) - This article explains why plagiarism is unacceptable in resume writing and tips to avoid it. Hopefully, you will find it beneficial!
- [A* Algorithm | A* Algorithm Example in AI](https://www.gatevidyalay.com/a-algorithm-a-algorithm-example-in-ai/) - A* Algorithm in Artificial Intelligence is a popular path finding technique. A* Algorithm Working & Pseudo Code. A* Algorithm Examples in AI. A* Algorithm on 8 Puzzle Problem is discussed.
- [Convert PDF to Excel With OCR Online & Free](https://www.gatevidyalay.com/convert-pdf-to-excel-with-ocr-online-free/) - Convert PDF To Excel With Optical Character Recognition (OCR) Online & Free- Here, you can quickly turn PDF to Excel online and free.
- [Learn Sorting By Color & Size | Kids Academy](https://www.gatevidyalay.com/learn-sorting-by-color-size-kids-academy/) - Easy-to-find items that Kids Academy suggests can help your child practice color-based sorting: Craft pom poms, Big buttons, Lego bricks, Toy food items etc
- [All About Video Streaming Ahead of 2024](https://www.gatevidyalay.com/all-about-video-streaming-ahead-of-2024/) - If you speak Spanish, their exclusive Spectrum Servicio al cliente provides 24-hour assistance. Once you have this internet, you can get streaming on the go!
- [Advantage & Disadvantage of Cloud Computing](https://www.gatevidyalay.com/advantage-disadvantage-of-cloud-computing/)
- [Cloud Computing | Examples | Features](https://www.gatevidyalay.com/cloud-computing-examples-features/)
- [Types of Cloud Computing](https://www.gatevidyalay.com/types-of-cloud-computing/) - Cloud computing is classified either on the basis of cloud location (public, private, hyrbid etc) or on the service that cloud is offering (IaaS, PaaS, Saas).
- [Top Reasons To Learn Web Development Online](https://www.gatevidyalay.com/top-reasons-to-learn-web-development-online/) - Web development, like almost any other skill, can be learned online, without the need of even taking a step in a place other than your room.
- [Ways To Improve Your Kids' Social Skills](https://www.gatevidyalay.com/ways-to-improve-your-kids-social-skills/) - To become better at parenting, you can read eBooks online. You can access these eBooks when you have a eliable internet service such as Spectrum Internet.
- [Destruction Rules & Regulations](https://www.gatevidyalay.com/destruction-rules-regulations/)
- [Converting Bases | Conversion of Bases](https://www.gatevidyalay.com/converting-bases-conversion-of-bases/) - Conversion of Bases- To convert a number from any base to any other base, it is first converted to base 10 using expansion method and then it is converted from base 10 to required base using division & multiplication method.
- [The Art of Custom Kiss Cut Stickers](https://www.gatevidyalay.com/the-art-of-custom-kiss-cut-stickers/) - Custom kiss cut stickers are a fantastic medium for self-expression, branding, and communication. It offers endless possibilities for creativity and engagement.
- [How To Prepare For SBI PO Exam?](https://www.gatevidyalay.com/how-to-prepare-for-sbi-po-exam/)
- [Information Security | Roles of IS Officer](https://www.gatevidyalay.com/information-security-roles-of-is-officer/) - Information Security is defending information from unauthorized access, disclosure, disruption, modification, inspection, recording, or destruction.
- [Cheap CV Writing Services | Resumes](https://www.gatevidyalay.com/cheap-cv-writing-service-cheap-resume/)
- [7 Mistakes In Home Solar Installations | Avoid Them](https://www.gatevidyalay.com/7-mistakes-in-home-solar-installations-avoid-them/)
- [NBA League Pass- How Does It Work?](https://www.gatevidyalay.com/nba-league-pass-how-does-it-work/) - NBA League Pass makes it easy & economical to follow the whole season. All you need is a steady internet connection & you are set to watch the big games.
- [Role of APIs in Composable Commerce](https://www.gatevidyalay.com/role-of-apis-in-composable-commerce/) - APIs are essential for businesses to stay competitive. Buinesses can use APIs to offer personalized customer experiences, increase sales and drive growth.
- [Key Components of Data Modelling In SAP MDG](https://www.gatevidyalay.com/key-components-of-data-modelling-in-sap-mdg/)
- [Is Coding Homework Too Difficult For Students?](https://www.gatevidyalay.com/is-coding-homework-too-difficult-for-students/) - To start coping with coding homework, a student must form a programmer's mindset. Start thinking and acting like a programmer to solve complex problems.
- [Weed-Growing Machines in Cannabis Farming](https://www.gatevidyalay.com/weed-growing-machines-in-cannabis-farming/) - Have you wondered if machine learning could optimize cannabis cultivation? Learn how using a weed-growing machine could increase your harvests and profits.
- [How To Cope With Java Coding Homework Faster?](https://www.gatevidyalay.com/how-to-cope-with-java-coding-homework-faster/) - Coping with homework is important to do it quickly to stay energized. Here, we talk about how you can quickly complete your Java assignments.
- [Tips to Start Your Fruitful Cooperation with Paperwritinghelp.Net](https://www.gatevidyalay.com/tips-to-start-your-fruitful-cooperation-with-paperwritinghelp-net/) - Paperwritinghelp.Net provide professional essay writing services that help students get the best grades on their assignments. Learn to work with proficient reps
- [List of Top Online Test Series For GATE Exam Preparation](https://www.gatevidyalay.com/list-of-top-online-test-series-for-gate-exam-preparation/)
- [How To Write An Essay Quickly](https://www.gatevidyalay.com/how-to-write-an-essay-quickly/)
- [Unlock The Power of Data Warehousing](https://www.gatevidyalay.com/unlock-the-power-of-data-warehousing/)
- [How To Check Plagiarism In Your Content?](https://www.gatevidyalay.com/how-to-check-plagiarism-in-your-content/)
- [5 Paraphrasing Ways To Paraphrase Content Better](https://www.gatevidyalay.com/5-paraphrasing-ways-to-paraphrase-content-better/) - Paraphrasing content can be easy when you know what to do. Here, we'll explore the five tips you can use to paraphrase content better
- [Write My Research Paper | Step By Step Guide](https://www.gatevidyalay.com/write-my-research-paper-step-by-step-guide/)
- [Best Essay Service Benefits](https://www.gatevidyalay.com/best-essay-service-benefits/)
- [5 Best Ways To Learn Korean Online](https://www.gatevidyalay.com/how-to-be-fluent-in-korean-5-ways-must-try/) - 5 Best Ways To Learn Korean Online Looking to learn Korean? There's no need to fly to Seoul or sign up for an expensive language course. With the rise of the internet, it's easier than ever to learn Korean online. There are online resources that can help you get started with learning Korean. These Discover the best ways to learn Korean at home. They make it easy &d fun for anyone who wants to learn Korean words, grammar, and culture today.
- [How To Install Whatsapp On A Computer Without A Smartphone](https://www.gatevidyalay.com/how-to-install-whatsapp-on-a-computer-without-a-smartphone/)
- [What Is A Gaming VPN & Do I Need One?](https://www.gatevidyalay.com/what-is-a-gaming-vpn-do-i-need-one/)
- [Disk Scheduling | Disk Scheduling Algorithms](https://www.gatevidyalay.com/disk-scheduling-disk-scheduling-algorithms/) - FCFS Disk Scheduling Algorithm is the simplest disk scheduling algorithm that services the requests on First Come First Serve basis. Example. The process which arrives first in the disk queue is entertained first.
- [Colleges Helping For Your Medical Career](https://www.gatevidyalay.com/colleges-helping-for-your-medical-career/)
- [How to Improve Team Management Skills](https://www.gatevidyalay.com/how-to-improve-team-management-skills/)
- [Great DIY Ideas For A Dorm Room](https://www.gatevidyalay.com/great-diy-ideas-for-a-dorm-room/)
- [System Bus in Computer Architecture](https://www.gatevidyalay.com/system-bus-in-computer-architecture/) - A system bus is a set of wires that connects major components of a computer system. Data bus, Control bus & Address bus are the components of a system bus.
- [Addressing Modes | Practice Problems | COA](https://www.gatevidyalay.com/addressing-modes-practice-problems-coa/) - Practice Problems based on Addressing Modes in computer architecture. Addressing modes specify the location of an operand. Various types of addressing modes exist in computer architecture.
- [Top Best Tips To Craft A Quality Essay For College](https://www.gatevidyalay.com/top-best-tips-to-craft-a-quality-essay-for-college/)
- [Where Can I Get Help On My Essay Fast](https://www.gatevidyalay.com/where-can-i-get-help-on-my-essay-fast/)
- [Where To Go To Get Biology Homework Help?](https://www.gatevidyalay.com/where-to-go-to-get-biology-homework-help/)
- [Arithmetic Sequence Explained](https://www.gatevidyalay.com/arithmetic-sequence-explained/)
- [How To Get Help With Physics Homework Online](https://www.gatevidyalay.com/how-to-get-help-with-physics-homework-online/)
- [Boolean Algebra & Its Use in Computer Science](https://www.gatevidyalay.com/boolean-algebra-its-use-in-computer-science/)
- [Writing An Expository Essay](https://www.gatevidyalay.com/writing-an-expository-essay/)
- [How To Get Help With Math Homework Online?](https://www.gatevidyalay.com/how-to-get-help-with-math-homework-online/)
- [Microsoft MD-100 & Certbolt Practice Tests](https://www.gatevidyalay.com/microsoft-md-100-certbolt-practice-tests/)
- [7 Benefits of Sample Essays](https://www.gatevidyalay.com/7-benefits-of-sample-essays/)
- [Machine Learning in Education](https://www.gatevidyalay.com/machine-learning-in-education/)
- [How To Write Evaluation Essay](https://www.gatevidyalay.com/how-to-write-evaluation-essay/)
- [Machine Learning For College Education in 2021](https://www.gatevidyalay.com/machine-learning-for-college-education-in-2021/)
- [Book Summary- Pains & Gains of Academic Writing](https://www.gatevidyalay.com/book-summary-pains-gains-of-academic-writing/)
- [Using Technology To Teach Writing In School](https://www.gatevidyalay.com/using-technology-to-teach-writing-in-school/)
- [Do My Computer Science Homework?](https://www.gatevidyalay.com/do-my-computer-science-homework/)
- [Current Research Trends in Machine Learning](https://www.gatevidyalay.com/current-research-trends-in-machine-learning/) - Current Research Trends in Machine Learning in Education- Technology plays a crucial role in the lives of everyone. Almost all the functions are automated in every sphere of human activity. It's done to simplify all the processes, make them run faster, easier, and more productively. Although many people oppose the implementation of technology,
- [How To Become A Professional Java Developer](https://www.gatevidyalay.com/how-to-become-a-professional-java-developer/)
- [Traditional & Boundless Types of Engineering](https://www.gatevidyalay.com/traditional-boundless-types-of-engineering/)
- [A+ Essay Writing Service | Get Expert Help](https://www.gatevidyalay.com/a-essay-writing-service-get-expert-help/)
- [Could Someone Write My Assignment?](https://www.gatevidyalay.com/could-someone-write-my-assignment/)
- [Assignment Writing Tools](https://www.gatevidyalay.com/assignment-writing-tools/)
- [Online AI-Based Paraphrasing Tools](https://www.gatevidyalay.com/online-ai-based-paraphrasing-tools/)
- [AI Article Spinner](https://www.gatevidyalay.com/ai-article-spinner/)
- [Decimal to Binary Conversion | Base 10 to base 2](https://www.gatevidyalay.com/converting-base-10-to-base-2-decimal-to-binary/) - Decimal to Binary Conversion- We use division method to convert a given number from base 10 to base 2. Decimal to Binary Conversion Examples. Convert the given numbers from base 10 to base 2.
- [Content Writing Job | Guidelines](https://www.gatevidyalay.com/content-writing-job-guidelines/) - Job Opportunities At Gate Vidyalay- Content Writers are welcomes to write content to help other students. Whether you are a student, teacher or a job person, you can always apply.
- [Bubble Sort Algorithm | Example | Time Complexity](https://www.gatevidyalay.com/bubble-sort-algorithm-example-time-complexity/) - Bubble Sort is the easiest sorting algorithm. Bubble Sort Algorithm with Example is given. The time complexity of Bubble Sort Algorithm is O(n2) and its space complexity is O(1).
- [Merge Sort Algorithm | Example | Time Complexity](https://www.gatevidyalay.com/merge-sort-algorithm-example-time-complexity/) - Merge Sort is a famous sorting algorithm that uses divide and conquer paradigm. Merge Sort Algorithm with Example is given. The time complexity of Merge Sort Algorithm is Θ(nlogn) and its space complexity is Θ(n).
- [Quick Sort Algorithm | Example | Time Complexity](https://www.gatevidyalay.com/quick-sort-sorting-algorithms/) - Quick Sort Algorithm is a famous sorting algorithm that sorts the given data items in ascending order based on divide and conquer approach. Quick Sort Example. Quick Sort Algorithm Time Complexity is O(n2).
- [Insertion Sort Algorithm | Example | Time Complexity](https://www.gatevidyalay.com/insertion-sort-insertion-sort-algorithm/) - Insertion Sort is a famous approach to sorting. Insertion Sort Algorithm with Example is given. Insertion Sort Algorithm Time Complexity is O(n2). Insertion Sort Algorithm Space Complexity is O(1).
- [Topological Sort | Topological Sort Examples](https://www.gatevidyalay.com/topological-sort-topological-sorting/) - Topological Sort or Topological Sorting is a linear ordering of the vertices of a directed acyclic graph. Topological Sort Examples. We learn how to find different possible topological orderings of a given graph.
- [Selection Sort Algorithm | Example | Time Complexity](https://www.gatevidyalay.com/selection-sort-selection-sort-algorithm/) - Selection Sort is the easiest approach to sorting. Selection Sort Algorithm with Example is given. Selection Sort Algorithm Time Complexity is O(n2). Selection Sort Algorithm Space Complexity is O(1).
- [Schedules in DBMS | Types of Schedules in DBMS](https://www.gatevidyalay.com/schedules-in-dbms/) - A schedule in DBMS is the order in which the operations of multiple transactions appear for execution. Types of Schedules in DBMS- Serial Schedules and Non-Serial Schedules. Finding Number of Schedules in DBMS.
- [Paging in OS | Practice Problems | Set-03](https://www.gatevidyalay.com/paging-in-os-practice-problems-set-03/) - Practice Problems based on Multilevel Paging and Translation Lookaside Buffer (TLB). Multilevel Paging is a paging scheme where there exists a hierarchy of page tables. Translation Lookaside Buffer (TLB) tries to reduce the effective access time.
- [K Maps | karnaugh Maps | Solved Examples](https://www.gatevidyalay.com/k-maps-karnaugh-maps-solved-examples/) - Karnaugh Map or K Map is a graphical representation for simplifying the boolean expressions. K Map Simplification Rules and Solved Examples are discussed.
- [Carry Look Ahead Adder | 4-bit Carry Look Ahead Adder](https://www.gatevidyalay.com/carry-look-ahead-adder/) - Carry Look Ahead Adder is an improved version of Ripple Carry Adder. 4-bit Carry Look Ahead Adder Circuit Diagram & Example. Advantages and Disadvantages of Carry Look Ahead Adder.
- [Normalization in DBMS | Normal Forms](https://www.gatevidyalay.com/database-normalization/) - Normalization in DBMS is a process of making database consistent. Normal Forms in DBMS- First Normal Form (1NF), Second Normal Form (2NF), Third Normal Form (3NF), Boyce Codd Normal Form (BCNF).
- [Closure in DBMS | Steps to Find Closure](https://www.gatevidyalay.com/closure-of-an-attribute-set/) - Closure in DBMS is a set of attributes that can be functionally determined from an attribute set. How to find closure in DBMS- The given steps are followed to find the closure of an attribute set.
- [Normal Forms in Database | Important Points](https://www.gatevidyalay.com/normal-forms-in-database-important-points-for-gate-exam/) - Normalization in DBMS is a process of making database consistent. Normal Forms in DBMS- First Normal Form (1NF), Second Normal Form (2NF), Third Normal Form (3NF), Boyce Codd Normal Form (BCNF).
- [Types of Keys in DBMS | Definitions | Examples](https://www.gatevidyalay.com/keys-in-dbms/) - Keys in DBMS is a set of attributes that can identify each tuple uniquely of the given relation. Different Types of Keys in DBMS are- Super key, Candidate key, Primary key, Alternate key, Foreign key, Partial key, Composite key, Unique key, Surrogate key, Secondary key
- [Candidate Key | Finding Candidate Keys | Examples](https://www.gatevidyalay.com/candidate-key-finding-candidate-key-examples/) - A candidate key is defined as a set of minimal attributes that can identify each tuple uniquely in the given relation. Examples. How to find Candidate Keys- To find candidate keys of any given relation, we follow the discussed steps.
- [Cyclomatic Complexity | Calculation | Examples](https://www.gatevidyalay.com/cyclomatic-complexity-calculation-examples/) - Cyclomatic Complexity is a software metric that measures the logical complexity of the program code. Cyclomatic Complexity is calculated using the formula E-N+2. Cyclomatic Complexity Calculation Examples.
- [Cause Effect Graph Technique | Examples](https://www.gatevidyalay.com/cause-effect-graph-technique-examples/) - Cause Effect Graph is a black box testing technique that illustrates the relationship between a outcome & the factors influencing the outcome graphically. Examples.
- [Linear Regression Machine Learning | Examples](https://www.gatevidyalay.com/linear-regression-machine-learning-examples/) - Linear Regression in Machine Learning is a supervised machine learning algorithm that finds out the best linear relationship describing the data you have. Types of Linear Regression- Simple Linear Regression & Multiple Linear Regression.
- [Machine Learning Workflow | Process Steps](https://www.gatevidyalay.com/machine-learning-workflow-process-steps/) - Machine Learning Workflow is the series of stages or steps involved in the process of building a successful machine learning system. Machine Learning Step by Step Process.
- [Principal Component Analysis | Dimension Reduction](https://www.gatevidyalay.com/principal-component-analysis-dimension-reduction/) - Principal Component Analysis is a dimension reduction technique that transforms the variables into a new set of variables called as principal components. Principal Component Analysis Example & PCA Algorithm.
- [K-Means Clustering Algorithm | Examples](https://www.gatevidyalay.com/k-means-clustering-algorithm-example/) - K-Means Clustering is an iterative clustering technique that partitions the given data set into k predefined clusters. K-Means Clustering Algorithm Examples, Advantages & Disadvantages.
- [Machine Learning Algorithms | Machine Learning](https://www.gatevidyalay.com/machine-learning-machine-learning-algorithms/) - Machine Learning- It is building machines that can adapt and learn from the experience. Machine Learning Algorithms- Supervised Learning Algorithm, Unsupervised Learning Algorithm, Reinforcement Learning Algorithm.
- [3D Shearing in Computer Graphics | Definition | Examples](https://www.gatevidyalay.com/3d-shearing-in-computer-graphics-definition-examples/) - 3D Shearing in Computer Graphics is a process of modifying the shape of an object in 3D plane. Shearing Transformation in Computer Graphics Definition, Solved Examples and Problems.
- [Bezier Curve in Computer Graphics | Examples](https://www.gatevidyalay.com/bezier-curve-in-computer-graphics-examples/) - Bezier Curve in Computer Graphics is a parametric curve defined by a set of control points. Bezier Curve Example & Properties. Cubic Bezier Curve is a bezier curve with degree 3. Problem on Bezier Curve.
- [2D Translation in Computer Graphics | Definition | Examples](https://www.gatevidyalay.com/2d-transformation-in-computer-graphics-translation-examples/) - 2D Transformation in Computer Graphics- 2D Translation in Computer Graphics is a process of moving an object from one position to another in 2D plane. Solved Examples and Problems.
- [Genetic Algorithm in AI | Operators | Working](https://www.gatevidyalay.com/genetic-algorithm-in-ai-operators-working/) - Genetic Algorithm in AI is one of the heuristic algorithms that is used to solve optimization problems. Genetic Algorithm Working, Flowchart, Operators & Advantages are discussed.
- [Stop and Wait ARQ | Sliding Window Protocols](https://www.gatevidyalay.com/stop-and-wait-arq-sliding-window-protocols/) - Stop and Wait ARQ is a one bit sliding sliding window protocol. Stop and Wait ARQ is a modified and improved version of the stop and wait protocol. It solves the problems of stop and wait protocol.
- [Flow Control | Stop and Wait Protocol](https://www.gatevidyalay.com/flow-control-stop-and-wait-protocol/) - Flow Control in Computer Networks is a set of procedures to restrict the amount of data that sender can send. Stop and Wait Protocol is a flow control protocol where sender sends one data packet to the receiver and then stops and waits for its acknowledgement from the receiver.
- [Decimal to Hexadecimal | Base 10 to base 16](https://www.gatevidyalay.com/converting-decimal-to-hexa-base-10-to-base-16/) - Decimal to Hexadecimal Conversion- We use division method to convert a given decimal number to hexadecimal form. Decimal to Hexadecimal Conversion Examples. Convert the given numbers from base 10 to base 16.
- [Decimal to Octal Conversion | Base 10 to Base 8](https://www.gatevidyalay.com/converting-decimal-to-octal-base-10-to-base-8/) - Decimal to Octal Conversion- We use division method to convert a given decimal number to octal form. Decimal to Octal Conversion Examples. Convert the given numbers from base 10 to base 8.
- [DFA to Regular Expression | Arden's Theorem](https://www.gatevidyalay.com/dfa-to-regular-expression-ardens-theorem/) - Arden's Theorem is a popular method to convert DFA to regular expression. Arden's Theorem Examples. Problems on converting DFA to Regular Expression Using Arden's Theorem.
- [DFA to Regular Expression | Examples](https://www.gatevidyalay.com/dfa-to-regular-expression-examples-automata/) - DFA to Regular Expression- The methods to convert DFA to regular expression are- Arden's Method and State Elimination Method. Convert DFA to a Regular Expression Using State Elimination Method. DFA to Regular Expression Conversion Exercises.
- [Heap Operations | Max Heap Operations | Examples](https://www.gatevidyalay.com/heap-operations-max-heap-operations-examples/) - Heap Operations- The most commonly performed operations a heap data structure are- Search, Insert, Delete. Max Heap Operations with their Time Complexities are discussed.
- [Heap Data Structure | Binary Heap | Examples](https://www.gatevidyalay.com/heap-data-structure-binary-heap-examples/) - Heap in Data Structure- Binary Heap is a binary tree that has ordering & structural property. Max Heap and Min Heap- In Max Heap, all the nodes have greater value element than its child nodes. In Min Heap, all the nodes have smaller value element than its child nodes.
- [Convert to Base 10 | Number System Conversions](https://www.gatevidyalay.com/converting-to-base-10-number-system-conversions/) - Converting to Base 10- Expansion Method is used to convert a given number from any base to base 10. Conversion to Base 10 Examples. Problems based on Converting to Base 10.
- [AVL Tree Insertion  | Insertion in AVL Tree](https://www.gatevidyalay.com/insertion-in-avl-tree-avl-trees/) - AVL Tree Insertion- Insertion in AVL Tree is performed to insert an element in the AVL tree. Steps to perform insertion in AVL trees. AVL Tree Insertion Example. Insertion in AVL tree is same as insertion in Binary Search Tree with an added step. The tree has to be balanced using AVL tree rotations after performing an insertion operation.
- [Base of Number System | Types of Number System](https://www.gatevidyalay.com/base-of-number-system-types-of-number-systems/) - Base of a Number System is the total number of digits used in that number system. Types of Number Systems- Decimal Number System, Binary Number System, Octal Number System, Hexadecimal Number System.
- [Travelling Salesman Problem | Branch & Bound](https://www.gatevidyalay.com/travelling-salesman-problem-using-branch-and-bound-approach/) - Travelling Salesman Problem is a famous problem that finds the shortest possible route. Travelling Salesman Problem Using Branch and Bound. Example.
- [Huffman Coding | Huffman Coding Example | Time Complexity](https://www.gatevidyalay.com/huffman-coding-huffman-encoding/) - Huffman Coding or Huffman Encoding is a Greedy Algorithm that is used for the lossless compression of data. Huffman Coding Example and Time Complexity. Huffman Tree Construction Steps.
- [Longest Job First Algorithm | LRTF Scheduling](https://www.gatevidyalay.com/longest-job-first-algorithm-lrtf-scheduling/) - Longest Job First Algorithm is a CPU Scheduling Algorithm that assigns CPU to the process with longest burst time. Longest Remaining Time First or LRTF is the preemptive mode of Longest Job First Scheduling Algorithm.
- [Job Sequencing With Deadlines | Algorithm | Example](https://www.gatevidyalay.com/job-sequencing-with-deadlines/) - Job Sequencing with Deadlines- The sequencing of jobs on a single processor with deadline constraints is called as Job Sequencing with Deadlines. Greedy Algorithm is adopted to solve this problem. Job Sequencing with Deadlines Example.
- [0/1 Knapsack Problem | Dynamic Programming | Example](https://www.gatevidyalay.com/0-1-knapsack-problem-using-dynamic-programming-approach/) - 0/1 Knapsack Problem is a variant of Knapsack Problem that does not allow to fill the knapsack with fractional items. 0/1 Knapsack Problem solved using Dynamic Programming. 0/1 Knapsack Problem Example & Algorithm.
- [Fractional Knapsack Problem | Greedy Method | Example](https://www.gatevidyalay.com/fractional-knapsack-problem-using-greedy-approach/) - Fractional Knapsack Problem is a variant of Knapsack Problem that allows to fill the knapsack with fractional items. Fractional Knapsack Problem solved using Greedy Method. Fractional Knapsack Problem Example & Algorithm.
- [Floyd Warshall Algorithm | Example | Time Complexity](https://www.gatevidyalay.com/floyd-warshall-algorithm-shortest-path-algorithm/) - Floyd Warshall Algorithm is a dynamic programming algorithm used to solve All Pairs Shortest path problem. Floyd Warshall Algorithm Example Step by Step. The time complexity of Floyd Warshall algorithm is O(n3).
- [Dijkstra Algorithm | Example | Time Complexity](https://www.gatevidyalay.com/dijkstras-algorithm-shortest-path-algorithm/) - Dijkstra Algorithm is a Greedy algorithm for solving the single source shortest path problem. Dijkstra Algorithm Example, Pseudo Code, Time Complexity, Implementation & Problem.
- [Shortest Path Problem | Shortest Path Algorithms | Examples](https://www.gatevidyalay.com/shortest-path-algorithms-shortest-path-problems/) - Shortest Path Problem in Data Structure is a problem of finding the shortest path between vertices of a given graph. Shortest Path Algorithms are a family of algorithms used for solving Shortest Path Problem. Examples.
- [Types of Graphs in Graph Theory](https://www.gatevidyalay.com/graphs-types-of-graphs/) - In Graph Theory, Graph is a collection of vertices connected to each other through a set of edges. Types of Graphs in Graph Theory- There are various types of graphs in graph theory. Examples are listed.
- [Binary Search Algorithm | Example | Time Complexity](https://www.gatevidyalay.com/binary-search-binary-search-algorithm/) - Binary Search Algorithm is the fastest searching algorithm. Binary Search Algorithm Example & Time Complexity. Binary Search Algorithm is better than Linear Search Algorithm but can be applied only on sorted arrays.
- [Linear Search Algorithm | Example | Time Complexity](https://www.gatevidyalay.com/linear-search-searching-algorithms/) - Linear Search Algorithm is the simplest searching algorithm. Linear Search Algorithm Example & Time Complexity. Linear Search Algorithm searches for an element by comparing it with each element of the array.
- [Difference Between Prim's and Kruskal's Algorithm](https://www.gatevidyalay.com/prims-and-kruskal-algorithm-difference/) - Difference Between Prim's and Kruskal's Algorithm- In Prim's Algorithm, the tree that we are growing always remains connected while in Kruskal's Algorithm, the tree that we are growing usually remains disconnected.
- [Kruskal's Algorithm | Kruskal's Algorithm Example | Problems](https://www.gatevidyalay.com/kruskals-algorithm-kruskals-algorithm-example/) - Kruskal's Algorithm is a famous greedy algorithm used to find minimum cost spanning tree of a graph. Kruskal's Algorithm Example. Kruskal's Algorithm Time Complexity is O(ElogV) or O(ElogE).
- [Prim's Algorithm | Prim's Algorithm Example | Problems](https://www.gatevidyalay.com/prims-algorithm-prim-algorithm-example/) - Prim's Algorithm is a famous greedy algorithm used to find minimum cost spanning tree of a graph. Prim's Algorithm Example. Prim's Algorithm Time Complexity is O(ElogV) using binary heap.
- [Complement of Graph in Graph Theory | Example | Problems](https://www.gatevidyalay.com/complement-of-a-graph/) - Complement of Graph in Graph Theory- Complement of a graph G is a graph G' with all the vertices of G in which there is an edge between two vertices v and w if and only if there exist no edge between v and w in the original graph G. Complement of Graph Examples and Problems.
- [TCP Timers | Time Out Timer | Time Wait Timer](https://www.gatevidyalay.com/tcp-timers-transmission-control-protocol/) - TCP Timers are used to avoid excessive delays during communication. TCP Timers are- Time Out Timer, Time Wait Timer, Keep Alive Timer, Persistent Timer. Time out timer is used for retransmission. Time Wait Timer is used during connection termination.
- [Breadth First Search Algorithm | BFS Example](https://www.gatevidyalay.com/breadth-first-search-bfs-algorithm/) - Breadth First Search Algorithm is a Graph Traversing Algorithm. BFS Algorithm is discussed Step by Step. BFS Example. BFS Algorithm searches in the graph in breadth first manner whenever possible.
- [Directed Acyclic Graphs | DAGs | Examples](https://www.gatevidyalay.com/directed-acyclic-graphs/) - In Compiler design, Directed Acyclic Graph is a directed graph that does not contain any cycles in it. Directed Acyclic Graph Examples. Properties and Applications. Problems On Directed Acyclic Graphs.
- [Depth First Search Algorithm | DFS Example](https://www.gatevidyalay.com/depth-first-search-dfs-algorithm/) - Depth First Search Algorithm is a Graph Traversing Algorithm. DFS Algorithm is discussed Step by Step. DFS Example. DFS Algorithm searches deeper in the graph whenever possible.
- [C Programming By Dennis Ritchie | Best C Programming Books](https://www.gatevidyalay.com/c-programming-by-dennis-ritchie-best-c-programming-books/) - C Programming Books for GATE CSE- The C Programming Language by Dennis Ritchie is the best C Programming book for GATE CSE. C Programming A Modern Approach by K.N. King is another recommended book.
- [Binary Tree | Binary Tree Properties](https://www.gatevidyalay.com/binary-tree-properties-important-formulas/) - Binary tree is a special tree data structure. There are various types of binary trees. Binary Tree Properties are given. If height of binary tree = H then, minimum number of nodes in binary tree H+1.
- [3D Reflection in Computer Graphics | Definition | Examples](https://www.gatevidyalay.com/3d-reflection-in-computer-graphics-definition-examples/) - Reflection in Computer Graphics is a kind of rotation where the angle of rotation is 180 degree. 3D Reflection takes place in 3D plane. Reflection in Computer Graphics Definition, Solved Examples and Problems.
- [3D Scaling in Computer Graphics | Definition | Examples](https://www.gatevidyalay.com/3d-scaling-in-computer-graphics-definition-examples/) - 3D Scaling in Computer Graphics is a process of altering the size of objects in 3D plane. Scaling in Computer Graphics Definition, Solved Examples and Problems.
- [3D Rotation in Computer Graphics | Definition | Examples](https://www.gatevidyalay.com/3d-rotation-in-computer-graphics-definition-examples/) - 3D Rotation in Computer Graphics is a process of rotating an object with respect to an angle in 3D plane. Rotation in Computer Graphics Definition, Solved Examples and Problems.
- [3D Translation in Computer Graphics | Definition | Examples](https://www.gatevidyalay.com/3d-translation-in-computer-graphics-definition-examples/) - 3D Transformation in Computer Graphics- 3D Translation in Computer Graphics is a process of moving an object from one position to another in 3D plane. Solved Examples and Problems.
- [2D Shearing in Computer Graphics | Definition | Examples](https://www.gatevidyalay.com/2d-shearing-in-computer-graphics-definition-examples/) - 2D Shearing in Computer Graphics is a process of modifying the shape of an object in 2D plane. Shearing Transformation in Computer Graphics Definition, Solved Examples and Problems.
- [Operator Precedence Parsing](https://www.gatevidyalay.com/operator-precedence-parsing/) - In Compiler design, Operator Precedence Parser is a bottom-up parser that reads and understand Operator Precedence Grammar. Operator Precedence Parsing is simple and easy to use.
- [Process States in Operating System](https://www.gatevidyalay.com/process-states-in-operating-system/) - Process Management in Operating System- Each process in operating system goes through different states in its lifetime. Process State Diagram in Operating System is shown.
- [2D Reflection in Computer Graphics | Definition | Examples](https://www.gatevidyalay.com/2d-reflection-in-computer-graphics-definition-examples/) - Reflection in Computer Graphics is a kind of rotation where the angle of rotation is 180 degree. 2D Reflection takes place in 2D plane. Reflection in Computer Graphics Definition, Solved Examples and Problems.
- [2D Scaling in Computer Graphics | Definition | Examples](https://www.gatevidyalay.com/scaling-in-computer-graphics-definition-examples/) - 2D Scaling in Computer Graphics is a process of altering the size of objects in 2D plane. Scaling in Computer Graphics Definition, Solved Examples and Problems.
- [2D Rotation in Computer Graphics | Definition | Examples](https://www.gatevidyalay.com/2d-rotation-in-computer-graphics-definition-examples/) - 2D Rotation in Computer Graphics is a process of rotating an object with respect to an angle in 2D plane. Rotation in Computer Graphics Definition, Solved Examples and Problems.
- [Recursion Tree | Solving Recurrence Relations](https://www.gatevidyalay.com/recursion-tree-solving-recurrence-relations/) - Like Master's theorem, recursion tree method is another method for solving recurrence relations. A recursion tree is a tree where each node represents the cost of a certain recursive sub-problem. We will follow the following steps for solving recurrence relations using recursion tree method.
- [Master Theorem | Master Theorem Examples](https://www.gatevidyalay.com/masters-theorem-solving-recurrence-relations/) - Master Theorem is a popular method for solving the recurrence relations. Master Theorem Examples are discussed. Master Theorem Cases are explained. Problems based on Master Theorem.
- [Self-Dual Functions | Dual Of Boolean Expression](https://www.gatevidyalay.com/self-dual-functions-dual-of-a-boolean-expression/) - Self Dual Function is a function which is equal to its dual. Dual of Boolean Expression: To get a dual of any Boolean Expression, replace- OR with AND, AND with OR, 1 with 0 and 0 with 1.
- [Neutral Functions | Minterms and Maxterms](https://www.gatevidyalay.com/neutral-functions/) - A neutral function is a function for which number of minterms and number of maxterms are same. Number of neutral functions possible with n Boolean variables = C ( 2n , 2n-1 ).
- [Delay in Ripple Carry Adder | Ripple Carry Adder](https://www.gatevidyalay.com/delay-in-ripple-carry-adder/) - Ripple Carry Adder is used for the purpose of adding two n-bit binary numbers. Delay in Ripple Carry Adder- Problems based on delay calculation in ripple carry adder are discussed.
- [Ripple Carry Adder | 4 bit Ripple Carry Adder](https://www.gatevidyalay.com/ripple-carry-adder/) - Ripple carry adder is a combinational logic circuit used for the purpose of adding two n-bit binary numbers. 4-bit ripple carry adder is used for adding two 4-bit binary numbers. N-bit ripple carry adder is used for adding two N-bit binary numbers.
- [Full Subtractor | Definition | Circuit Diagram | Truth Table](https://www.gatevidyalay.com/full-subtractor/) - Full Subtractor is a combinational logic circuit used for the purpose of subtracting two single bit numbers with a borrow. Full Subtractor Definition, Block Diagram, Truth Table, Circuit Diagram, Logic Diagram, Boolean Expression and Equation are discussed. Full Subtractor overcomes the limitation of Half Subtractor.
- [Full Adder | Definition | Circuit Diagram | Truth Table](https://www.gatevidyalay.com/full-adder/) - Full Adder is a combinational logic circuit used for the purpose of adding two single bit numbers with a carry. Full Adder Definition, Block Diagram, Truth Table, Circuit Diagram, Logic Diagram, Boolean Expression and Equation are discussed. Full Adder overcomes the limitation of Half Adder.
- [Half Subtractor | Definition | Circuit Diagram | Truth Table](https://www.gatevidyalay.com/half-subtractor/) - Half Subtractor is a combinational logic circuit used for the purpose of subtracting two single bit numbers. Half Subtractor Definition, Block Diagram, Truth Table, Circuit Diagram, Logic Diagram, Boolean Expression and Equation are discussed.
- [Half Adder | Definition | Circuit Diagram | Truth Table](https://www.gatevidyalay.com/half-adder/) - Half Adder is a combinational logic circuit used for the purpose of adding two single bit numbers. Half Adder Definition, Block Diagram, Truth Table, Circuit Diagram, Logic Diagram, Boolean Expression and Equation are discussed.
- [JK Flip Flop | Diagram | Truth Table | Excitation Table](https://www.gatevidyalay.com/jk-flip-flops/) - JK flip flop is a refined and improved version of the SR flip flop. JK Flip Flop Construction, Logic Circuit Diagram, Logic Symbol, Truth Table, Characteristic Equation & Excitation Table are discussed.
- [SR Flip Flop | Diagram | Truth Table | Excitation Table](https://www.gatevidyalay.com/sr-flip-flop/) - SR flip flop is the simplest type of flip flops. SR Flip Flop Construction, Logic Circuit Diagram, Logic Symbol, Truth Table, Characteristic Equation & Excitation Table are discussed.
- [Latch in Digital Electronics | Latch Construction](https://www.gatevidyalay.com/latches-and-flip-flops/) - Latch in Digital Electronics- Latches are unclocked flip flops using which clocked flip flops are constructed. Latch Construction- A latch may be constructed using either 2 NOR Gates or 2 NAND Gates.
- [Logic Gates | Definitions | Types | Symbols | Truth Tables](https://www.gatevidyalay.com/logic-gates/) - Logic gates are defined as the basic building blocks of any digital circuit. Logic Gates Definitions, Types, Symbols and Truth Tables are discussed. There are 3 basic logic gates- AND Gate, OR Gate, NOT Gate.
- [Universal Logic Gates | NAND Gate | NOR Gate](https://www.gatevidyalay.com/universal-gates/) - NAND Gate & NOR Gate are called as Universal Logic Gates or Universal Gates. NAND Gate & NOR Gate are special logic gates. NAND Gate & NOR Gate- Definitions, Types, Symbols and Truth Tables are discussed.
- [Flip Flops in Digital Logic | Flip Flops Types](https://www.gatevidyalay.com/flip-flops-in-electronics/) - Flip Flop in digital logic is a memory element capable to store one bit of information. Flip Flops Types- There are 4 types of flip flops- SR Flip Flop, JK Flip Flop, D Flip Flop, T Flip Flop.
- [Alternative Logic Gates | Bubbled Gates | Logic Gates](https://www.gatevidyalay.com/alternative-logic-gates-bubbled-gates/) - Alternative Logic Gates also called as Alternate Gates or Bubbled Gates are the logic gates that can be used during the unavailability of the given logic gates to produce the same output.
- [Digital Design By Morris Mano | Best Digital Design Books](https://www.gatevidyalay.com/digital-design-by-morris-mano-best-digital-design-books/) - Digital Design Books for GATE CSE- Digital Logic and Computer Design by M. Morris Mano is the best Digital Design book for GATE CSE. Modern Digital Electronics by R P Jain is another recommended book.
- [Walk in Graph Theory | Path | Trail | Cycle | Circuit](https://www.gatevidyalay.com/walk-in-graph-theory/) - Walk in Graph Theory- In graph theory, walk is a finite length alternating sequence of vertices and edges. Path in Graph Theory, Cycle in Graph Theory, Trail in Graph Theory & Circuit in Graph Theory are discussed.
- [How to Find Chromatic Number | Graph Coloring Algorithm](https://www.gatevidyalay.com/graph-coloring-algorithm-how-to-find-chromatic-number/) - Graph Coloring Algorithm- A Greedy Algorithm exists for Graph Coloring.How to find Chromatic Number of a graph- We follow the Greedy Algorithm to find Chromatic Number of the Graph. Problems on finding Chromatic Number of a given graph.
- [Graph Coloring in Graph Theory | Chromatic Number of Graphs](https://www.gatevidyalay.com/graph-coloring-chromatic-number/) - Graph Coloring in Graph Theory- Graph Coloring is a process of assigning colors to the vertices such that no two adjacent vertices get the same color. Chromatic Number of a Graph is the minimum number of colors required to properly color the graph.
- [Handshaking Theorem in Graph Theory | Handshaking Lemma](https://www.gatevidyalay.com/handshaking-theorem-graph-theory-theorems/) - In graph theory, Handshaking Theorem or Handshaking Lemma or Sum of Degree of Vertices Theorem states that sum of degree of all vertices is twice the number of edges contained in it. Problems On Handshaking Theorem.
- [Graph Isomorphism | Isomorphic Graphs | Examples | Problems](https://www.gatevidyalay.com/graph-isomorphism/) - Graph Isomorphism is a phenomenon of existing the same graph in more than one forms. Graph Isomorphism Examples. Practice Problems On Graph Isomorphism. Same graphs existing in multiple forms are called as Isomorphic graphs.
- [Planar Graph in Graph Theory | Planar Graph Example](https://www.gatevidyalay.com/planar-graphs/) - Planar Graph in Graph Theory- A planar graph is a graph that can be drawn in a plane such that none of its edges cross each other. Planar Graph Example, Properties & Practice Problems are discussed.
- [Introduction to Formal Languages & Automata | Automata Books](https://www.gatevidyalay.com/introduction-to-formal-languages-automata-automata-books/) - Automata Books for GATE CSE- Introduction to Formal Languages and Automata by Peter Linz is the best Theory of Automata and Computation book for GATE CSE. Introduction to Automata Theory, Languages and Computation by Ullman and Introduction to the Theory of Computation by Michael Sipser are other recommended books.
- [Konigsberg Bridge Problem in Graph Theory](https://www.gatevidyalay.com/konigsberg-bridge-problem/) - Konigsberg Bridge Problem in Graph Theory- It states "Is it possible to cross each of the seven bridges exactly once and come back to the starting point without swimming across the river?". Konigsberg Bridge Problem Solution was provided by Leon hard Euler concluding that such a walk is impossible.
- [Bipartite Graph | Bipartite Graph Example | Properties](https://www.gatevidyalay.com/bipartite-graphs/) - Bipartite Graph in Graph Theory- A Bipartite Graph is a special graph that consists of 2 sets of vertices X and Y where vertices only join from one set to other. Bipartite Graph Example. Bipartite Graph Properties are discussed.
- [Hamiltonian Graph | Hamiltonian Path | Hamiltonian Circuit](https://www.gatevidyalay.com/hamiltonian-graphs-hamiltonian-path-hamiltonian-circuit/) - Hamiltonian Graph in Graph Theory- A Hamiltonian Graph is a connected graph that contains a Hamiltonian Circuit. Hamiltonian Graph Examples. Hamiltonian Path and Hamiltonian Circuit- Hamiltonian path is a path in a connected graph that contains all the vertices of the graph. A closed Hamiltonian path is called as Hamiltonian Circuit.
- [Euler Graph | Euler Path | Euler Circuit](https://www.gatevidyalay.com/euler-graph-euler-trail-euler-circuit/) - Euler Graph in Graph Theory- An Euler Graph is a connected graph whose all vertices are of even degree. Euler Graph Examples. Euler Path and Euler Circuit- Euler Path is a trail in the connected graph that contains all the edges of the graph. A closed Euler trail is called as an Euler Circuit.
- [Introduction to Algorithms By Cormen | Best Algorithms Books](https://www.gatevidyalay.com/algorithms-by-cormen-algorithm-books/) - Best Algorithms Books for GATE CSE- Introduction to Algorithms by Cormen is the best Algorithms book for GATE CSE. Algorithm Design by Kleinberg and Tardos is another recommended book.
- [Computer Networks Tanenbaum | Networking Books](https://www.gatevidyalay.com/computer-networks-tanenbaum-networking-books/) - Computer Networks Books for GATE CSE- Computer Networks by Tanenbaum is the best Computer Networking book for GATE CSE. Data Communications and Networking by Fourozan & Computer Networking by Kurose and Ross are other recommended books.
- [Computer Organization Hamacher | Best COA Books](https://www.gatevidyalay.com/computer-organization-hamacher-coa-books/) - Computer Organization and Architecture Books for GATE CSE- Computer Organization by Carl Hamacher is the best Computer Organization book for GATE CSE. Computer Organization & Architecture by William Stallings and by Hennesy & Patterson are other recommended books.
- [Compiler Design Aho Ullman | Best Compiler Design Books](https://www.gatevidyalay.com/compiler-design-aho-ullman-compiler-design-books/) - Compiler Design Books for GATE CSE- Compilers Principles, Techniques and Tools by Aho, Ravi Sethi and Ullman is the best Compiler Design book for GATE CSE. Compiler Design by O.G. Kakde is another recommended book.
- [DBMS Raghu Ramakrishnan | Best DBMS Books](https://www.gatevidyalay.com/dbms-raghu-ramakrishnan-dbms-books/) - DBMS Books for GATE CSE- Database Management Systems by Raghu Ramakrishnan is the best DBMS book for GATE CSE. Database System by Navathe & Database System Concepts by Korth are other recommended books.
- [Operating System Tanenbaum | Best OS Books](https://www.gatevidyalay.com/operating-system-tanenbaum-os-books/) - Operating System Books for GATE CSE- Modern Operating Systems by Tanenbaum is the best Operating System book for GATE CSE. Operating Systems by William Stallings and Operating System Concepts By Abraham Silberschatz are other recommended books.
- [Bresenham Circle Drawing Algorithm](https://www.gatevidyalay.com/bresenham-circle-drawing-algorithm/) - Circle Drawing Algorithms- Bresenham Circle Drawing Algorithm is a famous circle drawing algorithm. Bresenham Circle Drawing Algorithm takes the centre point & radius of circle and generates the points for one octant.
- [Mid Point Circle Drawing Algorithm](https://www.gatevidyalay.com/mid-point-circle-drawing-algorithm/) - Circle Drawing Algorithms- Midpoint Circle Drawing Algorithm is a famous circle drawing algorithm. Midpoint Circle Drawing Algorithm takes the centre point & radius of circle and generates the points for one octant.
- [Converting NFA to DFA | Solved Examples](https://www.gatevidyalay.com/converting-nfa-to-dfa-solved-examples/) - Converting NFA to DFA- A given NFA is converted into a DFA using the mentioned steps. Practice Problems on NFA to DFA Conversion are discussed. Converting NFA to DFA Solved Examples.
- [Non Deterministic Finite Automata | NFA](https://www.gatevidyalay.com/non-deterministic-finite-automata-nfa/) - Non Deterministic Finite Automata or NFA is an automata in which for some current state and input symbol, there exists more than one next output states. Example of Non Deterministic Finite Automata. Equivalence of DFA and NFA.
- [Bresenham Line Drawing Algorithm](https://www.gatevidyalay.com/bresenham-line-drawing-algorithm/) - Line Drawing Algorithms- In computer graphics, Bresenham Line Drawing Algorithm is a famous line drawing algorithm. Bresenham Line Drawing Algorithm attempts to generate the points between the starting and ending coordinates.
- [Mid Point Line Drawing Algorithm](https://www.gatevidyalay.com/mid-point-line-drawing-algorithm/) - Line Drawing Algorithms- In computer graphics, Mid Point Line Drawing Algorithm is a famous line drawing algorithm. Mid Point Line Drawing Algorithm attempts to generate the points between the starting and ending coordinates.
- [DDA Algorithm | Line Drawing Algorithms](https://www.gatevidyalay.com/dda-algorithm-line-drawing-algorithms/) - Line Drawing Algorithms- In computer graphics, DDA Line Drawing Algorithm is the simplest line drawing algorithm. DDA Line Drawing Algorithm attempts to generate the points between the starting and ending coordinates.
- [Classless Addressing | CIDR in Networking](https://www.gatevidyalay.com/classless-addressing-cidr/) - Classless Addressing or CIDR in Networking short for Classless Inter Domain Routing is an improved IP Addressing System. Classless Inter Domain Routing assigns CIDR blocks dynamically to the user asking for specific number of IP Addresses.
- [Converse Inverse Contrapositive | Problems](https://www.gatevidyalay.com/converse-inverse-contrapositive-problems/) - Converse Inverse Contrapositive- For a statement p → q, q → p is a converse statement, ∼p → ∼q is a inverse statement, ∼q → ∼p is contrapositive statement. Problems based on Converse, Inverse and Contrapositive.
- [Tautology Contradiction Contingency](https://www.gatevidyalay.com/tautology-contradiction-contingency/) - Tautology, Contradiction, Contingency, Valid, Invalid, Falsifiable, Unfalsifiable, Satisfiable, Unsatisfiable with their definition, truth table and examples are discussed.
- [Logical Connectives | Truth Tables | Examples](https://www.gatevidyalay.com/logical-connectives-truth-tables-examples/) - In propositional logic, logical connectives are- Negation, Conjunction, Disjunction, Conditional & Biconditional. Logical connectives examples and truth tables are given. Logical connectives are the operators used to combine the propositions.
- [Propositional Logic | Propositions Examples](https://www.gatevidyalay.com/propositional-logic-propositions-examples/) - In propositional logic, propositions are the statements that are either true or false but not both. Examples of Propositions. Types of Propositions- Atomic Proposition and Compound Proposition.
- [Logical Connectives | Propositional Logic](https://www.gatevidyalay.com/logical-connectives-propositional-logic/) - Logical Connectives are used to connect propositions. Properties and Formulas of Conditional and Biconditional. Examples of Propositional Logic. Practice Problems on Converting English Sentences to Propositional Logic.
- [main method in Java](https://www.gatevidyalay.com/main-method-in-java/) - Main method is a starting point in the program from where the code execution is started by the JVM. If JVM does not find the main method inside the code according to the specifications configured inside it, it raises an error.
- [finalize method in Java](https://www.gatevidyalay.com/finalize-method-in-java/) - finalize( ) method is a method of Object class which is called just before the destruction of an object by the garbage collector. The purpose of calling finalize method is to perform clean up activities.
- [Garbage Collection in Java | How to make object eligible for Garbage Collection](https://www.gatevidyalay.com/how-to-make-object-eligible-for-garbage-collection/) - Ways to make an object eligible for garbage collection- There are 4 different ways in which an object can be made eligible for the purpose of garbage collection- 1) By nullifying the reference variable 2) By reassigning the reference variable 3) By creating objects inside a method 4) Island of Isolation
- [Garbage Collection in Java](https://www.gatevidyalay.com/garbage-collection-in-java/) - The process of collecting the unreferenced objects (garbage) to free up the unnecessarily occupied memory by garbage collector is called as garbage collection in Java.
- [Instance blocks in Java](https://www.gatevidyalay.com/instance-blocks-in-java/) - Instance block is an element of a class which serves the same two purposes as served by the constructors. Instance block will be executed only once for each object during its creation.
- [Constructors in Java](https://www.gatevidyalay.com/constructors-in-java/) - Constructor is an element of a class which serves the following two purposes- 1) Constructors can be used to initialize the instance variables during object creation. 2) Constructors can also be used to write the logic of the program which has to be executed automatically on the creation of the objects.
- [Methods in Java](https://www.gatevidyalay.com/methods-in-java/) - Method is an element of a class that is used for writing the logic of the program. There are mainly two types of methods in Java- Instance methods and static methods.
- [Variables in Java with examples](https://www.gatevidyalay.com/variables-in-java-with-examples/) - Variable is an element of a class that is used for storing the values. It is basically a name that is assigned to a memory location where a particular value is stored.
- [Three Address Code | Examples](https://www.gatevidyalay.com/three-address-code/) - In compiler design, Three Address Code is a form of an intermediate code. Three Address Code Examples and Common Forms. Three Address Code is generated by the compiler for implementing code optimization.
- [Code Optimization | Code Optimization Techniques](https://www.gatevidyalay.com/code-optimization-techniques/) - In Compiler design, Code Optimization is an approach for enhancing the performance of the code. Various Code optimization techniques are- Compile Time Evaluation, Common Sub expression elimination, Code movement, Dead code elimination, Strength reduction.
- [Miscellaneous Problems in Compiler Design](https://www.gatevidyalay.com/three-address-code-directed-acyclic-graphs-problems/) - Practice Problems on Three Address Code, Directed Acyclic Graphs and Basic Blocks & Flow Graphs in Compiler Design. Questions from Three Address Code, Directed Acyclic Graphs and Basic Blocks & Flow Graphs are frequently asked in compiler design.
- [Basic Blocks and Flow Graphs | Examples](https://www.gatevidyalay.com/basic-blocks-and-flow-graphs/) - Basic Blocks and Flow Graphs in Compiler design- Basic block is a set of statements that always executes in a sequence one after the other. Flow Graph is a directed graph with flow control information added to the basic blocks.
- [Quadruples, Triples and Indirect Triples](https://www.gatevidyalay.com/implementation-of-three-address-code/) - In compiler design, Three Address Code is implemented as a record with address fields. Representations used are-Quadruples, Triples and Indirect Triples. Problems On Quadruples, Triples and Indirect Triples.
- [First and Follow | Solved Examples](https://www.gatevidyalay.com/first-and-follow-compiler-design/) - In compiler design, first and follow sets are needed by the parser to properly apply the needed production. Calculating First and Follow Solved Examples. First and Follow Questions with Solutions.
- [Syntax Trees | Abstract Syntax Trees](https://www.gatevidyalay.com/syntax-trees/) - Syntax Tree or Abstract Syntax Tree is a condensed form of parse tree. A syntax tree is nothing but the compact form of a parse tree. Parse trees are comparatively less dense than syntax trees.
- [Shift Reduce Parser | Shift Reduce Parsing](https://www.gatevidyalay.com/shift-reduce-parsing/) - In compiler design, Shift-Reduce Parser is a bottom up parser. Shift Reduce Parsing is a bottom up parsing. Problems on Shift Reduce Parser. Shift Reduce Parser requires 2 data structures for its implementation- Stack and Input buffer.
- [Data Structures Test on Tree Traversal Techniques](https://www.gatevidyalay.com/data-structures-test-on-tree-traversal-techniques/) - This test paper is specifically meant for the students to check their understanding of the Data Structure Concept "Tree Traversal Techniques". This test paper consist of the questions based on preorder, inorder, postorder and level order traversal techniques.
- [Data Structures Test on Binary Tree Formulas](https://www.gatevidyalay.com/data-structures-test-on-binary-tree-formulas/) - This test paper is specifically meant for the students to check their understanding of the Data Structure Concept "Binary Tree Formulas". This test paper consist of the questions based on the formulas and properties of the binary trees.
- [Data Structures Test on Binary Search Trees](https://www.gatevidyalay.com/data-structures-test-on-binary-search-trees/) - This test paper is specifically meant for the students to check their understanding of the Data Structure Concept "Binary Search Trees". This test paper consist of the questions based on the concepts of Binary Search Trees.
- [Binary Search Tree Insertion | BST Deletion](https://www.gatevidyalay.com/binary-search-tree-insertion-bst-deletion/) - Binary Search Tree Operations are- Binary Search Tree Insertion, Binary Search Tree Deletion and Binary Search Tree Search. BST Deletion involves deleting a node from BST. BST Insertion involves inserting a node in BST. BST Search involves searching a node in BST.
- [Equivalence of Two Sets of Functional Dependencies](https://www.gatevidyalay.com/equivalence-of-two-sets-of-functional-dependencies/) - Functional Dependencies Equivalence- Two sets of functional dependencies may or may not be equivalent. Three cases are possible- F covers G, G covers F, Both F and G cover each other.
- [Decomposition in DBMS | Lossless | Lossy](https://www.gatevidyalay.com/decomposition-of-a-relation/) - Decomposition in DBMS is a process of dividing a relation into sub relations. Types of Decomposition in DBMS- Lossless Decomposition and Lossy Decomposition.
- [Determine Decomposition Is Lossless Or Lossy](https://www.gatevidyalay.com/determine-whether-the-decomposition-is-lossless-or-lossy/) - To determine whether decomposition is lossless or lossy, we check 3 conditions. Lossless Decomposition occurs if all conditions satisfy. Lossy decomposition occurs if any one condition fails.
- [Canonical Cover in DBMS](https://www.gatevidyalay.com/canonical-cover-in-dbms/) - A canonical cover also called as irreducible set is a simplified and reduced version of the given set of functional dependencies whose closure is exactly same as that of the closure of given set of functional dependencies.
- [Referential Integrity Constraint | Violation](https://www.gatevidyalay.com/referential-integrity-constraint-violation/) - Referential Integrity Constraint Violation occur due to three causes. On Delete Cascade handles violation due to deletion. On Update Cascade handles violation due to insertion.
- [Constraints in DBMS | Types of Constraints in DBMS](https://www.gatevidyalay.com/constraints-in-dbms-types-of-constraints-in-dbms/) - Relational Constraints in DBMS are the constraints imposed to ensure database correctness. Types of constraints in DBMS- Domain Integrity Constraint, Referential Integrity Constraint, Tuple Uniqueness Constraint, Key Constraint, Entity Integrity Constraint.
- [ER Diagrams to Tables](https://www.gatevidyalay.com/er-diagrams-to-tables/) - ER diagram is converted into the tables so that it can be easily implemented by any Relational Database Management System. We use the following rules for converting ER diagrams to tables.
- [Concurrency Problems | DBMS](https://www.gatevidyalay.com/concurrency-problems-in-transaction/) - Concurrency problems occur when multiple transactions execute concurrently in an uncontrolled manner. Dirty Read Problem, Unrepeatable Read Problem, Lost Update Problem, Phantom read Problem are the concurrency problems in DBMS.
- [Transaction States in DBMS](https://www.gatevidyalay.com/transaction-states-in-dbms/) - Transaction in DBMS is a set of logically related operations. Transaction states in DBMS are the states through which a transaction goes throughout its lifetime. Transaction states are- Active state, Partially committed state, Committed state, Failed state, Aborted state, Terminated state.
- [Entity Sets in DBMS](https://www.gatevidyalay.com/entity-sets-in-dbms/) - In DBMS, an entity set is a set of entities of same type. An entity set may be of two types- Strong Entity Set and Weak Entity Set. An entity refers to any object having either a physical existence or a conceptual existence.
- [ER Diagrams | ER Diagram Symbols](https://www.gatevidyalay.com/er-diagrams/) - ER diagram is a conceptual model that gives the graphical representation of the logical structure of the database. ER Diagram Symbols are used to represent each component of ER Diagram.
- [Cardinality in ER Diagram | DBMS](https://www.gatevidyalay.com/cardinality-in-er-diagram/) - Cardinality in DBMS defines the maximum number of relationship instances in which an entity can participate. Cardinality Ratios are- Many to Many Cardinality, Many to One Cardinality, One to Many Cardinality, One to One Cardinality.
- [Relationship Sets | DBMS](https://www.gatevidyalay.com/relationship-sets/) - A relationship set is a set of relationships of same type. A relationship set may be a unary relationship set or binary relationship set or ternary relationship set or n-ary relationship set.
- [Participation Constraints | DBMS](https://www.gatevidyalay.com/participation-constraints/) - Participation constraint defines the least number of relationship instances in which an entity must participate. Total participation and Partial participation are the two types of participation constraints.
- [Serializability in DBMS | Conflict Serializability](https://www.gatevidyalay.com/serializability-in-dbms-conflict-serializability/) - Serializability in DBMS identifies the non-serial schedules that will maintain the database consistency. Conflict Serializability & View Serializability are the two types of Serializability in DBMS.
- [Conflict Serializability | Practice Problems](https://www.gatevidyalay.com/conflict-serializability-practice-problems/) - Practice Problems based on Conflict Serializability and How to check whether a given schedule is conflict serializable or not. Serializability in DBMS is a concept that helps to identify the correct non-serial schedules that will maintain the consistency of the database.
- [View Serializability in DBMS](https://www.gatevidyalay.com/view-serializability-in-dbms/) - View Serializability- A view serializable schedule is a schedule which is view equivalent to some serial schedule. View Serializability and Conflict Serializability are two types of serializability in DBMS. Conditions to check whether a given schedule is view serializable or not.
- [Recoverability in DBMS | Recoverable Schedule](https://www.gatevidyalay.com/recoverable-schedules-irrecoverable-schedules-non-serializable-schedules/) - Recoverability in DBMS- If a non serializable schedule can recover by rolling back, then it is a recoverable schedule otherwise irrecoverable schedule. Methods to check whether a given schedule is Recoverable or Irrecoverable.
- [Types of Attributes | DBMS](https://www.gatevidyalay.com/types-of-attributes/) - Attributes in DBMS are the descriptive properties owned by each entity of an entity set. Types of attributes in DBMS- Simple attributes, Composite attributes, Single valued attributes, Multi valued attributes, Derived attributes, Key attributes
- [ER Diagrams to Tables | Practice Problems](https://www.gatevidyalay.com/er-diagrams-to-tables-practice-problems/) - Practice problems based on converting ER diagram to tables. ER diagram is converted into the tables so that it can be easily implemented by any Relational Database Management System. We use the following rules for converting ER diagrams to tables.
- [ACID Properties | ACID Properties in DBMS](https://www.gatevidyalay.com/acid-properties/) - ACID Properties in DBMS are the properties that must be followed by each transaction to ensure consistency of the database. In the term ACID Properties, A = Atomicity, C = Consistency, I = Isolation, D = Durability.
- [Cascading Rollback | Cascadeless Schedule](https://www.gatevidyalay.com/cascading-schedule-cascading-rollback-cascadeless-schedule/) - Recoverable Schedules in DBMS are of three types- Cascading Rollback Schedule or Cascading Abort, Cascadeless Schedule and Strict Schedule. Cascadeless schedules are less strict than strict schedules.
- [Equivalence of Schedules | Equivalent Schedules in DBMS](https://www.gatevidyalay.com/equivalence-of-schedules-equivalent-schedules-in-dbms/) - Equivalence of Schedules- In DBMS, schedules may be Result Equivalent Schedules, Conflict Equivalent Schedules and View Equivalent Schedules.
- [View Serializability in DBMS | Practice Problems](https://www.gatevidyalay.com/view-serializability-in-dbms-practice-problems/) - Practice Problems based on View Serializability and How to check whether a given schedule is view serializable or not. Serializability in DBMS is a concept that helps to identify the correct non-serial schedules that will maintain the consistency of the database.
- [Cache Memory in Computer Architecture](https://www.gatevidyalay.com/cache-memory/) - Cache memory in computer architecture is a special memory that matches the processor speed. Cache memory is located on the path between the processor and the memory. Its fast speed makes it extremely useful.
- [Addressing Modes | Types of Addressing Modes](https://www.gatevidyalay.com/addressing-modes/) - In computer architecture, Addressing Modes specify the location of an operand. Types of Addressing Modes- Implied / Implicit Addressing Mode, Immediate Addressing Mode, Direct Addressing Mode, Indirect Addressing Mode, Register Direct Addressing Mode, Register Indirect Addressing Mode, Relative Addressing Mode, Indexed Addressing Mode, Base Register Addressing Mode, Auto-Increment Addressing Mode, Auto-Decrement Addressing Mode, Stack Addressing Mode
- [Hashing in Data Structure | Hash Functions](https://www.gatevidyalay.com/hashing/) - Hashing in data structure is an efficient technique to perform the search. Hash table data structure is used to store the data items. Hash function is used to compute the the hash key value. Hash key value serves as an index for storing the data item into the hash table.
- [Separate Chaining | Collision Resolution Techniques](https://www.gatevidyalay.com/collision-resolution-techniques-separate-chaining/) - Collision Resolution Techniques in data structure are the techniques used for handling collision in hashing. Separate Chaining is a collision resolution technique that handles collision by creating a linked list to the bucket of hash table for which collision occurs.
- [Open Addressing | Linear Probing | Collision](https://www.gatevidyalay.com/open-addressing-collision-resolution-techniques/) - Open Addressing is a collision resolution technique used for handling collisions in hashing. Techniques Used- Linear Probing, Quadratic Probing, Double Hashing. In linear probing, the next bucket is linearly probed.
- [Separate Chaining Vs Open Addressing](https://www.gatevidyalay.com/separate-chaining-open-addressing-comparison/) - In hashing, collision resolution techniques are- separate chaining and open addressing. Separate Chaining Vs Open Addressing- A comparison is done between separate chaining and open addressing. Difference between Separate Chaining and Open Addressing.
- [Cache Mapping | Cache Mapping Techniques](https://www.gatevidyalay.com/cache-mapping-cache-mapping-techniques/) - Cache mapping is a technique that defines how contents of main memory are brought into cache. Cache Mapping Techniques- Direct Mapping, Fully Associative Mapping, K-way Set Associative Mapping.
- [Functional Dependency in DBMS](https://www.gatevidyalay.com/functional-dependency-in-dbms/) - In DBMS, a functional dependency α → β holds if two tuples having same value of attribute α have same value for attribute β. Examples of Trivial and Non-Trivial Functional Dependency.
- [Construction of DFA | DFA Solved Examples](https://www.gatevidyalay.com/how-to-solve-dfa-problems-dfa-solved-examples/) - Construction of DFA- This article discusses how to solve DFA problems with examples. Construction of DFA with Examples. Practice Problems based on Construction of DFA.
- [DFA Solved Examples | How to Construct DFA](https://www.gatevidyalay.com/construction-of-dfa-examples-dfa-solved-examples/) - How to construct DFA- This article discusses construction of DFA with examples. DFA Solved Examples. DFA Construction Problems. Practice Problems based on Construction of DFA.
- [Relation between Left Recursion & Left Factoring](https://www.gatevidyalay.com/left-recursion-left-factoring-ambiguity-of-grammar/) - Relationship between left recursion, left factoring and ambiguity of grammar. Left recursion, left factoring and ambiguity of grammar does not have any relationship among them.
- [Context Free Grammar | Context Free Language](https://www.gatevidyalay.com/context-free-grammar-cfg/) - Context Free Grammar- A context Free Grammar or CFG is a 4-tuple such that G = (V , T , P , S). Examples. Context Free Language is a language generated using Context Free Grammar. Applications of Context Free Grammar.
- [Algorithm To Decide Whether CFL Is Empty](https://www.gatevidyalay.com/decision-properties-of-context-free-languages/) - Decision Properties of Context Free Languages and Decision Algorithms for Context Free Languages- Algorithm to decide whether a Context Free Language is empty or not.
- [Algorithm To Decide Whether CFL Is Finite](https://www.gatevidyalay.com/decision-algorithms-for-context-free-languages/) - Decision Properties of Context Free Languages and Decision Algorithms for Context Free Languages- Algorithm to decide whether a Context Free Language is finite or not.
- [CYK Algorithm | CYK Algorithm Example](https://www.gatevidyalay.com/cyk-cyk-algorithm/) - CYK Algorithm or CKY Algorithm or Cocke Younger Kasami Algorithm is a membership algorithm of CFG. CYK Algorithm Example. CYK Algorithm decides whether a given string belongs to a language of grammar or not.
- [GATE Exam | GATE 2019 | Important Notifications](https://www.gatevidyalay.com/gate-exam-gate-2019-important-notifications/) - The important notifications for GATE 2019 exam has been released by IIT Madras. Check out GATE 2019 syllabus, Eligibility Criteria, Important dates, application fee, exam pattern, exam date etc.
- [Binary Search Tree Traversal | BST Traversal](https://www.gatevidyalay.com/binary-search-tree-traversal-bst-traversal/) - Binary Search Tree Traversal or BST Traversal is same as Binary Tree Traversal. In other words, preorder traversal, inorder traversal and postorder traversal of BST is performed in the same way as that of binary tree.
- [Tree Data Structure | Tree Terminology](https://www.gatevidyalay.com/tree-data-structure-tree-terminology/) - Tree data structure is a non-linear data structure. Tree Terminology in Data Structure- Level of a Tree, Height of a Tree, Depth of Tree, Degree of a Tree, Root of Tree, Internal Node, Leaf Node, Edge, Parent, Child, Siblings, Subtree, Forest. All these terms are discussed with examples.
- [Binary Tree | Types of Binary Trees](https://www.gatevidyalay.com/binary-tree-types-of-trees-in-data-structure/) - Binary tree is a special tree data structure. Types of Trees in Data Structure- Perfect or Complete Binary Tree, Full or Strictly Binary Tree, Almost Complete Binary Tree, Skew Binary Tree, Rooted Binary Tree, Balance Binary Tree.
- [Tree Traversal | Binary Tree Traversal](https://www.gatevidyalay.com/tree-traversal-binary-tree-traversal/) - Tree Traversal is the process of visiting each node exactly once. Binary Tree Traversal Techniques- Preorder Traversal, Inorder Traversal, Postorder Traversal, Level Order Traversal.
- [Binary Search Tree | Example | Construction](https://www.gatevidyalay.com/binary-search-trees-data-structures/) - Binary Search Tree or BST is a special kind of binary tree. Binary Search Tree Example is given. Binary Search Tree Construction- Various steps to construct binary search tree are given. Practice Problems on Binary Search Trees.
- [Relational Algebra | Relational Algebra in DBMS](https://www.gatevidyalay.com/relational-algebra-relational-algebra-in-dbms/) - Relational Algebra is a procedural query language which takes relation as input and generates relation as output. Relational Algebra Operators and Characteristics of Relational Algebra Operators.
- [AVL Tree | AVL Tree Example | AVL Tree Rotation](https://www.gatevidyalay.com/avl-tree-avl-tree-example-avl-tree-rotation/) - AVL Tree in data structure is a self balancing binary search tree. AVL Tree Examples are given. AVL Tree Rotations refer to the process of moving nodes to make the tree balanced.
- [Time Complexity of Binary Search Tree](https://www.gatevidyalay.com/time-complexity-of-bst-binary-search-tree/) - Time complexity of binary search tree- Time complexity of BST operations is O(h) where h is the height of binary search tree. Binary search tree is a special kind of binary tree.
- [Grammar in Automata | Types of Grammar](https://www.gatevidyalay.com/what-is-grammar-types-of-grammar-automata/) - In automata, Grammar is defined as 4-tuple G (V, T, P, S). Example of Grammar. Types of Grammar- Ambiguous and Unambiguous Grammar, Recursive and Non-Recursive Grammar, Chomsky Hierarchy.
- [Language Of Grammar | Automata](https://www.gatevidyalay.com/language-of-grammar-automata/) - In Automata, Language of Grammar is the set of all strings that can be generated from that grammar. Examples. Finite and Infinite Language- If language consists of finite number of strings, then it is called as a finite language otherwise an infinite language.
- [Ambiguous Grammar | Grammar in Automata](https://www.gatevidyalay.com/ambiguous-grammar-types-of-grammar/) - Ambiguous Grammar- A grammar is said to be ambiguous if it produces more than one parse tree for at least one string generated by it. Unambiguous Grammar- A grammar is said to be unambiguous if it produces exactly one parse tree for at least one string generated by it.
- [Difference between Ambiguous and Unambiguous Grammar](https://www.gatevidyalay.com/difference-between-ambiguous-and-unambiguous-grammar/) - Difference between Ambiguous and Unambiguous Grammar- Ambiguous grammar produces more than one parse tree for at least one string while unambiguous grammar produces exactly one parse for all the strings.
- [Grammar Ambiguity | Check Ambiguous Grammar](https://www.gatevidyalay.com/grammar-ambiguity-ambiguous-grammar/) - Check Whether Grammar is Ambiguous or Not- To check grammar ambiguity, we try to find one string for which there exists more than one parse tree. There exists no algorithm to check whether grammar is ambiguous or not.
- [Language Ambiguity | Ambiguous Language](https://www.gatevidyalay.com/language-ambiguity-ambiguous-language/) - A language is called inherently ambiguous language if every grammar which generates that language is ambiguous. Ambiguous Language Examples. Language Ambiguity is closely related to grammar ambiguity.
- [Recursive Grammar | Left Recursive Grammar](https://www.gatevidyalay.com/recursive-grammar-left-recursive-grammar/) - A recursive grammar is a grammar that generates infinite number of strings. Types- Left Recursive Grammar & Right Recursive Grammar. A left recursive grammar is one that has left recursion. A right recursive grammar is one that has right recursion.
- [Selection Operator | Relational Algebra | DBMS](https://www.gatevidyalay.com/selection-operator-relational-algebra-dbms/) - Relational Algebra Operators- Selection Operator (σ) is an operator in relational algebra that performs a selection operation by selecting the rows from a relation that satisfies the selection condition.
- [Projection Operator | Relational Algebra | DBMS](https://www.gatevidyalay.com/projection-operator-relational-algebra-dbms/) - Relational Algebra Operators- Projection Operator (π) is a unary operator in relational algebra that perform a projection operation. It displays the columns of a table or relation based on the specified attributes.
- [Set Theory Operators | Relational Algebra | DBMS](https://www.gatevidyalay.com/set-theory-operators-relational-algebra-dbms/) - In Relational Algebra, Set theory operators are- Union operator, Intersection operator, Difference operator. Condition for using set theory operators- Both the relations must be union compatible.
- [Parse Tree | Derivations | Automata](https://www.gatevidyalay.com/parse-tree-derivations-automata/) - In automata, derivation is a process of deriving a string. Parse tree or Derivation tree is the geometrical representation of a derivation. Leftmost Derivation and Rightmost Derivation are the two types of derivation.
- [Left Recursion | Left Recursion Elimination](https://www.gatevidyalay.com/left-recursion-left-recursion-elimination/) - Left Recursion- A production of grammar is said to have left recursion if leftmost variable of RHS is same as variable of LHS. Left Recursion Elimination. Examples on how to eliminate left recursion.
- [AVL Tree Properties | Problems on AVL Tree](https://www.gatevidyalay.com/avl-tree-properties-avl-trees/) - AVL tree is a self balancing binary search tree data structure. AVL Tree Properties are given. If height of AVL tree = H then, minimum number of nodes in AVL tree is given by a recursive relation N(H) = N(H-1) + N(H-2) + 1. AVL Tree Exercise.
- [Left Factoring | Left Factoring Examples](https://www.gatevidyalay.com/left-factoring-examples-compiler-design/) - In compiler design, left factoring is a process to transform the grammar with common prefixes. Left Factoring Examples. Problems to perform left factoring on given grammars.
- [Minimization of DFA | Minimize DFA | Examples](https://www.gatevidyalay.com/minimization-of-dfa-minimize-dfa-example/) - Minimization of DFA is a process of reducing a given DFA to its minimal form called minimal DFA. Minimized DFA contains minimum number of states. Minimization of DFA Examples and Practice Problems.
- [Chomsky Normal Form | Normal Forms in Automata](https://www.gatevidyalay.com/chomsky-normal-form-normal-forms/) - A grammar is called in Chomsky Normal Form if all its productions derive either two non-terminals or a single terminal. Examples. Normal Forms- Chomsky Normal Form and Greibach Normal Form.
- [Evaluating Expressions Based On Given Grammar](https://www.gatevidyalay.com/solving-expressions-based-on-given-grammar/) - Two methods for evaluating the expressions based on given grammar- Drawing a parse tree and Designing rules for operators. Rules for deciding priority and associativity of operators are given.
- [Removing Ambiguity | Ambiguous to Unambiguous](https://www.gatevidyalay.com/removing-ambiguity-grammar-ambiguity/) - Removing Ambiguity- An ambiguous grammar may be converted into an unambiguous grammar by implementing precedence and associativity constraints. Rules to convert ambiguous grammar into unambiguous grammar.
- [Ambiguous Grammar | Parse Tree | Important Points](https://www.gatevidyalay.com/ambiguous-grammar-parse-tree-important-points/) - Important Points about Ambiguous Grammar and Parse Tree- Ambiguous grammar is a grammar whose all strings have exactly one parse tree. Parse tree is a geometrical representation of a derivation.
- [DNS in Networking | DNS Resolution](https://www.gatevidyalay.com/domain-name-system-in-computer-networks/) - DNS in Networking stands for Domain Name Service or Domain Name System. DNS is a host name to IP Address translation service. DNS Resolution is a process of resolving domain name to an IP Address.
- [HyperText Transfer Protocol | HTTP Tutorial](https://www.gatevidyalay.com/hypertext-transfer-protocol-http-protocol/) - HTTP short for HyperText Transfer Protocol is an application layer protocol. HTTP Protocol uses port number 80. HTTP Protocol is a stateless, connectionless & in-band protocol. HTTP connections may be persistent or non-persistent. HTTP uses TCP at transport layer.
- [Simple Mail Transfer Protocol | SMTP Protocol](https://www.gatevidyalay.com/simple-mail-transfer-protocol-smtp-protocol/) - SMTP is short for Simple Mail Transfer Protocol. SMTP Protocol is an application layer protocol. SMTP in Computer Networks is a stateless, connection oriented, push, in-band protocol. SMTP uses TCP port 25 at the transport layer.
- [POP Protocol | IMAP Protocol | POP Vs IMAP](https://www.gatevidyalay.com/post-office-protocol-pop3-imap-vs-pop3/) - POP is short for Post Office Protocol. IMAP is short for Internet Message Access Protocol. POP Vs IMAP. POP Protocol and IMAP Protocol are both application layer protocols used for the retrieval of mails by the receiver.
- [File Transfer Protocol | FTP Protocol](https://www.gatevidyalay.com/file-transfer-protocol-ftp-computer-networks/) - FTP is short for File Transfer Protocol. FTP Protocol is an application layer protocol. FTP in computer networks is used to transfer files over the internet. FTP is a stateful protocol. FTP uses port 21 for control connection and port 20 for data connection.
- [DNS | SMTP Vs POP3 | HTTP Vs FTP](https://www.gatevidyalay.com/application-layer-protocols-list-comparison/) - In computer networks, Application layer protocols are- DNS, HTTP, SMTP, POP, FTP. DNS Vs SMTP Vs POP3 Vs HTTP Vs FTP. This article compares all these application layer protocols.
- [TCP in Networking | TCP Protocol](https://www.gatevidyalay.com/transmission-control-protocol-tcp/) - TCP in Networking stands for Transmission Control Protocol. TCP is a transport layer protocol. TCP Protocol has been designed to send data packets reliably over the Internet. Characteristics of TCP are discussed.
- [TCP Connection Termination | FIN Segment](https://www.gatevidyalay.com/tcp-connection-termination-tcp-protocol/) - TCP Connection Termination- A TCP connection is terminated using FIN segment where FIN bit is set to 1. Three Way Handshake is used to establish a TCP Connection. The steps involved in terminating a TCP Connection are described.
- [3 Way Handshake | TCP Connection](https://www.gatevidyalay.com/three-way-handshake-tcp-connection-establishment/) - TCP 3 Way Handshake or Three Way Handshake or TCP Handshake is a process used for TCP Connection Establishment. TCP Handshake involves a series of steps which are followed to establish a reliable TCP connection.
- [TCP Header | TCP Header Format | TCP Flags](https://www.gatevidyalay.com/transmission-control-protocol-tcp-header/) - TCP in networking is a transport layer protocol. TCP Header specifies various fields required during transmission. TCP header Format and TCP Header Diagram are given. TCP Header size ranges from 20 bytes to 60 bytes.
- [TCP Congestion Control | Congestion in Network](https://www.gatevidyalay.com/tcp-congestion-control-tcp-protocol-tcp/) - TCP Congestion Control is meant for handling Congestion in Network. TCP Congestion Control Policy consists of three phases- Slow start phase, Congestion Avoidance Phase, Congestion Detection Phase. Congestion refers to a network state where the message traffic becomes so heavy that it slows down network response time.
- [Silly Window Syndrome | Nagle's Algorithm](https://www.gatevidyalay.com/silly-window-syndrome-nagles-algorithm/) - Silly Window Syndrome is a problem that arises due to the poor implementation of TCP. Nagle's Algorithm and Clark's solution tries to solve the problems caused due to silly window syndrome.
- [Time Out Timer | Karn Algorithm | Jacobson Algorithm](https://www.gatevidyalay.com/time-out-timer-jacobson-algorithm-calculation/) - TCP timers are used to avoid excessive delays. Time out timer is used to retransmit lost segments. Karn's Algorithm, Jacobson Algorithm & Basic Algorithm are used for computing time out timer value dynamically.
- [IPv4 | IPv4 Header | IPv4 Header Format](https://www.gatevidyalay.com/ipv4-ipv4-header-ipv4-header-format/) - IPv4 short for Internet Protocol Version 4 is one of the popularly used IP versions. IPv4 Header is the header of IP datagram. IPv4 Header Format consists of several fields as shown in the diagram. IPv4 header contains the necessary information required during transmission.
- [IP Fragmentation | Fragmentation in Networking](https://www.gatevidyalay.com/ip-fragmentation-fragmentation-in-networking/) - IP Fragmentation is a process of dividing the datagrams into smaller size fragments. IP Fragmentation Example. Fragmentation in Networking is performed at destination side at network layer. Reassembly Algorithm is used to combine the fragments.
- [IP Address in Networking | Classes of IP Address](https://www.gatevidyalay.com/ip-address-classes-of-ip-address-types/) - IP Address in Networking is a unique address for each device in a IP network. Classes of IP Address- A, B, C, D, E. IP Address Format- It is a 32 bit binary address written as 4 numbers separated by dots.
- [Unicast Broadcast Multicast | IP Address](https://www.gatevidyalay.com/types-of-casting-unicast-broadcast-multicast/) - Types of Casting in Networking- Unicast, Broadcast, Multicast. Types of Broadcasting- Limited Broadcast, Direct Broadcast. Examples. In computer networks, transmitting data over the network is termed as casting.
- [TCP Sequence Number | Wrap Around Time](https://www.gatevidyalay.com/tcp-sequence-number-wrap-around-concept/) - TCP Sequence Number- TCP assigns a unique sequence number to each data byte. Wrap Around Time is the time taken to consume all the available sequence numbers. The wrap around concept allows to send unlimited data using TCP.
- [IP Address in Networking | Problems](https://www.gatevidyalay.com/ip-address-classes-of-ip-address-problems/) - Practice Problems based on IP Address in Networking. IP Address in Networking is a unique address for each device in a IP network. Classes of IP Address- A, B, C, D, E. IP Address Format- It is a 32 bit binary address written as 4 numbers separated by dots.
- [Subnetting in Networking | Subnetting Examples](https://www.gatevidyalay.com/subnetting-ip-subnetting-examples/) - Subnetting in Networking is a process of dividing a single network into sub networks called as subnets. Subnetting Examples. IPv4 Subnetting Types- Fixed Length Subnetting and Variable Length Subnetting.
- [Routing Table in Networking | Examples](https://www.gatevidyalay.com/subnetting-in-networking-routing-table/) - Routing table in Networking is a table maintained by the router for routing the packets to their destination. Routing Table Examples. Routing Table helps the router to decide the interface on which the data packet should be forwarded.
- [Subnet Mask | How to Calculate Subnet Mask](https://www.gatevidyalay.com/subnet-mask-how-to-calculate-subnet-mask/) - What is Subnet Mask? Subnet Mask is a 32 bit number that identifies the subnet to which an IP Address belongs. How to calculate Subnet Mask? Subnet Mask for IP Address is calculated by setting all the bits reserved for network ID and subnet ID to 1 and all the bits reserved for Host ID to 0.
- [Subnet Mask | Practice Problems](https://www.gatevidyalay.com/subnet-mask-ip-subnet-mask-problems/) - Practice Problems based on Subnet Mask. Subnet Mask is a 32 bit number that identifies the subnet to which an IP Address belongs. How to calculate Subnet Mask? Subnet Mask for IP Address is calculated by setting all the bits reserved for network ID and subnet ID to 1 and all the bits reserved for Host ID to 0.
- [TCP Retransmission | TCP Duplicate ACK](https://www.gatevidyalay.com/tcp-retransmission-tcp-computer-networks/) - TCP Retransmission is a process of retransmitting a TCP segment. TCP Retransmission occurs when time out timer expires before receiving the acknowledgement or 3 duplicate acknowledgements are received from the receiver for the same segment.
- [Subnet Mask | Subnet Mask Use](https://www.gatevidyalay.com/subnet-mask-subnet-mask-use/) - Subnet Mask Use- Host use its subnet mask to determine whether the other host it wants to communicate with is present within the same network or not. Subnet Mask is a 32 bit number that identifies the subnet to which an IP Address belongs.
- [Delays in Computer Networks | Formulas](https://www.gatevidyalay.com/delay-in-computer-networks/) - Delays in Computer Networks- There are different types delay in computer networks- Transmission delay, Propagation delay, Queuing delay and Processing delay. These delays are discussed with their formula.
- [Simplex | Half Duplex | Full Duplex](https://www.gatevidyalay.com/simplex-half-duplex-full-duplex/) - Types of communication channels in networking- Simplex, Half duplex, Full duplex. Simplex Vs Half Duplex Vs Full Duplex with Examples. Channel Capacity in Computer Network.
- [Access Control in Networking | Methods](https://www.gatevidyalay.com/types-of-links-access-control-in-networking/) - Access Control in Networking is a mechanism that controls the access of stations to a broadcast link. Access Control Methods are used to provide access control. Access Control Methods are- Time Division Multiplexing, Polling, CSMA CD, Token Passing, Aloha.
- [Time Division Multiplexing | Access Control](https://www.gatevidyalay.com/time-division-multiplexing-access-control/) - Time Division Multiplexing is an access control method. Access Control in Networking controls the access of stations to shared link. Time Division Multiplexing divides the link time into fixed time slots and distributes them in Round Robin order.
- [Polling in Networking | Access Control Method](https://www.gatevidyalay.com/polling-access-control-in-networking/) - Polling in Networking is an access control method. Access Control in Networking controls the access of stations to shared link. Polling in Computer Networks conducts a polling and polling algorithm chooses one of the stations to send data.
- [Binary Exponential BackOff Algorithm | CSMA CD](https://www.gatevidyalay.com/binary-exponential-backoff-algorithm-csma-cd/) - Back Off Algorithm or Binary Exponential BackOff Algorithm is used to calculate back off time. Back Off time is the time for which the station waits before retransmitting the packet after the collision.
- [CSMA CD Protocol | CSMA CD Flowchart](https://www.gatevidyalay.com/csma-cd-access-control-in-networking/) - CSMA / CD protocol stands for Carrier Sense Multiple Access / Collision Detection. CSMA / CD in computer networks is an access control method. CSMA / CD allows the stations to sense the carrier and send the data if it is free.
- [Token Passing | Token Ring in Networking](https://www.gatevidyalay.com/token-passing-access-control-in-networking/) - Token Ring in Networking or Token Passing in Networking is an access control method. Token Ring Protocol in computer networks consist of stations connected in the form of a ring. There is a token that governs whether a station can transmit the data or not.
- [Aloha | Pure Aloha | Slotted Aloha](https://www.gatevidyalay.com/aloha-pure-aloha-slotted-aloha/) - Aloha in computer networks is an access control protocol. Versions of Aloha Protocol- Pure Aloha and Slotted Aloha. Pure Aloha in networking allows the stations to transmit the data at anytime. Slotted Aloha Protocol allows the stations to transmit data only at the beginning of the time slot. Difference between Pure Aloha and Slotted Aloha.
- [Stop and Wait Protocol | Practice Problems](https://www.gatevidyalay.com/stop-and-wait-protocol-practice-problems/) - Practice Problems based on Stop and Wait Protocol. Stop and Wait Protocol is a flow control protocol where sender sends one data packet and then stops and waits for its acknowledgement.
- [Distance Vector Routing Algorithm | Example](https://www.gatevidyalay.com/distance-vector-routing-routing-algorithms/) - Distance Vector Routing Algorithm is a dynamic routing algorithm in computer networks. Distance Vector Routing Algorithm Example. Distance Vector Routing Algorithm is called so because it involves exchanging distance vectors. Each router prepares a routing table and exchange with its neighbors.
- [Sliding Window Protocol | Flow Control](https://www.gatevidyalay.com/sliding-window-protocol-flow-control/) - Sliding Window Protocols in computer networks are the flow control protocols. Go Back N and Selective Repeat are the implementations of sliding window protocol. Sliding Window Protocol allows the sender to send multiple frames before needing acknowledgements.
- [Go back N | Sliding Window Protocol](https://www.gatevidyalay.com/go-back-n-sliding-window-protocol/) - Go back N Protocol in computer networks is a Sliding Window Protocol. Go back N ARQ is an implementation of sliding window protocol like Selective Repeat Protocol.
- [Go Back N | Practice Problems](https://www.gatevidyalay.com/go-back-n-practice-problems/) - Practice Problems based on Go back N protocol. Go back N Protocol in computer networks is a Sliding Window Protocol. Go back N ARQ is an implementation of sliding window protocol like Selective Repeat Protocol.
- [Selective Repeat | Sliding Window Protocol](https://www.gatevidyalay.com/selective-repeat-sliding-window-protocol/) - Selective Repeat Protocol in computer networks is a Sliding Window Protocol. Selective Repeat ARQ or SR Protocol is an implementation of sliding window protocol like Go back N Protocol.
- [Sliding Window Protocol | Practice Problems](https://www.gatevidyalay.com/sliding-window-protocol-practice-problems/) - Practice Problems based on Sliding Window Protocol. Sliding Window Protocols in computer networks are the flow control protocols. Go Back N and Selective Repeat are the implementations of sliding window protocol.
- [Selective Repeat Protocol | Practice Problems](https://www.gatevidyalay.com/selective-repeat-protocol-practice-problems/) - Practice Problems based on Selective Repeat ARQ. Selective Repeat Protocol in computer networks is a Sliding Window Protocol. SR Protocol or Selective Repeat ARQ is an implementation of sliding window protocol like Go back N Protocol.
- [Flow Control Protocols | Practice Problems](https://www.gatevidyalay.com/flow-control-protocols-practice-problems/) - Practice problems based on Flow Control Protocols. Flow control protocols are Stop and Wait Protocol, Stop and Wait ARQ, Go back N Protocol and Selective Repeat Protocol.
- [Ethernet in Networking | Ethernet Frame Format](https://www.gatevidyalay.com/ethernet-ethernet-frame-format/) - Ethernet in networking is a LAN technology. Ethernet frame format has several fields. Ethernet frame size range = [64 bytes, 1518 bytes]. Ethernet Header Size = 14 bytes. Ethernet Protocol is used to build wired LANs.
- [Ethernet in Networking | Practice Problems](https://www.gatevidyalay.com/ethernet-ethernet-frame-practice-problems/) - Practice Problems based on Ethernet. Ethernet in networking is a LAN technology. Ethernet frame format has several fields. Ethernet frame size range = [64 bytes, 1518 bytes]. Ethernet Header Size = 14 bytes.
- [CSMA CD | BackOff Algorithm | Problems](https://www.gatevidyalay.com/csma-cd-backoff-algorithm-practice-problems/) - Practice Problems based on CSMA / CD and Back Off Algorithm. CSMA / CD protocol stands for Carrier Sense Multiple Access / Collision Detection. Back Off Algorithm or Binary Exponential BackOff Algorithm is used to calculate back off time.
- [Token Ring | Token Passing | Practice Problems](https://www.gatevidyalay.com/token-ring-token-passing-practice-problems/) - Practice Problems based on Token Ring and Token Passing. Token passing strategies- Delayed Token Reinsertion (DTR) and Early Token Reinsertion (ETR).
- [UDP Protocol | UDP Header | UDP Header Format](https://www.gatevidyalay.com/udp-protocol-udp-header-udp/) - UDP Protocol is the simplest Transport Layer Protocol. UDP stands for User Datagram Protocol. UDP Header consists of 4 fields. UDP Header Format is shown. UDP header size is 8 bytes. UDP Checksum calculation is not mandatory.
- [IP Header | IP Fragmentation | Problems](https://www.gatevidyalay.com/ip-header-ip-fragmentation-practice-problems/) - Practice Problems based on IP Header and IP Fragmentation. IPv4 Header contains information required during the data packet transmission. IP Fragmentation is a process of dividing datagram into fragments.
- [Transmission Control Protocol | Practice Problems](https://www.gatevidyalay.com/tcp-protocol-tcp-header-practice-problems/) - Practice Problems based on Transmission Control Protocol. TCP Protocol is a transport layer protocol. TCP header format specifies various fields required for transmission. TCP congestion control policy is used for handling congestion.
- [Stop and Wait ARQ | Go back N | SR Protocol](https://www.gatevidyalay.com/stop-and-wait-arq-go-back-n-sr-protocol/) - Sliding window protocols are- Stop and Wait ARQ, Go back N & Selective Repeat. The comparison is performed. SR Protocol is superior to Go back N and Stop and Wait ARQ but because of its complexity, it is less used.
- [Cyclic Redundancy Check | CRC | Example](https://www.gatevidyalay.com/cyclic-redundancy-check-crc-error-detection/) - CRC or Cyclic Redundancy Check in computer networks is an error detection method. CRC Generator is used to generate CRC. Example of Cyclic Redundancy Check. CRC or Cyclic Redundancy Check is based on binary division.
- [Error Detection in Computer Networks | Parity Check](https://www.gatevidyalay.com/parity-check-parity-bit-error-detection/) - Error Detection in Computer Networks is a method to detect errors in the data introduced during transmission. Single Parity Check uses a parity bit to perform error detection. Cyclic Redundancy Check (CRC) and Checksum are other error detection methods.
- [Checksum in Networking | Checksum Example](https://www.gatevidyalay.com/checksum-checksum-example-error-detection/) - Checksum in networking is an error detection method. Checksum Example. Checksum method involves calculating a value called as checksum to check whether error occurred in the data during the transmission or not.
- [Circuit Switching in Networking | Switching](https://www.gatevidyalay.com/circuit-switching-types-of-switching/) - Switching in computer networks is done using three techniques- Circuit Switching, Message Switching, Packet Switching. Circuit Switching in Networking is a switching technique which establishes a dedicated path for data transfer.
- [Packet Switching in Networking | Switching](https://www.gatevidyalay.com/packet-switching-switching-in-computer-networks/) - Switching in computer networks is done using three techniques- Circuit Switching, Message Switching, Packet Switching. Packet Switching in Networking is a switching technique in which entire message is divided into smaller size packets. Types of Packet Switching- Virtual Circuit Switching and Datagram Switching.
- [Message Switching | Switching Techniques](https://www.gatevidyalay.com/message-switching-types-of-switching/) - Switching in computer networks is done using three techniques- Circuit Switching, Message Switching, Packet Switching. Message Switching in Networking is a switching technique that follows store and forward strategy. The message is forwarded from hop to hop.
- [Difference between Circuit Switching And Packet Switching](https://www.gatevidyalay.com/circuit-switching-vs-packet-switching/) - Difference between Circuit Switching and Packet Switching. This article compares Circuit Switching Vs Packet Switching. Switching in computer networks is done using three techniques- Circuit Switching, Message Switching, Packet Switching.
- [Process Control Block | Process Attributes](https://www.gatevidyalay.com/process-control-block-process-attributes/) - Process Control Block or PCB in OS is a data structure that stores information about a particular process. The various process attributes stored in the PCB are discussed.
- [Batch Operating System | Types of Operating System](https://www.gatevidyalay.com/batch-operating-system-types-of-operating-system/) - Types of Operating System. In batch operating system, operator collects jobs from different users and converts them into batches with similar needs. Advantages and Disadvantages.
- [CPU Schedulers | Schedulers in OS | Schedulers](https://www.gatevidyalay.com/cpu-schedulers-schedulers-in-os-schedulers/) - CPU Schedulers in OS help in scheduling the processes. Types of Schedulers in OS- Long Term Scheduler, Short Term Scheduler, Medium Term Scheduler. Dispatcher in OS assigns the process to the CPU for execution.
- [Turn Around Time | Response Time | Waiting Time](https://www.gatevidyalay.com/turn-around-time-response-time-waiting-time/) - In Operating System, various times related to process are- Turn Around Time, Waiting time, Response time, Burst time, Completion time, Arrival time. TurnAround Time = Waiting Time + Burst Time.
- [First Come First Serve | CPU Scheduling](https://www.gatevidyalay.com/first-come-first-serve-cpu-scheduling/) - In Operating System, FCFS Scheduling is a CPU Scheduling Algorithm that assigns CPU to the process on First Come First Serve basis. It is always non-preemptive in nature.
- [SJF Scheduling | SRTF | CPU Scheduling](https://www.gatevidyalay.com/sjf-scheduling-srtf-cpu-scheduling/) - Shortest Job First or SJF Scheduling is a CPU Scheduling Algorithm that assigns CPU to the process with smallest burst time. Shortest Remaining Time First (SRTF) guarantees the minimal average waiting time and is optimal.
- [Priority Scheduling | CPU Scheduling | Examples](https://www.gatevidyalay.com/priority-scheduling-cpu-scheduling-examples/) - Priority Scheduling is a CPU Scheduling Algorithm that assigns CPU to the process having the highest priority. Priority Scheduling Preemptive and Non-preemptive Examples.
- [Predicting Burst Time | SJF Scheduling](https://www.gatevidyalay.com/predicting-burst-time-sjf-scheduling/) - Techniques to predict burst time for processes for SJF Scheduling Algorithm- There are various techniques which try to predict the burst time for processes. Static and Dynamic Techniques.
- [HRRN Scheduling | CPU Scheduling](https://www.gatevidyalay.com/highest-response-ratio-next-cpu-scheduling/) - HRRN Scheduling or Highest Response Ratio Next Scheduling is a CPU scheduling algorithm that assigns CPU to the process having highest response ratio. Highest Response Ratio Next Example.
- [Deadlock in OS | Conditions for Deadlock](https://www.gatevidyalay.com/deadlock-in-os-conditions-for-deadlock/) - Deadlock in OS is a situation where two or more processes are blocked. Conditions for Deadlock- Mutual Exclusion, Hold and Wait, No preemption, Circular wait. These 4 conditions must hold simultaneously for the occurrence of deadlock.
- [Deadlock Detection | Deadlock Prevention](https://www.gatevidyalay.com/deadlock-detection-deadlock-prevention/) - Deadlock Prevention, Deadlock Avoidance, Deadlock Detection and Recovery, Deadlock Ignorance are the various strategies used to handle deadlock in Operating System.
- [Deadlock in OS | Deadlock Problems | Questions](https://www.gatevidyalay.com/deadlock-in-os-deadlock-problems-questions/) - Practice Problems based on Deadlock in OS. Deadlock Problems. Deadlock in OS is a situation where the execution of a set of processes is blocked since each process waits for a resource held by some other process.
- [Banker's Algorithm | Deadlock Avoidance](https://www.gatevidyalay.com/bankers-algorithm-deadlock-avoidance/) - Banker's Algorithm in OS is a deadlock avoidance strategy. Banker's Algorithm Example. Banker's Algorithm maintains a set of data. If entertaining the request causes the system to move to unsafe state, then it is aborted.
- [Banker's Algorithm | Deadlock Avoidance](https://www.gatevidyalay.com/bankers-algorithm-deadlock-avoidance-2/) - Practice Problems based on Banker's Algorithm. Banker's Algorithm in OS is a deadlock avoidance strategy. It maintains a set of data. Banker's Algorithm Example.
- [Resource Allocation Graph | Operating System](https://www.gatevidyalay.com/resource-allocation-graph-operating-system/) - In OS, Resource Allocation Graph (RAG) is a graph that represents the state of a system pictorially. Whether the system is in a deadlock state or not can be predicted using Resource Allocation Graph.
- [Resource Allocation Graph | Deadlock Detection](https://www.gatevidyalay.com/resource-allocation-graph-deadlock-detection/) - Practice Problems based on Resource Allocation Graph. In OS, Resource Allocation Graph (RAG) is a graph that represents the state of a system pictorially. Whether the system is in a deadlock state or not can be predicted using Resource Allocation Graph.
- [CPU Scheduling | Practice Problems | Numericals](https://www.gatevidyalay.com/cpu-scheduling-practice-problems-numericals/) - Practice Problems on CPU Scheduling Algorithms. Various CPU Scheduling Algorithms are- FCFS Scheduling, SJF Scheduling, SRTF Scheduling, Round Robin Scheduling, Priority Scheduling.
- [Process Synchronization | Race Condition in OS](https://www.gatevidyalay.com/process-synchronization-race-condition-in-os/) - Process Synchronization deals with synchronization of processes. Race Condition in OS is a situation where multiple processes compete. Critical Section in OS is a part of the program where a process access the shared resource.
- [Critical Section | Critical Section Problem](https://www.gatevidyalay.com/critical-section-critical-section-problem/) - Critical Section in OS is a part of the program where shared resources are accessed by the process. Critical Section Problem arises when multiple processes access the critical section at the same time.
- [Lock Variable | Process Synchronization](https://www.gatevidyalay.com/lock-variable-process-synchronization/) - In process synchronization, lock variable is a synchronization mechanism that uses a lock variable to provide the synchronization among the processes. It fails to meet criteria of synchronization mechanism.
- [Test and Set | Process Synchronization](https://www.gatevidyalay.com/test-and-set-process-synchronization/) - In Process Synchronization, Test and Set Lock (TSL) is a synchronization mechanism that uses a test-and-set instruction to provide the synchronization among the processes. It ensures mutual exclusion and freedom from deadlock.
- [Turn Variable | Process Synchronization](https://www.gatevidyalay.com/turn-variable-process-synchronization/) - In Process Synchronization, Turn Variable is a synchronization mechanism that uses a turn variable to provide the synchronization among the processes. Processes are executed turn wise one by one.
- [Interest Variable | Process Synchronization](https://www.gatevidyalay.com/interest-variable-process-synchronization/) - In Process Synchronization, Interest Variable is a synchronization mechanism that uses an interest variable to provide the synchronization among the processes. Processes are executed according to their interests.
- [Process Synchronization | Practice Problems](https://www.gatevidyalay.com/process-synchronization-practice-problems/) - Practice Problems based on Synchronization Mechanisms. In Process Synchronization, synchronization mechanisms provide the synchronization among processes so that consistent results are produced.
- [SSTF Algorithm | Disk Scheduling Algorithms](https://www.gatevidyalay.com/sstf-algorithm-disk-scheduling-algorithms/) - SSTF Disk Scheduling Algorithm is a disk scheduling algorithm which services requests on the basis of shortest seek time first. SSTF Disk Scheduling Example. It reduces total seek time as compared to FCFS.
- [SCAN Algorithm | Disk Scheduling Algorithms](https://www.gatevidyalay.com/scan-algorithm-disk-scheduling-algorithms/) - SCAN Disk Scheduling Algorithm is a disk scheduling algorithm that services requests by scanning all the cylinders back and forth. SCAN Disk Scheduling Algorithm Example.
- [C-SCAN Disk Scheduling | Disk Scheduling](https://www.gatevidyalay.com/c-scan-disk-scheduling-disk-scheduling/) - C-SCAN Disk Scheduling Algorithm is an improved version of the SCAN Disk Scheduling Algorithm. C-SCAN Disk Scheduling Example. C-SCAN Algorithm overcomes the disadvantage of SCAN Disk Scheduling Algorithm.
- [LOOK Algorithm | Disk Scheduling Algorithms](https://www.gatevidyalay.com/look-algorithm-disk-scheduling-algorithms/) - LOOK Disk Scheduling Algorithm is an improved version of the SCAN Disk Scheduling Algorithm. LOOK Disk Scheduling Example. It overcomes the disadvantage of SCAN Disk Scheduling Algorithm.
- [C-LOOK Algorithm | Disk Scheduling Algorithms](https://www.gatevidyalay.com/c-look-algorithm-disk-scheduling-algorithms/) - C-LOOK Disk Scheduling Algorithm is an improved version of the LOOK Disk Scheduling Algorithm. C-LOOK Disk Scheduling Example. C-LOOK Algorithm overcomes the disadvantage of LOOK Algorithm.
- [Paging | Memory Management | Operating System](https://www.gatevidyalay.com/paging-memory-management-operating-system/) - Paging in OS is a non-contiguous memory allocation technique. Paging in Operating System allows to store different parts of a single process in a non-contiguous fashion. Paging is a fixed size partitioning scheme.
- [Page Table | Paging in Operating System](https://www.gatevidyalay.com/page-table-paging-in-operating-system/) - Paging in OS uses a data structure called as page table. Page Table stores the frame number where pages of the process are stored. Page Table Entry contains several information about the page. Page Table Entry Format.
- [Paging in OS | Formulas | Practice Problems](https://www.gatevidyalay.com/paging-formulas-practice-problems/) - Practice Problems based on Paging and Page Table in OS. Important Formulas of Paging. Paging in OS is a non-contiguous memory allocation technique. Page table performs the mapping of page number to frame number.
- [Translation Lookaside Buffer | TLB | Paging](https://www.gatevidyalay.com/translation-lookaside-buffer-tlb-paging/) - In paging, Translation Lookaside Buffer or TLB is a solution that tries to reduce the effective access time. Paging in OS using TLB requires only one memory reference if TLB hit occurs.
- [Multilevel Paging in OS | Paging in OS](https://www.gatevidyalay.com/multilevel-paging-paging-in-operating-system/) - Multilevel paging in OS is a paging scheme where there exists a hierarchy of page tables. In Operating System, Multilevel Paging is needed when the size of page table is greater than the frame size.
- [Multilevel Paging | Paging | Practice Problems](https://www.gatevidyalay.com/multilevel-paging-paging-practice-problems/) - Practice Problems based on Multilevel Paging in OS. Multilevel paging is a paging scheme where there exists a hierarchy of page tables. Multilevel Paging is needed when the size of page table is greater than the frame size.
- [Paging in OS | Practice Problems | Set-01](https://www.gatevidyalay.com/paging-in-os-practice-problems-set-01/) - Practice Problems based on Paging in OS. Paging in OS is a non-contiguous memory allocation technique. In paging scheme, page table performs the mapping of page number to the frame number.
- [Page Fault | Page Replacement Algorithms](https://www.gatevidyalay.com/page-fault-page-replacement-algorithms/) - Page Fault in OS occurs when the page referenced by the CPU is not found in main memory. Page Replacement Algorithms are used to replace the page to make space for the referenced page if the memory is already full.
- [Page Fault | Paging | Practice Problems](https://www.gatevidyalay.com/page-fault-paging-practice-problems/) - Practice Problems based on Page Fault in OS. A page fault occurs when the referenced page is not found in the main memory. Effective access time is increased due to page fault service time.
- [Page Replacement Algorithms | Page Fault](https://www.gatevidyalay.com/page-replacement-algorithms-page-fault/) - When page fault occurs, page replacement algorithms help to decide which page must be replaced. FIFO Page Replacement Algorithm, LRU Page Replacement Algorithm, Optimal Page Replacement Algorithm are famous Page Replacement Algorithms.
- [Paging in OS | Practice Problems | Set-02](https://www.gatevidyalay.com/paging-in-os-practice-problems-set-02/) - Practice Problems based on Paging and Multilevel Paging in OS. Multilevel Paging is a paging scheme where there exists a hierarchy of page tables. Page table performs the mapping of page number to frame number.
- [Belady's Anomaly | Page Fault | Paging](https://www.gatevidyalay.com/beladys-anomaly-page-fault-paging/) - Belady's Anomaly in operating system is a phenomenon of increasing the number of page faults on increasing the number of frames in main memory. FIFO Page Replacement Algorithm and Random Page Replacement Algorithm suffer from Belady's Anomaly.
- [Page Replacement Algorithms | Important Results](https://www.gatevidyalay.com/page-replacement-algorithms-important-results/) - Page replacement algorithms help to decide which page should be replaced when a page fault occurs and main memory is full. FIFO Page Replacement Algorithm, LRU Page Replacement Algorithm, Optimal Page Replacement Algorithm are famous page replacement algorithms.
- [Segmentation in OS | Segmentation and Paging](https://www.gatevidyalay.com/segmentation-in-os-segmentation-and-paging/) - Segmentation in OS is a non-contiguous memory allocation technique. Unlike Paging, Segmentation divides the process into modules and not fixed size pages. Segment table stores the details about each segment.
- [Segmentation in OS | Practice Problems](https://www.gatevidyalay.com/segmentation-in-os-practice-problems/) - Practice Problems based on Segmentation in OS. Segmentation in OS is a non-contiguous memory allocation technique. Unlike Paging, Segmentation divides the process into segments.
- [Segmentation and Paging | Segmented Paging](https://www.gatevidyalay.com/segmentation-and-paging-segmented-paging/) - Segmented Paging in OS is a scheme that implements the combination of segmentation and paging. Segmentation and Paging are non-contiguous memory allocation techniques.
- [Segmented Paging | Practice Problems](https://www.gatevidyalay.com/segmented-paging-practice-problems/) - Practice Problems based on Segmented Paging. Segmented Paging is a scheme that implements the combination of segmentation and paging. Segmentation and paging are non-contiguous memory allocation techniques.
- [Optimal Page Size | Paging](https://www.gatevidyalay.com/optimal-page-size-paging/) - In paging scheme, Optimal page size is the page size that minimizes the total overhead. Practice Problems based on Optimal page size. Paging in OS divides process into pages.
- [Contiguous Memory Allocation | Static Partitioning](https://www.gatevidyalay.com/contiguous-memory-allocation-static-partitioning/) - Contiguous Memory Allocation in OS allows to store the process only in contiguous fashion. Static partitioning and Dynamic partitioning are two contiguous memory allocation techniques.
- [Contiguous Memory Allocation | Dynamic Partitioning](https://www.gatevidyalay.com/contiguous-memory-allocation-dynamic-partitioning/) - Contiguous Memory Allocation in OS allows to store the process only in contiguous fashion. Dynamic partitioning and Static partitioning are the two contiguous memory allocation techniques.
- [Semaphore | Semaphore in OS | Counting Semaphore](https://www.gatevidyalay.com/semaphore-semaphore-in-os-counting-semaphore/) - Semaphore in OS is a simple integer variable. There are two types of semaphores- Counting Semaphore and Binary Semaphore also called as mutex. Semaphores are used to provide synchronization among processes running concurrently.
- [Semaphore in OS | Practice Problems](https://www.gatevidyalay.com/semaphore-in-os-practice-problems/) - Practice Problems based on Semaphore in OS. In operating system, there are two types of semaphores- Counting Semaphore & Binary Semaphore also called as mutex.
- [Semaphore | Semaphore in OS | Binary Semaphore](https://www.gatevidyalay.com/semaphore-semaphore-in-os-binary-semaphore/) - Semaphore in OS is a simple integer variable. There are two types of semaphores- Binary Semaphore also called as mutex and Counting Semaphore. Semaphores are used to provide synchronization among processes running concurrently.
- [Semaphore | Binary Semaphore | Practice Problems](https://www.gatevidyalay.com/semaphore-binary-semaphore-practice-problems/) - Practice Problems based on Binary Semaphore in OS. In operating system, semaphore is a simple integer variable. There are two types of semaphores- Counting Semaphore and Binary Semaphore also called as mutex.
- [Direct Mapping | Direct Mapped Cache](https://www.gatevidyalay.com/direct-mapping-cache-mapping/) - Direct mapped cache employs direct cache mapping technique. Direct mapping is a cache mapping technique that allows to map a block of main memory to only one particular cache line. Direct mapping implementation. Important results and formulas.
- [Contiguous Memory Allocation | Practice Problems](https://www.gatevidyalay.com/contiguous-memory-allocation-practice-problems/) - Practice Problems based on Contiguous Memory Allocation. In Operating System, Contiguous Memory Allocation Techniques are- Static partitioning and Dynamic partitioning.
- [Direct Mapping | Cache | Practice Problems](https://www.gatevidyalay.com/direct-mapping-cache-practice-problems/) - Practice Problems based on Direct Mapping. Direct Mapping is a cache mapping technique that allows to map a particular block of main memory to one particular cache line only.
- [Set Associative Mapping | Set Associative Cache](https://www.gatevidyalay.com/set-associative-mapping-cache-mapping/) - Set associative cache employs set associative cache mapping technique. Set associative mapping is a cache mapping technique that allows to map a block of main memory to only one particular set of cache. Set associative mapping implementation. Important results and formulas.
- [Cache Line | Cache Line Size |  Cache Memory](https://www.gatevidyalay.com/cache-line-cache-line-size-cache-memory/) - Cache memory is divided into equal size partitions called as cache lines. Cache line size is an important parameter while designing computer's cache system.
- [Magnetic Disk in Computer Architecture](https://www.gatevidyalay.com/magnetic-disk-secondary-memory-coa/) - Magnetic Disk is a storage device. Disk performance parameters- Seek time, Rotational Latency, Data Transfer Rate. Disk Formulas- Seek time Formula, Rotational Latency Formula etc.
- [Fully Associative Mapping | Practice Problems](https://www.gatevidyalay.com/fully-associative-cache-practice-problems/) - Practice Problems based on Fully Associative Mapping. Fully Associative Cache employs fully associative cache mapping technique. Fully Associative Mapping is a cache mapping technique that allows to map a block of main memory to any freely available cache line.
- [Magnetic Disk | Practice Problems | COA](https://www.gatevidyalay.com/magnetic-disk-practice-problems-coa/) - Practice Problems based on Magnetic Disk in Computer Architecture. Magnetic disk formulas- Seek time, Rotational Latency, Disk Transfer Rate, Recording Density etc. are used.
- [Set Associative Mapping | Practice Problems](https://www.gatevidyalay.com/set-associative-mapping-practice-problems/) - Practice Problems based on set associative mapping. Set associative mapping is a cache mapping technique that allows to map a particular block of main memory to one particular cache set only.
- [Cache Mapping | Practice Problems](https://www.gatevidyalay.com/cache-mapping-practice-problems/) - Practice Problems based on Cache Mapping Techniques. Cache mapping techniques are- Direct Mapping, Fully Associative Mapping and Set Associative Mapping. Cache mapping techniques govern the mapping of a block from main memory to cache memory.
- [Addressing Modes in Computer Architecture](https://www.gatevidyalay.com/addressing-modes-in-computer-architecture/) - In computer architecture, addressing modes are the different ways of specifying the operand location. Different types of addressing Modes exist. Syntax of addressing mode is the way of representing the addressing mode used.
- [Memory Hierarchy | Memory Hierarchy Diagram](https://www.gatevidyalay.com/memory-hierarchy-memory-hierarchy-diagram/) - In Computer Architecture, Memory hierarchy is a hierarchy of memory and storage devices. Memory Hierarchy Diagram. It's purpose is to minimize the average access time of the entire memory system.
- [Pipelining in Computer Architecture](https://www.gatevidyalay.com/pipelining-in-computer-architecture/) - Pipelining in Computer Architecture implements a form of parallelism for executing the instructions. A pipelined processor executes multiple instructions at the same time.
- [Instruction Pipelining | Performance](https://www.gatevidyalay.com/instruction-pipelining-performance/) - Pipelining in Computer Architecture offers better performance than non-pipelined execution. Speed Up, Efficiency and Throughput serve as the criteria to estimate performance of pipelined execution.
- [Pipelining | Practice Problems](https://www.gatevidyalay.com/pipelining-practice-problems/) - Practice Problems based on Pipelining in Computer Architecture. Pipelining in Computer Architecture is an efficient way of executing instructions. Speed up, Efficiency and Throughput are performance parameters of pipelined architecture.
- [Symmetric Key Cryptography | Cryptography Techniques](https://www.gatevidyalay.com/cryptography-symmetric-key-cryptography/) - Cryptography in Network Security is a method of exchanging data in a particular form. Cryptography Techniques- Symmetric key cryptography and Asymmetric key cryptography. In symmetric key cryptography, sender and receiver use the same key for encryption and decryption.
- [Public Key Cryptography | RSA Algorithm Example](https://www.gatevidyalay.com/public-key-cryptography-rsa-algorithm/) - Public key cryptography or Asymmetric key cryptography use different keys for encryption and decryption. RSA Algorithm Examples. RSA Algorithm and Diffie Hellman Key Exchange are asymmetric key algorithms.
- [Diffie Hellman Key Exchange | Asymmetric Encryption](https://www.gatevidyalay.com/diffie-hellman-key-exchange-asymmetric-encryption/) - Diffie Hellman Key Exchange Algorithm enables the exchange of secret key between sender and receiver. Diffie Hellman Key Exchange Example. Diffie Hellman Key Exchange is an asymmetric encryption technique.
- [How Digital Signature Works | Algorithm](https://www.gatevidyalay.com/how-digital-signature-works-algorithm/) - A digital signature guarantees the authenticity of an electronic document. How digital signature works? The digital signature algorithm describes how digital signature works.
- [Memory Organization in Computer Architecture](https://www.gatevidyalay.com/memory-organization-in-computer-architecture/) - Memory Organization in Computer Architecture is mainly of two types- Simultaneous Access Memory Organization and Hierarchical Access Memory Organization. In simultaneous organization, all the levels are directly connected to CPU whereas in hierarchical organization, all the levels are connected in hierarchical fashion.
- [TCP Congestion Control | Practice Problems](https://www.gatevidyalay.com/tcp-congestion-control-practice-problems/) - Practice Problems on TCP Congestion Control. TCP Congestion Control is meant for handling Congestion in Network. TCP Congestion Control Policy consists of three phases- Slow start phase, Congestion Avoidance Phase, Congestion Detection Phase.

## Pages

- [About Us](https://www.gatevidyalay.com/) - Gate Vidyalay is an online study portal for B.Tech students preparing for their semester exams and competitive exams like GATE, NET, PSU’s etc.
- [Subscribe](https://www.gatevidyalay.com/subscribe/) - Gate Vidyalay is an online study portal for B.Tech students preparing for their semester exams and competitive exams like GATE, NET, PSU’s etc. It provides you the best quality notes which covers the entire GATE syllabus.
- [Privacy Policy](https://www.gatevidyalay.com/privacy-policy/) - At GateVidyalay, we value your trust & respect your privacy. This privacy statement (“Privacy Statement”) applies to the treatment of personally identifiable information submitted by, or otherwise obtained from, you in connection with the associated application (“Application”).
- [GATE 2022](https://www.gatevidyalay.com/gate-2020-important-notifications/) - Gate Vidyalay is an online study portal for B.Tech students preparing for their semester exams and competitive exams like GATE, NET, PSU’s etc. It provides you the best quality notes which covers the entire GATE syllabus.
- [Disclaimer](https://www.gatevidyalay.com/disclaimer/) - Gate Vidyalay is an online study portal for B.Tech students preparing for their semester exams and competitive exams like GATE, NET, PSU’s etc. It provides you the best quality notes which covers the entire GATE syllabus.
- [Contact Us](https://www.gatevidyalay.com/contact-us/) - Gate Vidyalay is an online portal established for the students preparing for their B.Tech semester exams and exams like GATE, Net and PSU. Contact Gate Vidyalay.
- [Cloud Computing Notes](https://www.gatevidyalay.com/cloud-computing-notes/)
- [GATE Exam | Notifications](https://www.gatevidyalay.com/gate-exam-notifications/) - The Graduate Aptitude Test in Engineering popularly called as GATE is an All-India examination. It is administered by the GATE Committee consisting of Faculty members from IISc, Bangalore and other seven IIT’s.
- [Computer Organization & Architecture Notes](https://www.gatevidyalay.com/computer-organization-architecture/) - Get the notes of all important topics of Computer Organization & Architecture subject. These notes will be helpful in preparing for semester exams and competitive exams like GATE, NET and PSU's.
- [Design & Analysis of Algorithms Notes](https://www.gatevidyalay.com/algorithms/) - Get the notes of all important topics of Design and Analysis of Algorithms subject. These notes will be helpful in preparing for semester exams and competitive exams like GATE, NET and PSU's.
- [Data Structures Notes](https://www.gatevidyalay.com/data-structures/) - Get the notes of all important topics of Data Structures subject. These notes will be helpful in preparing for semester exams and competitive exams like GATE, NET and PSU's.
- [Digital Design Notes](https://www.gatevidyalay.com/digital-electronics/) - Get the notes of all important topics of Digital Design subject. These notes will be helpful in preparing for semester exams and competitive exams like GATE, NET and PSU's.
- [Graph Theory Notes](https://www.gatevidyalay.com/graph-theory/) - Get the notes of all important topics of Graph Theory subject. These notes will be helpful in preparing for semester exams and competitive exams like GATE, NET and PSU's.
- [Number System Notes](https://www.gatevidyalay.com/number-system/) - Get the notes of all important topics of Number System subject. These notes will be helpful in preparing for semester exams and competitive exams like GATE, NET and PSU's.
- [Propositional Logic Notes](https://www.gatevidyalay.com/propositional-logic/) - Get the notes of all important topics of Propositional Logic subject. These notes will be helpful in preparing for semester exams and competitive exams like GATE, NET and PSU's.
- [Database Management System Notes](https://www.gatevidyalay.com/database-management-system/) - Get the notes of all important topics of Database Management System subject. These notes will be helpful in preparing for semester exams and competitive exams like GATE, NET and PSU's.
- [Software Engineering Notes](https://www.gatevidyalay.com/software-engineering-notes/) - Get the notes of all important topics of Software Engineering subject. These notes will be helpful in preparing for B.Tech CSE semester exams.
- [Machine Learning Notes](https://www.gatevidyalay.com/machine-learning/) - Get the notes of all important topics of Machine Learning subject. These notes will be helpful in preparing for B.Tech CSE semester exams.
- [Pattern Recognition Notes](https://www.gatevidyalay.com/pattern-recognition-notes/) - Get the notes of all important topics of Pattern Recognition subject. These notes will be helpful in preparing for B.Tech CSE semester exams.
- [Artificial Intelligence Notes](https://www.gatevidyalay.com/artificial-intelligence-notes/) - Get the notes of all important topics of Artificial Intelligence subject. These notes will be helpful in preparing for B.Tech CSE semester exams.
- [Computer Graphics Notes](https://www.gatevidyalay.com/computer-graphics/) - Get the notes of all important topics of Computer Graphics subject. These notes will be helpful in preparing for B.Tech CSE semester exams.
- [Theory of Automata & Computation Notes](https://www.gatevidyalay.com/theory-of-automata-computation/) - Get the notes of all important topics of Theory of Automata and Computation subject. These notes will be helpful in preparing for semester exams and competitive exams like GATE, NET and PSU's.
- [Operating System Notes](https://www.gatevidyalay.com/operating-system/) - Get the notes of all important topics of Operating System subject. These notes will be helpful in preparing for semester exams and competitive exams like GATE, NET and PSU's.
- [Computer Networks Notes](https://www.gatevidyalay.com/computer-networks/) - Get the notes of all important topics of Computer Networks subject. These notes will be helpful in preparing for semester exams and competitive exams like GATE, NET and PSU's.
- [Compiler Design Notes](https://www.gatevidyalay.com/compiler-design/) - Get the notes of all important topics of Compiler Design subject. These notes will be helpful in preparing for semester exams and competitive exams like GATE, NET and PSU's.
- [Job Opportunities](https://www.gatevidyalay.com/job-opportunities/) - Job Opportunities at Gate Vidyalay- We are looking for Teachers / Professors / Lecturers for creating video and / or textual courses in partnership with Gate Vidyalay.
- [Apply for Job | Job Opportunities](https://www.gatevidyalay.com/apply-for-job-job-opportunities/) - Job Opportunities at Gate Vidyalay- We give a warm welcome to all the content creators who can create exceptionally good self-learning material.
- [GATE CSE Books | GATE Books for CSE](https://www.gatevidyalay.com/gate-books/) - GATE CSE Books- The best standard text books for GATE preparation are listed. These GATE Books for Computer Science & Engineering (CSE) are helpful in GATE CSE Exam preparation.
- [Core Java](https://www.gatevidyalay.com/core-java/) - Get the notes of all important topics of Core Java subject. These notes will be helpful in preparing for semester exams and competitive exams like GATE, NET and PSU's.
- [Contribute an Article](https://www.gatevidyalay.com/contribute-an-article/) - Gate Vidyalay is an online portal established for the students preparing for their B.Tech semester exams and exams like GATE, Net and PSU. Contribute an article to help other students.

## Categories

- [Uncategorized](https://www.gatevidyalay.com/category/uncategorized/)
- [Compiler Design](https://www.gatevidyalay.com/category/subjects/compiler-design/)
- [Design & Analysis of Algorithms](https://www.gatevidyalay.com/category/subjects/design-analysis-of-algorithms/)
- [Data Structures](https://www.gatevidyalay.com/category/subjects/data-structures/)
- [Data Structures Tests](https://www.gatevidyalay.com/category/tests/data-structures-tests/)
- [Database Management System](https://www.gatevidyalay.com/category/subjects/database-management-system/)
- [Core Java](https://www.gatevidyalay.com/category/programming-languages/core-java/)
- [Graph Theory](https://www.gatevidyalay.com/category/subjects/graph-theory/)
- [Digital Design](https://www.gatevidyalay.com/category/subjects/digital-design/)
- [Subjects](https://www.gatevidyalay.com/category/subjects/)
- [Programming Languages](https://www.gatevidyalay.com/category/programming-languages/)
- [Tests](https://www.gatevidyalay.com/category/tests/)
- [Computer Organization and Architecture](https://www.gatevidyalay.com/category/subjects/computer-organization-and-architecture/)
- [Theory of Automata & Computation](https://www.gatevidyalay.com/category/subjects/theory-of-automata-computation/)
- [Number System](https://www.gatevidyalay.com/category/subjects/number-system/)
- [GATE](https://www.gatevidyalay.com/category/gate/)
- [Computer Networks](https://www.gatevidyalay.com/category/subjects/computer-networks/)
- [Operating System](https://www.gatevidyalay.com/category/subjects/operating-system/)
- [Mathematics](https://www.gatevidyalay.com/category/mathematics/)
- [Propositional Logic](https://www.gatevidyalay.com/category/mathematics/propositional-logic/)
- [GATE CSE Books](https://www.gatevidyalay.com/category/gate-cse-books/)
- [Computer Network Books](https://www.gatevidyalay.com/category/gate-cse-books/computer-network-books/)
- [Algorithms Books](https://www.gatevidyalay.com/category/gate-cse-books/algorithms-books/)
- [Operating Systems Books](https://www.gatevidyalay.com/category/gate-cse-books/operating-systems-books/)
- [Computer Graphics](https://www.gatevidyalay.com/category/subjects/computer-graphics/)
- [Computer Organization & Architecture Books](https://www.gatevidyalay.com/category/gate-cse-books/computer-organization-architecture-books/)
- [Database Management System Books](https://www.gatevidyalay.com/category/gate-cse-books/database-management-system-books/)
- [Compiler Design Books](https://www.gatevidyalay.com/category/gate-cse-books/compiler-design-books/)
- [Theory of Automata & Computation Books](https://www.gatevidyalay.com/category/gate-cse-books/theory-of-automata-computation-books/)
- [Digital Design Books](https://www.gatevidyalay.com/category/gate-cse-books/digital-design-books/)
- [C Programming Books](https://www.gatevidyalay.com/category/gate-cse-books/c-programming-books/)
- [Job Opportunity](https://www.gatevidyalay.com/category/job-opportunity/)
- [Machine Learning](https://www.gatevidyalay.com/category/subjects/machine-learning/)
- [Artificial Intelligence](https://www.gatevidyalay.com/category/subjects/artificial-intelligence/)
- [Pattern Recognition](https://www.gatevidyalay.com/category/subjects/pattern-recognition/)
- [Software Engineering](https://www.gatevidyalay.com/category/subjects/software-engineering/)
- [Posts](https://www.gatevidyalay.com/category/posts/)
- [Mathematics](https://www.gatevidyalay.com/category/subjects/mathematics-subjects/)
- [Cloud Computing](https://www.gatevidyalay.com/category/subjects/cloud-computing/)

## Tags

- [basic blocks](https://www.gatevidyalay.com/tag/basic-blocks/)
- [flow graphs](https://www.gatevidyalay.com/tag/flow-graphs/)
- [compiler design](https://www.gatevidyalay.com/tag/compiler-design/)
- [dag](https://www.gatevidyalay.com/tag/dag/)
- [three address code](https://www.gatevidyalay.com/tag/three-address-code/)
- [code optimization techniques](https://www.gatevidyalay.com/tag/code-optimization-techniques/)
- [implementation of three address code](https://www.gatevidyalay.com/tag/implementation-of-three-address-code/)
- [quadruples](https://www.gatevidyalay.com/tag/quadruples/)
- [triples](https://www.gatevidyalay.com/tag/triples/)
- [indirect triples](https://www.gatevidyalay.com/tag/indirect-triples/)
- [operator precedence parsing](https://www.gatevidyalay.com/tag/operator-precedence-parsing/)
- [shift reduce parsing](https://www.gatevidyalay.com/tag/shift-reduce-parsing/)
- [huffman coding](https://www.gatevidyalay.com/tag/huffman-coding/)
- [huffman encoding](https://www.gatevidyalay.com/tag/huffman-encoding/)
- [algorithms](https://www.gatevidyalay.com/tag/algorithms/)
- [tree data structure](https://www.gatevidyalay.com/tag/tree-data-structure/)
- [binary trees](https://www.gatevidyalay.com/tag/binary-trees/)
- [data structures](https://www.gatevidyalay.com/tag/data-structures/)
- [tree traversal techniques](https://www.gatevidyalay.com/tag/tree-traversal-techniques/)
- [prims algorithm](https://www.gatevidyalay.com/tag/prims-algorithm/)
- [kruskal algorithm](https://www.gatevidyalay.com/tag/kruskal-algorithm/)
- [kruskals algorithm](https://www.gatevidyalay.com/tag/kruskals-algorithm/)
- [knapsack problem](https://www.gatevidyalay.com/tag/knapsack-problem/)
- [fractional knapsack problem](https://www.gatevidyalay.com/tag/fractional-knapsack-problem/)
- [0-1 knapsack problem](https://www.gatevidyalay.com/tag/0-1-knapsack-problem/)
- [how to solve 0-1 knapsack problem](https://www.gatevidyalay.com/tag/how-to-solve-0-1-knapsack-problem/)
- [floyd warshall algorithm](https://www.gatevidyalay.com/tag/floyd-warshall-algorithm/)
- [topological sort](https://www.gatevidyalay.com/tag/topological-sort/)
- [Dijkstra Algorithm](https://www.gatevidyalay.com/tag/dijkstra-algorithm/)
- [binary search tree data structure](https://www.gatevidyalay.com/tag/binary-search-tree-data-structure/)
- [binary search tree](https://www.gatevidyalay.com/tag/binary-search-tree/)
- [bst](https://www.gatevidyalay.com/tag/bst/)
- [binary search tree operations](https://www.gatevidyalay.com/tag/binary-search-tree-operations/)
- [data structure tests](https://www.gatevidyalay.com/tag/data-structure-tests/)
- [binary trees tests](https://www.gatevidyalay.com/tag/binary-trees-tests/)
- [preorder traversal](https://www.gatevidyalay.com/tag/preorder-traversal/)
- [inorder traversal](https://www.gatevidyalay.com/tag/inorder-traversal/)
- [postorder traversal](https://www.gatevidyalay.com/tag/postorder-traversal/)
- [level order traversal](https://www.gatevidyalay.com/tag/level-order-traversal/)
- [depth first traversal](https://www.gatevidyalay.com/tag/depth-first-traversal/)
- [breadth first traversal](https://www.gatevidyalay.com/tag/breadth-first-traversal/)
- [test on tree traversal techniques](https://www.gatevidyalay.com/tag/test-on-tree-traversal-techniques/)
- [binary tree formulas](https://www.gatevidyalay.com/tag/binary-tree-formulas/)
- [practice questions](https://www.gatevidyalay.com/tag/practice-questions/)
- [gate](https://www.gatevidyalay.com/tag/gate/)
- [gate questions previous years](https://www.gatevidyalay.com/tag/gate-questions-previous-years/)
- [properties of binary trees questions](https://www.gatevidyalay.com/tag/properties-of-binary-trees-questions/)
- [binary search tree questions](https://www.gatevidyalay.com/tag/binary-search-tree-questions/)
- [practice problems gate](https://www.gatevidyalay.com/tag/practice-problems-gate/)
- [gate questions](https://www.gatevidyalay.com/tag/gate-questions/)
- [bst questions](https://www.gatevidyalay.com/tag/bst-questions/)
- [questions of binary search trees](https://www.gatevidyalay.com/tag/questions-of-binary-search-trees/)
- [test on binary search tree](https://www.gatevidyalay.com/tag/test-on-binary-search-tree/)
- [travelling salesman problem](https://www.gatevidyalay.com/tag/travelling-salesman-problem/)
- [normal forms in dbms](https://www.gatevidyalay.com/tag/normal-forms-in-dbms/)
- [first normal form](https://www.gatevidyalay.com/tag/first-normal-form/)
- [second normal form](https://www.gatevidyalay.com/tag/second-normal-form/)
- [third normal form](https://www.gatevidyalay.com/tag/third-normal-form/)
- [boyce codd normal form](https://www.gatevidyalay.com/tag/boyce-codd-normal-form/)
- [1NF](https://www.gatevidyalay.com/tag/1nf/)
- [2NF](https://www.gatevidyalay.com/tag/2nf/)
- [3NF](https://www.gatevidyalay.com/tag/3nf/)
- [BCNF](https://www.gatevidyalay.com/tag/bcnf/)
- [Equivalence of two sets of Functional Dependencies](https://www.gatevidyalay.com/tag/equivalence-of-two-sets-of-functional-dependencies/)
- [functional dependencies](https://www.gatevidyalay.com/tag/functional-dependencies/)
- [equivalence of functional dependencies](https://www.gatevidyalay.com/tag/equivalence-of-functional-dependencies/)
- [database management system](https://www.gatevidyalay.com/tag/database-management-system/)
- [how to check whether two sets of fds are equivalent](https://www.gatevidyalay.com/tag/how-to-check-whether-two-sets-of-fds-are-equivalent/)
- [code optimization](https://www.gatevidyalay.com/tag/code-optimization/)
- [lossless decomposition](https://www.gatevidyalay.com/tag/lossless-decomposition/)
- [lossy decomposition](https://www.gatevidyalay.com/tag/lossy-decomposition/)
- [dbms](https://www.gatevidyalay.com/tag/dbms/)
- [keys in dbms](https://www.gatevidyalay.com/tag/keys-in-dbms/)
- [dbms notes](https://www.gatevidyalay.com/tag/dbms-notes/)
- [constraints in dbms](https://www.gatevidyalay.com/tag/constraints-in-dbms/)
- [canonical cover](https://www.gatevidyalay.com/tag/canonical-cover/)
- [how to find canonical cover in dbms](https://www.gatevidyalay.com/tag/how-to-find-canonical-cover-in-dbms/)
- [concurrency problems in dbms](https://www.gatevidyalay.com/tag/concurrency-problems-in-dbms/)
- [concurrency problems](https://www.gatevidyalay.com/tag/concurrency-problems/)
- [dirty read problem](https://www.gatevidyalay.com/tag/dirty-read-problem/)
- [lost update problem](https://www.gatevidyalay.com/tag/lost-update-problem/)
- [unrepeatable read problem](https://www.gatevidyalay.com/tag/unrepeatable-read-problem/)
- [phantom read problem](https://www.gatevidyalay.com/tag/phantom-read-problem/)
- [garbage collector in java](https://www.gatevidyalay.com/tag/garbage-collector-in-java/)
- [garbage collection in java](https://www.gatevidyalay.com/tag/garbage-collection-in-java/)
- [eligibility for an object for garbage collection](https://www.gatevidyalay.com/tag/eligibility-for-an-object-for-garbage-collection/)
- [when object becomes eligible for garbage collection](https://www.gatevidyalay.com/tag/when-object-becomes-eligible-for-garbage-collection/)
- [island of isolation](https://www.gatevidyalay.com/tag/island-of-isolation/)
- [types of methods in Java](https://www.gatevidyalay.com/tag/types-of-methods-in-java/)
- [main method in java](https://www.gatevidyalay.com/tag/main-method-in-java/)
- [rules for main method in java](https://www.gatevidyalay.com/tag/rules-for-main-method-in-java/)
- [methods in java](https://www.gatevidyalay.com/tag/methods-in-java/)
- [transaction states in dbms](https://www.gatevidyalay.com/tag/transaction-states-in-dbms/)
- [types of variables in Java](https://www.gatevidyalay.com/tag/types-of-variables-in-java/)
- [instance blocks in java](https://www.gatevidyalay.com/tag/instance-blocks-in-java/)
- [constructors in java](https://www.gatevidyalay.com/tag/constructors-in-java/)
- [types of constructors in java](https://www.gatevidyalay.com/tag/types-of-constructors-in-java/)
- [schedules in dbms](https://www.gatevidyalay.com/tag/schedules-in-dbms/)
- [serial schedules](https://www.gatevidyalay.com/tag/serial-schedules/)
- [variables in java](https://www.gatevidyalay.com/tag/variables-in-java/)
- [local variables in java](https://www.gatevidyalay.com/tag/local-variables-in-java/)
- [static variables in java](https://www.gatevidyalay.com/tag/static-variables-in-java/)
- [ER diagrams](https://www.gatevidyalay.com/tag/er-diagrams/)
- [er diagrams in dbms](https://www.gatevidyalay.com/tag/er-diagrams-in-dbms/)
- [er diagram symbols](https://www.gatevidyalay.com/tag/er-diagram-symbols/)
- [er diagram basics](https://www.gatevidyalay.com/tag/er-diagram-basics/)
- [entity relationship diagram](https://www.gatevidyalay.com/tag/entity-relationship-diagram/)
- [er diagrams tutorial](https://www.gatevidyalay.com/tag/er-diagrams-tutorial/)
- [constructors in java with examples](https://www.gatevidyalay.com/tag/constructors-in-java-with-examples/)
- [constructors in java example](https://www.gatevidyalay.com/tag/constructors-in-java-example/)
- [constructor definition](https://www.gatevidyalay.com/tag/constructor-definition/)
- [constructors in java programming](https://www.gatevidyalay.com/tag/constructors-in-java-programming/)
- [constructor program in java with output](https://www.gatevidyalay.com/tag/constructor-program-in-java-with-output/)
- [instance blocks in java with examples](https://www.gatevidyalay.com/tag/instance-blocks-in-java-with-examples/)
- [instance blocks in java example](https://www.gatevidyalay.com/tag/instance-blocks-in-java-example/)
- [instance block definition](https://www.gatevidyalay.com/tag/instance-block-definition/)
- [instance blocks in java programming](https://www.gatevidyalay.com/tag/instance-blocks-in-java-programming/)
- [instance block program in java with output](https://www.gatevidyalay.com/tag/instance-block-program-in-java-with-output/)
- [scope of variables](https://www.gatevidyalay.com/tag/scope-of-variables/)
- [variables in java with examples](https://www.gatevidyalay.com/tag/variables-in-java-with-examples/)
- [class variables in java](https://www.gatevidyalay.com/tag/class-variables-in-java/)
- [global variables in java](https://www.gatevidyalay.com/tag/global-variables-in-java/)
- [scope of variables in java](https://www.gatevidyalay.com/tag/scope-of-variables-in-java/)
- [transaction management in dbms](https://www.gatevidyalay.com/tag/transaction-management-in-dbms/)
- [concurrency control in dbms](https://www.gatevidyalay.com/tag/concurrency-control-in-dbms/)
- [entity sets in dbms](https://www.gatevidyalay.com/tag/entity-sets-in-dbms/)
- [database entities](https://www.gatevidyalay.com/tag/database-entities/)
- [weak entity example](https://www.gatevidyalay.com/tag/weak-entity-example/)
- [weak entity in dbms](https://www.gatevidyalay.com/tag/weak-entity-in-dbms/)
- [strong entity](https://www.gatevidyalay.com/tag/strong-entity/)
- [entity example in database](https://www.gatevidyalay.com/tag/entity-example-in-database/)
- [entity instance](https://www.gatevidyalay.com/tag/entity-instance/)
- [finalize method in java](https://www.gatevidyalay.com/tag/finalize-method-in-java/)
- [what is finalize method in java](https://www.gatevidyalay.com/tag/what-is-finalize-method-in-java/)
- [finalize method in java with example](https://www.gatevidyalay.com/tag/finalize-method-in-java-with-example/)
- [use of finalize method in java](https://www.gatevidyalay.com/tag/use-of-finalize-method-in-java/)
- [what is main method in java](https://www.gatevidyalay.com/tag/what-is-main-method-in-java/)
- [java main method example](https://www.gatevidyalay.com/tag/java-main-method-example/)
- [what changes can be made in main method of java](https://www.gatevidyalay.com/tag/what-changes-can-be-made-in-main-method-of-java/)
- [variants of main method in java](https://www.gatevidyalay.com/tag/variants-of-main-method-in-java/)
- [java main method](https://www.gatevidyalay.com/tag/java-main-method/)
- [the main method in java](https://www.gatevidyalay.com/tag/the-main-method-in-java/)
- [graph isomorphism](https://www.gatevidyalay.com/tag/graph-isomorphism/)
- [graph isomorphism algorithm](https://www.gatevidyalay.com/tag/graph-isomorphism-algorithm/)
- [methods java](https://www.gatevidyalay.com/tag/methods-java/)
- [methods in java example](https://www.gatevidyalay.com/tag/methods-in-java-example/)
- [methods in java programming](https://www.gatevidyalay.com/tag/methods-in-java-programming/)
- [methods in java tutorial](https://www.gatevidyalay.com/tag/methods-in-java-tutorial/)
- [relationship sets](https://www.gatevidyalay.com/tag/relationship-sets/)
- [relationship set in dbms](https://www.gatevidyalay.com/tag/relationship-set-in-dbms/)
- [unary relationship in dbms](https://www.gatevidyalay.com/tag/unary-relationship-in-dbms/)
- [relationship set in database](https://www.gatevidyalay.com/tag/relationship-set-in-database/)
- [relationship set in dbms with example](https://www.gatevidyalay.com/tag/relationship-set-in-dbms-with-example/)
- [relationship set](https://www.gatevidyalay.com/tag/relationship-set/)
- [participation constraints](https://www.gatevidyalay.com/tag/participation-constraints/)
- [participation constraints in dbms](https://www.gatevidyalay.com/tag/participation-constraints-in-dbms/)
- [total participation in dbms](https://www.gatevidyalay.com/tag/total-participation-in-dbms/)
- [partial participation](https://www.gatevidyalay.com/tag/partial-participation/)
- [partial participation in dbms](https://www.gatevidyalay.com/tag/partial-participation-in-dbms/)
- [total participation](https://www.gatevidyalay.com/tag/total-participation/)
- [participation constraints in er diagram](https://www.gatevidyalay.com/tag/participation-constraints-in-er-diagram/)
- [participation constraints in er model](https://www.gatevidyalay.com/tag/participation-constraints-in-er-model/)
- [total and partial participation in dbms](https://www.gatevidyalay.com/tag/total-and-partial-participation-in-dbms/)
- [total participation in dbms with example](https://www.gatevidyalay.com/tag/total-participation-in-dbms-with-example/)
- [How to make object eligible for Garbage Collection in java](https://www.gatevidyalay.com/tag/how-to-make-object-eligible-for-garbage-collection-in-java/)
- [garbage collection in java example](https://www.gatevidyalay.com/tag/garbage-collection-in-java-example/)
- [garbage collection in java interview questions](https://www.gatevidyalay.com/tag/garbage-collection-in-java-interview-questions/)
- [garbage collection in java with example](https://www.gatevidyalay.com/tag/garbage-collection-in-java-with-example/)
- [garbage collection algorithms in java](https://www.gatevidyalay.com/tag/garbage-collection-algorithms-in-java/)
- [system.gc in java](https://www.gatevidyalay.com/tag/system-gc-in-java/)
- [g1 garbage collector](https://www.gatevidyalay.com/tag/g1-garbage-collector/)
- [latch flip flop](https://www.gatevidyalay.com/tag/latch-flip-flop/)
- [latch in digital electronics](https://www.gatevidyalay.com/tag/latch-in-digital-electronics/)
- [SR flip flop](https://www.gatevidyalay.com/tag/sr-flip-flop/)
- [JK flip flop](https://www.gatevidyalay.com/tag/jk-flip-flop/)
- [sr flip flop truth table](https://www.gatevidyalay.com/tag/sr-flip-flop-truth-table/)
- [sr flip flop excitation table](https://www.gatevidyalay.com/tag/sr-flip-flop-excitation-table/)
- [sr flip flop using nand gate](https://www.gatevidyalay.com/tag/sr-flip-flop-using-nand-gate/)
- [sr flip flop table](https://www.gatevidyalay.com/tag/sr-flip-flop-table/)
- [sr flip flop circuit](https://www.gatevidyalay.com/tag/sr-flip-flop-circuit/)
- [sr flip flop characteristic equation](https://www.gatevidyalay.com/tag/sr-flip-flop-characteristic-equation/)
- [sr flip flop definition](https://www.gatevidyalay.com/tag/sr-flip-flop-definition/)
- [sr flip flop equation](https://www.gatevidyalay.com/tag/sr-flip-flop-equation/)
- [jk flip flop truth table](https://www.gatevidyalay.com/tag/jk-flip-flop-truth-table/)
- [jk flip flop excitation table](https://www.gatevidyalay.com/tag/jk-flip-flop-excitation-table/)
- [jk flip flop timing diagram](https://www.gatevidyalay.com/tag/jk-flip-flop-timing-diagram/)
- [jk flip flop equation](https://www.gatevidyalay.com/tag/jk-flip-flop-equation/)
- [jk flip flop characteristic equation](https://www.gatevidyalay.com/tag/jk-flip-flop-characteristic-equation/)
- [difference between sr flip flop and jk flip flop](https://www.gatevidyalay.com/tag/difference-between-sr-flip-flop-and-jk-flip-flop/)
- [job sequencing with deadlines](https://www.gatevidyalay.com/tag/job-sequencing-with-deadlines/)
- [job sequencing with deadlines greedy algorithm](https://www.gatevidyalay.com/tag/job-sequencing-with-deadlines-greedy-algorithm/)
- [types of constraints in dbms](https://www.gatevidyalay.com/tag/types-of-constraints-in-dbms/)
- [integrity constraint in dbms](https://www.gatevidyalay.com/tag/integrity-constraint-in-dbms/)
- [types of integrity constraints in dbms](https://www.gatevidyalay.com/tag/types-of-integrity-constraints-in-dbms/)
- [domain constraints](https://www.gatevidyalay.com/tag/domain-constraints/)
- [domain constraints in dbms](https://www.gatevidyalay.com/tag/domain-constraints-in-dbms/)
- [domain integrity constraints](https://www.gatevidyalay.com/tag/domain-integrity-constraints/)
- [integrity constraints in dbms notes](https://www.gatevidyalay.com/tag/integrity-constraints-in-dbms-notes/)
- [mapping constraints in dbms](https://www.gatevidyalay.com/tag/mapping-constraints-in-dbms/)
- [key constraints in dbms with examples](https://www.gatevidyalay.com/tag/key-constraints-in-dbms-with-examples/)
- [referential integrity constraint violation](https://www.gatevidyalay.com/tag/referential-integrity-constraint-violation/)
- [referential integrity constraint](https://www.gatevidyalay.com/tag/referential-integrity-constraint/)
- [on delete cascade](https://www.gatevidyalay.com/tag/on-delete-cascade/)
- [on update cascade](https://www.gatevidyalay.com/tag/on-update-cascade/)
- [ER diagrams to tables](https://www.gatevidyalay.com/tag/er-diagrams-to-tables/)
- [converting er diagram to tables](https://www.gatevidyalay.com/tag/converting-er-diagram-to-tables/)
- [convert er diagram to relational schema](https://www.gatevidyalay.com/tag/convert-er-diagram-to-relational-schema/)
- [reduction of er diagrams into tables](https://www.gatevidyalay.com/tag/reduction-of-er-diagrams-into-tables/)
- [er diagram to database tables](https://www.gatevidyalay.com/tag/er-diagram-to-database-tables/)
- [er diagram to table conversion ppt](https://www.gatevidyalay.com/tag/er-diagram-to-table-conversion-ppt/)
- [er diagram examples with tables](https://www.gatevidyalay.com/tag/er-diagram-examples-with-tables/)
- [reduction of er diagram to tables](https://www.gatevidyalay.com/tag/reduction-of-er-diagram-to-tables/)
- [rules to convert er diagram into tables](https://www.gatevidyalay.com/tag/rules-to-convert-er-diagram-into-tables/)
- [steps to convert er diagram into tables](https://www.gatevidyalay.com/tag/steps-to-convert-er-diagram-into-tables/)
- [mapping er diagram to tables](https://www.gatevidyalay.com/tag/mapping-er-diagram-to-tables/)
- [translating er diagram to tables](https://www.gatevidyalay.com/tag/translating-er-diagram-to-tables/)
- [er diagram tables examples](https://www.gatevidyalay.com/tag/er-diagram-tables-examples/)
- [er diagram and tables example](https://www.gatevidyalay.com/tag/er-diagram-and-tables-example/)
- [er diagram and table](https://www.gatevidyalay.com/tag/er-diagram-and-table/)
- [er diagram to tables conversion](https://www.gatevidyalay.com/tag/er-diagram-to-tables-conversion/)
- [er diagram to table conversion rules](https://www.gatevidyalay.com/tag/er-diagram-to-table-conversion-rules/)
- [convert the following er diagram to relational tables](https://www.gatevidyalay.com/tag/convert-the-following-er-diagram-to-relational-tables/)
- [ER diagram to tables](https://www.gatevidyalay.com/tag/er-diagram-to-tables/)
- [serializability in dbms](https://www.gatevidyalay.com/tag/serializability-in-dbms/)
- [conflict serializability](https://www.gatevidyalay.com/tag/conflict-serializability/)
- [conflict serializability in dbms](https://www.gatevidyalay.com/tag/conflict-serializability-in-dbms/)
- [view serializability in dbms](https://www.gatevidyalay.com/tag/view-serializability-in-dbms/)
- [what is serializability in dbms](https://www.gatevidyalay.com/tag/what-is-serializability-in-dbms/)
- [serializability of schedules in dbms](https://www.gatevidyalay.com/tag/serializability-of-schedules-in-dbms/)
- [conflict and view serializability in dbms](https://www.gatevidyalay.com/tag/conflict-and-view-serializability-in-dbms/)
- [serializability and recoverability in dbms](https://www.gatevidyalay.com/tag/serializability-and-recoverability-in-dbms/)
- [canonical cover in dbms](https://www.gatevidyalay.com/tag/canonical-cover-in-dbms/)
- [canonical cover in dbms with examples](https://www.gatevidyalay.com/tag/canonical-cover-in-dbms-with-examples/)
- [canonical cover in dbms with example](https://www.gatevidyalay.com/tag/canonical-cover-in-dbms-with-example/)
- [steps to find canonical cover](https://www.gatevidyalay.com/tag/steps-to-find-canonical-cover/)
- [steps to find canonical cover in dbms](https://www.gatevidyalay.com/tag/steps-to-find-canonical-cover-in-dbms/)
- [how to find canonical cover](https://www.gatevidyalay.com/tag/how-to-find-canonical-cover/)
- [irreducible set of functional dependencies](https://www.gatevidyalay.com/tag/irreducible-set-of-functional-dependencies/)
- [canonical cover of functional dependencies](https://www.gatevidyalay.com/tag/canonical-cover-of-functional-dependencies/)
- [irreducible set of functional dependencies in dbms](https://www.gatevidyalay.com/tag/irreducible-set-of-functional-dependencies-in-dbms/)
- [how to compute canonical cover in dbms](https://www.gatevidyalay.com/tag/how-to-compute-canonical-cover-in-dbms/)
- [canonical cover in dbms tutorial](https://www.gatevidyalay.com/tag/canonical-cover-in-dbms-tutorial/)
- [view serializability](https://www.gatevidyalay.com/tag/view-serializability/)
- [keys in dbms with example](https://www.gatevidyalay.com/tag/keys-in-dbms-with-example/)
- [keys of dbms](https://www.gatevidyalay.com/tag/keys-of-dbms/)
- [foreign key in dbms](https://www.gatevidyalay.com/tag/foreign-key-in-dbms/)
- [types of keys in dbms](https://www.gatevidyalay.com/tag/types-of-keys-in-dbms/)
- [types of keys in dbms with example](https://www.gatevidyalay.com/tag/types-of-keys-in-dbms-with-example/)
- [keys concept in dbms](https://www.gatevidyalay.com/tag/keys-concept-in-dbms/)
- [define keys in dbms](https://www.gatevidyalay.com/tag/define-keys-in-dbms/)
- [all keys in dbms with example](https://www.gatevidyalay.com/tag/all-keys-in-dbms-with-example/)
- [candidate key in dbms](https://www.gatevidyalay.com/tag/candidate-key-in-dbms/)
- [alternate key](https://www.gatevidyalay.com/tag/alternate-key/)
- [composite key](https://www.gatevidyalay.com/tag/composite-key/)
- [unique key](https://www.gatevidyalay.com/tag/unique-key/)
- [surrogate key](https://www.gatevidyalay.com/tag/surrogate-key/)
- [secondary key](https://www.gatevidyalay.com/tag/secondary-key/)
- [composite key in dbms](https://www.gatevidyalay.com/tag/composite-key-in-dbms/)
- [unique key in dbms](https://www.gatevidyalay.com/tag/unique-key-in-dbms/)
- [recoverable schedule](https://www.gatevidyalay.com/tag/recoverable-schedule/)
- [recoverable schedule in dbms](https://www.gatevidyalay.com/tag/recoverable-schedule-in-dbms/)
- [complement of a graph](https://www.gatevidyalay.com/tag/complement-of-a-graph/)
- [walk in graph theory](https://www.gatevidyalay.com/tag/walk-in-graph-theory/)
- [walk in graph theory examples](https://www.gatevidyalay.com/tag/walk-in-graph-theory-examples/)
- [path in graph theory](https://www.gatevidyalay.com/tag/path-in-graph-theory/)
- [path in graph theory example](https://www.gatevidyalay.com/tag/path-in-graph-theory-example/)
- [trail in graph theory](https://www.gatevidyalay.com/tag/trail-in-graph-theory/)
- [circuit in graph theory](https://www.gatevidyalay.com/tag/circuit-in-graph-theory/)
- [walk path and circuit in graph theory](https://www.gatevidyalay.com/tag/walk-path-and-circuit-in-graph-theory/)
- [types of attributes](https://www.gatevidyalay.com/tag/types-of-attributes/)
- [attributes dbms](https://www.gatevidyalay.com/tag/attributes-dbms/)
- [attributes in dbms](https://www.gatevidyalay.com/tag/attributes-in-dbms/)
- [types of attributes in dbms](https://www.gatevidyalay.com/tag/types-of-attributes-in-dbms/)
- [types of attributes in database](https://www.gatevidyalay.com/tag/types-of-attributes-in-database/)
- [composite attributes in dbms](https://www.gatevidyalay.com/tag/composite-attributes-in-dbms/)
- [attributes in er diagram](https://www.gatevidyalay.com/tag/attributes-in-er-diagram/)
- [types of attributes in er diagram](https://www.gatevidyalay.com/tag/types-of-attributes-in-er-diagram/)
- [simple attribute](https://www.gatevidyalay.com/tag/simple-attribute/)
- [composite attribute](https://www.gatevidyalay.com/tag/composite-attribute/)
- [single valued attribute](https://www.gatevidyalay.com/tag/single-valued-attribute/)
- [multi valued attribute](https://www.gatevidyalay.com/tag/multi-valued-attribute/)
- [derived attribute](https://www.gatevidyalay.com/tag/derived-attribute/)
- [derived attribute example](https://www.gatevidyalay.com/tag/derived-attribute-example/)
- [key attribute](https://www.gatevidyalay.com/tag/key-attribute/)
- [half adder](https://www.gatevidyalay.com/tag/half-adder/)
- [half adder circuit](https://www.gatevidyalay.com/tag/half-adder-circuit/)
- [half adder truth table](https://www.gatevidyalay.com/tag/half-adder-truth-table/)
- [half adder using nor gates](https://www.gatevidyalay.com/tag/half-adder-using-nor-gates/)
- [half adder definition](https://www.gatevidyalay.com/tag/half-adder-definition/)
- [half adder diagram](https://www.gatevidyalay.com/tag/half-adder-diagram/)
- [half adder equation](https://www.gatevidyalay.com/tag/half-adder-equation/)
- [half adder theory](https://www.gatevidyalay.com/tag/half-adder-theory/)
- [half adder boolean expression](https://www.gatevidyalay.com/tag/half-adder-boolean-expression/)
- [half adder logic diagram](https://www.gatevidyalay.com/tag/half-adder-logic-diagram/)
- [half adder block diagram](https://www.gatevidyalay.com/tag/half-adder-block-diagram/)
- [full adder](https://www.gatevidyalay.com/tag/full-adder/)
- [full adder circuit](https://www.gatevidyalay.com/tag/full-adder-circuit/)
- [full adder truth table](https://www.gatevidyalay.com/tag/full-adder-truth-table/)
- [full adder equation](https://www.gatevidyalay.com/tag/full-adder-equation/)
- [1 bit full adder](https://www.gatevidyalay.com/tag/1-bit-full-adder/)
- [full adder boolean expression](https://www.gatevidyalay.com/tag/full-adder-boolean-expression/)
- [full adder diagram](https://www.gatevidyalay.com/tag/full-adder-diagram/)
- [full adder definition](https://www.gatevidyalay.com/tag/full-adder-definition/)
- [full adder k map](https://www.gatevidyalay.com/tag/full-adder-k-map/)
- [full adder logic diagram](https://www.gatevidyalay.com/tag/full-adder-logic-diagram/)
- [full adder k map simplification](https://www.gatevidyalay.com/tag/full-adder-k-map-simplification/)
- [full adder logic expression](https://www.gatevidyalay.com/tag/full-adder-logic-expression/)
- [half subtractor](https://www.gatevidyalay.com/tag/half-subtractor/)
- [half subtractor circuit](https://www.gatevidyalay.com/tag/half-subtractor-circuit/)
- [half subtractor truth table](https://www.gatevidyalay.com/tag/half-subtractor-truth-table/)
- [half subtractor using nor gates](https://www.gatevidyalay.com/tag/half-subtractor-using-nor-gates/)
- [half subtractor logic diagram](https://www.gatevidyalay.com/tag/half-subtractor-logic-diagram/)
- [half subtractor using nand gates](https://www.gatevidyalay.com/tag/half-subtractor-using-nand-gates/)
- [full subtractor](https://www.gatevidyalay.com/tag/full-subtractor/)
- [full subtractor circuit](https://www.gatevidyalay.com/tag/full-subtractor-circuit/)
- [full subtractor truth table](https://www.gatevidyalay.com/tag/full-subtractor-truth-table/)
- [full subtractor equation](https://www.gatevidyalay.com/tag/full-subtractor-equation/)
- [full subtractor diagram](https://www.gatevidyalay.com/tag/full-subtractor-diagram/)
- [full subtractor definition](https://www.gatevidyalay.com/tag/full-subtractor-definition/)
- [full subtractor k map](https://www.gatevidyalay.com/tag/full-subtractor-k-map/)
- [full subtractor logic diagram](https://www.gatevidyalay.com/tag/full-subtractor-logic-diagram/)
- [basic blocks compiler design](https://www.gatevidyalay.com/tag/basic-blocks-compiler-design/)
- [basic blocks and flow graphs](https://www.gatevidyalay.com/tag/basic-blocks-and-flow-graphs/)
- [basic blocks and flow graphs in compiler design examples](https://www.gatevidyalay.com/tag/basic-blocks-and-flow-graphs-in-compiler-design-examples/)
- [directed acyclic graph applications](https://www.gatevidyalay.com/tag/directed-acyclic-graph-applications/)
- [three address code examples](https://www.gatevidyalay.com/tag/three-address-code-examples/)
- [three address code in compiler design](https://www.gatevidyalay.com/tag/three-address-code-in-compiler-design/)
- [three address code compiler](https://www.gatevidyalay.com/tag/three-address-code-compiler/)
- [three address code in compiler design examples](https://www.gatevidyalay.com/tag/three-address-code-in-compiler-design-examples/)
- [code optimization techniques in compiler design](https://www.gatevidyalay.com/tag/code-optimization-techniques-in-compiler-design/)
- [code optimization techniques in compiler design ppt](https://www.gatevidyalay.com/tag/code-optimization-techniques-in-compiler-design-ppt/)
- [code optimization in compiler design lecture notes](https://www.gatevidyalay.com/tag/code-optimization-in-compiler-design-lecture-notes/)
- [ripple carry adder](https://www.gatevidyalay.com/tag/ripple-carry-adder/)
- [4 bit ripple carry adder](https://www.gatevidyalay.com/tag/4-bit-ripple-carry-adder/)
- [ripple carry adder circuit](https://www.gatevidyalay.com/tag/ripple-carry-adder-circuit/)
- [acid properties](https://www.gatevidyalay.com/tag/acid-properties/)
- [acid properties of transaction](https://www.gatevidyalay.com/tag/acid-properties-of-transaction/)
- [acid properties of database](https://www.gatevidyalay.com/tag/acid-properties-of-database/)
- [acid properties database](https://www.gatevidyalay.com/tag/acid-properties-database/)
- [acid properties dbms](https://www.gatevidyalay.com/tag/acid-properties-dbms/)
- [acid properties in dbms](https://www.gatevidyalay.com/tag/acid-properties-in-dbms/)
- [acid properties of dbms](https://www.gatevidyalay.com/tag/acid-properties-of-dbms/)
- [acid properties transaction](https://www.gatevidyalay.com/tag/acid-properties-transaction/)
- [cascading schedule](https://www.gatevidyalay.com/tag/cascading-schedule/)
- [cascadeless schedule](https://www.gatevidyalay.com/tag/cascadeless-schedule/)
- [cascading rollback](https://www.gatevidyalay.com/tag/cascading-rollback/)
- [cascading abort](https://www.gatevidyalay.com/tag/cascading-abort/)
- [strict schedule](https://www.gatevidyalay.com/tag/strict-schedule/)
- [cascading rollback in dbms](https://www.gatevidyalay.com/tag/cascading-rollback-in-dbms/)
- [equivalence of schedules](https://www.gatevidyalay.com/tag/equivalence-of-schedules/)
- [equivalent schedule in dbms](https://www.gatevidyalay.com/tag/equivalent-schedule-in-dbms/)
- [equivalent schedules in dbms](https://www.gatevidyalay.com/tag/equivalent-schedules-in-dbms/)
- [conflict equivalent schedule in dbms](https://www.gatevidyalay.com/tag/conflict-equivalent-schedule-in-dbms/)
- [conflict equivalent schedules in dbms](https://www.gatevidyalay.com/tag/conflict-equivalent-schedules-in-dbms/)
- [example of equivalent schedule in dbms](https://www.gatevidyalay.com/tag/example-of-equivalent-schedule-in-dbms/)
- [result equivalent schedules in dbms](https://www.gatevidyalay.com/tag/result-equivalent-schedules-in-dbms/)
- [result equivalent schedule in dbms](https://www.gatevidyalay.com/tag/result-equivalent-schedule-in-dbms/)
- [view equivalent schedules in dbms](https://www.gatevidyalay.com/tag/view-equivalent-schedules-in-dbms/)
- [view equivalent schedule in dbms](https://www.gatevidyalay.com/tag/view-equivalent-schedule-in-dbms/)
- [result equivalence](https://www.gatevidyalay.com/tag/result-equivalence/)
- [result equivalent schedule](https://www.gatevidyalay.com/tag/result-equivalent-schedule/)
- [result equivalent schedules](https://www.gatevidyalay.com/tag/result-equivalent-schedules/)
- [conflict equivalence](https://www.gatevidyalay.com/tag/conflict-equivalence/)
- [conflict equivalent schedule](https://www.gatevidyalay.com/tag/conflict-equivalent-schedule/)
- [conflict equivalent schedules](https://www.gatevidyalay.com/tag/conflict-equivalent-schedules/)
- [view equivalence](https://www.gatevidyalay.com/tag/view-equivalence/)
- [view equivalent schedule](https://www.gatevidyalay.com/tag/view-equivalent-schedule/)
- [view equivalent schedules](https://www.gatevidyalay.com/tag/view-equivalent-schedules/)
- [delay in ripple carry adder](https://www.gatevidyalay.com/tag/delay-in-ripple-carry-adder/)
- [propagation delay in ripple carry adder](https://www.gatevidyalay.com/tag/propagation-delay-in-ripple-carry-adder/)
- [gate delay in ripple carry adder](https://www.gatevidyalay.com/tag/gate-delay-in-ripple-carry-adder/)
- [time delay in ripple carry adder](https://www.gatevidyalay.com/tag/time-delay-in-ripple-carry-adder/)
- [delay in n bit ripple carry adder](https://www.gatevidyalay.com/tag/delay-in-n-bit-ripple-carry-adder/)
- [gate delay in a 32 bit ripple carry adder](https://www.gatevidyalay.com/tag/gate-delay-in-a-32-bit-ripple-carry-adder/)
- [delay for ripple carry adder](https://www.gatevidyalay.com/tag/delay-for-ripple-carry-adder/)
- [how to calculate gate delay in ripple carry adder](https://www.gatevidyalay.com/tag/how-to-calculate-gate-delay-in-ripple-carry-adder/)
- [delay of ripple carry adder](https://www.gatevidyalay.com/tag/delay-of-ripple-carry-adder/)
- [logic gates](https://www.gatevidyalay.com/tag/logic-gates/)
- [logic gates symbols](https://www.gatevidyalay.com/tag/logic-gates-symbols/)
- [logic gates definition](https://www.gatevidyalay.com/tag/logic-gates-definition/)
- [logic gates basics](https://www.gatevidyalay.com/tag/logic-gates-basics/)
- [logic gates and truth tables](https://www.gatevidyalay.com/tag/logic-gates-and-truth-tables/)
- [logic gates not](https://www.gatevidyalay.com/tag/logic-gates-not/)
- [logic gates diagram](https://www.gatevidyalay.com/tag/logic-gates-diagram/)
- [logic gates introduction](https://www.gatevidyalay.com/tag/logic-gates-introduction/)
- [logic gates electronics](https://www.gatevidyalay.com/tag/logic-gates-electronics/)
- [logic gates explained](https://www.gatevidyalay.com/tag/logic-gates-explained/)
- [logic gates computer science](https://www.gatevidyalay.com/tag/logic-gates-computer-science/)
- [logic gates symbols and truth tables](https://www.gatevidyalay.com/tag/logic-gates-symbols-and-truth-tables/)
- [quadruples triples indirect triples examples](https://www.gatevidyalay.com/tag/quadruples-triples-indirect-triples-examples/)
- [quadruples triples and indirect triples](https://www.gatevidyalay.com/tag/quadruples-triples-and-indirect-triples/)
- [operator precedence parsing in compiler design](https://www.gatevidyalay.com/tag/operator-precedence-parsing-in-compiler-design/)
- [operator precedence parsing example](https://www.gatevidyalay.com/tag/operator-precedence-parsing-example/)
- [operator precedence parsing algorithm](https://www.gatevidyalay.com/tag/operator-precedence-parsing-algorithm/)
- [operator precedence parsing table](https://www.gatevidyalay.com/tag/operator-precedence-parsing-table/)
- [operator precedence parsing in compiler design examples](https://www.gatevidyalay.com/tag/operator-precedence-parsing-in-compiler-design-examples/)
- [operator precedence parsing table example](https://www.gatevidyalay.com/tag/operator-precedence-parsing-table-example/)
- [shift reduce parsing example](https://www.gatevidyalay.com/tag/shift-reduce-parsing-example/)
- [shift reduce parsing in compiler design](https://www.gatevidyalay.com/tag/shift-reduce-parsing-in-compiler-design/)
- [shift reduce parsing algorithm](https://www.gatevidyalay.com/tag/shift-reduce-parsing-algorithm/)
- [fractional knapsack problem example](https://www.gatevidyalay.com/tag/fractional-knapsack-problem-example/)
- [fractional knapsack problem algorithm](https://www.gatevidyalay.com/tag/fractional-knapsack-problem-algorithm/)
- [fractional knapsack problem greedy algorithm](https://www.gatevidyalay.com/tag/fractional-knapsack-problem-greedy-algorithm/)
- [0 1 knapsack problem example](https://www.gatevidyalay.com/tag/0-1-knapsack-problem-example/)
- [0 1 knapsack problem algorithm](https://www.gatevidyalay.com/tag/0-1-knapsack-problem-algorithm/)
- [how to solve 0 1 knapsack problem using dynamic programming](https://www.gatevidyalay.com/tag/how-to-solve-0-1-knapsack-problem-using-dynamic-programming/)
- [universal gates](https://www.gatevidyalay.com/tag/universal-gates/)
- [universal logic gates theory](https://www.gatevidyalay.com/tag/universal-logic-gates-theory/)
- [universal gates nand and nor](https://www.gatevidyalay.com/tag/universal-gates-nand-and-nor/)
- [normal forms](https://www.gatevidyalay.com/tag/normal-forms/)
- [normal forms in database](https://www.gatevidyalay.com/tag/normal-forms-in-database/)
- [normal forms database](https://www.gatevidyalay.com/tag/normal-forms-database/)
- [normal forms of database](https://www.gatevidyalay.com/tag/normal-forms-of-database/)
- [database normalization](https://www.gatevidyalay.com/tag/database-normalization/)
- [cache memory](https://www.gatevidyalay.com/tag/cache-memory/)
- [cache memory definition](https://www.gatevidyalay.com/tag/cache-memory-definition/)
- [cache memory meaning](https://www.gatevidyalay.com/tag/cache-memory-meaning/)
- [cache memory in computer architecture](https://www.gatevidyalay.com/tag/cache-memory-in-computer-architecture/)
- [cache memory levels](https://www.gatevidyalay.com/tag/cache-memory-levels/)
- [cache memory purpose](https://www.gatevidyalay.com/tag/cache-memory-purpose/)
- [cache memory size](https://www.gatevidyalay.com/tag/cache-memory-size/)
- [cache memory explained](https://www.gatevidyalay.com/tag/cache-memory-explained/)
- [cache memory function](https://www.gatevidyalay.com/tag/cache-memory-function/)
- [cache memory organization](https://www.gatevidyalay.com/tag/cache-memory-organization/)
- [cache memory computer](https://www.gatevidyalay.com/tag/cache-memory-computer/)
- [cache memory tutorial](https://www.gatevidyalay.com/tag/cache-memory-tutorial/)
- [cache memory location](https://www.gatevidyalay.com/tag/cache-memory-location/)
- [cache memory speed](https://www.gatevidyalay.com/tag/cache-memory-speed/)
- [cache memory working](https://www.gatevidyalay.com/tag/cache-memory-working/)
- [cache memory capacity](https://www.gatevidyalay.com/tag/cache-memory-capacity/)
- [cache memory notes](https://www.gatevidyalay.com/tag/cache-memory-notes/)
- [cache memory with diagram](https://www.gatevidyalay.com/tag/cache-memory-with-diagram/)
- [multi level cache memory](https://www.gatevidyalay.com/tag/multi-level-cache-memory/)
- [cache memory multiple levels](https://www.gatevidyalay.com/tag/cache-memory-multiple-levels/)
- [addressing modes](https://www.gatevidyalay.com/tag/addressing-modes/)
- [addressing mode](https://www.gatevidyalay.com/tag/addressing-mode/)
- [addressing modes in computer architecture](https://www.gatevidyalay.com/tag/addressing-modes-in-computer-architecture/)
- [addressing modes types](https://www.gatevidyalay.com/tag/addressing-modes-types/)
- [types of addressing modes](https://www.gatevidyalay.com/tag/types-of-addressing-modes/)
- [what are addressing modes](https://www.gatevidyalay.com/tag/what-are-addressing-modes/)
- [addressing modes examples](https://www.gatevidyalay.com/tag/addressing-modes-examples/)
- [addressing modes with examples in computer architecture](https://www.gatevidyalay.com/tag/addressing-modes-with-examples-in-computer-architecture/)
- [addressing modes definition](https://www.gatevidyalay.com/tag/addressing-modes-definition/)
- [various addressing modes](https://www.gatevidyalay.com/tag/various-addressing-modes/)
- [addressing modes in coa](https://www.gatevidyalay.com/tag/addressing-modes-in-coa/)
- [addressing modes and its types](https://www.gatevidyalay.com/tag/addressing-modes-and-its-types/)
- [addressing modes computer architecture](https://www.gatevidyalay.com/tag/addressing-modes-computer-architecture/)
- [addressing modes tutorial](https://www.gatevidyalay.com/tag/addressing-modes-tutorial/)
- [Implied Addressing Mode](https://www.gatevidyalay.com/tag/implied-addressing-mode/)
- [Implicit Addressing Mode](https://www.gatevidyalay.com/tag/implicit-addressing-mode/)
- [Immediate Addressing Mode](https://www.gatevidyalay.com/tag/immediate-addressing-mode/)
- [Direct Addressing Mode](https://www.gatevidyalay.com/tag/direct-addressing-mode/)
- [Indirect Addressing Mode](https://www.gatevidyalay.com/tag/indirect-addressing-mode/)
- [Register Direct Addressing Mode](https://www.gatevidyalay.com/tag/register-direct-addressing-mode/)
- [Register Indirect Addressing Mode](https://www.gatevidyalay.com/tag/register-indirect-addressing-mode/)
- [Relative Addressing Mode](https://www.gatevidyalay.com/tag/relative-addressing-mode/)
- [Indexed Addressing Mode](https://www.gatevidyalay.com/tag/indexed-addressing-mode/)
- [Base Register Addressing Mode](https://www.gatevidyalay.com/tag/base-register-addressing-mode/)
- [Auto Increment Addressing Mode](https://www.gatevidyalay.com/tag/auto-increment-addressing-mode/)
- [Auto Decrement Addressing Mode](https://www.gatevidyalay.com/tag/auto-decrement-addressing-mode/)
- [Stack Addressing Mode](https://www.gatevidyalay.com/tag/stack-addressing-mode/)
- [dijkstras algorithm](https://www.gatevidyalay.com/tag/dijkstras-algorithm/)
- [dijkstras algorithm example](https://www.gatevidyalay.com/tag/dijkstras-algorithm-example/)
- [dijkstras algorithm tutorial](https://www.gatevidyalay.com/tag/dijkstras-algorithm-tutorial/)
- [dijkstra algorithm data structure](https://www.gatevidyalay.com/tag/dijkstra-algorithm-data-structure/)
- [dijkstras algorithm time complexity](https://www.gatevidyalay.com/tag/dijkstras-algorithm-time-complexity/)
- [Hashing](https://www.gatevidyalay.com/tag/hashing/)
- [Hashing Algorithm](https://www.gatevidyalay.com/tag/hashing-algorithm/)
- [Hashing meaning](https://www.gatevidyalay.com/tag/hashing-meaning/)
- [Hashing data structure](https://www.gatevidyalay.com/tag/hashing-data-structure/)
- [Hashing in data structure](https://www.gatevidyalay.com/tag/hashing-in-data-structure/)
- [what is hashing](https://www.gatevidyalay.com/tag/what-is-hashing/)
- [hash table](https://www.gatevidyalay.com/tag/hash-table/)
- [hashing definition](https://www.gatevidyalay.com/tag/hashing-definition/)
- [Hashing table](https://www.gatevidyalay.com/tag/hashing-table/)
- [Hashing collision](https://www.gatevidyalay.com/tag/hashing-collision/)
- [Hashing Function](https://www.gatevidyalay.com/tag/hashing-function/)
- [Hashing Function Example](https://www.gatevidyalay.com/tag/hashing-function-example/)
- [Hashing define](https://www.gatevidyalay.com/tag/hashing-define/)
- [Hashing diagram](https://www.gatevidyalay.com/tag/hashing-diagram/)
- [Hashing explained](https://www.gatevidyalay.com/tag/hashing-explained/)
- [Hashing explanation](https://www.gatevidyalay.com/tag/hashing-explanation/)
- [Hashing tutorial](https://www.gatevidyalay.com/tag/hashing-tutorial/)
- [Hashing mechanism](https://www.gatevidyalay.com/tag/hashing-mechanism/)
- [Hashing computer science](https://www.gatevidyalay.com/tag/hashing-computer-science/)
- [Hashing in computer science](https://www.gatevidyalay.com/tag/hashing-in-computer-science/)
- [Hashing methods](https://www.gatevidyalay.com/tag/hashing-methods/)
- [Types of Hashing Functions](https://www.gatevidyalay.com/tag/types-of-hashing-functions/)
- [Need of Hashing](https://www.gatevidyalay.com/tag/need-of-hashing/)
- [Hash key value](https://www.gatevidyalay.com/tag/hash-key-value/)
- [collision resolution techniques](https://www.gatevidyalay.com/tag/collision-resolution-techniques/)
- [collision resolution techniques in data structure](https://www.gatevidyalay.com/tag/collision-resolution-techniques-in-data-structure/)
- [collision resolution techniques with examples](https://www.gatevidyalay.com/tag/collision-resolution-techniques-with-examples/)
- [collision in hashing](https://www.gatevidyalay.com/tag/collision-in-hashing/)
- [load factor](https://www.gatevidyalay.com/tag/load-factor/)
- [separate chaining example](https://www.gatevidyalay.com/tag/separate-chaining-example/)
- [open addressing](https://www.gatevidyalay.com/tag/open-addressing/)
- [linear probing](https://www.gatevidyalay.com/tag/linear-probing/)
- [quadratic probing](https://www.gatevidyalay.com/tag/quadratic-probing/)
- [double hashing](https://www.gatevidyalay.com/tag/double-hashing/)
- [linear probing example](https://www.gatevidyalay.com/tag/linear-probing-example/)
- [difference between linear probing and quadratic probing](https://www.gatevidyalay.com/tag/difference-between-linear-probing-and-quadratic-probing/)
- [difference between separate chaining and open addressing](https://www.gatevidyalay.com/tag/difference-between-separate-chaining-and-open-addressing/)
- [separate chaining vs open addressing](https://www.gatevidyalay.com/tag/separate-chaining-vs-open-addressing/)
- [neutral function](https://www.gatevidyalay.com/tag/neutral-function/)
- [neutral functions](https://www.gatevidyalay.com/tag/neutral-functions/)
- [self dual functions](https://www.gatevidyalay.com/tag/self-dual-functions/)
- [number of self dual functions](https://www.gatevidyalay.com/tag/number-of-self-dual-functions/)
- [examples of self dual functions](https://www.gatevidyalay.com/tag/examples-of-self-dual-functions/)
- [dual of a boolean expression](https://www.gatevidyalay.com/tag/dual-of-a-boolean-expression/)
- [dual of boolean expression](https://www.gatevidyalay.com/tag/dual-of-boolean-expression/)
- [dual of boolean expression example](https://www.gatevidyalay.com/tag/dual-of-boolean-expression-example/)
- [alternate gates](https://www.gatevidyalay.com/tag/alternate-gates/)
- [alternative logic gates](https://www.gatevidyalay.com/tag/alternative-logic-gates/)
- [bubbled gates](https://www.gatevidyalay.com/tag/bubbled-gates/)
- [bubble logic gates](https://www.gatevidyalay.com/tag/bubble-logic-gates/)
- [carry look ahead adder](https://www.gatevidyalay.com/tag/carry-look-ahead-adder/)
- [4 bit carry look ahead adder](https://www.gatevidyalay.com/tag/4-bit-carry-look-ahead-adder/)
- [carry look ahead adder circuit](https://www.gatevidyalay.com/tag/carry-look-ahead-adder-circuit/)
- [carry look ahead adder delay](https://www.gatevidyalay.com/tag/carry-look-ahead-adder-delay/)
- [carry look ahead adder example](https://www.gatevidyalay.com/tag/carry-look-ahead-adder-example/)
- [carry look ahead adder circuit diagram](https://www.gatevidyalay.com/tag/carry-look-ahead-adder-circuit-diagram/)
- [4 bit carry look ahead adder circuit diagram](https://www.gatevidyalay.com/tag/4-bit-carry-look-ahead-adder-circuit-diagram/)
- [4 bit carry look ahead adder example](https://www.gatevidyalay.com/tag/4-bit-carry-look-ahead-adder-example/)
- [cache mapping](https://www.gatevidyalay.com/tag/cache-mapping/)
- [cache mapping techniques](https://www.gatevidyalay.com/tag/cache-mapping-techniques/)
- [mapping techniques in cache memory](https://www.gatevidyalay.com/tag/mapping-techniques-in-cache-memory/)
- [cache memory mapping techniques](https://www.gatevidyalay.com/tag/cache-memory-mapping-techniques/)
- [mapping techniques of cache memory](https://www.gatevidyalay.com/tag/mapping-techniques-of-cache-memory/)
- [direct mapping](https://www.gatevidyalay.com/tag/direct-mapping/)
- [direct mapping cache](https://www.gatevidyalay.com/tag/direct-mapping-cache/)
- [direct mapping and associative mapping](https://www.gatevidyalay.com/tag/direct-mapping-and-associative-mapping/)
- [cache mapping in computer architecture](https://www.gatevidyalay.com/tag/cache-mapping-in-computer-architecture/)
- [direct mapping in cache memory example](https://www.gatevidyalay.com/tag/direct-mapping-in-cache-memory-example/)
- [direct mapping example](https://www.gatevidyalay.com/tag/direct-mapping-example/)
- [fully associative mapping](https://www.gatevidyalay.com/tag/fully-associative-mapping/)
- [set associative mapping](https://www.gatevidyalay.com/tag/set-associative-mapping/)
- [set associative mapping in computer architecture](https://www.gatevidyalay.com/tag/set-associative-mapping-in-computer-architecture/)
- [set associative mapping in cache memory](https://www.gatevidyalay.com/tag/set-associative-mapping-in-cache-memory/)
- [k way set associative mapping](https://www.gatevidyalay.com/tag/k-way-set-associative-mapping/)
- [2 way set associative mapping](https://www.gatevidyalay.com/tag/2-way-set-associative-mapping/)
- [planar graphs](https://www.gatevidyalay.com/tag/planar-graphs/)
- [planar graphs in graph theory](https://www.gatevidyalay.com/tag/planar-graphs-in-graph-theory/)
- [graph coloring](https://www.gatevidyalay.com/tag/graph-coloring/)
- [graph coloring algorithm](https://www.gatevidyalay.com/tag/graph-coloring-algorithm/)
- [graph coloring problem](https://www.gatevidyalay.com/tag/graph-coloring-problem/)
- [graph coloring applications](https://www.gatevidyalay.com/tag/graph-coloring-applications/)
- [graph coloring example](https://www.gatevidyalay.com/tag/graph-coloring-example/)
- [graph coloring definition](https://www.gatevidyalay.com/tag/graph-coloring-definition/)
- [chromatic number](https://www.gatevidyalay.com/tag/chromatic-number/)
- [chromatic number of a graph](https://www.gatevidyalay.com/tag/chromatic-number-of-a-graph/)
- [chromatic number of a tree](https://www.gatevidyalay.com/tag/chromatic-number-of-a-tree/)
- [chromatic number definition](https://www.gatevidyalay.com/tag/chromatic-number-definition/)
- [chromatic number in graph theory](https://www.gatevidyalay.com/tag/chromatic-number-in-graph-theory/)
- [chromatic number of bipartite graph](https://www.gatevidyalay.com/tag/chromatic-number-of-bipartite-graph/)
- [Graph Coloring Algorithm with Example](https://www.gatevidyalay.com/tag/graph-coloring-algorithm-with-example/)
- [how to find chromatic number of graph](https://www.gatevidyalay.com/tag/how-to-find-chromatic-number-of-graph/)
- [Euler Graph](https://www.gatevidyalay.com/tag/euler-graph/)
- [Euler Graph Theory](https://www.gatevidyalay.com/tag/euler-graph-theory/)
- [Euler Trail](https://www.gatevidyalay.com/tag/euler-trail/)
- [Eulerian Graph](https://www.gatevidyalay.com/tag/eulerian-graph/)
- [Eulerian Graph Example](https://www.gatevidyalay.com/tag/eulerian-graph-example/)
- [Eulerian Graph definition](https://www.gatevidyalay.com/tag/eulerian-graph-definition/)
- [Eulerian Graphs and Related Topics](https://www.gatevidyalay.com/tag/eulerian-graphs-and-related-topics/)
- [Euler Circuit](https://www.gatevidyalay.com/tag/euler-circuit/)
- [konigsberg bridge problem](https://www.gatevidyalay.com/tag/konigsberg-bridge-problem/)
- [konigsberg bridge problem solution](https://www.gatevidyalay.com/tag/konigsberg-bridge-problem-solution/)
- [konigsberg bridge problem in graph theory](https://www.gatevidyalay.com/tag/konigsberg-bridge-problem-in-graph-theory/)
- [explain konigsberg bridge problem](https://www.gatevidyalay.com/tag/explain-konigsberg-bridge-problem/)
- [explain konigsberg bridge problem in graph theory](https://www.gatevidyalay.com/tag/explain-konigsberg-bridge-problem-in-graph-theory/)
- [handshaking theorem](https://www.gatevidyalay.com/tag/handshaking-theorem/)
- [graph theory theorems](https://www.gatevidyalay.com/tag/graph-theory-theorems/)
- [graph theory theorems and proofs](https://www.gatevidyalay.com/tag/graph-theory-theorems-and-proofs/)
- [handshaking theorem in graph theory](https://www.gatevidyalay.com/tag/handshaking-theorem-in-graph-theory/)
- [handshaking lemma in graph theory](https://www.gatevidyalay.com/tag/handshaking-lemma-in-graph-theory/)
- [graph theory theorems and proofs pdf](https://www.gatevidyalay.com/tag/graph-theory-theorems-and-proofs-pdf/)
- [Hamiltonian Graph](https://www.gatevidyalay.com/tag/hamiltonian-graph/)
- [Hamiltonian Graph pdf](https://www.gatevidyalay.com/tag/hamiltonian-graph-pdf/)
- [Semi Hamiltonian Graph](https://www.gatevidyalay.com/tag/semi-hamiltonian-graph/)
- [Non Hamiltonian Graph](https://www.gatevidyalay.com/tag/non-hamiltonian-graph/)
- [Hamiltonian Graph Example Problems](https://www.gatevidyalay.com/tag/hamiltonian-graph-example-problems/)
- [Hamiltonian Graph Properties](https://www.gatevidyalay.com/tag/hamiltonian-graph-properties/)
- [Hamiltonian Graph PPT](https://www.gatevidyalay.com/tag/hamiltonian-graph-ppt/)
- [Hamiltonian Graph in Graph Theory](https://www.gatevidyalay.com/tag/hamiltonian-graph-in-graph-theory/)
- [Hamiltonian Graph Definition](https://www.gatevidyalay.com/tag/hamiltonian-graph-definition/)
- [Hamiltonian Path](https://www.gatevidyalay.com/tag/hamiltonian-path/)
- [Hamiltonian Path Problem](https://www.gatevidyalay.com/tag/hamiltonian-path-problem/)
- [Hamiltonian Path and Circuit](https://www.gatevidyalay.com/tag/hamiltonian-path-and-circuit/)
- [Hamiltonian Path Example](https://www.gatevidyalay.com/tag/hamiltonian-path-example/)
- [Hamiltonian Path Definition](https://www.gatevidyalay.com/tag/hamiltonian-path-definition/)
- [Hamiltonian Path Problem Example](https://www.gatevidyalay.com/tag/hamiltonian-path-problem-example/)
- [Hamiltonian Path and Cycle](https://www.gatevidyalay.com/tag/hamiltonian-path-and-cycle/)
- [Hamiltonian Circuit](https://www.gatevidyalay.com/tag/hamiltonian-circuit/)
- [Hamiltonian Circuit and Path](https://www.gatevidyalay.com/tag/hamiltonian-circuit-and-path/)
- [Hamiltonian Circuit Definition](https://www.gatevidyalay.com/tag/hamiltonian-circuit-definition/)
- [Explain Hamiltonian Circuit and path](https://www.gatevidyalay.com/tag/explain-hamiltonian-circuit-and-path/)
- [Hamiltonian Circuit Problem Example](https://www.gatevidyalay.com/tag/hamiltonian-circuit-problem-example/)
- [Bipartite Graphs](https://www.gatevidyalay.com/tag/bipartite-graphs/)
- [Bipartite Graph](https://www.gatevidyalay.com/tag/bipartite-graph/)
- [Complete Bipartite Graph](https://www.gatevidyalay.com/tag/complete-bipartite-graph/)
- [Bipartite Graph Matching](https://www.gatevidyalay.com/tag/bipartite-graph-matching/)
- [Graphs](https://www.gatevidyalay.com/tag/graphs/)
- [Types of Graphs](https://www.gatevidyalay.com/tag/types-of-graphs/)
- [Types of Graphs in Graph Theory](https://www.gatevidyalay.com/tag/types-of-graphs-in-graph-theory/)
- [Graphs in Graph Theory](https://www.gatevidyalay.com/tag/graphs-in-graph-theory/)
- [Null Graph](https://www.gatevidyalay.com/tag/null-graph/)
- [Trivial Graph](https://www.gatevidyalay.com/tag/trivial-graph/)
- [Directed Graph](https://www.gatevidyalay.com/tag/directed-graph/)
- [Simple Graph](https://www.gatevidyalay.com/tag/simple-graph/)
- [Connected Graph](https://www.gatevidyalay.com/tag/connected-graph/)
- [Disconnected Graph](https://www.gatevidyalay.com/tag/disconnected-graph/)
- [Regular Graph](https://www.gatevidyalay.com/tag/regular-graph/)
- [Complete Graph](https://www.gatevidyalay.com/tag/complete-graph/)
- [Cycle Graph](https://www.gatevidyalay.com/tag/cycle-graph/)
- [Cyclic Graph](https://www.gatevidyalay.com/tag/cyclic-graph/)
- [Acyclic Graph](https://www.gatevidyalay.com/tag/acyclic-graph/)
- [Finite Graph](https://www.gatevidyalay.com/tag/finite-graph/)
- [Infinite Graph](https://www.gatevidyalay.com/tag/infinite-graph/)
- [Planar Graph](https://www.gatevidyalay.com/tag/planar-graph/)
- [Master Theorem](https://www.gatevidyalay.com/tag/master-theorem/)
- [Master Theorem Examples](https://www.gatevidyalay.com/tag/master-theorem-examples/)
- [Depth First Search](https://www.gatevidyalay.com/tag/depth-first-search/)
- [DFS Algorithm](https://www.gatevidyalay.com/tag/dfs-algorithm/)
- [Depth First Search Algorithm](https://www.gatevidyalay.com/tag/depth-first-search-algorithm/)
- [DFS](https://www.gatevidyalay.com/tag/dfs/)
- [Depth First Search Example](https://www.gatevidyalay.com/tag/depth-first-search-example/)
- [DFS Example](https://www.gatevidyalay.com/tag/dfs-example/)
- [DFS Complexity](https://www.gatevidyalay.com/tag/dfs-complexity/)
- [Breadth First Search](https://www.gatevidyalay.com/tag/breadth-first-search/)
- [BFS Algorithm](https://www.gatevidyalay.com/tag/bfs-algorithm/)
- [Breadth First Search Algorithm](https://www.gatevidyalay.com/tag/breadth-first-search-algorithm/)
- [BFS](https://www.gatevidyalay.com/tag/bfs/)
- [Breadth First Search Example](https://www.gatevidyalay.com/tag/breadth-first-search-example/)
- [BFS Example](https://www.gatevidyalay.com/tag/bfs-example/)
- [Huffman Coding with Example](https://www.gatevidyalay.com/tag/huffman-coding-with-example/)
- [Huffman Coding Algorithm](https://www.gatevidyalay.com/tag/huffman-coding-algorithm/)
- [Huffman Coding Steps](https://www.gatevidyalay.com/tag/huffman-coding-steps/)
- [Shortest Path Problem](https://www.gatevidyalay.com/tag/shortest-path-problem/)
- [Shortest Path Problem Example](https://www.gatevidyalay.com/tag/shortest-path-problem-example/)
- [Shortest Path Algorithm](https://www.gatevidyalay.com/tag/shortest-path-algorithm/)
- [Shortest Path Algorithm Example](https://www.gatevidyalay.com/tag/shortest-path-algorithm-example/)
- [Shortest Path Algorithm with Example](https://www.gatevidyalay.com/tag/shortest-path-algorithm-with-example/)
- [Recursion Tree](https://www.gatevidyalay.com/tag/recursion-tree/)
- [Recursion Tree Method](https://www.gatevidyalay.com/tag/recursion-tree-method/)
- [Recursion Tree Examples](https://www.gatevidyalay.com/tag/recursion-tree-examples/)
- [Recursion Tree Method for solving Recurrences](https://www.gatevidyalay.com/tag/recursion-tree-method-for-solving-recurrences/)
- [Recursion Tree Method for solving Recurrences Examples pdf](https://www.gatevidyalay.com/tag/recursion-tree-method-for-solving-recurrences-examples-pdf/)
- [Searching Algorithms](https://www.gatevidyalay.com/tag/searching-algorithms/)
- [Linear Search](https://www.gatevidyalay.com/tag/linear-search/)
- [Linear Search Algorithm](https://www.gatevidyalay.com/tag/linear-search-algorithm/)
- [Binary Search](https://www.gatevidyalay.com/tag/binary-search/)
- [Binary Search Algorithm](https://www.gatevidyalay.com/tag/binary-search-algorithm/)
- [Binary Search Example](https://www.gatevidyalay.com/tag/binary-search-example/)
- [Quick Sort](https://www.gatevidyalay.com/tag/quick-sort/)
- [Sorting Algorithms](https://www.gatevidyalay.com/tag/sorting-algorithms/)
- [Quick Sort Example](https://www.gatevidyalay.com/tag/quick-sort-example/)
- [Quick Sort with Example](https://www.gatevidyalay.com/tag/quick-sort-with-example/)
- [Quick Sort Algorithm](https://www.gatevidyalay.com/tag/quick-sort-algorithm/)
- [Quick Sort Data Structure](https://www.gatevidyalay.com/tag/quick-sort-data-structure/)
- [Floyd Warshall Algorithm Example Step by Step](https://www.gatevidyalay.com/tag/floyd-warshall-algorithm-example-step-by-step/)
- [Floyd Warshall Algorithm Example ppt](https://www.gatevidyalay.com/tag/floyd-warshall-algorithm-example-ppt/)
- [Floyd Warshall Algorithm Example](https://www.gatevidyalay.com/tag/floyd-warshall-algorithm-example/)
- [Functional Dependency](https://www.gatevidyalay.com/tag/functional-dependency/)
- [Functional Dependency in DBMS](https://www.gatevidyalay.com/tag/functional-dependency-in-dbms/)
- [Functional Dependency Example](https://www.gatevidyalay.com/tag/functional-dependency-example/)
- [Functional Dependency with Example](https://www.gatevidyalay.com/tag/functional-dependency-with-example/)
- [Functional Dependency Diagram](https://www.gatevidyalay.com/tag/functional-dependency-diagram/)
- [Travelling Salesman Problem Algorithm](https://www.gatevidyalay.com/tag/travelling-salesman-problem-algorithm/)
- [Travelling Salesman Problem Example](https://www.gatevidyalay.com/tag/travelling-salesman-problem-example/)
- [Travelling Salesman Problem with Example](https://www.gatevidyalay.com/tag/travelling-salesman-problem-with-example/)
- [Travelling Salesman Problem Solution](https://www.gatevidyalay.com/tag/travelling-salesman-problem-solution/)
- [Travelling Salesman Problem using Branch and Bound](https://www.gatevidyalay.com/tag/travelling-salesman-problem-using-branch-and-bound/)
- [Construction of DFA](https://www.gatevidyalay.com/tag/construction-of-dfa/)
- [Construction of DFA Examples](https://www.gatevidyalay.com/tag/construction-of-dfa-examples/)
- [How to construct a DFA](https://www.gatevidyalay.com/tag/how-to-construct-a-dfa/)
- [How to draw DFA Diagram](https://www.gatevidyalay.com/tag/how-to-draw-dfa-diagram/)
- [DFA Examples with Solutions](https://www.gatevidyalay.com/tag/dfa-examples-with-solutions/)
- [DFA Examples with Solutions PDF](https://www.gatevidyalay.com/tag/dfa-examples-with-solutions-pdf/)
- [DFA Solved Examples](https://www.gatevidyalay.com/tag/dfa-solved-examples/)
- [DFA Examples PDF](https://www.gatevidyalay.com/tag/dfa-examples-pdf/)
- [How to solve DFA Problems](https://www.gatevidyalay.com/tag/how-to-solve-dfa-problems/)
- [Number System Definition](https://www.gatevidyalay.com/tag/number-system-definition/)
- [Number System Examples](https://www.gatevidyalay.com/tag/number-system-examples/)
- [Number System Conversion](https://www.gatevidyalay.com/tag/number-system-conversion/)
- [Number System Conversion PDF](https://www.gatevidyalay.com/tag/number-system-conversion-pdf/)
- [Number System Conversion in Computer](https://www.gatevidyalay.com/tag/number-system-conversion-in-computer/)
- [Number System Conversion Examples](https://www.gatevidyalay.com/tag/number-system-conversion-examples/)
- [Number System Conversion with solution](https://www.gatevidyalay.com/tag/number-system-conversion-with-solution/)
- [base 16 to base 10](https://www.gatevidyalay.com/tag/base-16-to-base-10/)
- [Left Recursion](https://www.gatevidyalay.com/tag/left-recursion/)
- [Left Factoring](https://www.gatevidyalay.com/tag/left-factoring/)
- [Ambiguity of Grammar](https://www.gatevidyalay.com/tag/ambiguity-of-grammar/)
- [Ambiguous Grammar](https://www.gatevidyalay.com/tag/ambiguous-grammar/)
- [Decimal to Octal Conversion Method](https://www.gatevidyalay.com/tag/decimal-to-octal-conversion-method/)
- [Base 10 to base 16](https://www.gatevidyalay.com/tag/base-10-to-base-16/)
- [Converting Bases](https://www.gatevidyalay.com/tag/converting-bases/)
- [Conversion of Bases](https://www.gatevidyalay.com/tag/conversion-of-bases/)
- [Context Free Grammar](https://www.gatevidyalay.com/tag/context-free-grammar/)
- [CFG](https://www.gatevidyalay.com/tag/cfg/)
- [Context Free Grammar Examples](https://www.gatevidyalay.com/tag/context-free-grammar-examples/)
- [Context Free Grammar Language Examples](https://www.gatevidyalay.com/tag/context-free-grammar-language-examples/)
- [Context Free Language](https://www.gatevidyalay.com/tag/context-free-language/)
- [CFL](https://www.gatevidyalay.com/tag/cfl/)
- [Context Free Grammars](https://www.gatevidyalay.com/tag/context-free-grammars/)
- [Context Free Languages](https://www.gatevidyalay.com/tag/context-free-languages/)
- [Decision Algorithms for Context Free Languages](https://www.gatevidyalay.com/tag/decision-algorithms-for-context-free-languages/)
- [Decision Properties of Context Free Languages](https://www.gatevidyalay.com/tag/decision-properties-of-context-free-languages/)
- [CYK Algorithm](https://www.gatevidyalay.com/tag/cyk-algorithm/)
- [Topological Sorting](https://www.gatevidyalay.com/tag/topological-sorting/)
- [Topological Sort Example](https://www.gatevidyalay.com/tag/topological-sort-example/)
- [Topological Sort Algorithm](https://www.gatevidyalay.com/tag/topological-sort-algorithm/)
- [Prim Algorithm](https://www.gatevidyalay.com/tag/prim-algorithm/)
- [Prim Algorithm Example](https://www.gatevidyalay.com/tag/prim-algorithm-example/)
- [Kruskal Algorithm Example](https://www.gatevidyalay.com/tag/kruskal-algorithm-example/)
- [Prims and Kruskal Algorithm with Example](https://www.gatevidyalay.com/tag/prims-and-kruskal-algorithm-with-example/)
- [GATE 2019](https://www.gatevidyalay.com/tag/gate-2019/)
- [GATE 2019 Syllabus](https://www.gatevidyalay.com/tag/gate-2019-syllabus/)
- [GATE Exam Pattern](https://www.gatevidyalay.com/tag/gate-exam-pattern/)
- [GATE Exam Date](https://www.gatevidyalay.com/tag/gate-exam-date/)
- [What is GATE Exam](https://www.gatevidyalay.com/tag/what-is-gate-exam/)
- [GATE Exam Syllabus](https://www.gatevidyalay.com/tag/gate-exam-syllabus/)
- [GATE Exam](https://www.gatevidyalay.com/tag/gate-exam/)
- [GATE Exam For](https://www.gatevidyalay.com/tag/gate-exam-for/)
- [Tree Terminology](https://www.gatevidyalay.com/tag/tree-terminology/)
- [Binary Tree](https://www.gatevidyalay.com/tag/binary-tree/)
- [Complete Binary Tree](https://www.gatevidyalay.com/tag/complete-binary-tree/)
- [Types of Binary Tree](https://www.gatevidyalay.com/tag/types-of-binary-tree/)
- [Types of Trees in Data Structure](https://www.gatevidyalay.com/tag/types-of-trees-in-data-structure/)
- [Compiler Design Notes](https://www.gatevidyalay.com/tag/compiler-design-notes/)
- [Basic Blocks and Flow Graphs in Compiler Design](https://www.gatevidyalay.com/tag/basic-blocks-and-flow-graphs-in-compiler-design/)
- [Code Optimization in Compiler Design](https://www.gatevidyalay.com/tag/code-optimization-in-compiler-design/)
- [Code Optimization Compiler Design](https://www.gatevidyalay.com/tag/code-optimization-compiler-design/)
- [Binary Tree Properties](https://www.gatevidyalay.com/tag/binary-tree-properties/)
- [Properties of Binary Tree](https://www.gatevidyalay.com/tag/properties-of-binary-tree/)
- [Tree Traversal](https://www.gatevidyalay.com/tag/tree-traversal/)
- [Binary Tree Traversal](https://www.gatevidyalay.com/tag/binary-tree-traversal/)
- [Preorder Traversal Binary Tree](https://www.gatevidyalay.com/tag/preorder-traversal-binary-tree/)
- [Preorder Traversal of Binary Tree](https://www.gatevidyalay.com/tag/preorder-traversal-of-binary-tree/)
- [Inorder Traversal Binary Tree](https://www.gatevidyalay.com/tag/inorder-traversal-binary-tree/)
- [Inorder Traversal of Binary Tree](https://www.gatevidyalay.com/tag/inorder-traversal-of-binary-tree/)
- [Inorder Traversal Tree](https://www.gatevidyalay.com/tag/inorder-traversal-tree/)
- [GATE Important Topics for CSE](https://www.gatevidyalay.com/tag/gate-important-topics-for-cse/)
- [Most Important Topics for GATE CSE](https://www.gatevidyalay.com/tag/most-important-topics-for-gate-cse/)
- [GATE Important Topics](https://www.gatevidyalay.com/tag/gate-important-topics/)
- [Important Topics for GATE](https://www.gatevidyalay.com/tag/important-topics-for-gate/)
- [Data Structure](https://www.gatevidyalay.com/tag/data-structure/)
- [Binary Search Tree Example](https://www.gatevidyalay.com/tag/binary-search-tree-example/)
- [Binary Search Tree Algorithm](https://www.gatevidyalay.com/tag/binary-search-tree-algorithm/)
- [Binary Search Tree Traversal](https://www.gatevidyalay.com/tag/binary-search-tree-traversal/)
- [BST Traversal](https://www.gatevidyalay.com/tag/bst-traversal/)
- [Binary Search Tree Traversal Inorder Preorder Postorder Example](https://www.gatevidyalay.com/tag/binary-search-tree-traversal-inorder-preorder-postorder-example/)
- [Binary Search Tree Insertion](https://www.gatevidyalay.com/tag/binary-search-tree-insertion/)
- [Binary Search Tree Deletion](https://www.gatevidyalay.com/tag/binary-search-tree-deletion/)
- [BST Deletion](https://www.gatevidyalay.com/tag/bst-deletion/)
- [AVL Tree](https://www.gatevidyalay.com/tag/avl-tree/)
- [AVL Trees](https://www.gatevidyalay.com/tag/avl-trees/)
- [AVL Tree Rotation](https://www.gatevidyalay.com/tag/avl-tree-rotation/)
- [AVL Tree Insertion](https://www.gatevidyalay.com/tag/avl-tree-insertion/)
- [AVL Tree Deletion](https://www.gatevidyalay.com/tag/avl-tree-deletion/)
- [AVL Tree Data Structure](https://www.gatevidyalay.com/tag/avl-tree-data-structure/)
- [AVL Tree with Example](https://www.gatevidyalay.com/tag/avl-tree-with-example/)
- [Balance Factor](https://www.gatevidyalay.com/tag/balance-factor/)
- [Time Complexity of Binary Search Tree](https://www.gatevidyalay.com/tag/time-complexity-of-binary-search-tree/)
- [Time Complexity of BST](https://www.gatevidyalay.com/tag/time-complexity-of-bst/)
- [Language of Grammar](https://www.gatevidyalay.com/tag/language-of-grammar/)
- [Language and Grammar](https://www.gatevidyalay.com/tag/language-and-grammar/)
- [Automata](https://www.gatevidyalay.com/tag/automata/)
- [Theory of Computation](https://www.gatevidyalay.com/tag/theory-of-computation/)
- [Grammar in Automata](https://www.gatevidyalay.com/tag/grammar-in-automata/)
- [Difference between Ambiguous and Unambiguous Grammar](https://www.gatevidyalay.com/tag/difference-between-ambiguous-and-unambiguous-grammar/)
- [Ambiguity](https://www.gatevidyalay.com/tag/ambiguity/)
- [Grammar Ambiguity](https://www.gatevidyalay.com/tag/grammar-ambiguity/)
- [Ambiguity in Grammar](https://www.gatevidyalay.com/tag/ambiguity-in-grammar/)
- [Language Ambiguity](https://www.gatevidyalay.com/tag/language-ambiguity/)
- [Ambiguity in Language](https://www.gatevidyalay.com/tag/ambiguity-in-language/)
- [Ambiguity of Language](https://www.gatevidyalay.com/tag/ambiguity-of-language/)
- [Ambiguous Language](https://www.gatevidyalay.com/tag/ambiguous-language/)
- [Recursive Grammar](https://www.gatevidyalay.com/tag/recursive-grammar/)
- [Left Recursive Grammar](https://www.gatevidyalay.com/tag/left-recursive-grammar/)
- [Right Recursive Grammar](https://www.gatevidyalay.com/tag/right-recursive-grammar/)
- [Selection Operation](https://www.gatevidyalay.com/tag/selection-operation/)
- [Selection Operator](https://www.gatevidyalay.com/tag/selection-operator/)
- [Selection Operation in DBMS](https://www.gatevidyalay.com/tag/selection-operation-in-dbms/)
- [Select Operation in Relational Algebra](https://www.gatevidyalay.com/tag/select-operation-in-relational-algebra/)
- [Select Operator](https://www.gatevidyalay.com/tag/select-operator/)
- [Select Operation in DBMS](https://www.gatevidyalay.com/tag/select-operation-in-dbms/)
- [Select Operator in Relational Algebra](https://www.gatevidyalay.com/tag/select-operator-in-relational-algebra/)
- [Relational Algebra](https://www.gatevidyalay.com/tag/relational-algebra/)
- [Relational Algebra in DBMS](https://www.gatevidyalay.com/tag/relational-algebra-in-dbms/)
- [Relational Algebra Examples](https://www.gatevidyalay.com/tag/relational-algebra-examples/)
- [Relational Algebra SQL](https://www.gatevidyalay.com/tag/relational-algebra-sql/)
- [Relational Algebra in SQL](https://www.gatevidyalay.com/tag/relational-algebra-in-sql/)
- [Relational Algebra Database](https://www.gatevidyalay.com/tag/relational-algebra-database/)
- [Relational Algebra Operators](https://www.gatevidyalay.com/tag/relational-algebra-operators/)
- [Projection Operator](https://www.gatevidyalay.com/tag/projection-operator/)
- [Relational Algebra Projection](https://www.gatevidyalay.com/tag/relational-algebra-projection/)
- [Project Operation in DBMS](https://www.gatevidyalay.com/tag/project-operation-in-dbms/)
- [Project Operation in Relational Algebra](https://www.gatevidyalay.com/tag/project-operation-in-relational-algebra/)
- [Set Theory Operators](https://www.gatevidyalay.com/tag/set-theory-operators/)
- [Union Operator](https://www.gatevidyalay.com/tag/union-operator/)
- [Union Operator SQL](https://www.gatevidyalay.com/tag/union-operator-sql/)
- [Union Operator in SQL](https://www.gatevidyalay.com/tag/union-operator-in-sql/)
- [Intersection Operator](https://www.gatevidyalay.com/tag/intersection-operator/)
- [Difference Operator](https://www.gatevidyalay.com/tag/difference-operator/)
- [Difference Operator SQL](https://www.gatevidyalay.com/tag/difference-operator-sql/)
- [Union Compatible](https://www.gatevidyalay.com/tag/union-compatible/)
- [Parse Tree](https://www.gatevidyalay.com/tag/parse-tree/)
- [Parse Tree Example](https://www.gatevidyalay.com/tag/parse-tree-example/)
- [Leftmost Derivation](https://www.gatevidyalay.com/tag/leftmost-derivation/)
- [Rightmost Derivation](https://www.gatevidyalay.com/tag/rightmost-derivation/)
- [Insertion in AVL Tree](https://www.gatevidyalay.com/tag/insertion-in-avl-tree/)
- [Recursion](https://www.gatevidyalay.com/tag/recursion/)
- [Left Recursion Elimination](https://www.gatevidyalay.com/tag/left-recursion-elimination/)
- [AVL Tree Properties](https://www.gatevidyalay.com/tag/avl-tree-properties/)
- [Properties of AVL Tree](https://www.gatevidyalay.com/tag/properties-of-avl-tree/)
- [Left Factoring Examples](https://www.gatevidyalay.com/tag/left-factoring-examples/)
- [Left Factoring in Compiler Design](https://www.gatevidyalay.com/tag/left-factoring-in-compiler-design/)
- [DFA to Regular Expression](https://www.gatevidyalay.com/tag/dfa-to-regular-expression/)
- [Finite Automata to Regular Expression](https://www.gatevidyalay.com/tag/finite-automata-to-regular-expression/)
- [Find Regular Expression](https://www.gatevidyalay.com/tag/find-regular-expression/)
- [Regular Expression](https://www.gatevidyalay.com/tag/regular-expression/)
- [Regular Expression Tutorial](https://www.gatevidyalay.com/tag/regular-expression-tutorial/)
- [Regular Expression Examples](https://www.gatevidyalay.com/tag/regular-expression-examples/)
- [Minimization of DFA](https://www.gatevidyalay.com/tag/minimization-of-dfa/)
- [DFA](https://www.gatevidyalay.com/tag/dfa/)
- [Chomsky Normal Form](https://www.gatevidyalay.com/tag/chomsky-normal-form/)
- [Removing Ambiguity](https://www.gatevidyalay.com/tag/removing-ambiguity/)
- [Convert Ambiguous to Unambiguous Grammar](https://www.gatevidyalay.com/tag/convert-ambiguous-to-unambiguous-grammar/)
- [First and Follow](https://www.gatevidyalay.com/tag/first-and-follow/)
- [First and Follow Examples](https://www.gatevidyalay.com/tag/first-and-follow-examples/)
- [First and Follow in Compiler Design](https://www.gatevidyalay.com/tag/first-and-follow-in-compiler-design/)
- [Domain Name Service DNS](https://www.gatevidyalay.com/tag/domain-name-service-dns/)
- [Domain Name Service Definition](https://www.gatevidyalay.com/tag/domain-name-service-definition/)
- [Domain Name System Resolution](https://www.gatevidyalay.com/tag/domain-name-system-resolution/)
- [Domain Name System](https://www.gatevidyalay.com/tag/domain-name-system/)
- [Domain Name System in Computer Networks](https://www.gatevidyalay.com/tag/domain-name-system-in-computer-networks/)
- [Domain Name System Definition](https://www.gatevidyalay.com/tag/domain-name-system-definition/)
- [DNS](https://www.gatevidyalay.com/tag/dns/)
- [DNS Working](https://www.gatevidyalay.com/tag/dns-working/)
- [DNS Definition](https://www.gatevidyalay.com/tag/dns-definition/)
- [Domain Name Service](https://www.gatevidyalay.com/tag/domain-name-service/)
- [Computer Network](https://www.gatevidyalay.com/tag/computer-network/)
- [Computer Networks](https://www.gatevidyalay.com/tag/computer-networks/)
- [HTTP](https://www.gatevidyalay.com/tag/http/)
- [HTTP in Computer Networks](https://www.gatevidyalay.com/tag/http-in-computer-networks/)
- [HTTP Definition](https://www.gatevidyalay.com/tag/http-definition/)
- [HTTP Port](https://www.gatevidyalay.com/tag/http-port/)
- [HTTP Protocol](https://www.gatevidyalay.com/tag/http-protocol/)
- [Hypertext Transfer Protocol](https://www.gatevidyalay.com/tag/hypertext-transfer-protocol/)
- [HTTP Tutorial](https://www.gatevidyalay.com/tag/http-tutorial/)
- [HTTP connection](https://www.gatevidyalay.com/tag/http-connection/)
- [HTTP connections](https://www.gatevidyalay.com/tag/http-connections/)
- [Simple Mail Transfer Protocol](https://www.gatevidyalay.com/tag/simple-mail-transfer-protocol/)
- [SMTP Full Form](https://www.gatevidyalay.com/tag/smtp-full-form/)
- [SMTP Port Number](https://www.gatevidyalay.com/tag/smtp-port-number/)
- [SMTP Protocol](https://www.gatevidyalay.com/tag/smtp-protocol/)
- [SMTP Means](https://www.gatevidyalay.com/tag/smtp-means/)
- [SMTP Definition](https://www.gatevidyalay.com/tag/smtp-definition/)
- [SMTP](https://www.gatevidyalay.com/tag/smtp/)
- [SMTP in Computer Networks](https://www.gatevidyalay.com/tag/smtp-in-computer-networks/)
- [Post Office Protocol](https://www.gatevidyalay.com/tag/post-office-protocol/)
- [POP](https://www.gatevidyalay.com/tag/pop/)
- [POP3](https://www.gatevidyalay.com/tag/pop3/)
- [POP3 Port](https://www.gatevidyalay.com/tag/pop3-port/)
- [POP3 Protocol](https://www.gatevidyalay.com/tag/pop3-protocol/)
- [IMAP](https://www.gatevidyalay.com/tag/imap/)
- [IMAP Protocol](https://www.gatevidyalay.com/tag/imap-protocol/)
- [IMAP Means](https://www.gatevidyalay.com/tag/imap-means/)
- [POP Definition](https://www.gatevidyalay.com/tag/pop-definition/)
- [POP Protocol](https://www.gatevidyalay.com/tag/pop-protocol/)
- [Define POP](https://www.gatevidyalay.com/tag/define-pop/)
- [Application Layer Protocols](https://www.gatevidyalay.com/tag/application-layer-protocols/)
- [IMAP Vs POP3](https://www.gatevidyalay.com/tag/imap-vs-pop3/)
- [Internet Message Access Protocol](https://www.gatevidyalay.com/tag/internet-message-access-protocol/)
- [IMAP Port](https://www.gatevidyalay.com/tag/imap-port/)
- [Difference between POP and IMAP](https://www.gatevidyalay.com/tag/difference-between-pop-and-imap/)
- [File Transfer Protocol](https://www.gatevidyalay.com/tag/file-transfer-protocol/)
- [File Transfer Protocol FTP](https://www.gatevidyalay.com/tag/file-transfer-protocol-ftp/)
- [Definition of File Transfer Protocol](https://www.gatevidyalay.com/tag/definition-of-file-transfer-protocol/)
- [File Transfer Protocol Definition](https://www.gatevidyalay.com/tag/file-transfer-protocol-definition/)
- [FTP](https://www.gatevidyalay.com/tag/ftp/)
- [FTP Port](https://www.gatevidyalay.com/tag/ftp-port/)
- [FTP Full Form](https://www.gatevidyalay.com/tag/ftp-full-form/)
- [FTP Port Number](https://www.gatevidyalay.com/tag/ftp-port-number/)
- [FTP Connection](https://www.gatevidyalay.com/tag/ftp-connection/)
- [FTP Working](https://www.gatevidyalay.com/tag/ftp-working/)
- [FTP in Computer Networks](https://www.gatevidyalay.com/tag/ftp-in-computer-networks/)
- [Application Layer Protocols List](https://www.gatevidyalay.com/tag/application-layer-protocols-list/)
- [Transmission Control Protocol](https://www.gatevidyalay.com/tag/transmission-control-protocol/)
- [TCP](https://www.gatevidyalay.com/tag/tcp/)
- [Transmission Control Protocol Meaning](https://www.gatevidyalay.com/tag/transmission-control-protocol-meaning/)
- [TCP IP](https://www.gatevidyalay.com/tag/tcp-ip/)
- [TCP Meaning](https://www.gatevidyalay.com/tag/tcp-meaning/)
- [TCP Protocol](https://www.gatevidyalay.com/tag/tcp-protocol/)
- [TCP Definition](https://www.gatevidyalay.com/tag/tcp-definition/)
- [TCP Connection Termination](https://www.gatevidyalay.com/tag/tcp-connection-termination/)
- [TCP Connection](https://www.gatevidyalay.com/tag/tcp-connection/)
- [Three Way Handshake](https://www.gatevidyalay.com/tag/three-way-handshake/)
- [TCP Connection Establishment](https://www.gatevidyalay.com/tag/tcp-connection-establishment/)
- [Three Way Handshake TCP](https://www.gatevidyalay.com/tag/three-way-handshake-tcp/)
- [TCP Header](https://www.gatevidyalay.com/tag/tcp-header/)
- [TCP Header Size](https://www.gatevidyalay.com/tag/tcp-header-size/)
- [TCP Header Structure](https://www.gatevidyalay.com/tag/tcp-header-structure/)
- [TCP Header Format](https://www.gatevidyalay.com/tag/tcp-header-format/)
- [TCP Header Diagram](https://www.gatevidyalay.com/tag/tcp-header-diagram/)
- [TCP Header Checksum](https://www.gatevidyalay.com/tag/tcp-header-checksum/)
- [TCP Congestion Control](https://www.gatevidyalay.com/tag/tcp-congestion-control/)
- [TCP Congestion Avoidance](https://www.gatevidyalay.com/tag/tcp-congestion-avoidance/)
- [TCP Timers](https://www.gatevidyalay.com/tag/tcp-timers/)
- [Silly Window Syndrome](https://www.gatevidyalay.com/tag/silly-window-syndrome/)
- [Nagle's Algorithm](https://www.gatevidyalay.com/tag/nagles-algorithm/)
- [Time Out Timer](https://www.gatevidyalay.com/tag/time-out-timer/)
- [Jacobson Algorithm](https://www.gatevidyalay.com/tag/jacobson-algorithm/)
- [Karn's Algorithm](https://www.gatevidyalay.com/tag/karns-algorithm/)
- [IPv4](https://www.gatevidyalay.com/tag/ipv4/)
- [IPv4 Header](https://www.gatevidyalay.com/tag/ipv4-header/)
- [IPv4 Header Format](https://www.gatevidyalay.com/tag/ipv4-header-format/)
- [Internet Protocol Version 4](https://www.gatevidyalay.com/tag/internet-protocol-version-4/)
- [Fragmentation in Computer Networks](https://www.gatevidyalay.com/tag/fragmentation-in-computer-networks/)
- [Fragmentation in Networking](https://www.gatevidyalay.com/tag/fragmentation-in-networking/)
- [IP Fragmentation Example](https://www.gatevidyalay.com/tag/ip-fragmentation-example/)
- [IPv4 Fragmentation](https://www.gatevidyalay.com/tag/ipv4-fragmentation/)
- [IP Fragmentation](https://www.gatevidyalay.com/tag/ip-fragmentation/)
- [IP Fragmentation and Reassembly](https://www.gatevidyalay.com/tag/ip-fragmentation-and-reassembly/)
- [IP Address](https://www.gatevidyalay.com/tag/ip-address/)
- [IP Addresses](https://www.gatevidyalay.com/tag/ip-addresses/)
- [What is an IP Address](https://www.gatevidyalay.com/tag/what-is-an-ip-address/)
- [IP Address Definition](https://www.gatevidyalay.com/tag/ip-address-definition/)
- [IP Address Define](https://www.gatevidyalay.com/tag/ip-address-define/)
- [IP Address Meaning](https://www.gatevidyalay.com/tag/ip-address-meaning/)
- [IP Address Range](https://www.gatevidyalay.com/tag/ip-address-range/)
- [IP Address Full Form](https://www.gatevidyalay.com/tag/ip-address-full-form/)
- [IP Address in Networking](https://www.gatevidyalay.com/tag/ip-address-in-networking/)
- [Class B IP Address](https://www.gatevidyalay.com/tag/class-b-ip-address/)
- [IP Address Explain](https://www.gatevidyalay.com/tag/ip-address-explain/)
- [Classes of IP Address](https://www.gatevidyalay.com/tag/classes-of-ip-address/)
- [Classes of IP Address Range](https://www.gatevidyalay.com/tag/classes-of-ip-address-range/)
- [IP Address Classes](https://www.gatevidyalay.com/tag/ip-address-classes/)
- [IP Address Classes Range](https://www.gatevidyalay.com/tag/ip-address-classes-range/)
- [Types of IP Address](https://www.gatevidyalay.com/tag/types-of-ip-address/)
- [Types of casting](https://www.gatevidyalay.com/tag/types-of-casting/)
- [Unicast](https://www.gatevidyalay.com/tag/unicast/)
- [Unicasting](https://www.gatevidyalay.com/tag/unicasting/)
- [Broadcast](https://www.gatevidyalay.com/tag/broadcast/)
- [Broadcasting](https://www.gatevidyalay.com/tag/broadcasting/)
- [Types of Broadcasting](https://www.gatevidyalay.com/tag/types-of-broadcasting/)
- [Multicast](https://www.gatevidyalay.com/tag/multicast/)
- [Multicasting](https://www.gatevidyalay.com/tag/multicasting/)
- [Multicast in Networking](https://www.gatevidyalay.com/tag/multicast-in-networking/)
- [What is Broadcast](https://www.gatevidyalay.com/tag/what-is-broadcast/)
- [IP Multicast](https://www.gatevidyalay.com/tag/ip-multicast/)
- [Multicast IP](https://www.gatevidyalay.com/tag/multicast-ip/)
- [Broadcast Vs Multicast](https://www.gatevidyalay.com/tag/broadcast-vs-multicast/)
- [Sequence Number](https://www.gatevidyalay.com/tag/sequence-number/)
- [Sequence Number TCP](https://www.gatevidyalay.com/tag/sequence-number-tcp/)
- [What is Sequence Number in TCP](https://www.gatevidyalay.com/tag/what-is-sequence-number-in-tcp/)
- [TCP Sequence Number](https://www.gatevidyalay.com/tag/tcp-sequence-number/)
- [Subnetting](https://www.gatevidyalay.com/tag/subnetting/)
- [Subnetting IP](https://www.gatevidyalay.com/tag/subnetting-ip/)
- [IP Subnetting](https://www.gatevidyalay.com/tag/ip-subnetting/)
- [Subnetting Questions](https://www.gatevidyalay.com/tag/subnetting-questions/)
- [Subnetting Practice](https://www.gatevidyalay.com/tag/subnetting-practice/)
- [Subnetting in Networking](https://www.gatevidyalay.com/tag/subnetting-in-networking/)
- [Subnetting Tutorial](https://www.gatevidyalay.com/tag/subnetting-tutorial/)
- [Subnetting in IPv4](https://www.gatevidyalay.com/tag/subnetting-in-ipv4/)
- [Subnetting Explained](https://www.gatevidyalay.com/tag/subnetting-explained/)
- [Subnetting with Examples](https://www.gatevidyalay.com/tag/subnetting-with-examples/)
- [Subnetting Examples](https://www.gatevidyalay.com/tag/subnetting-examples/)
- [Subnet](https://www.gatevidyalay.com/tag/subnet/)
- [Subnet for IP](https://www.gatevidyalay.com/tag/subnet-for-ip/)
- [Subnet Network](https://www.gatevidyalay.com/tag/subnet-network/)
- [Subnet of IP](https://www.gatevidyalay.com/tag/subnet-of-ip/)
- [What is Subnet](https://www.gatevidyalay.com/tag/what-is-subnet/)
- [Subnet Tutorial](https://www.gatevidyalay.com/tag/subnet-tutorial/)
- [IPv4 Subnetting](https://www.gatevidyalay.com/tag/ipv4-subnetting/)
- [Subnet and IP Address](https://www.gatevidyalay.com/tag/subnet-and-ip-address/)
- [Subnet Explained](https://www.gatevidyalay.com/tag/subnet-explained/)
- [Routing Table](https://www.gatevidyalay.com/tag/routing-table/)
- [IP Routing Table](https://www.gatevidyalay.com/tag/ip-routing-table/)
- [Routing Table in Networking](https://www.gatevidyalay.com/tag/routing-table-in-networking/)
- [Subnet Mask](https://www.gatevidyalay.com/tag/subnet-mask/)
- [What is Subnet Mask](https://www.gatevidyalay.com/tag/what-is-subnet-mask/)
- [IP Subnet Mask](https://www.gatevidyalay.com/tag/ip-subnet-mask/)
- [Subnet Mask for IP](https://www.gatevidyalay.com/tag/subnet-mask-for-ip/)
- [How to calculate Subnet Mask](https://www.gatevidyalay.com/tag/how-to-calculate-subnet-mask/)
- [Subnet Mask Table](https://www.gatevidyalay.com/tag/subnet-mask-table/)
- [Subnet Mask of IP Address](https://www.gatevidyalay.com/tag/subnet-mask-of-ip-address/)
- [Subnet Mask Definition](https://www.gatevidyalay.com/tag/subnet-mask-definition/)
- [Classless Inter Domain Routing](https://www.gatevidyalay.com/tag/classless-inter-domain-routing/)
- [CIDR](https://www.gatevidyalay.com/tag/cidr/)
- [CIDR Block](https://www.gatevidyalay.com/tag/cidr-block/)
- [IP CIDR](https://www.gatevidyalay.com/tag/ip-cidr/)
- [CIDR Range](https://www.gatevidyalay.com/tag/cidr-range/)
- [CIDR Networking](https://www.gatevidyalay.com/tag/cidr-networking/)
- [CIDR in Networking](https://www.gatevidyalay.com/tag/cidr-in-networking/)
- [CIDR Full Form](https://www.gatevidyalay.com/tag/cidr-full-form/)
- [CIDR Format](https://www.gatevidyalay.com/tag/cidr-format/)
- [Classless Addressing](https://www.gatevidyalay.com/tag/classless-addressing/)
- [Subnet Mask Use](https://www.gatevidyalay.com/tag/subnet-mask-use/)
- [Use of Subnet Mask](https://www.gatevidyalay.com/tag/use-of-subnet-mask/)