Computer Science & Engineering Materials: 2014

Wednesday, November 12, 2014

DCCN PRE-FINAL IMP QUESTIONS.

1. Discuss the functions of various layers of OSI Model and compare with TCP/IP model

2. a) Compare ADSL,VDSL,HDSL and SDSL Technologies.

b) Compare circuit switching and packet switching.

3. a) What are the functions of the Data link layer? Explain stop and wait protocol.

b) Briefly explain ALOHA,CSMA,CSMA/CD,CSMA/CA protocols and compare its performances.

4. a) Explain Architecture ,layers and frame format of SONET.

b) Compare frame relay and ATM networks.

5. What is logical addressing? Give the services and header format of IPV4 and compare with IPV6.

6. a) Explain the main categories of DNS Messages.

b) Explain briefly about ICMP.

7. Explain the following

a) Electronic mail b) Voice over IP c) HTTP

d) FTP e) Remote login.

8. a) Compare TCP,UDP and SCTP protocols.

b) What is congestion and explain any one of the congestion control mechanism.

DCCN II MID IMPQUESTIONS

II MID IMPORTANT QUESTIONS.

1. a) Compare TCP,UDP and SCTP protocols.

b) What is congestion and explain any one of the congestion control mechanism

2. What is logical addressing? Give the services and header format of IPV4 & compare with IPV6.

3. a) Explain DNS in the Internet.

b) Write short notes on Remote login & FTP.

4. Explain the following

a) ICMP b) IGMP c) Multi-cast routing protocols

d) Forwarding & routing e) Inter-networking.

5. a) Explain the main categories of DNS Messages and its header format.

b) Explain briefly about ICMP.

6. Explain the following

a) Electronic mail b) Voice over IP c) HTTP

d) FTP e) Remote login.

7. Give the frame format of IPV4 and explain the functions of each.

8. Describe the procedure used for Checksum calculation in IPV4.

9. Discuss ICMP message & IGMP messages and its formats.

10. Explain and compare various techniques used to improve QOS.

11. Explain SMTP and POP3 protocol.

12. Explain the working of 3-ways handshaking used in TCP.

13. What is congestion? Explain the causes and the effects of congestion.

14. Explain the integrated Services QoS model.

15. Explain the name-address and address-name resolution process.

Saturday, November 8, 2014

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.

Tuesday, October 28, 2014

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

Friday, September 5, 2014

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

Behrouz A. Forouzan
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.
TEXT BOOK LINK
TEXT BOOK (Data_Communications_and_Networking_4e_forouzan)

Thursday, March 6, 2014

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.