DCCN VIVA & SHORT ANSWER QUESTION'S

DCCN VIVA & SHORT ANSWER QUESTION'S-1
DCCN VIVA & SHORT ANSWER QUESTION'S-2

Five health benefits of rope skipping

                                             Skipping is one of the simplest, easiest and zero-cost workouts. It can be done anytime, anywhere even in the comfort and convenience of your home. Besides being an effective aerobic exercise it is fun too. So grab that rope and give it a shot. The following reasons are sure to motivate you:

Major health benefits of jumping rope:
1. Aids weight loss
Skipping can help you shed up to 450 calories in just 30 minutes.The effort it takes to jump rope for 10 minutes is the equivalent of running a mile in eight minutes. So, you see how effective is skipping rope for losing weight.
2. Promotes cardio-vascular fitness
Skipping rope leads to better cardio-respiratory improvements, making the heart stronger and allowing it to pump more blood, delivering oxygen and nutrients to your tissues.
3. Improves muscle tone
Regular skipping improves the muscle tone in the legs and lower body and also in the upper body as your shoulders and arms work the rope.
4. Fights osteoporosis
Skipping boosts a person's bone density, helping to keep off osteoporosis.
5. Improves balance and coordination
Skipping regularly improves body flexibility and also aids your coordination and balance.It also helps you gain better concentration as both sides of your brain remain active while skipping.

DIJKSTRA'S ALGORITHM with example.

Edsger Wybe Dijkstra in 2002
Born	11 May 1930 Rotterdam, Netherlands
Died	6 August 2002 (aged 72) Nuenen, Netherlands
Fields	Computer science
Institutions	Mathematisch Centrum Eindhoven University of Technology The University of Texas at Austin
Known for	Dijkstra's algorithm Structured programming THE multiprogramming system Semaphore
Notable awards	Turing Award (1972) Association for Computing Machinery Dijkstra Prize (2002)

                                Dijkstra's algorithm. It picks the unvisited vertex with the lowest-distance, calculates the distance through it to each unvisited neighbor, and updates the neighbor's distance if smaller. Mark visited (set to red) when done with neighbors.

                                                                                                                                                                         Illustration of Dijkstra's algorithm search for finding path from a start node (lower left, red) to a goal node (upper right, green) in a robot motion planning problem. Open nodes represent the "tentative" set. Filled nodes are visited ones, with color representing the distance: the greener, the farther. Nodes in all the different directions are explored uniformly, appearing as a more-or-less circular wavefront as Dijkstra's algorithm uses a heuristic identically equal to 0.

Dijkstra's Algorithm

AIM: Implement Dijkstra’s algorithm to compute the Shortest path through graph.

DESCRIPTION: 

Dijkstra’s algorithm solves the simple source shortest paths problem on a weighted, directed graph. 

G=(V,E) for the case in which all weights are non negative. 

The algorithm repeatedly selects the vertex v belong s to v-s with the minimum shortest path estimate add ---

ALGORITHM: 

- Take a weighted, directed graph and take number of vertices. 

- Next take the weights between the states. 

- Start with the source vertex and identify the shortest path. 

- Repeat the above process for all the vertices repetitively until the destination is reached. 

- Display the shortest path from the source to destination. 

 OUTPUT:-
 Enter the number of nodes:4

 Enter the cost matrix:
0 3 23 0
3 0 2 0
23 2 0 5
0 0 5 0

 Enter the source node:1

 Enter the destination node:4

 Shortest path:
1->4,cost=10

Data Communications & Computer Networks Video Tutorials by IIT Kharagpur

Data Communications & Computer Networks Video Tutorials by IIT Kharagpur
Click the following link
Data Communications & Computer Networks Video Tutorials by IIT Kharagpur

Data Communications & Computer Networks(DCCN) UNIT-II NOTES PPT

UNIT-II CHPT-6 PPT' NOTES
UNIT-II CHPT-7 PPT NOTES
UNIT-II CHPT-8 PPT NOTES
UNIT-II CHPT-9 PPT NOTES

ONLINE MATERIAL FORM THE AUTHOR FOROUZAN

ONLINE MATERIAL FORM THE AUTHOR FOROUZAN

THE AVAILABLE MATERIALS ARE:

--PPT'S
--BITS
--ANIMATIONS

OPEN THE FOLLOWING LINK AND SELECT THE REQUIRED CHAPTERS

ONLINE MATERIAL FORM THE AUTHOR FOROUZAN

DCCN COURSE FILE

DCCN COURSE FILE

TEXT BOOK (Data_Communications_and_Networking_4e_forouzan)

1. 
2. Behrouz A. Forouzan
3. Behrouz A. Forouzan (born 1944) is a Professor at the Computer Information Systems department of DeAnza College. He has written many textbooks about computer science,networking, programming and databases. He graduated from the University of California, Irvine.
4. TEXT BOOK LINK
5. TEXT BOOK (Data_Communications_and_Networking_4e_forouzan)

Differences between Java & C++

Differences between Java & C++

Java

Java was developed by James Gosling in 1995 at Sun Microsystems (now acquired by Oracle Corporation).

Java is a true and complete object oriented language.

Java does not provide template classes.

Java supports multiple inheritance using interface.

Java does not provide global variables.

Java does not support pointers.

In Java, destruction of objects is performed in finalize method.

Java doesn’t provide header files.

C++

• C++ (earlier known as C with Classes) was developed by Bjarne Stroustrup in 1979 at Bell Labs
• C++ is an extension of C with object oriented behavior. C++ is not a complete object oriented language as that of Java.
• C++ offers Template classes.

• C++ achieves multiple inheritance by permitting classes to inherit from multiple classes.
• Global variables can be declared in C++.
• C++ supports pointers.
• In C++, destruction of objects is performed by destructor function.
• C++ has header files.

1. Dennis Ritchie

   Computer Scientist
2. Dennis MacAlistair Ritchie was an American computer scientist. He created the C programming language and, with long-time colleague Ken Thompson, the Unix operating system. Wikipedia
4. Born: September 9, 1941, Bronxville, New York, United States
5. Died: October 12, 2011, Berkeley Heights, New Jersey, United States
6. Education: Harvard University
7. Books: The C Programming Language, more
8. Awards: Turing Award, National Medal of Technology and Innovation, IEEE Emanuel R. Piore Award