Канал: Student Globe

For loop | while loop | range function | Programming Questions | Python List tuple set & dictionary

For loop | while loop | range function | Programming Questions | Python List tuple set & dictionary

Student Globe Live Stream: PYTHON QP DISCUSSION

Student Globe Live Stream: PYTHON QP DISCUSSION

Program to display first positive 10 odd integers | Print numbers from 50 to 100 with a gap of 5

Program to display first positive 10 odd integers | Print numbers from 50 to 100 with a gap of 5

Python Program to print sum of natural numbers| Sum of Natural Number | For Loop and While Loop

Python Program to print sum of natural numbers| Sum of Natural Number | For Loop and While Loop

Program to print first 10 positive integers | For Loop and While Loop in Python | Looping statement

Program to print first 10 positive integers | For Loop and While Loop in Python | Looping statement

For Loop and While Loop in Python | Looping statement: C Programming Vs Python Programming

For Loop and While Loop in Python | Looping statement: C Programming Vs Python Programming

What is Algorithm and its properties | Component of Algorithm | Design, Validate, Analyse and Test

What is Algorithm and its properties | Component of Algorithm | Design, Validate, Analyse and Test

Lec 28: Simplification of context free grammar | Unit production, Null production & Useless product

Lec 28: Simplification of context free grammar | Unit production, Null production & Useless product

Longest Increasing Sequence | Gate Problem | Data structure and Algorithm

Longest Increasing Sequence | Gate Problem | Data structure and Algorithm

Longest Common Subsequence Problems | LCS | Longest Increasing Subsequence | CS Gate Problems

Longest Common Subsequence Problems | LCS | Longest Increasing Subsequence | CS Gate Problems

Computer Network: Network Layer, Cipher Text and RSA Problem | Gate Preparation Video Set- III

Computer Network: Network Layer, Cipher Text and RSA Problem | Gate Preparation Video Set- III

Computer Networks: Data Link based problems | Gate preparation video- II | CRC, Sliding window

Computer Networks: Data Link based problems | Gate preparation video- II | CRC, Sliding window

Computer Networks: IP address Problems | Previous year gate questions set- I | GATE BARC ISRO NET

Computer Networks: IP address Problems | Previous year gate questions set- I | GATE BARC ISRO NET

Identify lexical errors | What is lexical errors ? | Types of errors in programming

Identify lexical errors | What is lexical errors ? | Types of errors in programming

How to find token in compiler design ? | Token in compiler design | Lexical Analysis | Gate Problems

How to find token in compiler design ? | Token in compiler design | Lexical Analysis | Gate Problems

What is Token, Identifier, and Lexemes | What is Lexical Errors | Lexical Analysis | Compiler Design

What is Token, Identifier, and Lexemes | What is Lexical Errors | Lexical Analysis | Compiler Design

Advanced Graph Theory week 7 assignment 7 | Swayam Nptel

Advanced Graph Theory week 7 assignment 7 | Swayam Nptel

Introduction to Automata, Languages and Computation week 11 assignment 11

Introduction to Automata, Languages and Computation week 11 assignment 11

advanced graph theory assignment 6 week 6 | swayam nptel

advanced graph theory assignment 6 week 6 | swayam nptel

Introduction to Automata, Languages and Computation Assignment 9 week 9 | Assignment 9 week 9

Introduction to Automata, Languages and Computation Assignment 9 week 9 | Assignment 9 week 9

Introduction to Automata, Languages and Computation Assignment 10 week 10 | Week 10 Assignment 10

Introduction to Automata, Languages and Computation Assignment 10 week 10 | Week 10 Assignment 10

Introduction to Automata, Languages and Computation week 7 assignment 7 | swayam nptel

Introduction to Automata, Languages and Computation week 7 assignment 7 | swayam nptel

Introduction to Automata, Languages and Computation Week 8 Assignment 8 | swayam nptel

Introduction to Automata, Languages and Computation Week 8 Assignment 8 | swayam nptel

Axis Transformation using Excel | how to change axis of XY- plot in excel | Multiple columns axis

Axis Transformation using Excel | how to change axis of XY- plot in excel | Multiple columns axis

TOC GATE LECTURE PART-II | Automata Theory | CFG, PDA, Turing Machine, Recursive enumerable language

TOC GATE LECTURE PART-II | Automata Theory | CFG, PDA, Turing Machine, Recursive enumerable language

Theory of Computation Gate Lecture: Part-I | DFA, NFA, CFG, TYPE-3, TYPE-2, TYPE-1 & TYPE-0 GRAMMAR

Theory of Computation Gate Lecture: Part-I | DFA, NFA, CFG, TYPE-3, TYPE-2, TYPE-1 & TYPE-0 GRAMMAR

How to Find inverse modulo in cryptography | Numerical to find inverse modulo | {HINDI}

How to Find inverse modulo in cryptography | Numerical to find inverse modulo | {HINDI}

RGB Color Model and CMY Color Model with example

RGB Color Model and CMY Color Model with example

Lec-26: Homomorphism & inverse homomorphism | Closure properties of regular language

Lec-26: Homomorphism & inverse homomorphism | Closure properties of regular language

Simplification of context free grammar (Example)

Simplification of context free grammar (Example)

Context free grammar for language L= a^nb^m, where 'n' greater than 'm'

Context free grammar for language L= a^nb^m, where 'n' greater than 'm'

Context free grammar for CFL L = a^nb^mc^n

Context free grammar for CFL L = a^nb^mc^n

Lec-25:Closure Properties of Regular Sets | Regular language closed under union, intersection, Compl

Lec-25:Closure Properties of Regular Sets | Regular language closed under union, intersection, Compl

Ambiguous Grammar Example || Ambiguity in Context Free Grammar || CFG

Ambiguous Grammar Example || Ambiguity in Context Free Grammar || CFG

Ambiguous Grammar || Derivation Tree || Parse Tree || LMD & RMD || Context Free Grammar

Ambiguous Grammar || Derivation Tree || Parse Tree || LMD & RMD || Context Free Grammar

Lec-19: Direct and Indirect recursion | Factorial using recursion LIFO| Recursion in data structure

Lec-19: Direct and Indirect recursion | Factorial using recursion LIFO| Recursion in data structure

Context free grammar for language L = a^nb^n-3

Context free grammar for language L = a^nb^n-3

Apache web server | Linux Networking

Apache web server | Linux Networking

Context Free Grammar for Given Context Free Language | CFL TO CFG

Context Free Grammar for Given Context Free Language | CFL TO CFG

Mealy and Moore machine | Conversion Mealy to Moore model | Moore to Mealy model

Mealy and Moore machine | Conversion Mealy to Moore model | Moore to Mealy model

Lec-00: NFA for beginners | NFA Vs DFA |Conversion NFA to DFA | Non Deterministic Finite Automata

Lec-00: NFA for beginners | NFA Vs DFA |Conversion NFA to DFA | Non Deterministic Finite Automata

Lec-00: DFA for beginners | Deterministic Finite Automata | Mealy and Moore Machine | NFA

Lec-00: DFA for beginners | Deterministic Finite Automata | Mealy and Moore Machine | NFA

First order predicate logic | Knowledge Representation | Resolution & Refutation | FOPL | AI

First order predicate logic | Knowledge Representation | Resolution & Refutation | FOPL | AI

Graph Theory | Simple, Complete, Plannar, Bipartite Graph and Chromatic Number | GATE Problems

Graph Theory | Simple, Complete, Plannar, Bipartite Graph and Chromatic Number | GATE Problems

Lec-00: Automata Theory for begginers | Regular Expression & Languages | Transition matrix TOC

Lec-00: Automata Theory for begginers | Regular Expression & Languages | Transition matrix TOC

Email notification for Google Form responses | Google Quiz

Email notification for Google Form responses | Google Quiz

What is TELNET ? | Linux Networking

What is TELNET ? | Linux Networking

PART-2: Advance Features of Google Form | Quiz with TIMER & Form LIMITER | Manage Responses in excel

PART-2: Advance Features of Google Form | Quiz with TIMER & Form LIMITER | Manage Responses in excel

PART-1: HOW TO DESIGN QUIZ USING GOOGLE FORM | Regular expression in Google Form

PART-1: HOW TO DESIGN QUIZ USING GOOGLE FORM | Regular expression in Google Form

PPPD | Point to point protocol daemon | Linux Networking

PPPD | Point to point protocol daemon | Linux Networking

Mail server | SMTP Vs POP and IMAP | Linux Networking

Mail server | SMTP Vs POP and IMAP | Linux Networking

SAMBA Protocol | Linux Networking

SAMBA Protocol | Linux Networking

Trivial file transfer protocol | tftp

Trivial file transfer protocol | tftp

Server message block | SMB

Server message block | SMB

File Transfer Protocol | FTP (TCP/IP)

File Transfer Protocol | FTP (TCP/IP)

Network File System | NFS

Network File System | NFS

Domain Name System | DNS Server

Domain Name System | DNS Server

Networking services in Linux | Client Server Model

Networking services in Linux | Client Server Model

Layered Pattern Architecture of distributed database | N-Tier pattern

Layered Pattern Architecture of distributed database | N-Tier pattern

MVC Architecture | Model View Controller Architecture of Distributed Database

MVC Architecture | Model View Controller Architecture of Distributed Database

Peer to peer architecture in distributed database

Peer to peer architecture in distributed database

Master Slave Architecture | Distributed Data Base

Master Slave Architecture | Distributed Data Base

Client Server Architecture | Distributed Data Base

Client Server Architecture | Distributed Data Base

Architecture of distributed data base in hindi | Mtech 2nd sem computer science

Architecture of distributed data base in hindi | Mtech 2nd sem computer science

Architecture of distributed database : Brief Introduction

Architecture of distributed database : Brief Introduction

TIC TAC TOE GAME PLAYING | PROBLEM AS A STATE SPACE SEARCH | Artificial Intelligence

TIC TAC TOE GAME PLAYING | PROBLEM AS A STATE SPACE SEARCH | Artificial Intelligence

TIC-TAC-TOE GAME PLAYING | PROBLEM AS A STATE SPACE SEARCH | Artificial Intelligence

TIC-TAC-TOE GAME PLAYING | PROBLEM AS A STATE SPACE SEARCH | Artificial Intelligence

8 puzzle game playing using A* Algorithm

8 puzzle game playing using A* Algorithm

A* Algorithm | OR-GRAPH | A* Admissible | Underestimation and Overestimation condition in A*

A* Algorithm | OR-GRAPH | A* Admissible | Underestimation and Overestimation condition in A*

A* Algorithm | OR Graph | Artificial Intelligence

A* Algorithm | OR Graph | Artificial Intelligence

AO* Algorithm in Artificial Intelligence | AND-OR Graph in Artificial Intelligence

AO* Algorithm in Artificial Intelligence | AND-OR Graph in Artificial Intelligence

AO* Algorithm | AND/OR Graph | Artificial Intelligence

AO* Algorithm | AND/OR Graph | Artificial Intelligence

ARTIFICIAL INTELLIGENCE | A* HEURISTIC ALGORITHM | OR-GRAPH

ARTIFICIAL INTELLIGENCE | A* HEURISTIC ALGORITHM | OR-GRAPH

Disk partition in Linux system | Advantage of disk partitioning | System information using 'uname'

Disk partition in Linux system | Advantage of disk partitioning | System information using 'uname'

How to add, modify, delete users and groups in Linux system

How to add, modify, delete users and groups in Linux system

System Administration | Log files & config files

System Administration | Log files & config files

Lec-XI: Flowchart for Pyramid Triangle | Triangle pattern and pyramid | flowchart vs algorithm

Lec-XI: Flowchart for Pyramid Triangle | Triangle pattern and pyramid | flowchart vs algorithm

Lec-X: Check a number is palindrome or not | Flowchart for palindrome | What is palindrome

Lec-X: Check a number is palindrome or not | Flowchart for palindrome | What is palindrome

Lec-IX: Fibonacci series | Flowchart for fibonacci series | Flowchart and Algorithms

Lec-IX: Fibonacci series | Flowchart for fibonacci series | Flowchart and Algorithms

Lec- VIII: Flowchart for Decimal to octal conversion | Flowchart and Algorithms

Lec- VIII: Flowchart for Decimal to octal conversion | Flowchart and Algorithms

Lec-VII: Flowchart for Decimal to binary conversion | Flowchart and Algorithms

Lec-VII: Flowchart for Decimal to binary conversion | Flowchart and Algorithms

Lec- III: Flowchart to check a number is prime or not

Lec- III: Flowchart to check a number is prime or not

Lec- II: Flowchart to check a number is even or odd

Lec- II: Flowchart to check a number is even or odd

Lec- I: Introduction to flowchart | Symbols for Flowchart | Flowchart for loop

Lec- I: Introduction to flowchart | Symbols for Flowchart | Flowchart for loop

Artificial intelligence quiz solution

Artificial intelligence quiz solution

Lec- VI: Flowchart for HCF of two numbers | Algorithms to find HCF

Lec- VI: Flowchart for HCF of two numbers | Algorithms to find HCF

Lec- XII: Flow chart for series 1+2+4+5+7+8+ ... | Computer science | Flowchart and Algorithms

Lec- XII: Flow chart for series 1+2+4+5+7+8+ ... | Computer science | Flowchart and Algorithms

Lec- XIV: Flowchart for sum series 2^0 + 2^1 + 2^2 + .... | Flowchart and Algorithms for sum series

Lec- XIV: Flowchart for sum series 2^0 + 2^1 + 2^2 + .... | Flowchart and Algorithms for sum series

Lec- XIII: Flowchart for sum series 1!*1 + 2!*2 + 3!*3 + ... | 1!/1 + 2!/2 + 3!/3 + ...

Lec- XIII: Flowchart for sum series 1!1 + 2!2 + 3!*3 + ... | 1!/1 + 2!/2 + 3!/3 + ...

Lec- V: Flowchart to find LCM of n Numbers | Algorithms to find LCM of N numbers

Lec- V: Flowchart to find LCM of n Numbers | Algorithms to find LCM of N numbers

Lec- IV: Flowchart for LCM of two numbers | Flowchart for LCM of N numbers

Lec- IV: Flowchart for LCM of two numbers | Flowchart for LCM of N numbers

Lec- XVII: Flowchart for sum series: 1 + x^2/2! + x^4/4! + ....

Lec- XVII: Flowchart for sum series: 1 + x^2/2! + x^4/4! + ....

Lec- XVI:Flow chart for sum series: X - X^3/3! + X^5/5! - X^7/7! + ....

Lec- XVI:Flow chart for sum series: X - X^3/3! + X^5/5! - X^7/7! + ....

Lec-XV: Flowchart for sum series 1!*1 + 2!*2 + ... + N!*N | 1!/1 + 2!/2 + ... + N!/N |2^0 + 2^1 +..

Lec-XV: Flowchart for sum series 1!1 + 2!2 + ... + N!*N | 1!/1 + 2!/2 + ... + N!/N |2^0 + 2^1 +..

Process Life Cycle in Linux | Process phases

Process Life Cycle in Linux | Process phases

Positional parameters in Linux

Positional parameters in Linux

File test operators in Linux | File concepts in Linux

File test operators in Linux | File concepts in Linux

Problem based on Selective repeat and go back n arq

Problem based on Selective repeat and go back n arq

Basic concepts of Fibonacci heap | Algorithm

Basic concepts of Fibonacci heap | Algorithm

Break and Continue statement | Linux and shell programming

Break and Continue statement | Linux and shell programming

Propositional logic in ai | Converse, Inverse and Contrapositive Propositional logic

Propositional logic in ai | Converse, Inverse and Contrapositive Propositional logic

For loop, while loop & until loop | Loop in Shell Script

For loop, while loop & until loop | Loop in Shell Script

Case statement in shell script | Conditional statement

Case statement in shell script | Conditional statement

Propositional Logic, Conjunction & Disjunction | Knowledge Representation |Converse & contrapositive

Propositional Logic, Conjunction & Disjunction | Knowledge Representation |Converse & contrapositive

If else condition in Linux and shell programming | Conditional statement

If else condition in Linux and shell programming | Conditional statement

Relational operators, Bitwise operators and Boolean operators

Relational operators, Bitwise operators and Boolean operators

How to write and execute shell program | Addition of two numbers

How to write and execute shell program | Addition of two numbers

Standard Streams in Linux

Standard Streams in Linux

Cryptarithmetic problem using constraint satisfaction | Artificial intelligence

Cryptarithmetic problem using constraint satisfaction | Artificial intelligence

'pipe' and 'tee' COMMANDS in Linux

'pipe' and 'tee' COMMANDS in Linux

what is constraint Satisfaction | Constraints Satisfaction Problems | Artificial intelligence

what is constraint Satisfaction | Constraints Satisfaction Problems | Artificial intelligence

8 Puzzle problem using A* algorithm | Artificial intelligence

8 Puzzle problem using A* algorithm | Artificial intelligence

Best First Search Technique: Informed search | OR Graph

Best First Search Technique: Informed search | OR Graph

Informed search and uninformed search | Heuristic search | Blind search

Informed search and uninformed search | Heuristic search | Blind search

Difference between A* and AO* Algorithm

Difference between A* and AO* Algorithm

$Pushdown Automata for L = {a^ib^j | i -le 2*j & j -le 2*i}$

Pushdown Automata for L = {a^ib^j | i -le 2j & j -le 2i}

Distributed database introduction | Homogeneous and heterogeneous distributed system

Distributed database introduction | Homogeneous and heterogeneous distributed system

What is parallel computing and distributed database system | Parallel Vs Distributed System

What is parallel computing and distributed database system | Parallel Vs Distributed System

Actual meaning of multiuser and multitasking | Linux tutorial

Actual meaning of multiuser and multitasking | Linux tutorial

Lec- 15: vi editor in details | Linux tutorial

Lec- 15: vi editor in details | Linux tutorial

Lec- 14: File Permissions and Ownership | Read, write & execute (rwx) | Linux Tutorial

Lec- 14: File Permissions and Ownership | Read, write & execute (rwx) | Linux Tutorial

Bernoulli Process | Information Theory and Cryptography

Bernoulli Process | Information Theory and Cryptography

Hard link and Soft link in Linux | What is hard link ? | Difference between hard link and soft link

Hard link and Soft link in Linux | What is hard link ? | Difference between hard link and soft link

7 fundamental file types in linux | Linux tutorial

7 fundamental file types in linux | Linux tutorial

What is mounting and unmounting in Linux | mount and umount commands in linux

What is mounting and unmounting in Linux | mount and umount commands in linux

Inode and inode number | file system | Linux tutorial

Inode and inode number | file system | Linux tutorial

rm, rmdir, whoami, grep, history, whatis commands

rm, rmdir, whoami, grep, history, whatis commands

move, copy, mkdir commands | linux tutorial

move, copy, mkdir commands | linux tutorial

ls, ls -l, cd, cd .., cat commands | Commands to read file and create directory

ls, ls -l, cd, cd .., cat commands | Commands to read file and create directory

cal date Command LINUX/UNIX

cal date Command LINUX/UNIX

Basic commands LINUX/UNIX

Basic commands LINUX/UNIX

Internal and External commands | Basic understanding of commands

Internal and External commands | Basic understanding of commands

LECTURE- VII: Relative and absolute pathname

LECTURE- VII: Relative and absolute pathname

LECTURE- VI: File System | Ordinary, Directory and Device file | Unix file system

LECTURE- VI: File System | Ordinary, Directory and Device file | Unix file system

LECTURE-V: Linux Distribution (DISTROs) | Ubuntu Debian Mint CentOS Fedora

LECTURE-V: Linux Distribution (DISTROs) | Ubuntu Debian Mint CentOS Fedora

LECTURE-IV: Linux Vs Unix | Difference between Linux and unix

LECTURE-IV: Linux Vs Unix | Difference between Linux and unix

LECTURE - III: Features of UNIX | Multiuser and multitasking

LECTURE - III: Features of UNIX | Multiuser and multitasking

LECTURE -II : UNIX ARCHITECTURE

LECTURE -II : UNIX ARCHITECTURE

Lecture- I: Introduction to Linux and Shell Programming

Lecture- I: Introduction to Linux and Shell Programming

Adjoint of a matrix in hindi | Cofactor matrix in hindi | Minor in matrix

Adjoint of a matrix in hindi | Cofactor matrix in hindi | Minor in matrix

Inverse of a matrix

Inverse of a matrix

Inverse of a matrix | Inverse of a 3 X 3 matrix using adjoint

Inverse of a matrix | Inverse of a 3 X 3 matrix using adjoint

Lec-48: Prove Height of AVL tree = 1.44*log(n) | Find height of AVL tree

Lec-48: Prove Height of AVL tree = 1.44*log(n) | Find height of AVL tree

Adjoint of matrices | what is cofactor of a matrix |How to find Adjoint of 3 X 3 Matrix

Adjoint of matrices | what is cofactor of a matrix |How to find Adjoint of 3 X 3 Matrix

Find utilization of channel for given bandwidth | Stop and wait ARQ | data link layer

Find utilization of channel for given bandwidth | Stop and wait ARQ | data link layer

Lec-47: why AVL tree height is 1.44*log(n) ? | How to get height of AVL tree?

Lec-47: why AVL tree height is 1.44*log(n) ? | How to get height of AVL tree?

Trapezoidal rule | Numerical Methods | Engineering Mathematics

Trapezoidal rule | Numerical Methods | Engineering Mathematics

Newton Raphson Method

Newton Raphson Method

Problem based on Simpson's 1/3rd Problem | Concepts of Simpson's 1/3rd

Problem based on Simpson's 1/3rd Problem | Concepts of Simpson's 1/3rd

Simpson's 1/3rd Rule

Simpson's 1/3rd Rule

Problem based on Regula Falsi Method | False Position Method | Numerical Methods

Problem based on Regula Falsi Method | False Position Method | Numerical Methods

Newton Raphson Method | Newton's Method to find approximate root

Newton Raphson Method | Newton's Method to find approximate root

Lec-09: Tower of Hanoi Problem in Data Structure | TOH practical example

Lec-09: Tower of Hanoi Problem in Data Structure | TOH practical example

Priority encoder GATE problems | Problem based on priority encoder

Priority encoder GATE problems | Problem based on priority encoder

Properties of entropy in cryptography and information theory

Properties of entropy in cryptography and information theory

Huffman Coding in cryptography and information theory

Huffman Coding in cryptography and information theory

Problem based on Huffman coding | Cryptography and information theory (M.Tech.)

Problem based on Huffman coding | Cryptography and information theory (M.Tech.)

What is potential function ? | Potential function in Fibonacci heap

What is potential function ? | Potential function in Fibonacci heap

Fibonacci heap data structure | Fibonacci heap structure

Fibonacci heap data structure | Fibonacci heap structure

Binomial heap data structure | Properties of binomial heap

Binomial heap data structure | Properties of binomial heap

Operations of heap data structure | Binary heap vs Binomial heap vs fibonacci heap

Operations of heap data structure | Binary heap vs Binomial heap vs fibonacci heap

Entropy in information theory | Problems to calculate entropy in Information Theory

Entropy in information theory | Problems to calculate entropy in Information Theory

Properties of Information Theory | prove information is zero | Information is combined for messages

Properties of Information Theory | prove information is zero | Information is combined for messages

Properties of information | Uncertainty of information | Principle of improbability

Properties of information | Uncertainty of information | Principle of improbability

Problem based on measure of information | Information content given | Information theory and cryptog

Problem based on measure of information | Information content given | Information theory and cryptog

Expression Conversion for given infix algebraic expression

Expression Conversion for given infix algebraic expression

Prefix and postfix expression from given Algebraic expression

Prefix and postfix expression from given Algebraic expression

Algebraic Expression to Tree construction | Infix to Prefix and Postfix conversion

Algebraic Expression to Tree construction | Infix to Prefix and Postfix conversion

What is information theory ? | Measure of Information | M.Tech Second Semester Information Theory

What is information theory ? | Measure of Information | M.Tech Second Semester Information Theory

How to get cipher text | problem based on cipher text | Cryptography | Public key and Private key

How to get cipher text | problem based on cipher text | Cryptography | Public key and Private key

How to find public key pair ? | How to find private key pair ? | Problems from cryptography

How to find public key pair ? | How to find private key pair ? | Problems from cryptography

Problem based on sub networking | GATE Problem | Computer Nework

Problem based on sub networking | GATE Problem | Computer Nework

Problem based on sliding window protocol | Piggybacking | Computer Networks

Problem based on sliding window protocol | Piggybacking | Computer Networks

Numerical based on NETWORK LAYERs | Subnetwork problems | Default mask and subnet mask problems

Numerical based on NETWORK LAYERs | Subnetwork problems | Default mask and subnet mask problems

Problem Based on Flag Delimiter | Data Link Layer | Computer Networks

Problem Based on Flag Delimiter | Data Link Layer | Computer Networks

Computer Network Problem Set -III

Computer Network Problem Set -III

Cyclic Redundancy Check (CRC) Problem with proper example | Error Detection | Computer Networking

Cyclic Redundancy Check (CRC) Problem with proper example | Error Detection | Computer Networking

Computer Networks Problem Set -II

Computer Networks Problem Set -II

Computer Networks Gate practice questions | Problem Set -I | GATE BARC ISRO NET | OSI model layers

Computer Networks Gate practice questions | Problem Set -I | GATE BARC ISRO NET | OSI model layers

LAST MOMENT TIPS FOR GATE 2020 | PREPARATION PLAN | HOW TO ATTEMPT GATE PAPER 2020

LAST MOMENT TIPS FOR GATE 2020 | PREPARATION PLAN | HOW TO ATTEMPT GATE PAPER 2020

Pragramming Challenge | C & Data Structure | Placement questions

Pragramming Challenge | C & Data Structure | Placement questions

Programming challenge | C and Data Structure | Placement questions

Programming challenge | C and Data Structure | Placement questions

Graph Theory Part - III | A Quick Revision GATE 2021

Graph Theory Part - III | A Quick Revision GATE 2021

Graph Theory Part - II | A Quick Revision GATE 2021

Graph Theory Part - II | A Quick Revision GATE 2021

Compiler Design Problem set - III | A Quick GATE 2021 Revision

Compiler Design Problem set - III | A Quick GATE 2021 Revision

Compiler Design Problem Set -I | A Quick Revision GATE 2020

Compiler Design Problem Set -I | A Quick Revision GATE 2020

Compiler Design Problem set - II

Compiler Design Problem set - II

Automata Theory Problem Set - V | A quick revision GATE 2021

Automata Theory Problem Set - V | A quick revision GATE 2021

Automata Theory Problem Set -IV | A Quick Revision GATE 2020

Automata Theory Problem Set -IV | A Quick Revision GATE 2020

Automata Theory Problem Set - III | A Quick Revision GATE 2020

Automata Theory Problem Set - III | A Quick Revision GATE 2020

Automata Theory Problem Set -II | A Quick Revision GATE 2020

Automata Theory Problem Set -II | A Quick Revision GATE 2020

Problem set -I | Automata Theory | A Quick Revision GATE 2020

Problem set -I | Automata Theory | A Quick Revision GATE 2020

Discrete Mathematics Problem Set-III | A Quick Revision GATE 2020

Discrete Mathematics Problem Set-III | A Quick Revision GATE 2020

Graph Theory (Part -I): A Quick Revision GATE 2021

Graph Theory (Part -I): A Quick Revision GATE 2021

Discrete Mathematics Problem Set- II : A Quick Revision GATE 2021

Discrete Mathematics Problem Set- II : A Quick Revision GATE 2021

Discrete Mathematics : A quick revision GATE 2021 | SET -1

Discrete Mathematics : A quick revision GATE 2021 | SET -1

ENGINEERING MATHEMATICS PROBLEM SET -III | A QUICK REVISION GATE 2020

ENGINEERING MATHEMATICS PROBLEM SET -III | A QUICK REVISION GATE 2020

Engineering Mathematics PROBLEM SET- II: A Quick Revision GATE 2020

Engineering Mathematics PROBLEM SET- II: A Quick Revision GATE 2020

Engineering Mathematics PROBLEM SET - I: A QUICK REVISION GATE 2020

Engineering Mathematics PROBLEM SET - I: A QUICK REVISION GATE 2020

Lec-12: Calculate address of array elements | Row major and Column major array implementation

Lec-12: Calculate address of array elements | Row major and Column major array implementation