Code Logic

In this episode we talk about various steps in data cleaning process in Natural Language Processing. Data cleaning is almost a given whenever you want to perform natural language processing onto the given text. Data cleaning in natural language processing involves tokenization, lowering the words, lemmatization, and so on. Aside from talking about that we also talk about how you can implement those briefly. To install codesnip mentioned in the last part open your terminal and write pip install codesnip

A general discussion about natural language processing, in this episode we discuss what is contained within natural language processing and we discuss about topics which we will be discussing about in further episodes.

In this podcast episode we discuss about basics of sentiment analysis and its objective. In future episodes we will discuss the same in a bit more depth.

In this podcast episode we talk about the basics for Searching in computer programming. We discuss 2 things, first is the naive way and other is binary search. These two techniques are apt for many applications and will help you get your way around the algorithm design.

Hello everyone, this time we will learn about linked lists! I mean they are amazing and very useful. They are used for various purposes like creating stacks , queues, lists, various management systems like library management systems, admissions management systems , hospital management systems and the list goes on! In this podcast episode we look into what linked lists are and various types of linked lists.

Stacks are a linear data structures which we use in many applications and in various domains, in this podcast episode we look at basics about stacks and where they are used.

In this episode, we will be discussing about how we can implement a minimum spanning tree algorithm, while doing so we will also discuss union find data structure and how it helps us in finding weather including an edge will lead to a cycle in the tree or not.

So, in this podcast we discuss about what connected graphs are , what trees are, how they differ from each other and how to convert a graph into a tree. So basically after getting a grasp on these basic concepts, we will try to understand how we can get a minimum spanning tree from a given connected graph.

Queue's are linear data structures which are quite important in operating systems and are used to implement algorithms such as round robin algorithm, priority queue scheduling and multilevel queue scheduling... In this podcast we will have a glance on these concepts and will discuss a bit about how queue works and how we can implement it.

In this podcast we will mainly discuss about finding reverse of a given number, using which we will find if the given number is a palindromic number or not...