Pages



Home



View All results for ""

Arogya Thapa Magar

Articles by "Fitur"

No posts with label Fitur. Show all posts

Subscribe to: Posts (Atom)

Social

Recent Popular Comments

Recent Posts

Popular Posts

NFA with Epsilon-Transition (ε-NFA) | Epsilon-Closure (ε-Closure) of a state | Extended Transition Function of ε-NFA | Theory Of Computation (TOC)

NFA with Epsilon-Transition (ε-NFA) | Epsilon-Closure (ε-Closure) of a state | Extended Transition Function of ε-NFA | Theory Of Computatio...
Eliminating Epsilon transition (ε-Transitions) | Conversion of Epsilon-NFA to DFA | Conversion of Epsilon-NFA to NFA | Theory Of Computation (TOC)

Theory Of Computation (TOC) | Eliminating Epsilon Transition ( ε -Transitions) : Given any Epsilon NFA (ε-NFA) , we can ﬁnd a DFA D that a...
Computer Networks | Types of Network according to Physical Span | Advantages and Disadvantages of Computer Networks

Computer Network According to Tanenbaum , computer network is a collection of ―autonomous‖ computers interconnected by a single technology. ...
C++ code to find sum of two numbers given by user

Source Code #include<iostream> using namespace std; int main() { int n1,n2,sum; cout<<"Enter any Two numbers \n"; //...
Automata Theory | Deterministic Finite Automata (DFA) | Transition Table | Transition Diagrams | Language of DFA | Theory Of Computation (TOC)

Automata Theory Automata (singular: automation) are abstract models of machines that perform computations on an input by moving through a se...
Selection Sort

Selection Sort A selection sort is a sorting techniqlue in which successive elements are selected in order and paced into their proper sorte...
C Program to find the odd numbers

#include<stdio.h> int main() {int i,n; printf("Enter the number "); scanf("%d",&n); for(i=0; i<=n;i+=2) pri...
Huffman Coding | DAA

Huffman coding Huffman coding is an algorithm for the lossless compression of ﬁles based on the frequency of occurrence of a symbol in the ﬁ...
Non Deterministic Finite Automata | Language of NFA | Extended transition function of NFA | Theory Of Computation (TOC)

Non Deterministic Finite Automata (NFA): Like the DFA, a NFA has a ﬁnite set of states, a finite set of input symbols, one start state, a s...
Heap Sort

Heap Sort A heap is a nearly complete binary tree with the following two properties: Structural property: all levels are full, except poss...

Recent Comments

Popular Posts

NFA with Epsilon-Transition (ε-NFA) | Epsilon-Closure (ε-Closure) of a state | Extended Transition Function of ε-NFA | Theory Of Computation (TOC)

NFA with Epsilon-Transition (ε-NFA) | Epsilon-Closure (ε-Closure) of a state | Extended Transition Function of ε-NFA | Theory Of Computatio...
Eliminating Epsilon transition (ε-Transitions) | Conversion of Epsilon-NFA to DFA | Conversion of Epsilon-NFA to NFA | Theory Of Computation (TOC)

Theory Of Computation (TOC) | Eliminating Epsilon Transition ( ε -Transitions) : Given any Epsilon NFA (ε-NFA) , we can ﬁnd a DFA D that a...
Computer Networks | Types of Network according to Physical Span | Advantages and Disadvantages of Computer Networks

Computer Network According to Tanenbaum , computer network is a collection of ―autonomous‖ computers interconnected by a single technology. ...
C++ code to find sum of two numbers given by user

Source Code #include<iostream> using namespace std; int main() { int n1,n2,sum; cout<<"Enter any Two numbers \n"; //...
Automata Theory | Deterministic Finite Automata (DFA) | Transition Table | Transition Diagrams | Language of DFA | Theory Of Computation (TOC)

Automata Theory Automata (singular: automation) are abstract models of machines that perform computations on an input by moving through a se...
Selection Sort

Selection Sort A selection sort is a sorting techniqlue in which successive elements are selected in order and paced into their proper sorte...
C Program to find the odd numbers

#include<stdio.h> int main() {int i,n; printf("Enter the number "); scanf("%d",&n); for(i=0; i<=n;i+=2) pri...
Huffman Coding | DAA

Huffman coding Huffman coding is an algorithm for the lossless compression of ﬁles based on the frequency of occurrence of a symbol in the ﬁ...
Non Deterministic Finite Automata | Language of NFA | Extended transition function of NFA | Theory Of Computation (TOC)

Non Deterministic Finite Automata (NFA): Like the DFA, a NFA has a ﬁnite set of states, a finite set of input symbols, one start state, a s...
Heap Sort

Heap Sort A heap is a nearly complete binary tree with the following two properties: Structural property: all levels are full, except poss...

Labels

C Patterns
C Programming
C Programming Theory
Computer Network
Cpp Programming
Cryptography
Data Structure and Algorithm
Database Management System (DBMS)
Design and Analysis Of Algorithm (DAA)
Differences
Discrete Mathematics
Disk Scheduling Algorithm
Graphics
Information Technology
Numerical Methods
Object Oriented Programming
Operating System
Python Theory
Searching
Simulation And Modeling
Sorting
System Analysis and Design (SAD)
Theory Of Computation(TOC)
TOC Program
Web Technology

Blog Archive

▼ 2020 (22)
- ▼ February (3)
- ► January (19)

► 2019 (84)
- ► December (26)
- ► November (21)
- ► September (6)
- ► August (12)
- ► July (2)
- ► June (2)
- ► April (2)
- ► March (7)
- ► February (3)
- ► January (3)

► 2018 (126)
- ► December (3)
- ► October (1)
- ► September (9)
- ► July (6)
- ► June (22)
- ► May (9)
- ► April (7)
- ► March (25)
- ► February (37)
- ► January (7)

Random Post

Like On Facebook



Name

your name

Email *

Your Email

Message *

your message

Featured Posts

Recent Post

Random Posts

Arogya Thapa Magar © 2016-2017. All Rights Reserved.

Pages

Home

Back To Top