BIM Notes – Page 67

DSA 2019 Makeup

August 5, 2021BIM NotesLeave a Comment

Group B Q.No 11.

package folder2019;
import java.util.Scanner;
class Stack {
    private java.util.LinkedList list = new java.util.LinkedList();
    public Stack() {
    }
    public void clear() {
        list.clear();
    }
    public boolean isEmpty() {
        return list.isEmpty();
    }
    public void push(Object el) {
        list.addLast(el);
    }
    public Object pop() {
        if (isEmpty()) {
            System.out.println("stack is empty");
        }
        return list.removeLast();
    }
    public String toString() {
        return list.toString();
    }
}
public class makeup2019no11 {
    public static void main(String[] args) {
        Stack ob = new Stack();
        int data;
        Scanner sc = new Scanner(System.in);
        ob.clear();
        System.out.println("the stack is empty:" + ob.isEmpty());
        System.out.println("enter a number to push in any stack");
        for (int i = 0; i < 3; i++) {
            data = sc.nextInt();
            ob.push(data);
        }
        ob.pop();
    }
}

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

package folder2019;

import java.util.Scanner;

class Stack {

private java.util.LinkedList list = new java.util.LinkedList();

public Stack() {

}

public void clear() {

list.clear();

}

public boolean isEmpty() {

return list.isEmpty();

}

public void push(Object el) {

list.addLast(el);

}

public Object pop() {

if (isEmpty()) {

System.out.println("stack is empty");

}

return list.removeLast();

}

public String toString() {

return list.toString();

}

public class makeup2019no11 {

public static void main(String[] args) {

Stack ob = new Stack();

int data;

Scanner sc = new Scanner(System.in);

ob.clear();

System.out.println("the stack is empty:" + ob.isEmpty());

System.out.println("enter a number to push in any stack");

for (int i = 0; i < 3; i++) {

data = sc.nextInt();

ob.push(data);

}

ob.pop();

}

Q.no 12

package folder2019;
import java.util.Scanner;
class Node
{
public int info;
 public Node next;
 public Node()
 {
 next = null;
 }
 public Node(int el)
{
 info = el;
 next = null;
 }
 public Node(int el, Node ptr)
{
 info =el;
 next = ptr;
 }
}
class List{
    Node head,tail;
public void deleteAtAny(int n)
{
Node previous = head;
int count=1, position=n;
while(count < position - 1)
{
previous = previous.next;
count++;
}
Node current = previous.next;
previous.next = current.next;
current.next = null;
}
}
public class makeup2019no12{
    public static void main(String args[]) {
        Scanner sc=new Scanner(System.in);
        System.out.println("Singly linked list created");
        List mylist = new List();
        System.out.println("Enter the position");
        int pos=sc.nextInt();
        mylist.deleteAtAny(pos);
    }
}

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

package folder2019;

import java.util.Scanner;

class Node

{

public int info;

public Node next;

public Node()

{

next = null;

}

public Node(int el)

{

info = el;

next = null;

}

public Node(int el, Node ptr)

{

info =el;

next = ptr;

}

class List{

Node head,tail;

public void deleteAtAny(int n)

{

Node previous = head;

int count=1, position=n;

while(count < position - 1)

{

previous = previous.next;

count++;

}

Node current = previous.next;

previous.next = current.next;

current.next = null;

}

public class makeup2019no12{

public static void main(String args[]) {

Scanner sc=new Scanner(System.in);

System.out.println("Singly linked list created");

List mylist = new List();

System.out.println("Enter the position");

int pos=sc.nextInt();

mylist.deleteAtAny(pos);

}

Q.n0 13 Q.no 14 Q.no 15

import java.util.Scanner;
public class SelectionSorting {
    public static void selectionSort(int[] data){
       int i,j,least,temp;
       for(i=0;i<data.length-1;i++){
           for(j=i+1,least=i; j<data.length;j++){
                if(data[j]<data[least])
                    least=j;
           }
                if(i!=least){
                        temp=data[least];
                        data[least]=data[i];
                        data[i]=temp;
                }
           }
        }
    static void result(int[] data){
         System.out.println("The array after selection sorting is: ");
        for(int i=0;i<data.length;i++)
            System.out.print(data[i]+ " ");
    }
    public static void main(String args[]){
        SelectionSorting obj1 =new SelectionSorting ();
        Scanner sc=new Scanner(System.in);
        System.out.println("enter the size of array for sorting");
        int size=sc.nextInt();
        System.out.println("Enter the element for array");
         int data[]=new int[size];
        for(int i=0;i<size;i++){
             data[i]=sc.nextInt();
        }
        selectionSort(data);
        result(data);
    }
}

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

import java.util.Scanner;

public class SelectionSorting {

public static void selectionSort(int[] data){

int i,j,least,temp;

for(i=0;i<data.length-1;i++){

for(j=i+1,least=i; j<data.length;j++){

if(data[j]<data[least])

least=j;

}

if(i!=least){

temp=data[least];

data[least]=data[i];

data[i]=temp;

}

static void result(int[] data){

System.out.println("The array after selection sorting is: ");

for(int i=0;i<data.length;i++)

System.out.print(data[i]+ " ");

}

public static void main(String args[]){

SelectionSorting obj1 =new SelectionSorting ();

Scanner sc=new Scanner(System.in);

System.out.println("enter the size of array for sorting");

int size=sc.nextInt();

System.out.println("Enter the element for array");

int data[]=new int[size];

for(int i=0;i<size;i++){

data[i]=sc.nextInt();

}

selectionSort(data);

result(data);

}

DSA 2019

August 5, 2021BIM NotesLeave a Comment

Group B Q.No 11

package folder2019;
import java.util.Scanner;
public class no11 {
    private int STACKSIZE;
    private Integer stack[];
    no11(int STACKSIZE) {
        this.STACKSIZE = STACKSIZE;
        stack = new Integer[this.STACKSIZE];
    }
    int TOP = -1;
    public void push(int data) {
        if (TOP == STACKSIZE - 1) {
            System.out.println("Stack overflow");
        } else {
            TOP++;
            stack[TOP] = data;
        }
    }
    public int pop() {
        if (TOP == -1) {
            System.out.println("Stack underflow");
        } else {
            System.out.println("Item deleted" + stack[TOP]);
            TOP--;
        }
        return 0;
    }
}
class StackUsingArray {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        System.out.println("enter the size of stack");
        int STACKSIZE = sc.nextInt();
        no11 ob = new no11(STACKSIZE);
        int data;
        System.out.println("enter a number to push");
        for (int i = 0; i < STACKSIZE; i++) {
            data = sc.nextInt();
            ob.push(data);
        }
        ob.pop();
    }
}

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

package folder2019;

import java.util.Scanner;

public class no11 {

private int STACKSIZE;

private Integer stack[];

no11(int STACKSIZE) {

this.STACKSIZE = STACKSIZE;

stack = new Integer[this.STACKSIZE];

}

int TOP = -1;

public void push(int data) {

if (TOP == STACKSIZE - 1) {

System.out.println("Stack overflow");

} else {

TOP++;

stack[TOP] = data;

}

public int pop() {

if (TOP == -1) {

System.out.println("Stack underflow");

} else {

System.out.println("Item deleted" + stack[TOP]);

TOP--;

}

return 0;

}

class StackUsingArray {

public static void main(String[] args) {

Scanner sc = new Scanner(System.in);

System.out.println("enter the size of stack");

int STACKSIZE = sc.nextInt();

no11 ob = new no11(STACKSIZE);

int data;

System.out.println("enter a number to push");

for (int i = 0; i < STACKSIZE; i++) {

data = sc.nextInt();

ob.push(data);

}

ob.pop();

}

Q.No 12

package folder2019;
import java.util.Scanner;
class DCLNode{
    int info;
    DCLNode previous;
    DCLNode next;
    DCLNode(int el){
        this.info=el;
        this.previous=null;
        this.next=null;
    }
    DCLNode(int el,DCLNode next,DCLNode previous){
        this.info=el;
        this.previous=previous;
        this.next=next;
    }
}
class DLList{
    public DCLNode head,tail;
    DLList(){
        head=tail=null;
    }
    public boolean isEmpty(){
        return head==null && tail==null;
    }
    public void insertattail(int el){
        if(isEmpty()){
            head=tail=new DCLNode(el);
            head.previous=tail;
            tail.next=head;
        }
       else{
           tail=new DCLNode(el,head,tail);
           tail.previous.next=tail;
            head.previous=tail;
        }
        }
    }
public class no12 {
    public static void main(String args[]){
        Scanner sc=new Scanner(System.in);
        DLList ob=new DLList();
        ob.insertattail(5);
  ob.insertattail(6);
    }
}

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

package folder2019;

import java.util.Scanner;

class DCLNode{

int info;

DCLNode previous;

DCLNode next;

DCLNode(int el){

this.info=el;

this.previous=null;

this.next=null;

}

DCLNode(int el,DCLNode next,DCLNode previous){

this.info=el;

this.previous=previous;

this.next=next;

}

class DLList{

public DCLNode head,tail;

DLList(){

head=tail=null;

}

public boolean isEmpty(){

return head==null && tail==null;

}

public void insertattail(int el){

if(isEmpty()){

head=tail=new DCLNode(el);

head.previous=tail;

tail.next=head;

}

else{

tail=new DCLNode(el,head,tail);

tail.previous.next=tail;

head.previous=tail;

}

public class no12 {

public static void main(String args[]){

Scanner sc=new Scanner(System.in);

DLList ob=new DLList();

ob.insertattail(5);

ob.insertattail(6);

}

Q.no 13 Q.no 14

KurskalAlgorith(weighted connected undirected graph)
		tree=null;
		edges=sequence of all edges of graph sorted by weight;
		for(i=1;i<= |E| and |tree| < |V| -1;i++)
			if ei  from edges does not form a cycle with edges in tree add ei  to tree;

1

2

3

4

5

KurskalAlgorith(weighted connected undirected graph)

tree=null;

edges=sequence of all edges of graph sorted by weight;

for(i=1;i<= |E| and |tree| < |V| -1;i++)

if ei from edges does not form a cycle with edges in tree add ei to tree;

Q.no 15 The topological sorting for a directed acyclic graph is the linear ordering of vertices. For every edge U-V of a directed graph, the vertex u will come before vertex v in the ordering. Topological sorting is only possible on DAG. […]