Java Stream API — Even Numbers (Full Screen) Java Stream API — Get Even Numbers Example 1 — Filter even numbers from a list Creates a list, uses Stream to filter evens, and prints them. Copy import java.util.*; import java.util.stream.*; public class EvenNumbersStream { public static void main(String[] args) { // Create a list of numbers List<Integer> numbers = Arrays.asList(1, 2, 3, 4, 5, 6, 7, 8, 9, 10); // Use Stream API to filter even numbers List<Integer> evenNumbers = numbers.stream() .filter(n -> n % 2 == 0) .collect(Collectors.toList()); // Print the even numbers System.out.println( "Even numbers: " + evenNumbers); } } Example 2 — Use IntStream.rangeClosed ...
In this C program we will perform Linear Queue operations using Linked List.
input:
The Choice(i.e Data insert, Data delete and Display) & The Number (integers) (i.e. for Data insert) (15,10,128 etc.)output:
The Operations will be excecuted as choosen by the user.
CODE---->
#include<stdio.h>
#include<stdlib.h>
#include<malloc.h>
typedef struct node{
int data;
struct node *next;
}node;
node *rear=NULL,*front=NULL;
void qinsert(int value)
{
node *getnode;
getnode=(node *)malloc(sizeof(node));
getnode->data=value;
if(rear==NULL)
{
rear=getnode;
rear->next=NULL;
front=rear;
}
else
{
rear->next=getnode;
rear=getnode;
rear->next=NULL;
}
}
void qdelete()
{
node *delnode;
delnode=front;
if(delnode==NULL)
printf("\n No elements to delete. Empty Queue.");
else if(front==rear)
{
printf("\n The value %d is deleted.",front->data);
front=NULL;
rear=NULL;
}
else
{
printf("\n The value %d is deleted.",front->data);
front=front->next;
}
}
void display()
{
node *ptr=front;
if(front!=NULL)
{
printf("\n Data in the queue are...\n");
while(ptr!=NULL)
{
printf(" %d ",ptr->data);
ptr=ptr->next;
}
}
else
printf("\n No elements to display. Empty Queue.");
}
int main()
{
int choice,x;
while(1)
{
printf("\n 1.Data insert\n 2.Data Delete\n 3.Data Display\n 4.Exit");
printf("\n Please, Enter your choice : ");
scanf("%d",&choice);
switch(choice)
{
case 1: printf("\n Please, Enter the element : ");
scanf("%d",&x);
qinsert(x);
break;
case 2: qdelete();
break;
case 3: display();
break;
case 4: exit(0);
default : printf("\n Wrong Choice.");
}
}
}
Download the C-Program file of this Program.
RESULT :
1.Data insert 2.Data Delete 3.Data Display 4.Exit Please, Enter your choice : 1 Please, Enter the element : 10 1.Data insert 2.Data Delete 3.Data Display 4.Exit Please, Enter your choice : 1 Please, Enter the element : 20 1.Data insert 2.Data Delete 3.Data Display 4.Exit Please, Enter your choice : 1 Please, Enter the element : 30 1.Data insert 2.Data Delete 3.Data Display 4.Exit Please, Enter your choice : 3 Data in the queue are... 10 20 30 1.Data insert 2.Data Delete 3.Data Display 4.Exit Please, Enter your choice : 2 The value 10 is deleted. 1.Data insert 2.Data Delete 3.Data Display 4.Exit Please, Enter your choice : 2 The value 20 is deleted. 1.Data insert 2.Data Delete 3.Data Display 4.Exit Please, Enter your choice : 3 Data in the queue are... 30 1.Data insert 2.Data Delete 3.Data Display 4.Exit Please, Enter your choice : 4 -------------------------------- Process exited after 37.69 seconds with return value 0 Press any key to continue . . .
Images for better understanding :
Comments
Post a Comment