Assessment Test for Sessional Marks, Schedule of Data Structures (3rd Sem) on 7th Nov, 2020

 Assessment Test for Sessional Marks, Schedule of Data Structures (3rd Sem) on 7th Nov, 2020

An MCQ based assessment will be held for all subjects to account for the internal(sessional) marks. Each test will be of 25 minutes duration and will consist of 20 MCQ questions. A single MCQ test will cover both theory and lab components.

The tests will start on 7th Nov, 2020, Saturday and will end before Diwali. The schedule of all subjects will be displayed soon. On 7th Nov, 2020, Saturday the MCQ for Data Structures for 3rd semester is scheduled. The test is scheduled from 10 AM to 10.25 AM and will be held through exam.geu.ac.in. Appearing in the test is compulsory as the sessional marks will be completely dependent on it.

Special Instructions regarding the DS Exams:

  1. For theory: 20 Marks sessional from the MCQ test and 5 Marks from attendance (based on views of lectures)
  2. For Lab: 20 marks sessional from MCQ test and 5 Marks from attendance (based on views of lectures)
  3. Questions will be completely based on the Lecture Videos and questions will be included from each video. Hence you are advised to go through the Lecture Videos in detail

For your easy reference the list of lecture videos and the URLs are provided below

1. Introduction to Data Structures & its classification

https://youtu.be/tUUQ-LhVfsk

 2. Data Structures: Implementation of Stack using Array

https://youtu.be/tiZM96qLWlg

3. Implementation of Queue using Array | Data Structures

4. C Program for Stack using Linked List and Single Pointer

https://youtu.be/pkcG0A5hwiY

5. C Program for Stack using Linked List and Double Pointer

https://youtu.be/GFQOIH_GLAs

6. Circular Linked List – Implementation & Applications

https://youtu.be/BFecGhUZzkw

7.  Circular Linked List Algorithm | Prof. Kamal Ghanshala

https://youtu.be/OFEvyDshOIw

 8. Lecture on Doubly Linked List – Concept

https://youtu.be/_88VmjBzWFA

9. C Program for Doubly Linked List – Implementation

https://youtu.be/fzW9ovFZi04

10. Binary Search Tree (BST) Fundamentals Explained

https://youtu.be/CIYpfvubI9g

11 . Construct a Binary Search Tree (BST) using single pointer-Program

https://youtu.be/_dPHLO_i_lE

12.  Binary Search Tree Traversal Program | Inorder,Pre & Postorder

https://youtu.be/yH2i2xxJavY

  1. C Program for inserting nodes in BST using Double Pointer

https://youtu.be/zdUH9rBactQ

  1. Binary Search Tree (BST) Creation in 4 minutes

https://youtu.be/81aJt05gOCk

15. Binary Search Tree (BST) – Deletion in less than 4 mins

https://youtu.be/I6u2q_291tU

16. Huffman Algorithm and Huffman Coding with Example

https://youtu.be/HRayG7hGJ5g

17. Linked Representation of a Graph | Data Structure

https://youtu.be/KUQjDE91lZs

18. Graph Traversal : Breadth First Search (BFS) with Example

https://youtu.be/bm2Dto8hJWc

19. Graph Traversal : Depth First Search (DFS) with Example

https://youtu.be/75cjf4EtPzI

20. Lecture on Dijkstra’s Algorithm

https://youtu.be/wn5GA58giXY

21.  Bellman Ford Algorithm | Shortest Path | Dynamic Programming

https://youtu.be/ZCodT53pdFo1