{"id":2187,"date":"2019-11-20T05:00:06","date_gmt":"2019-11-20T05:00:06","guid":{"rendered":"https:\/\/bvcoend.ac.in\/?page_id=2187"},"modified":"2019-11-20T05:01:43","modified_gmt":"2019-11-20T05:01:43","slug":"computer-networks-lab-c-304","status":"publish","type":"page","link":"https:\/\/bvcoend.ac.in\/index.php\/computer-networks-lab-c-304\/","title":{"rendered":"Computer Networks Lab – C 304"},"content":{"rendered":"[vc_row][vc_column width=”1\/4″][vc_wp_custommenu title=”Imp Links” nav_menu=”66″][\/vc_column][vc_column width=”3\/4″][vc_column_text]\n

Computer Networks Lab<\/strong><\/span><\/span><\/h2>\n

Lab Incharge :\u00a0Mr. Arun Dubey<\/strong><\/span><\/p>\n

Lab Attendant:\u00a0 Mr.\u00a0Vijay Jadhav<\/strong><\/span><\/p>\n

This Lab is prepared for students to Implement Data Structures Algorithms in C\/C++ \u00a0Programs . The lab is\u00a0well equipped with Computer systems , printers and networking facility.<\/span><\/p>\n

Software Installed: Turbo C\/C++ software and Windows 7 \u00a0<\/strong><\/em><\/span><\/p>\n

List of Experiments<\/strong><\/span><\/p>\n

\n

Subject :Data Structures Lab<\/strong><\/span><\/p>\n

1<\/strong>. Perform Linear Search and Binary Search on an array.Description of programs:<\/span><\/p>\n

a. Read an array of type integer.<\/span><\/p>\n

b. Input element from user for searching.<\/span><\/p>\n

c. Search the element by passing the array to a function and then returning the position of the element <\/span>from the function else return -1 if the element is not found.<\/span><\/p>\n

d. Display the position where the element has been found.<\/span><\/p>\n

2<\/strong>. Implement sparse matrix using array.\u00a0Description of program:<\/span><\/p>\n

a. Read a 2D array from the user.<\/span><\/p>\n

b. Store it in the sparse matrix form, use array of structures.<\/span><\/p>\n

c. Print the final array.<\/span><\/p>\n

3<\/strong>. Create a linked list with nodes having information about a student and perform<\/span><\/p>\n

I. Insert a new node at specified position.<\/span><\/p>\n

II. Delete of a node with the roll number of student specified.<\/span><\/p>\n

III. Reversal of that linked list.<\/span><\/p>\n

4<\/strong>. Create doubly linked list with nodes having information about an employee and perform Insertion at front of <\/span>doubly linked list and perform deletion at end of that doubly linked list.<\/span><\/p>\n

5<\/strong>. Create circular linked list having information about an college and perform Insertion at front perform <\/span>Deletion at end.<\/span><\/p>\n

6<\/strong>. Create a stack and perform Pop, Push, Traverse operations on the stack using Linear Linked list.<\/span><\/p>\n

7<\/strong>. Create a Linear Queue using Linked List and implement different operations such as Insert, Delete, and <\/span>Display the queue elements.<\/span><\/p>\n

8<\/strong>. Create a Binary Tree (Display using Graphics) perform Tree traversals (Preorder, Postorder, Inorder) using <\/span>the concept of recursion.<\/span><\/p>\n

9<\/strong>. Implement insertion, deletion and display (inorder, preorder and postorder) on binary search tree with the i<\/span>nformation in the tree about the details of a automobile (type, company, year of make).<\/span><\/p>\n

10<\/strong>. To implement Insertion sort, Merge sort, Quick sort, Bubble sort, Bucket sort, Radix sort, Shell sort, <\/span>Selection sort, Heap sort and Exchange sort using array as a data structure.<\/span><\/p>\n

Text Books:<\/strong><\/span><\/p>\n

[T1]\u00a0\u00a0 \u00a0R. F. Gilberg, and B. A. Forouzan, \u201cData structures: A Pseudocode approach with C\u201d, Thomson Learning.<\/span><\/p>\n

[T2]\u00a0\u00a0 \u00a0A .V. Aho, J . E . Hopcroft, J . D . Ulman \u201cData Structures and Algorithm\u201d, Pearson Education.<\/span><\/p>\n

Reference Books:<\/strong><\/span><\/p>\n

[R1]\u00a0\u00a0 \u00a0S. Sahni and E. Horowitz, \u201cData Structures\u201d, Galgotia Publications.<\/span><\/p>\n

[R2]\u00a0\u00a0 \u00a0Tanenbaum: \u201cData Structures using C\u201d, Pearson\/PHI.<\/span><\/p>\n

[R3]\u00a0\u00a0 \u00a0T .H . Cormen, C . E . Leiserson, R .L . Rivest \u201cIntroduction to Algorithms\u201d, PHI\/Pearson.<\/span><\/p>\n

[R4]\u00a0\u00a0 \u00a0A.K.Sharma, \u201cData Structures\u201d, Pearson<\/span><\/p>\n

[R5]\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0Ellis \u00a0Horowitz \u00a0and Sartaz Sahani \u201cFundamentals of Computer \u00a0Algorithms\u201d, Computer\u00a0\u00a0\u00a0 \u00a0Science Press.<\/span><\/p>\n

Data communication & networks Lab<\/strong><\/span><\/p>\n

\n
\n
\n
    \n
  1. PC to PC Communication<\/span><\/li>\n
  2. Parallel Communication using 8 bit parallel cable & Serial communication using RS 232C<\/span><\/li>\n
  3. Ethernet LAN protocol<\/span><\/li>\n
  4. To create scenario and study the performance of CSMA\/CD protocol through Simulation<\/span><\/li>\n
  5. To create scenario and study the performance of token bus and token ring protocols through <\/span>simulation<\/span><\/li>\n
  6. To create scenario and study the performance of network with CSMA \/ CA protocol and compare <\/span>with\u00a0CSMA\/CD protocols.<\/span><\/li>\n
  7. Implementation and study of stop and wait protocol<\/span><\/li>\n
  8. Implementation and study of Go back-N and selective repeat protocols<\/span><\/li>\n
  9. Implementation of distance vector routing algorithm<\/span><\/li>\n
  10. Implementation of Link state routing algorithm<\/span><\/li>\n<\/ol>\n<\/div>\n<\/div>\n<\/div>\n[\/vc_column_text][\/vc_column][\/vc_row]\n","protected":false},"excerpt":{"rendered":"

    [vc_row][vc_column width=”1\/4″][vc_wp_custommenu title=”Imp Links” nav_menu=”66″][\/vc_column][vc_column width=”3\/4″][vc_column_text] Computer Networks Lab Lab Incharge :\u00a0Mr. Arun Dubey Lab Attendant:\u00a0 Mr.\u00a0Vijay Jadhav This Lab is prepared for students to Implement Data Structures Algorithms in C\/C++ \u00a0Programs . The lab is\u00a0well equipped with Computer systems , printers and networking facility. Software Installed: Turbo C\/C++ software and Windows 7 \u00a0 List…<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":[],"_links":{"self":[{"href":"https:\/\/bvcoend.ac.in\/index.php\/wp-json\/wp\/v2\/pages\/2187"}],"collection":[{"href":"https:\/\/bvcoend.ac.in\/index.php\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/bvcoend.ac.in\/index.php\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/bvcoend.ac.in\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/bvcoend.ac.in\/index.php\/wp-json\/wp\/v2\/comments?post=2187"}],"version-history":[{"count":1,"href":"https:\/\/bvcoend.ac.in\/index.php\/wp-json\/wp\/v2\/pages\/2187\/revisions"}],"predecessor-version":[{"id":2188,"href":"https:\/\/bvcoend.ac.in\/index.php\/wp-json\/wp\/v2\/pages\/2187\/revisions\/2188"}],"wp:attachment":[{"href":"https:\/\/bvcoend.ac.in\/index.php\/wp-json\/wp\/v2\/media?parent=2187"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}