69 CS651 Lecture Notes - Lecture 32: Linked List, Source Code Editor

8 views2 pages

shuhbam2607

1 Mar 2023

School

Indian Institute of Technology - IIT Kanpur

Department

Engineering

Course

69 CS651

Professor

For unlimited access to Class Notes, a Class+ subscription is required.

L32: LINKED LIST OPERATIONS In Java - REVERSE,

ADD, DELETION | Lesson 32 | DSA In

Java@CodingNinjasIndia

Coding Ninjas

This video is a part of new playlist of videos on data structures and algorithm in

Java by coding Ninjas.. in this video, we will be covering implementation of add

method and remove method. we will see how to insert a element at a particular

index in the linked list and how to delete a node from a linked list by doing a

code studio. Problem. this is how we can add an element to the linked list by

using add method only. if we want to add the element at the first position or the

last position, we will just have to write dot add last method. let us check whether

these elements are placed at the right position in this lick clip so after addition,

let us check what will get the output. after insertion by index. I have inserted

days of week at the zeroth index and middle at the fourth index and after that at

the end, we I have added and at the ninth index. So. This is how we can add

element at the first index or middle or the last of the in the linked list. by using

remove method, we can remove element from linked list, so it works similarly, so

you can see the code here..

Code Ninja is a free platform which provides free online code editor and

compiler in C plus plus plus Java Python, Python Python Code Studio.. Code

Studio is the best platform to prepare for coding interviews and you can find the

top interview questions and their solution guided path to learn various topics in

DsA. the element will be two five seven and ten and another linked list is minus

eight three four minus two one. So in this we will be deleting four. minus one

indicates that the end of the linked list. It will not be considered in linked list..

After this we can. Finally we we will delete the element Uh temp. We will then

delete the temp pointer so finally our element is deleted. the time complexity of

this code will be of one as all the operations are performed in constant time and

the talking. about the space complexity space complexity will also be of 1 as we

are using the constant extra time extra memory.. this problem. You can also

submit the code here and win the exciting badges..

Code studio is based on reverse linked list based on reversal link list. you are

given a single linked list of integer. You need to reverse the linked list by

changing the links between the nodes, so you do not need to print anything.

Just return the head of the reversed linked list. we will be doing this code by

using this recursion approach. the time complexity of this code will be of n.

Where n is a number of nodes in the linked list. the space complexity is also

often often where n n is the number of node in the list, and there can be at most

Unlock document

This preview shows half of the first page of the document.
Unlock all 2 pages and 3 million more documents.

Already have an account? Log in

Document Summary

L32: linked list operations in java - reverse, Add, deletion | lesson 32 | dsa in. This video is a part of new playlist of videos on data structures and algorithm in. I have inserted days of week at the zeroth index and middle at the fourth index and after that at the end, we i have added and at the ninth index. Code ninja is a free platform which provides free online code editor and compiler in c plus plus plus java python, python python code studio code. Studio is the best platform to prepare for coding interviews and you can find the top interview questions and their solution guided path to learn various topics in. Dsa. the element will be two five seven and ten and another linked list is minus eight three four minus two one. So in this we will be deleting four. minus one indicates that the end of the linked list.

Related Questions

MODERN PERIODIC TABLE

The periodic table is a tabular arrangement of the chemical elements organized on the basis of their atomic numbers, electron configurations, and chemical properties.

Elements are presented in order of increasing atomic number (the number of protons in the nucleus). The standard form of the table consists of a grid of elements laid out in 18 columns and 7 rows, with a double row of elements below that. (Please see periodic table provided above.)

The horizontal rows of the table are called periods and the vertical columns are called groups. The periodic table incorporates recurring trends and can therefore be used to derive relationships between the properties of the elements and predict the properties of new, yet to be discovered or synthesized, elements. As a result, a periodic table provides a useful framework for analyzing chemical behavior.

Main group (or representative) elements include elements (except hydrogen) in groups 1 and 2 and groups 13 to 18. In older nomenclature, the main group elements are groups lA and lIA, and groups IIIB to O (CAS groups IIIA to VIIIA).

The elements in groups 3 to 12 are the transition elements, the focus of this exercise.

Transition elements are divided into two groups:

the transition metals

the inner transition metals

The two sets of inner transition metals are located along the bottom of the periodic table and are known as the lanthanide series and the actinide series. (See periodic table provided above.) The rest of the elements in groups 3 to 12 are transition metals.

Transactinide elements (also called transactinides, or super-heavy elements) are the elements with atomic numbers greater than those of the actinides. (The heaviest actinide is lawrencium (103).)

Transuranium (or transuranic) elements are those elements having an atomic number greater than that of uranium (92), an actinide. (Thus all transactinide elements are also transuranium elements.)

Transuranium elements are unstable and decay radioactively into other elements.

These elements were all first discovered in the laboratory, with neptunium, plutonium, americium, curium, berkelium, and californium later also discovered in nature.

Transuranium elements can be synthesized in the laboratory through the use of nuclear reactors or particle accelerators.

Please review the following questions:

1. Are all transactinide elements transuranium elements?

2. Are all tranuranium elements actinides?

3. List two unique properties of transuranium elements:

For the following symbols, provide the element name and indicate whether it is a representative element, a lanthanide, an actinide, or a transactinide element.

4. Cf

5. Pm

6. Ag

7. Ds

8. Tb

9. Rf

10. U

isaiahh223g

Problem 1:
Alice is rearranging her library. She takes the innermost shelf and reverses the order of books. If you want to automate this process, which data structure would you prefer to do this and why?

Problem 2:
There are two persons A and B. Both are maintaining two book shelves. A takes the first book (the book he kept for the first time in the shelf) from the shelf and reads it. B prefers to take the last book and reads. After reading a book, both A and B keep the book in a separate shelf. Write a Python program to implement this process. Identify the data structures and define the operations accordingly.

mirra

A. Plan an imaginary dinner to which you invite several famous people. These may be a combination of living and deceased personalities. Write at least three scenes describing your dinner party. Each scenes should do one of the following:

a. Provide exposition (explain)

b. Describe character

c. Advance the plot

B. After you have completed writing the scenes, explain how each scene follows the general rules for the elements of 'scene' and also provide a brief explanation of why your chose these particular personalities to attend your party.

Lyricmomma12

69 CS651 Lecture Notes - Lecture 32: Linked List, Source Code Editor

Document Summary

Get access

Related Documents

69 CS651 Lecture Notes - Lecture 20: Flipkart, For Loop

69 CS651 Lecture : DSA notes 30

69 CS651 Lecture Notes - List Of Data Structures, Linked List

Related Questions