Tag: Computer Science

Object Oriented Programming | What Is OOPS In Java?

Computer Science

February 8, 2022
/ Leave a Comment on Object Oriented Programming | What Is OOPS In Java?

4 min
2 years
675 words
1

Tagged Computer Science, Java, OOPS

Object Oriented Programming | What Is OOPS In Java?

Author: Zeba Ali What is object-oriented programming? Object Oriented Programming is a methodology or paradigm in Java to design a program using class and object. It simplifies software development and maintenance by providing concept such […]

Author: Zeba Ali

What is object-oriented programming?

Object Oriented Programming is a methodology or paradigm in Java to design a program using class and object. It simplifies software development and maintenance by providing concept such as object, class, inheritance, Polymorphism, Abstraction , Encapsulation.

How Object Oriented Programming is related to real world?

To solve the problems of the real world , we do coding. Based on an object, in OOP, we write a logic, with features such as abstraction, polymorphism, inheritance , encapsulation. There are a lot of known objects such as a car, machine , bike, ATM, etc. Classes help in creating Object logic, for example with a phone we can call , use Bluetooth , take pictures etc. These all functions divide as classes, when we are creating classes we need consider solid various principles such as:

Abstraction

when we are making a call, it only concentrates on the number end display that end screen, we really do not know how this connect with other number .

Encapsulation

when we turn on the Bluetooth we can connect with other devices. We can assess to connect to other phones. But from that phone we cannot assess to call or send SMS, encapsulation hides that level.

Polymorphism

When we turn on the phone by one button the same time we can turn it off by the same button.

Why we need OOP in programming language?

Duplicate code is bad.
Code will always be changed.

Limitation of oops

1- Improved software development productivity: OO programming is modular, as it provides separation of duties in object-based program development. It is also extensible and objects may extend to include new attributes and behaviors. We can reuse objects within an across applications. Because of these three factors; extensibility, modularity, and reusability.

2- Faster development: Reuse enables faster development. Object-oriented programming languages come with rich libraries of objects, and code developed during projects is also reusable in future projects.

3- Lower cost of development: The reuse of software also lowers the cost of development. Typically, more we have to put into the OO analysis and design, which lowers the overall cost of development.

4- Higher-quality software: Faster development of software and lower cost of development allows more time and resources to be used in the verification of the software. Although quality is dependent upon the experience of the teams, OO programming tends to result in higher-quality software

Disadvantages of oop

1- Steep learning curve: The thought process involved in OO programming may not be natural for some people, and it will take the time to get used to it.

2- The complexity of creating programs: it is very complex to create programs based on the interaction of objects. Some of the key programming techniques, such as inheritance and polymorphism, can be a big challenging to comprehend initially.

Why is X language object Oriented? what does it mean?

Oops is a computer programming model that organize software design around data , or object rather than function and logic. OOP focus on object that developer want to manipulate rather than the logic required to manipulate them .

Java use OOP language as java use classes and object but java is not pure OOP language as java support non-primitive data type like int, float etc.

X language needs to satisfy 7 qualities:-

Encapsulation
Inheritance
Abstraction
Polymorphism
All predefined types are object
All user defined are object
each and every operation performed on object must only through method exposed at object.

Java only support 1,2,3,4 and 6 but fails to support property 5 and 7 given above. Java language contains certain properties because of which it is not a pure language. These are :
Primitive Data Type ex. int, long, bool, float, char, etc as Objects: Smalltalk is a ‘pure’ object-oriented programming language unlike Java and C++ as there is no difference between values which are objects and values which are primitive types. In Smalltalk, primitive values such as integers, Booleans and characters are also objects.
In Java, we have predefined types as non-objects (primitive types).

Read Similar Types :

Virtual Reality and Human Understanding

For any Query

Mail us at edumoundofficial@gmail.com

What is Minimum Spanning Tree? | Algorithms

Computer Science

February 7, 2022
/ Leave a Comment on What is Minimum Spanning Tree? | Algorithms

3 min
2 years
456 words
1
25

Tagged btech, Computer Science, Engineering, minimum spanning tree, spanning tree

What is Minimum Spanning Tree? | Algorithms

minimum spanning tree is a spanning tree which has minimum total cost. A spanning tree is a sub graph that is a tree and joined all vertices.

Author: Zeba Ali

Table of Contents :

Before knowing about the Minimum Spanning Tree , We must know about spanning tree.

A Spanning Tree is a connected undirected graph, a spanning tree is a sub graph that is a tree and joined all vertices. A single graph can have many spanning trees.

Example:-

Minimum Spanning Tree

Minimum spanning tree is a spanning tree which has minimum total cost.

How to calculate minimum cost spanning tree?

We can calculate it by using two algorithms:-

Prim’s Algorithm
Kruskal Algorithm

Kruskal’s Algorithm

It is a Greedy Algorithm. The Greedy Choice is to put the smallest weight edge first that does not form a cycle in the MST constructed so far.

Find the Minimum Spanning Tree of the following graph using Kruskal’s algorithm

here are 9 vertices and 12 edges. So MST formed (9-1) = 8 edges

Step1: So, first take (h, g) edge

Step -2: then (g, f) edge.

Step-3: then (a, b) and (i, g) edges are considered, and the forest becomes

Step 4: Now, edge (h, i). Both h and i vertices are in the same set. Thus it creates a cycle. So this edge is discarded.

Then edge (c, d), (b, c), (a, h), (d, e), (e, f) are considered, and the forest becomes.

Step 5: In (e, f) edge both endpoints e and f exist in the same tree so discarded this edge. Then (b, h) edge, it also creates a cycle.

Step 6: After that edge (d, f) and the final spanning tree is shown as in dark lines.

Step 7: This step will be required Minimum Spanning Tree because it contains all the 9 vertices and (9 – 1) = 8 edges

e → f, b → h, d → f [cycle will be formed]

Minimum Cost MST

Prim’s Algorithm

It is a greedy algorithm. It starts with an empty spanning tree. The idea is to maintain two sets of vertices:

Contain vertices already included in MST.
Contain vertices not yet included.

Find the minimum cost spanning tree for the following graph using Prim’s algorithm.

In Prim’s algorithm, first we initialize the priority Queue Q. to contain all the vertices and the key of each vertex to ∞ except for the root, whose key is set to 0. Suppose 0 vertex is the root, i.e., r. By EXTRACT – MIN (Q) procure, now u = r and Adj [u] = {5, 1}.Prime Ministers of India | List of Prime Minister of India (1947-2020)

Removing u from set Q and adds it to set V – Q of vertices in the tree. Now, update the key and π fields of every vertex v adjacent to u but not in a tree.

Taking 0 as starting vertex
Root = 0
Adj [0] = 5, 1
Parent, π [5] = 0 and π [1] = 0
Key [5] = ∞ and key [1] = ∞
w [0, 5) = 10 and w (0,1) = 28
w (u, v) < key [5] , w (u, v) < key [1]
Key [5] = 10 and key [1] = 28
So update key value of 5 and 1 is:

Now by EXTRACT_MIN (Q) Removes 5 because key [5] = 10 which is minimum so u = 5.

Adj [5] = {0, 4} and 0 is already in heap
Taking 4, key [4] = ∞ π [4] = 5
(u, v) < key [v] then key [4] = 25
w (5,4) = 25
w (5,4) < key [4]
date key value and parent of 4.

Now remove 4 because key [4] = 25 which is minimum, so u =4

Adj [4] = {6, 3}
Key [3] = ∞ key [6] = ∞
w(4,3) = 22 w (4,6) = 24
w (u, v) < key [v] w (u, v) < key [v]
w (4,3) < key [3] w (4,6) < key [6]

Update key value of key [3] as 22 and key [6] as 24.

And the parent of 3, 6 as 4.

π[3]= 4 π[6]= 4

u = EXTRACT_MIN (3, 6) [key [3] < key [6]]
u = 3 i.e. 22 < 24

Now remove 3 because key [3] = 22 is minimum so u =3.

Adj [3] = {4, 6, 2}
4 is already in heap
4 ≠ Q key [6] = 24 now becomes key [6] = 18
Key [2] = ∞ key [6] = 24
w (3, 2) = 12 w (3, 6) = 18
w (3, 2) < key [2] w (3, 6) < key [6]

Now in Q, key [2] = 12, key [6] = 18, key [1] = 28 and parent of 2 and 6 is 3.

π [2] = 3 π[6]=3

Now by EXTRACT_MIN (Q) Removes 2, because key [2] = 12 is minimum.

u = EXTRACT_MIN (2, 6)
u = 2 [key [2] < key [6]]
12 < 18
Now the root is 2
Adj [2] = {3, 1}
3 is already in a heap
Taking 1, key [1] = 28
w (2,1) = 16
w (2,1) < key [1]

So update key value of key [1] as 16 and its parent as 2.

π[1]= 2

Now by EXTRACT_MIN (Q) Removes 1 because key [1] = 16 is minimum.

Adj [1] = {0, 6, 2}
0 and 2 are already in heap.
Taking 6, key [6] = 18
w [1, 6] = 14
w [1, 6] < key [6]

Update key value of 6 as 14 and its parent as 1.

Π [6] = 1

Now all the vertices have been spanned, Using above the table we get Minimum Spanning Tree.

0 → 5 → 4 → 3 → 2 → 1 → 6
[Because Π [5] = 0, Π [4] = 5, Π [3] = 4, Π [2] = 3, Π [1] =2, Π [6] =1]

Thus the final spanning Tree is

Total Cost = 10 + 25 + 22 + 12 + 16 + 14 = 99

Read Similar Articles :

Programme to Count the Word in a Text File | C++

For any Query

Mail us at edumoundofficial@gmail.com

This write-up was edited by Tanya.

Programme to Count the Word in a Text File | C++

Computer Science

October 28, 2020
/ Leave a Comment on Programme to Count the Word in a Text File | C++

1 min
3 years
91 words
2

Tagged C++, Computer Science

Programme to Count the Word in a Text File | C++

Programme to Count the Word ‘THE’ in a Text File This is the programme that you need! You need to change the terms as per your requirement. #include<iostream.h> #include<fstream.h> #include<conio.h> #include<string.h> #include<stdio.h> #include<process.h> //For exit() […]

Programme to Count the Word ‘THE’ in a Text File

This is the programme that you need! You need to change the terms as per your requirement.

#include<iostream.h>

#include<fstream.h>

#include<conio.h>

#include<string.h>

#include<stdio.h>

#include<process.h> //For exit() purpose

void main()

{

clrscr(); //For cleaning purpose

int count=0;

char word[20]; //Assuming the longest word to be 19 characters long

ifstream fin; //Opening the file

fin.open(“The.txt”); //Open file in read mode

if(!fin)

{

cout<<”Could not open The.text file”;

exit(-1);

}

while(!fin.eof()) // To read the characters word by word

{

fin>>word;

if((strcmpi(word,”the”)==0)||(strcmpi(word,”The”)==0)) //strcmpi :- in order to ignore cases while comparing the strings

count++;

}

cout<<“Number of time ‘THE’ is present in a text file : “<<count;

fin.close(); //Closing the file

getch();

}

Here is an example as to how the above coding would get you the result . The file where the entry has been made, to count the word ‘THE’ :- There is a monkey in the zoo. The monkey was very naughty.

Result which would be shown after the above text has been read by the programme. The word ‘THE’ is present in the text for 2 times.

More Examples :

If you want to count the word monkey in the above text, you just need to write monkey in place of the in the steps :-

Instead of this : – if((strcmpi(word,”the”)==0)||(strcmpi(word,”The”)==0))

Write : – if((strcmpi(word,”monkey”)==0)||(strcmpi(word,”Monkey”)==0))

Also you need to change the ‘cout’ statement to show the number of times the word ‘THE’ is present with the word ‘MONKEY’.

Here, the result would show :- Number of time ‘MONKEY’ is present in a text file : 2

For any queries Drop Us a Message in the Comment Section

For more information Visit Our Site

If you want to submit your work Contact US

Who are We?

EduMound is a start-up platform established for young minds aspiring to contribute their skills and knowledge for the growth of the educational fraternity. We are an educational platform that focuses on the co-curricular portfolio development of students.

Stay Connected

Events

SUBSCRIBE TO OUR WEBSITE!