Videos uploaded by user “fun 2 code”

Best first search in artificial intelligence use an evaluation function to decide which adjacent is most promising and then explore. Best First Search falls under the category of Heuristic Search or Informed Search. Read from below links for more info :
https://www.geeksforgeeks.org/best-first-search-informed-search/
Artificial Intelligence algorithm playlist are at below link:
https://www.youtube.com/watch?v=7TmhnLHoeL8&list=PLNmFIlsXKJMnaoVHNcwBF07Tu244fn1c1

Views: 35394
fun 2 code

depth limited search (dls) is similar to dfs (depth first search) in artificial intelligence but it makes use of a limit or depth bound to find goal state
watch artificial intelligence algorithms with examples playlist below
https://www.youtube.com/watch?v=7TmhnLHoeL8&list=PLNmFIlsXKJMnaoVHNcwBF07Tu244fn1c1

Views: 12461
fun 2 code

K-means clustering algorithm is a method of vector quantization, originally from signal processing, that is popular for cluster analysis in data mining. k-means clustering aims to partition n observations into k clusters in which each observation belongs to the cluster with the nearest mean, serving as a prototype of the cluster. This results in a partitioning of the data space into Voronoi cells.
The problem is computationally difficult (NP-hard); however, there are efficient heuristic algorithms that are commonly employed and converge quickly to a local optimum. These are usually similar to the expectation-maximization algorithm for mixtures of Gaussian distributions via an iterative refinement approach employed by both k-means and Gaussian mixture modeling. Additionally, they both use cluster centers to model the data; however, kmeans clustering tends to find clusters of comparable spatial extent, while the expectation-maximization mechanism allows clusters to have different shapes.
======================================================
watch part 2 here:
https://www.youtube.com/watch?v=AukQSbtZ1NQ
book name: techmax publications datawarehousing and mining by arti deshpande n pallavi halarnkar

Views: 21579
fun 2 code

Breadth first search (bfs) algorithm in artificial intelligence(ai) can be implemented using FIFO queue data structure. Read bfs more from below link
https://www.tutorialspoint.com/artificial_intelligence/artificial_intelligence_popular_search_algorithms.htm
WATCH ARTIFICIAL INTELLIGENCE PLAYLIST BELOW :
https://www.youtube.com/watch?v=7TmhnLHoeL8&list=PLNmFIlsXKJMnaoVHNcwBF07Tu244fn1c1

Views: 5056
fun 2 code

Depth first search (Dfs) algorithm in artificial intelligence(Ai) is implemented in recursion with LIFO stack data structure.Read Dfs algorithm more from below link :
https://www.tutorialspoint.com/artificial_intelligence/artificial_intelligence_popular_search_algorithms.htm
WATCH ARTIFICIAL INTELLIGENCE PLAYLIST BELOW :
https://www.youtube.com/watch?v=7TmhnLHoeL8&list=PLNmFIlsXKJMnaoVHNcwBF07Tu244fn1c1

Views: 3852
fun 2 code

BOOK NAME : techmax publications datawarehousing and mining by arti deshpande n pallavi halarnkar
$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$
ALL DATA MINING ALGORITHM VIDEOS ARE BELOW :
https://www.youtube.com/watch?v=JZepOmvB514&list=PLNmFIlsXKJMmekmO4Gh6ZBZUVZp24ltEr
$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$
PDF OF THE SUM IS BELOW :
http://britsol.blogspot.in/2017/11/agglomerative-clustering-dendrogram.html?m=1
$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$
EXAMPLES ARE AT BELOW LINK
http://britsol.blogspot.in/2017/08/apriori-algorithm-example.html
$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$
DECISION TREE BASIC EXAMPLE PDF AND VIDEO ARE BELOW :
VIDEO :
https://www.youtube.com/watch?v=ajG5Yq1myMg&list=PLNmFIlsXKJMmekmO4Gh6ZBZUVZp24ltEr&index=2
PDF :
http://britsol.blogspot.in/2017/10/decision-tree-algorithm-pdf.html
$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$

Views: 3867
fun 2 code

*********************************************
visit below link for examples
http://britsol.blogspot.in/2017/08/apriori-algorithm-example.html
book name : techmax publications datawarehousing and mining by arti deshpande n pallavi halarnkar
********************************************
MORE DATA MINING ALGORITHM PLAYLIST IS ON BELOW LINK:
https://www.youtube.com/watch?v=JZepOmvB514&list=PLNmFIlsXKJMmekmO4Gh6ZBZUVZp24ltEr

Views: 94994
fun 2 code

a* algorithm in artificial intelligence makes use of a priority queue just like Uniform Cost Search with the element stored being the path from the start state to a particular node, but the priority of an element is not the same.
read more from below link
https://algorithmicthoughts.wordpress.com/2013/01/04/artificial-intelligence-a-search-algorithm/
*********************************************
WATCH MY ARTIFICIAL INTELLIGENCE ALGORITHM PLAYLIST FROM BELOW LINK
*********************************************
https://www.youtube.com/watch?v=7TmhnLHoeL8&list=PLNmFIlsXKJMnaoVHNcwBF07Tu244fn1c1

Views: 24451
fun 2 code

ALL DATA MINING ALGORITHM videos are on below link :
_____________________________________________________________
https://www.youtube.com/watch?v=JZepOmvB514&list=PLNmFIlsXKJMmekmO4Gh6ZBZUVZp24ltEr
*********************************************************************
apriori algorithm simple example :
http://britsol.blogspot.in/2017/08/apriori-algorithm-example.html
____________________________________________________________
book name: techmax publications datawarehousing and mining by arti deshpande n pallavi halarnkar

Views: 10950
fun 2 code

------------------------------------------------------------------------
JioFi M2S 150Mbps Wireless 4G Portable Data + Voice Device
http://amzn.to/2fHwdxS
--++++++++++++++++++++++++++++++++++
jboss download link
http://jbossas.jboss.org/downloads
visit below link for more
https://britsol.blogspot.in/

Views: 7311
fun 2 code

Alpha beta pruning or alpha beta cutoff example in AI
alpha-beta pruning algorithm steps
1) max will only update alpha value
2) min will only update beta value
3) dont pass alpha,beta values while going upwards in the tree,instead pass Node value in upward direction
4) pass alpha,beta only to the child nodes i.e in downward direction
alpha beta pruning in artificial intelligence (AI) is a search algorithm that seeks to decrease the number of nodes that are evaluated by the Minimax Algorithm in its search tree. It is an adversarial search algorithm used commonly for machine playing of two-player games (Tic-tac-toe, Chess, Go, etc.)
visit link for more :
https://en.wikipedia.org/wiki/Alpha%E2%80%93beta_pruning
======================================================
Artificial Intelligence algorithm playlist:
https://www.youtube.com/watch?v=7TmhnLHoeL8&list=PLNmFIlsXKJMnaoVHNcwBF07Tu244fn1c1

Views: 2395
fun 2 code

Iterative deepening search in artificial intelligence performs depth-first search to level 1, starts over, executes a complete depth-first search to level 2, and continues in such way till the solution is found.Read more below :
https://www.tutorialspoint.com/artificial_intelligence/artificial_intelligence_popular_search_algorithms.htm
Artificial intelligence algorithm with example playlist is below
https://www.youtube.com/watch?v=7TmhnLHoeL8&list=PLNmFIlsXKJMnaoVHNcwBF07Tu244fn1c1

Views: 11552
fun 2 code

K means clustering is a method of vector quantization, originally from signal processing, that is popular for cluster analysis in data mining. k-means clustering aims to partition n observations into k clusters in which each observation belongs to the cluster with the nearest mean, serving as a prototype of the cluster. This results in a partitioning of the data space into Voronoi cells.
For more visit below links :
https://en.wikipedia.org/wiki/K-means_clustering
https://www.datascience.com/blog/introduction-to-k-means-clustering-algorithm-learn-data-science-tutorials
############### BOOK NAME#######################
book name: techmax publications datawarehousing and mining by arti deshpande n pallavi halarnkar

Views: 18572
fun 2 code

naive Bayes classifiers in data mining or machine learning are a family of simple probabilistic classifiers based on applying Bayes' theorem with strong (naive) independence assumptions between the features.
Naive Bayes has been studied extensively since the 1950s. It was introduced under a different name into the text retrieval community in the early 1960s,and remains a popular (baseline) method for text categorization, the problem of judging documents as belonging to one category or the other (such as spam or legitimate, sports or politics, etc.) with word frequencies as the features. With appropriate pre-processing, it is competitive in this domain with more advanced methods including support vector machines. It also finds application in automatic medical diagnosis.
for more refer to
https://en.wikipedia.org/wiki/Naive_Bayes_classifier
naive bayes classifier example for play-tennis
Download PDF of the sum on below link
https://britsol.blogspot.in/2017/11/naive-bayes-classifier-example-pdf.html
*****************************************************NOTE*********************************************************************************
The steps explained in this video is correct but
please don't refer the given sum from the book mentioned in this video coz the solution for this problem might be wrong due to printing mistake.
****************************************************************************************************************************************
All data mining algorithm videos
Data mining algorithms Playlist:
http://www.youtube.com/playlist?list=PLNmFIlsXKJMmekmO4Gh6ZBZUVZp24ltEr
********************************************************************
book name: techmax publications datawarehousing and mining by arti deshpande n pallavi halarnkar
*********************************************

Views: 42667
fun 2 code

k nearest neighbour algorithm in data mining belongs to the supervised learning domain and finds intense application in pattern recognition, data mining and intrusion detection
https://www.geeksforgeeks.org/k-nearest-neighbours/
BOOK NAME : techmax publications datawarehousing and mining by arti deshpande n pallavi halarnkar
$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$
ALL DATA MINING ALGORITHM VIDEOS ARE BELOW :
https://www.youtube.com/watch?v=JZepOmvB514&list=PLNmFIlsXKJMmekmO4Gh6ZBZUVZp24ltEr
$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$
PDF OF KNN ALGORITHM EXAMPLE IS AT BELOW LINK
https://britsol.blogspot.in/2017/12/knn-k-nearest-neighbor-algorithm.html
$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$
EXAMPLES OF APRIORI ALGORITHM ARE AT BELOW LINK
http://britsol.blogspot.in/2017/08/apriori-algorithm-example.html
$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$
DECISION TREE BASIC EXAMPLE PDF AND VIDEO ARE BELOW :
VIDEO :
https://www.youtube.com/watch?v=ajG5Yq1myMg&list=PLNmFIlsXKJMmekmO4Gh6ZBZUVZp24ltEr&index=2
PDF :
http://britsol.blogspot.in/2017/10/decision-tree-algorithm-pdf.html
$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$

Views: 3209
fun 2 code

Download this sum PDF from link below
http://britsol.blogspot.in/2017/10/decision-tree-algorithm-pdf.html?m=1
book name: techmax publications datawarehousing and mining by arti deshpande n pallavi halarnkar

Views: 59215
fun 2 code

Alpha Beta Pruning (alpha-beta cutoff) Solved Example Artificial Intelligence (AI):
https://www.youtube.com/watch?v=N_wItjldKQ0&feature=youtu.be
Minimax or Min max Algorithm example in Artificial Intelligence which is also used in Tic-Tac-Toe game playing.Minimax Algorithm is a kind of backtracking algorithm used in game theory and decision making to find the optimal move for a player, assuming your opponent also plays optimally.Minimax algorithm in artificial intelligence (ai) is a decision rule used in decision theory, game theory, statistics and philosophy for minimizing the possible loss for a worst case (maximum loss) scenario.When dealing with gains, Minimax is referred to as "maximin"—to maximize the minimum gain. Originally formulated for two-player zero-sum game theory, covering both the cases where players take alternate moves and those where they make simultaneous moves, it has also been extended to more complex games and to general decision-making in the presence of uncertainty.
For more visit: https://en.wikipedia.org/wiki/Minimax
Some of the Artificial intelligence algorithm examples playlist link is below :
https://www.youtube.com/watch?v=Fwt9jhsCjC0&index=6&list=PLNmFIlsXKJMnaoVHNcwBF07Tu244fn1c1
Intro song : https://www.youtube.com/channel/UCBI9ekTJ4Wutlhh-BXgBq2A/featured

Views: 3110
fun 2 code

This video describes about opt page replacement algorithm with example..

Views: 4068
fun 2 code

What is Hill Climbing Approach in Artificial Intelligence?
Hill Climbing in artificial intelligence AI is a mathematical optimization technique which belongs to the family of local search. Hill Climbing algorithm in artificial intelligence is iterative that starts with an arbitrary solution to a problem, then attempts to find a better solution by making an incremental change to the solution. If the change produces a better solution, another incremental change is made to the new solution, and so on until no further improvements can be found.
For example, Hill Climbing can be applied to the travelling salesman problem. It is easy to find an initial solution that visits all the cities but will likely be very poor compared to the optimal solution. The algorithm starts with such a solution and makes small improvements to it, such as switching the order in which two cities are visited. Eventually, a much shorter route is likely to be obtained.
https://en.wikipedia.org/wiki/Hill_climbing
https://www.geeksforgeeks.org/introduction-hill-climbing-artificial-intelligence/
============================================
ARTIFICIAL INTELLIGENCE ALGORITHM OTHER PLAYLIST VIDEOS
https://www.youtube.com/watch?v=7TmhnLHoeL8&list=PLNmFIlsXKJMnaoVHNcwBF07Tu244fn1c1
============================================
Hill climbing Algorithm program in Java
http://funtwocode.blogspot.com/p/hill-climbing.html

Views: 8587
fun 2 code

Why Java main method is static and public is explained in this video
Can main method be overloaded? link here : https://www.youtube.com/watch?v=xfklo_LpWV0

Views: 185
fun 2 code

wanna make a simple software watch it!!

Views: 1257
fun 2 code

subscribe for more videos and press the notification icon..so that you may not miss the videos that i make on JAVA

Views: 237
fun 2 code

made with ezvid, free download at http://ezvid.com These are top 10 best countries to visit in your lifetime.It might differ acc to people

Views: 60
fun 2 code

Awesome!! discount on SENNHEISER Earphone on amazon (LIMITED STOCK AVAILABLE)!!
http://amzn.to/2kd55bI
-------------------------------------------------------------------------
Reliance JioFi M2S 150Mbps Wireless 4G Portable Data + Voice Device
http://amzn.to/2fHwdxS
±++++++++++++++++++++++++++++++++++
Best deal on Redmi NOTE 4
http://amzn.to/2yg0f3B
*********************************************
visit below link for awesome programming tricks!!
http://britsol.blogspot.in/
see how to make your own captcha on below link
http://britsol.blogspot.in/2017/08/create-simple-captcha-using-javascript.html

Views: 1229
fun 2 code

How to represent queue using array in data structures?
In Order to represent array using queues FRONT and REAR variables are used. FRONT variable is used to delete element from queue and REAR variable is used to insert element into queue.
-------------------------------------
watch part - 2 here :
https://youtu.be/oDAUpm4TvCE
---------------------------------------------------
data structures playlist :
https://www.youtube.com/watch?v=Wf4kmLNdJ5M&list=PLNmFIlsXKJMkvMxheDXZdNsnZn5TxXF8c

Views: 27
fun 2 code

infix to postfix conversion using Stack in data structure with example
This video just gives an short overview of converting infix expression to postfix expression without using stack. The Infix expression is represented as operator between the operands i.e A+B where A and B are operands and + is the operator between the operands. While the postfix expression has operator after the operands Eg) AB+ . While converting from infix to postfix the infix expression is parsed and then converted to postfix expression. The Infix expression is parsed as per the operator precedence and then converted to postfix expression. Also we can use stack to convert from infix to postfix.
Infix, prefix , postfix part 1 introduction link :
https://www.youtube.com/watch?v=Wf4kmLNdJ5M&list=PLNmFIlsXKJMkvMxheDXZdNsnZn5TxXF8c

Views: 174
fun 2 code

Array representation of queue in data structures
Overflow occurs in the array if the REAR = MAX-1 . This means that no element will be inserted now because the queue is already full.
Underflow occurs in the array when FRONT=-1 or FRONT greater than REAR.
when FRONT=-1 that means queue is empty. when FRONT greater than REAR means all elements have been deleted in the queue
data structures playlist :
https://www.youtube.com/watch?v=Wf4kmLNdJ5M&list=PLNmFIlsXKJMkvMxheDXZdNsnZn5TxXF8c

Views: 45
fun 2 code

thread join java multithreading example
part 1 Theory link with example :
https://youtu.be/oFYrjSfjDao

Views: 17
fun 2 code

Infix to Prefix using Stack in data structure example
Infix to Prefix conversion using stack has following steps :
1) Reverse the Infix expression
2) make every opening bracket as closing bracket and closing bracket as opening bracket
3) Convert the modified expression to postfix form.
see below link for Infix to Postfix conversion using stack and without stack :
Infix to Postfix conversion basic example
https://www.youtube.com/watch?v=rUm_XapVuvg
Infix to postfix conversion with stack data structure example
https://www.youtube.com/watch?v=r3kJEyz8rZ0
4) Reverse the postfix expression, finally you will get the result expression from Infix to Prefix Conversion using Stack data structure
some of the import link for infix to prefix conversion
https://www.geeksforgeeks.org/convert-infix-prefix-notation/
https://scanftree.com/Data_Structure/infix-to-prefix
https://www.tutorialspoint.com/Convert-Infix-to-Prefix-Expression
Data structures playlist :
https://www.youtube.com/watch?v=Wf4kmLNdJ5M&list=PLNmFIlsXKJMkvMxheDXZdNsnZn5TxXF8c

Views: 3243
fun 2 code

Infix to Prefix conversion in data structures can be done by parsing the Infix expression and considering the precedence of the Infix expression and evaluating it in which the operator must always be before operand.Read from below link for more info on infix to prefix
https://www.geeksforgeeks.org/convert-infix-prefix-notation/
Infix to prefix using stack link is as follows :
Some of the other useful links for Infix to Prefix Conversion :
http://interactivepython.org/runestone/static/pythonds/BasicDS/InfixPrefixandPostfixExpressions.html
https://scanftree.com/Data_Structure/infix-to-prefix
https://www.tutorialspoint.com/Convert-Infix-to-Prefix-Expression
infix to postfix conversion link is as follows :
https://www.youtube.com/watch?v=rUm_XapVuvg
Infix to postfix conversion using stack is as follows :
https://www.youtube.com/watch?v=r3kJEyz8rZ0
Data structures playlist :
https://www.youtube.com/watch?v=Wf4kmLNdJ5M&list=PLNmFIlsXKJMkvMxheDXZdNsnZn5TxXF8c

Views: 326
fun 2 code

thread join method java multithreading example link :
http://funtwocode.blogspot.com/2018/08/thread-join-method-in-java.html

Views: 71
fun 2 code

Bankers Algorithm example in Operating System (OS)
Bankers Algorithm in Operating System is for Deadlock Avoidance and is a resource allocation algorithm developed by Edsger Dijkstra.
The Bankers Algorithm or banker algorithm derives its name from the fact that this algorithm could be used in a banking system to ensure that the bank does not run out of resources, because the bank would never allocate its money in such a way that it can no longer satisfy the needs of all its customer.
By using the Banker's algorithm, the bank ensures that when customers request money the bank never leaves a safe state.
https://en.wikipedia.org/wiki/Banker%27s_algorithm.
visit above link for more information
Operating System tutorials playlist :
https://www.youtube.com/watch?v=s-sd0E5sQco&list=PLNmFIlsXKJMl0yB4ZmumAB7pomPzrYcPn
Bankers algorithm explaination :
https://www.geeksforgeeks.org/operating-system-bankers-algorithm/
Intro music (Nsquare - parade)
https://www.youtube.com/watch?v=W165Y2QOiVU

Views: 166
fun 2 code

angularjs form validation tutorial link in below :
http://britsol.blogspot.in/p/angular-forms-part-1-bes-way.html
custom directive to display table data in angular
http://britsol.blogspot.in/p/create-custom-directive-to-display-table.html
making use of one modal to render multiple data using json
http://britsol.blogspot.in/p/making-use-of-one-modal-to-render.html

Views: 32
fun 2 code

infix prefix postfix conversion using stack pdf
https://uomustansiriyah.edu.iq/media/lectures/5/5_2017_10_06!09_58_23_PM.pdf

Views: 72
fun 2 code

LRU is least recently used page replacement algorithm example is explained

Views: 3398
fun 2 code

yes we can overload main method in java but JVM will always look for main method with String[] argument
other overloaded main method can be executed but we have to call that method explicitly just like normal method call
$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$
Intro Music : https://www.youtube.com/watch?v=YfIuVmVSi6s
$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$
Java interview playlist link :

Views: 46
fun 2 code

In this video fifo page replacement algorithm is explained!!

Views: 774
fun 2 code

made with ezvid, free download at http://ezvid.com in this playlist we will cover some of the important java programs that are very important for interview...first we will start with strings coz most programs are asked from strings..further we will discuss more about it..

Views: 174
fun 2 code

Awesome!! discount on SENNHEISER Earphone on amazon (LIMITED STOCK AVAILABLE)!!
http://amzn.to/2kd55bI
-------------------------------------------------------------------------
Reliance JioFi M2S 150Mbps Wireless 4G Portable Data + Voice Device
http://amzn.to/2fHwdxS
±++++++++++++++++++++++++++++++++++
Best deal on Redmi NOTE 4
http://amzn.to/2yg0f3B
*********************************************

Views: 316
fun 2 code

Awesome!! discount on SENNHEISER Earphone on amazon (LIMITED STOCK AVAILABLE)!!
http://amzn.to/2kd55bI
-------------------------------------------------------------------------
Reliance JioFi M2S 150Mbps Wireless 4G Portable Data + Voice Device
http://amzn.to/2fHwdxS
±++++++++++++++++++++++++++++++++++
Best deal on Redmi NOTE 4
http://amzn.to/2yg0f3B
*********************************************
java code for finding anagrams
import java.util.Arrays;
class main
{
public static void main(String args[])
{
String a="hello";
String b="elloh";
char c[]=b.toCharArray();
char d[]=a.toCharArray();
//we have to find if both String a and b are anagrams
Arrays.sort(c);
Arrays.sort(d);
String e=new String(c);
String f=new String(d);
if(e.equals(f))
{
System.out.println("anagrams");
}
else
{
System.out.println("not anagrams");
}
}
}

Views: 910
fun 2 code

This video give u brief explanation about how to create a user with sql and assign privilleges to the user.For Notes visit my blog Link is http://britsol.blogspot.in/

Views: 53
fun 2 code

made with ezvid, free download at http://ezvid.com this video is just the working of the software,tutorials on this will be made later..

Views: 64
fun 2 code

made with ezvid, free download at http://ezvid.com in this playlist we will cover some of the important java programs that are very important for interview...first we will start with strings coz most programs are asked from strings..further we will discuss more about it..

Views: 288
fun 2 code

Infix to Postfix using Stack in data structure example
This video contains example of Infix to Postfix conversion using Stack. The Infix expression is represented as operator between the operands i.e A+B where A and B are operands and + is the operator between the operands. While the postfix expression has operator after the operands Eg) AB+ . While converting from Infix to Postfix the Infix expression is parsed and then converted to Postfix expression. The Infix expression is parsed as per the operator precedence and then converted to Postfix expression. Also we can use stack to convert from infix to Postfix.
Infix, Prefix , Postfix part 1 introduction link :
https://www.youtube.com/watch?v=Wf4kmLNdJ5M&list=PLNmFIlsXKJMkvMxheDXZdNsnZn5TxXF8c
Some of the useful links are as follows :
https://www.geeksforgeeks.org/stack-set-2-infix-to-postfix/
https://www.includehelp.com/c/infix-to-postfix-conversion-using-stack-with-c-program.aspx
https://codeburst.io/conversion-of-infix-expression-to-postfix-expression-using-stack-data-structure-3faf9c212ab8?gi=3d0c32fe71c2

Views: 107
fun 2 code

Awesome!! discount on SENNHEISER Earphone on amazon (LIMITED STOCK AVAILABLE)!!
http://amzn.to/2kd55bI
-------------------------------------------------------------------------
Reliance JioFi M2S 150Mbps Wireless 4G Portable Data + Voice Device
http://amzn.to/2fHwdxS
±++++++++++++++++++++++++++++++++++
Best deal on Redmi NOTE 4
http://amzn.to/2yg0f3B
*********************************************
mp3 player working!!

Views: 1034
fun 2 code

this whole playlist will consist of mostly important string programs in java..which is very important from the interview point..this whole video will teach u the tricks and methods to perform various string operations..

Views: 749
fun 2 code

here is some apple's future technologies..
must watch...

Views: 156
fun 2 code

The Banker's algorithm, sometimes referred to as the detection algorithm, is a resource allocation and deadlock avoidance algorithm developed by Edsger Dijkstra that tests for safety by simulating the allocation of predetermined maximum possible amounts of all resources, and then makes an "s-state" check to test for possible deadlock conditions for all other pending activities, before deciding whether allocation should be allowed to continue.
for more visit
https://en.wikipedia.org/wiki/Banker%27s_algorithm

Views: 22826
fun 2 code

Can u fuck me

Here!

Here!

Here!

© 2019 How to start mobile phone business

Divide and Conquer. This is another area that is very industry-dependent, but it is highly unlikely that any company can afford to have an entire contract team devoted to managing one portfolio. More than likely, it is more realistic to divvy up the team and the contracts so that there is a leader for each relevant sphere. The entire team will obviously have to coordinate and communicate, but resources must be allocated in the most efficient manner possible. In turn, this will allow for several individuals to keep an eye on a smaller batch of contracts, thereby facilitating those periodic reviews. Outsource the Tedium to Technology.