Each Project will have Reference Links which you can read to get a quick grasp on the topic and some Practice Questions,If you want more practice for each Topic .

Each Practice Question is slightly abstracted ,You need to make certain assumptions and write the best solution .Think for the best complexity algorithms .Remember also Space vs Time Tradeoff

Do not copy the Answers from Internet ,or from your friends as that will lead to your disqualification ,We will run copychecker tools ,and do a manual review too.So even changing variable names or changing for loops to while loops still leads to detection.

You are in the course for learning ,So Do learn and dont resort to any malpractices

Reference Links : (Right Click is disabled ,So Ctrl+C and Ctrl+V the links)

• https://www.youtube.com/playlist?list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P
• http://www.thelearningpoint.net/computer-science/data-structures-singly-linked-list-with-c-program-source-code
• http://www.tutorialspoint.com/data_structures_algorithms/linked_lists_algorithm.htm

Practice Questions :

• Find the Length of the SLL.
• Write functions for Insert and Delete nodes at a specific Index .
• Delete every other node in an SLL.
• Write a insert function ,which Inserts the nodes in a sorted way ,ie If 2 is inserted into a SLL already having 1->10 .Now after insert SLL becomes 1->2->10
• Given an Sll , Swap every two nodes using pointers ,Ex:abcd -> badc .
• Given a SLL ,Remove every Sll node which has greater valuen to its imediate right ?Ex :I/P:5->7->3->6->2->5 ,O/P: 7->6->5 ,A sorted SLL finally should have only 1 element .
• Given an SLL which is a representation of a number ,Ex:: 1->2->1->NULL .Find out whether the number formed from SLL,is divisible by 11 or not .Dont convert it into an integer

Sample Insert_node_at_end function