58 тысяч подписчиков
425 видео
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
Longest Increasing Sequence | Gate Problem | Data structure and Algorithm
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 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
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
What is Token, Identifier, and Lexemes | What is Lexical Errors | Lexical Analysis | Compiler Design
Advanced Graph Theory week 7 assignment 7 | Swayam Nptel
Introduction to Automata, Languages and Computation week 11 assignment 11
Lec-12: Calculate address of array elements | Row major and Column major array implementation
Break and Continue statement | Linux and shell programming
If else condition in Linux and shell programming | Conditional statement
Lec- 15: vi editor in details | Linux tutorial
LECTURE -II : UNIX ARCHITECTURE
Context free grammar for language L = a^nb^n-3
What is mounting and unmounting in Linux | mount and umount commands in linux
C Program to read a character, an integer and a float variable
Internal and External commands | Basic understanding of commands
Lec- VIII: Flowchart for Decimal to octal conversion | Flowchart and Algorithms
What is Priority Encoder ? | 4 to 2 encoder | Priority encoder with example
How to write and execute shell program | Addition of two numbers
Ambiguous Grammar Example || Ambiguity in Context Free Grammar || CFG
Flow Network | Maximum Flow in Network | Ford Fulkerson
Insertion of a new node at any position in Linked List
Lec-16: Infix to Prefix and Postfix Conversion| Explained with proper example | STACK | LIFO
Distributed database introduction | Homogeneous and heterogeneous distributed system
Trivial file transfer protocol | tftp
For loop, while loop & until loop | Loop in Shell Script
Difference between A* and AO* Algorithm
Lec-07: Top Down and Bottom Up Approach | Top Down Approach | Bottom up Approach | Easy Explanation
What is ENCODER? | Encoder with example
Context Free Grammar for Given Context Free Language | CFL TO CFG
Priority encoder GATE problems | Problem based on priority encoder
Lec-15: Expressions in data structure | infix prefix and postfix expression | STACK | LIFO
Phases of Compiler | What is cross compiler ? | What is source to source compiler ?
What is Ethernet ? | Frame format of Ethernet | LAN and Wireless LAN | IEEE 802.3 standard | 802.11
LECTURE- VI: File System | Ordinary, Directory and Device file | Unix file system
Binomial heap data structure | Properties of binomial heap
Lec-18: Algorithm to transform Postfix Expression into Infix and Prefix Expression
What is TELNET ? | Linux Networking
Fibonacci heap data structure | Fibonacci heap structure
File test operators in Linux | File concepts in Linux
Lec-18: Evaluation of Postfix and Prefix expression using STACK |LIFO
System Administration | Log files & config files
Comma Operator in C Language | Comma as a Separator VS Comma as an Operator
Lec-18: Mealy Machine to Moore Machine Conversion
Lecture- I: Introduction to Linux and Shell Programming
Array Implementation : Row major and Column major | What is Row Major Implementation ?
Context free grammar for language L= a^nb^m, where 'n' greater than 'm'
