Computer Notes, Programming codes, Hardware and Networking Tip, Entertainment, Biography, Internet Tip, Tech News, Latest Technology, YouTube,

Latest Post
About RAM Advantages of multiprocessing system Associative memory Binary Number System CA CA Notes Change drive icon change pendrive icon Computer Abbreviation Computer Architecture Computer fundamental MCQ Computer Generation Computer generation computer notes Computer MCQ Computer Network MCQ Computer Operator MCQ Critical Section Critical section in OS Database connectivity in java Deadlock avoidance Deadlock detection algorithm Deadlock Detection and Recovery Deadlock detection method Deadlock Handling Deadlock in OS Deadlock Prevention Deadlock Recovery define object and class Define system cell Descrete Structure Device Driver Device driver in computer device driver in os DFA DFA contains with DFA ends with dfa examples dijkstra's algorithm Discrete Structure Discrete Structure graph theory Download JDBC Driver Download MySql Download PUBG DS DS Notes FCFS Job Scheduling Algorithm Finding shortest path Finite Sate Automata Flynn's Classifications fragmentation in computer fragmentation in harddisk fragmentation in os fragmented memory Full form related to computer Generations of operations Generations of OS Graph theory ICT 1st semester notes Instruction Address Modes Java java array declaration java class and object example Java Database connectivity example java event handling example program Java JDBC Java JMenuBar Java JSP program example java notes java program methods example Java program to create class and object java program to create methods java program to print even number between any two numbers Java programming java programming notes Java programs Java question answer java swing example java swing program to calculate simple interest Java Tutorials JSP program learn qbasic Lekh MCQ MCQ Computer MCQ Operating System memory fragmentation MICT 1st semester notes mict 1st semester operating system notes MICT first semester notes Multiprocessing mutex in os Necessary conditions for deadlock Number System Operating System Operating system notes OS OS Notes OS Numeric pattern printing program in qbasic patterns in qbasic Pipeline Hazards Pipelining Pipelining concept prime or composite in qbasic print patterns qbasic print series in qbasic Printing Series in qbasic PUBG PUBG Mobile PUBG PC PUBG Story qbasic qbasic code qbasic for class 10 qbasic for class 8 qbasic for class 9 qbasic for school QBASIC Pattern printing qbasic pattern printing program qbasic pattern printing programs qbasic pattern types qbasic patterns qbasic programming tutorials qbasic programs qbasic sequence printing programs qbasic tutorials Race Condition in Operating system reverse order in qbasic RISC and CISC RISC Pipeline Scheduling algorithm segmentation in operating system segmentation in os semaphore and mutex Semaphore concept in os Semaphore in os semaphore in os notes semaphore meaning sequential programs in qbasic series in qbasic series printing programs in qbasic shell in operating system shell in os shortest path shortest path algorithm simple interest program in java swing System Bus System Cell Teach Blog Tech Blog Tech School technical school The Shell in Operating system types of fragmentation Types of Multiprocessor types of operating system Types of pipeline hazards View Connected Wifi password Virtual Memory Virtual memory in OS Von Neumann's architecture What is associative memory? what is class? What is computer system? What is Fragmentation? What is jsp? what is object? What is process? What is segmentation What is System Cell What is Thread? what is virtual memory in computer What is virtual memory? पब्जी गेम


Computer Abbreviation from A to Z.
ABC
Atnasoff Berry Computer
AC
Alternating Current
Admin
Administrator
AGP
Accelerated Graphs Port
AI
Artificial Intelligence
ALGOL
Algorithmic Oriented Language
ALU
Arithmetic Logic Unit
AM
Amplitude Modulation
a. m
Ante Meridian
ANSI
American National Standards Institute
API
Application Programming Interface
ARPA
Advance Research Project Agency
ARPANET
Advance Research Project Agency Network
ASCII
American Standard Code for Information Interchange
ASP
Active Server Page
ATM
Automated Teller Machine
.bat
Batch
BASIC
Beginners All Symbolic Instruction Code
BSS
Bulletin Board System
BCC
Blind Carbon Copy
BCD
Binary Coded Decimal
BCR
Bar Code Reader
BINAC
Binary Automatic Computer
BIOS
Basic Input Output
Bits
Binary Digits
BOF
Beginning of File
BPS
Bits Per Second
CC
Carbon Copy
CAD
Computer Aided Designing
CAI
Computer Aided Instruction
CAL
Computer Assisted Learning
CD
Compact Disk
CD / RW
Compact Disk Read and Write
CD-ROM
Compact Disk Read Only Memory
CGA
Colored Graphics Adapter
CIS
Computer Information System
CMOS
Complementary Metallic Oxide Semiconductor
COBOL
Common Business Oriented Language
COM
Computer Output to Microfilm
CON
Console
PC/M
Computer Program For Microcomputers
CPS
Character Per Second
CPU
Central Processing Unit
CRT
Cathode Ray Tube
CTR
Computing Tabulating Recording
CU
Control Unit
CUI
Character User Interface
DC
Direct Current
DCS
Desktop Color Separations
DCU
Device Control Unit
DDE
Dynamic Data Exchange
DIMM
Dual In-line Memory Module
DIP
Dual Inline Package
DLL
Dynamic Linked Library
DMA
Direct Memory Access
DNS
Domain System
DOS
Disk Operating System
DPI
Dots Per Inch
DPMS
Display Power Management Signaling
DRAM
Dynamic Random Access Memory
DSHD
Double Sided High Density
DSI
Data System International
DTE
Data Terminal Equipment
DVD
Digital Video Disk / Digital Versatile Disk

EB
Exa byte
EDB
External Data Bus
EDP
Electronic Data Processing
EDSAC
Electronic Delay Storage Automatic Computer
EDVAC
Electronic Discrete Variable Automatic Computer
EEPROM
Electronically Erasable and Programmable Read Only Memory
EGA
Enhanced Graphics Adapter
EIDE
Enhanced Integrated Drive Electronics
EISA
Extended Industry Standard Architecture
E-Mail
Electronic Mail
EMS
Expanded Memory System
ENIAC
Electronic Numerical Integrator and Calculator
EPROM
Erasable Programmable Read Only Memory
ESD
Electro Static Discharge
FAT
File Allocation Table
FDD
Floppy Disk Drive
F-Disk
Fixed Disk
FTP
File Transfer protocol
FM
Frequency Modulation
GaAs
Gallium Arsenide
GB
Giga Bytes
GDI
Graphical Device Interface
GIF
Graphic Interchange Format
GIGO
Garbage In - Garbage Out
GDP
General Protection Fault
GUI
Graphic User Interface
HDD
Hard Disk Drive
HMA
High Memory Area
HRR
Horizontal Refresh Rate
HTTP
Hyper Text Transfer Protocol
I/O
Input/Output
IBM
International Business Machine
IC
Integrated Circuit
ICL
International Computer Limited
IDE
Integrated Device Electronics
IEEE
Institute of Electrical and Electronics Engineers
IFF
Interchange File Format
IMS
Information Management System
IP
Internet Protocol
IRC
Internet Relay Chat
ISA
Industry Standard Architecture
ISD
International Subscriber Dialing
ISP
Internet Service Provider
IT
Information Technology
JPEG
Joint Photographic Expert Group
KB
Kilo Byte
LAN
Local Area Network
LBA
Logical Block Addressing
LCD
Liquid Crystal Display
LED
Light Emitting Diode
LIM
Lotus Inter Microsoft
LPT
Line Printer
LSI
Large Scale Integration
LSIC
Large Scale Integrated Circuit
MAN
Metropolitan Area Network
MB
Mega Byte
MC
Master Copy
MCGA
Multi Coloured Graphic Adapter
MDA
Monochrome Display Adapter
MFM
Modified Frequency Modulation
MHz
Megahertz
MICR
Magnetic Ink Character Recognition
MIDI
Musical Instrument Digital Interface
MIME
Multipurpose Internet Mail Extensions
MIPS
Million Instructions Per Second
MODEM
Modulator and Demodulator
MOS
Metal Oxide Semiconductor
MS-DOS
Microsoft Disk Operating System
MSI
Medium Scale Integration
MU
Memory Unit
NAV
Norton Anti Virus
NCC
National Computer Center
NDD
Norton Disk Doctor
NTSC
National Television Standards Committee
OAS
Optical Automation System
OCP
Order Code Processor
OCR
Optical Character Recognition
ODD
Optical Disk Drive
OLE
Object Linking and Embedding
OMR
Optical Mark Reader (Recognition)
OS
Operating System
OS/2
Operating System -2
PB
Peta byte
PC
Personal Computer
PCI
Peripheral Component Interconnect
PDF
Portable Document Format
PIO
Programmed Input/Output
Pixel
Picture Element
PM
Post Meridiem
PNG
Portable Network Graphic
POST
Power On Self Test
PPP
Point to Point Protocol
PPTP
Point to Point Tunneling Protocol
PROM
Programming Read Only Memory
PS/2
Personal System 2
QBASIC
Quick Beginners All Purpose Symbolic Instruction Code
RAM
Random Access Memory
RPG
Report Program Generator
RISC
Reduced Instruction Set Computing
RJ
Radio Jockey
ROM
Read Only Memory
RPM
Revolutions Per Minute
.sys
System
SCP
System Control processor
SCSI
Small Computer System Interface
SIM
Subscriber Identity Module
SIMM
Single Inline Memory Module
SIPP
Single Inline Pinned Package
SMS
Sort Message Service
SMM
System Memory Management
SPA
Software Publisher Association
STP
Shielded Twisted Pair
SII
Small Scale Integrated
SVGA
Super Video Graphic Array
SW
Short Wave


TB
Tera Byte
TCP/IP
Transmission Control Protocol / Internet Protocol
ULSI
Ultra Large Scale Integration
UMB
Upper Memory Block
UNIVAC
Universal Automatic Computer
UPS
Uninterruptible Power Supply
URL
Uniform Resource Locator
USB
Universal Serial BUS
UTP
Unshielded Twisted Pair
VDM
Virtual Dos Machine
VDU
Visual Display Unit
VESA
Video Electronics Standards Association
VGA
Video Graphic Adapter
VLSI
Very Large Scale Integration
VPN
Virtual Private Network
VOIP
Voice Over Internet Protocol
VRR
Vertical Refresh Rate
WAN
Wide Area Network
WFP
Windows File Protection
WORM
Write Once Read Many Times
WWW
World Wide Web
XMS
Extended Memory Specification
XT
Extended Technology
YB
Yotta byte
ZB
Zetta byte
ZB
Zero bytes
ZIF
Zero-Insertion-Force

Graph Theory |Walk, Path, Trial, Cycle and Circuit in Graph|



Walk

Let G=(V, E) a Graph, then 
A walk in G is a list W={u, e1, v1, e2, v2 ...... v} whose elements are alternatively vertices and degrees. 
The vertices u and v are called its end-vertices. 
The vertices v1, ........ are called inner vertices. 
In a simple graph, walk can be denoted by sequence of vertices only. 

Path

Let G=(V, E) be a Graph, then 
A path in G is a walk with no repeated vertex and edges. 

Trial 

Let G=(V, E) be a Graph, then 
A trial in G is a walk with no repeated edges. 

Cycle

Let G=(V, E) be a Graph, then 
A cycle in G is a closed path. 
In a cycle, start and end vertex are same. 

Circuit

Let G=(V, E) be a graph, then 
A trial in G is a walk with no repeated edges. Now a closed trial in G is closed circuit. 



Example: In the graph given below, construct walk, path, trial, cycle and circuit from a to e. 

           A)   
Graph
Solution Here, 
1. Walk (Vertex and Edge can be repeated) 
walk = {a, b, f, a, b, e}

2. Path (Vertex and Edge is not repeated) 
path = {a, b, f, e}

3. Trial (Vertex can be repeated, Edges not repeated) 
trial = {a, b, f, g, a, f, e}



4. Cycle (Vertex not repeated, Edge not repeated, close path)
cycle = {a, b, e, f, a}

5. Circuit (Vertex can be repeated, edge not repeated, close trial)
circuit = {a, f, b, e, f, g, a}

MKRdezign

Contact Form

Name

Email *

Message *

Powered by Blogger.
Javascript DisablePlease Enable Javascript To See All Widget