Select Assigned Questions

Class Univ. Assigned

Name
Roll No RollNo. Question
1 191550002 ABHISHEK GARG 6
2 191550011 AMIT SHARMA 7
3 191550015 ANMOL VARSHNEY 16
4 191550016 ARPAN SHARMA 17
5 191550018 ARYAN 9
6 191550019 ARYAN KANSAL 5
7 191550025 CHIRAG SARASWAT 9
8 191550026 DADU JAYAS 12
9 191550027 DEV KUMAR GANGWAR 2
10 191550030 EKTA SHUKLA 8
HANUMAN DAS
11 191550032 AGRAWAL 3
12 191550036 ISHA GUPTA 8
13 191550037 JAI AGARWAL 16
14 191550040 KARTIK KATIYAR 12
15 191550042 KUMKUM SHARMA 18
16 191550043 KUNAL JAIN 5
17 191550044 MADHVENDRA SINGH 10
18 191550045 MAHI SRIVASTAVA 13
19 191550047 MANAS AGARWAL 3
20 191550050 MEGHANSH BANSAL 18
21 191550051 MOHIT GUPTA 14
22 191550052 MOHIT SHARMA 11
23 191550053 MUKUL 16
24 191550054 NIKHIL 8
25 191550055 NIKHIL SHARMA 6
26 191550057 NITIN 16
27 191550058 PALAK GUPTA 18
28 191550059 PRAJJWAL SRIVASTAVA 8
29 191550061 PRATEEK JAIN 6
PRATYUSH
30 191550062 KHANDELWAL 15
31 191550065 RAAGHAV CHATURVEDI 17
32 191550066 RAHUL MALIK 15
RAJEEV NAYAN
33 191550067 AGRAWAL 9
RITESH SINGH
34 191550068 CHAUHAN 16
35 191550069 SAMAY SINGH 6
36 191550070 SAMYAK JAIN 10
37 191550073 SEJAL SINGH PARIHAR 17
38 191550075 SHIVA 14
39 191550076 SHIVAM GARG 10
40 191550078 SHOBHIT AGARWAL 13
41 191550079 SHREYA SAXENA 2
42 191550081 SHUBHAM AGGARWAL 11
43 191550082 SHUBHANSHU SHUKLA 1
44 191550083 SUDHAKAR SOROUT 16
45 191550084 SUMIT KUMAR RATH 16
46 191550085 SURBHI SHARMA 4
47 191550090 TARUN GUPTA 12
48 191550092 UNNATI SONI 4
49 191550093 UTKARSH DUBEY 2
50 191550101 VISHAL AGRAWAL 16
51 191550103 VISHNU SINGH 16
52 191550104 YAMAN CHOWDHARY 2
53 191550106 YATENDRA KUMAR 4
54 191550107 YOGESH CHAUDHARY 17

List of Questions

1. Write a program to delete the first, last and middle node of a linked list
2. Write a program that removes all nodes that have duplicate information.

3. Write a program to make the first element of singly linked list as the last
element of the list.
4. Write a program to count the number of occurrences of a given value in a
linked list.

5. Write a program to create a linked list which stores the details of employees
in a department. Read and print the information stored in the list.
6. Write a program to interchange the Kth and the (K+1)th node of a circular
doubly linked list.

7. Write a program to interchange the value of the first element with the last
element, second element with the second last element, so on and so forth of
a doubly linked list.
8. Write a program to print minimum and maximum values in a linked list that
stores integer values.

9. Write a program to add the values of the nodes of a lined list and then
calculate the mean.
10.Write a program to create a singly linked list and reverse the list by
interchanging the links and not the data.

11.Write a program to
a. Delete the first Occurrence of a given character in a linked list
b. Delete the last occurrence of a given character
c. Delete all the occurrences of a given character
12.Write a program to form a linked list of floating point numbers. Display the
sum and mean of these number.

13.. Write a method that removes all negative numbers from a stack of integer.
If the original stack contained the integers 30, −15, 20, −25 (top of stack is -
25), the new stack should contain the integers 30, 20.
14.Write a new queue method called moveToRear that moves the element
currently at the front of the queue to the rear of the queue. The element that
was second in line will be the new front element.
15.Write a new queue method called moveToFront that moves the element at
the rear of the queue to the front of the queue, while the other queue
elements maintain their relative positions behind the old front element.
16.Write a method peekNextToTop that allows you to retrieve the element just
below the one at the top of the stack without removing it. It should return
null if the stack has just one element, and it should throw an exception if the
stack is empty.

17.Implement bubble sort on doubly linked list

18.Write a program to interchange the value of the first element with the last
element, second element with second last element, so on and so forth of a
doubly linked list.