Skip to main content

YouTube Material 1| Hindi Video

Video Lecture- https://youtu.be/StCjnwfS0NQ

Basic structure of a Java program

public class xyz

{

public static void main(String args[])

{

//Code

//Code

//Code

//Code

//Code

}}


public- access specifier/modifiers which makes the particular entity accessible throughout the program i.e., it can be accessed by other classes also.

static- a keyword by which we don't have to create an object of that particular entity.

void- return type keyword by which the function becomes non-returning type.

main- name of the function

String args[]- argument for main function


Print Statement

Syntax: System.out.println();



Three types of Iteration statements are:

  1. for loop


Example:


for(int i=0; i<=5;i++)

{

//Code

//Code

//Code

//Code

//Code

}

The body of the above for loop will be executed 6 times.

  1. while loop( entry control loop)


Syntax:

while (condition)

{

//Code

//Code

//Code

//Code

//Code

}

The body of the above while loop will be executed continuously as long as the condition of the while is true.In this loop the condition is checked before the execution of the loop's body.


  1. do-while loop (exit- control loop)


Syntax:

do

{

//Code

//Code

//Code

//Code

//Code

}

while(condition);



The body of the above do-while loop will execute at least once, even if the condition of the loop is false because the condition is checked after the body's execution. After the first execution, similar to that of while loop the body of do-while will be continuously executed as long as the condition is true.


All the loops given below have three statements. Initial statement, conditional statement and an update statement.


Popular posts from this blog

Bubble Sort | Java & Python | MyCodingNetwork | Alok Tripathi

  Bubble Sort is a simple sorting algorithm that works by repeatedly comparing and swapping adjacent elements in an array until they are in the correct order. It is called bubble sort because the smaller elements "bubble" to the top of the array, while the larger elements sink to the bottom. Quick Video Explanation: How Bubble Sort Works Bubble sort works by iterating through the array from left to right and comparing each pair of adjacent elements. If the element on the left is larger than the element on the right, they are swapped. This way, the largest element in the array moves to the rightmost position in each iteration. This process is repeated until no more swaps are needed, which means the array is sorted. To illustrate how bubble sort works, let's use the example of sorting the array [30,90,50,10,40] in ascending order. First Iteration/Pass: The first step is to compare the first two elements, 30 and 90. Since 30 is smaller than 90, they are already i

Insertion and Deletion of a Node in Linked List | Java | MyCodingNetwork

  Insertion of a new node & Deletion of an existing node After an exhilarating commencement of the Linked List series, in this post, we'll be exploring the artistry behind insertion and deletion operations in linked list. So let's now move on to the second problem statement of the series, i.e., write two functions for insertion and deletion of a node respectively, from linked list . Algorithm for inserting a node at pos position: Create a function insert () which takes head of the node, pos and the new node as the parameter. Take a base case, if pos==1, means the new node is to be made the head of the linked list. If the above case is not true, traverse the linked list and reach to position, pos-1 . Assign the new node with the address of the node at pos. Finally, assign the node at pos-1 with address of new node. Algorithm for deleting a node at pos position: Create a function deletion () which takes pos and the head of the LinkedList as parameter. Base case, if pos

Time Complexity in One Shot | MyCodingNetwork

  After exploring various aspect of programming, it's important to understand and calculate the amount of time our code takes to execute for a given size of input. The concept needed for this is called Time Complexity. In this article we will be exploring various aspects of Time Complexity and also solve numerous questions on it, so that we can have strong foundation of one of the most important aspect in the world of DSA. Introduction For a beginner the first question that should come to his/her mind is, "what is time complexity?". The answer is pretty simple, it is a measure of the amount of time an algorithm takes to complete as a function of the size of the input . It is important to analyze the time complexity of an algorithm because it helps us to compare different solutions and choose the most efficient one for a given problem.  In simple words (just to understand), one way to measure the time complexity of an algorithm is to count the number of iterations it perfo