CE1007/CZ1007 Data Structures Assignment 1

Assignment Questions: Linked List

Information:
Program templates for questions 1 to 4 are provided as separate files: Q1_template_LL.c,
Q2_template_LL.c, Q3_template_LL.c, and Q4_template_LL.c. You must utilize these templates to
implement your functions. Each program includes a main () function containing a switch statement,
which you will use to execute various functions that you are required to implement. These functions
can be called multiple times, depending on the user's choice.

You are required to submit your code to HackerEarth (https://www.hackerearth.com). An email

invitation for this will be sent to your school account. Additionally, even though we use HackerEarth
for grading your assignment, please note that you must also submit your code to NTULearn.

The deadline for submissions on both HackerEarth and NTULearn is February 9th, 2024 (Friday)
at 11:59 PM.11:59 PM.

Assignment Questions (1-4)

1. Write a C function insertSortedLL()that asks the user to input an integer, then inserts it
into the linked list in ascending order. The function, insertSortedLL(), should not allow
inserting an integer if it already exists in the current linked list. The function should return the
index position where the new item was added; if the function could not complete successfully, it
should return a value of -1. You can assume that the linked list is either a sorted linked list or an
empty list.

The function prototype is given as follows:

int insertSortedLL(LinkedList *ll, int item);

If the current linked list is: 2 3 5 7 9

Calling insertSortedLL() with a value of 8 will result in the following linked list:
235789

The function should return the index position where the new item was added as follows:
The value 8 was added at index 4

If the current linked list is: 5 7 9 11 15

Calling insertSortedLL() with a value of 7 will result in the following linked list:
5 7 9 11 15

The function does not complete successfully (does not insert the value of 7 to the linked list) hence
it should return a value of -1:
The value 7 was added at index -1

Your function should print the contents of the linked list after it has been created. This function
may be called multiple times for each time your program is running.

Some sample inputs and outputs are given as follows:

1: Insert an integer to the sorted linked list:
2: Print the index of the most recent input value:
3: Print sorted linked list:
0: Quit:

Please input your choice (1/2/3/0): 1

Input an integer that you want to add to the linked list: 2
The resulting linked list is: 2

Please input your choice (1/2/3/0): 1

Input an integer that you want to add to the linked list: 3
The resulting linked list is: 2 3

Please input your choice (1/2/3/0): 1

Input an integer that you want to add to the linked list: 5
The resulting linked list is: 2 3 5

Please input your choice (1/2/3/0): 1

Input an integer that you want to add to the linked list: 7

Page 1
CE1007/CZ1007 Data Structures Assignment 1
The resulting linked list is: 2 3 5 7
Input an integer that you want to add to the linked list: 9
The resulting linked list is: 2 3 5 7 9

Please input your choice (1/2/3/0): 1

Input an integer that you want to add to the linked list: 8
The resulting linked list is: 2 3 5 7 8 9

Please input your choice (1/2/3/0): 2

The value 8 was added at index 4

Please input your choice(1/2/3/0):3

The resulting sorted linked list is: 2 3 5 7 8 9

Please input your choice(1/2/3/0): 1

Input an integer that you want to add to the linked list: 5
The resulting linked list is: 5

Please input your choice(1/2/3/0): 1

Input an integer that you want to add to the linked list: 7
The resulting linked list is: 5 7

Please input your choice(1/2/3/0): 1

Input an integer that you want to add to the linked list: 9
The resulting linked list is: 5 7 9

Please input your choice(1/2/3/0): 1

Input an integer that you want to add to the linked list: 5
The resulting linked list is: 5 7 9

Please input your choice (1/2/3/0): 2

The value 5 was added at index -1

Please input your choice(1/2/3/0):3

The resulting sorted linked list is: 5 7 9

Please input your choice(1/2/3/0):

2. Write a C function alternateMergeLinkedList()which inserts nodes of the second list

into alternate positions of the first list. The nodes of the second list should only be inserted when
there are alternate positions available in the first list.

The function prototype is given as follows:

void alternateMergeLinkedList(LinkedList *ll1, LinkedList *ll2);

For an example, assume that given two linked lists are LinkedList1 and
LinkedList2: LinkedList1: 1 2 3
LinkedList2: 4 5 6 7

The resulting linked lists

are: LinkedList1: 1 4 2 5
36
LinkedList2: 7

The second list should become empty when the first list is larger than the second list. For
an example, assume that given two linked lists are LinkedList1 and LinkedList2:
LinkedList1: 1 5 7 3 9 11
LinkedList2: 6 10 2 4

The resulting Linked Lists are: LinkedList1: 1 6 5 10 7 2 3 4 9 11

LinkedList2: empty

A sample input and output session is given below (if the current linked lists are Linked list 1: 1 2
3 and Linked list 2: 4 5 6 7):

Page 2
CE1007/CZ1007 Data Structures Assignment 1

Linked list 1: 1 2 3
Linked list 2: 4 5 6 7
Please input your choice(1/2/3/0): 3
Linked list 1: 1 4 2 5 3 6
Linked list 2: 7

3. Write a C function moveOddItemsToBack()that moves all the odd integers to the

back of the linked list.

The function prototype is given as follows:

void moveOddItemsToBack(LinkedList *ll);

Some sample inputs and outputs sessions are given

below: If the linked list is 2 3 4 7 15 18:

The resulting Linked List after moving odd integers to the
back of the Linked List is: 2 4 18 3 7 15

If the linked list is 2 7 18 3 4 15:

The resulting Linked List after moving odd integers to the
back of the Linked List is: 2 18 4 7 3 15

If the current linked list is 1 3 5:

The resulting Linked List after moving odd integers to the
back of the Linked List is: 1 3 5

If the current linked list is 2 4 6:

The resulting Linked List after moving odd integers to the
back of the Linked List is: 2 4 6

4. Write a C function frontBackSplitLinkedList() that splits the singly linked list into
two sublists – one for the front half, and one for the back half. If the number of elements is
odd, the extra element should go into the front list. The
frontBackSplitLinkedList() prints two lists which contains frontList and
backList.

The function prototypes are given as follows:

void frontBackSplitLinkedList(LinkedList *ll, LinkedList
*resultFrontList, LinkedList *resultBackList);

For example, assume that given linked list is: 2 3 5 6 7

The resulting Linked Lists, frontList and backList are:

frontList: 2 3 5
backList: 6 7

A sample input and output session is given below:

1: Insert an integer to the linked list:

2: Print the linked list:
3: Split the linked list into two linked lists, frontList and backList:
0: Quit:

Please input your choice(1/2/3/0): 1

Input an integer that you want to add to the linked list: 2
The resulting linked list is: 2

Please input your choice(1/2/3/0): 1

Input an integer that you want to add to the linked list: 3
The resulting linked list is: 2 3

Page 3
CE1007/CZ1007 Data Structures Assignment 1
Please input your choice(1/2/3/0): 1
Input an integer that you want to add to the linked list: 5
The resulting linked list is: 2 3 5
Please input your choice(1/2/3/0): 1
Input an integer that you want to add to the linked list: 6
The resulting linked list is: 2 3 5 6

Please input your choice(1/2/3/0): 1

Input an integer that you want to add to the linked list: 7
The resulting linked list is: 2 3 5 6 7

Please input your choice(1/2/3/0): 2

The resulting linked list is: 2 3 5 6 7

Please input your choice(1/2/3/0): 3

The resulting linked lists after splitting the given linked list
are: Front linked list: 2 3 5
Back linked list: 6 7

Page 4