Videos uploaded by user “IT Miner - Tutorials,GK & Facts”
Data Mining  Association Rule - Basic Concepts
short introduction on Association Rule with definition & Example, are explained. Association rules are if/then statements used to find relationship between unrelated data in information repository or relational database. Parts of Association rule is explained with 2 measurements support and confidence. types of association rule such as single dimensional Association Rule,Multi dimensional Association rules and Hybrid Association rules are explained with Examples. Names of Association rule algorithm and fields where association rule is used is also mentioned.
What is Networking
What is a Network? Network is an Inter connected collection of autonomous Computers. Purpose of Networking are a) Sharing Information. b)Sharing the Resources. c) Storage. d)Backing Up data.
The objective of data link layer is to reliably transmit data between 2 nodes. Protocol is a set of rules & Guidelines for communicating the data. Network has to follow these rules to successfully transmit the data. 3 types of protocol. Unrestricted Simplex protocol. Simplex stop & wait Protocol. Simplex protocol for noisy channel. These three types of protocols are explained in this video.
Introduction on Compilers & 6 phases of compiler
What is a Compiler A compiler is a Special Program, that converts the source program written in a high level language into target program which is an Machine language. Compilation process is a sequence of various phases.There are 6 phases of Compiler.They are Lexical Analysis Syntax Analysis Semantic Analysis Intermediate Code Representation Code Optimization & Code Generation These 6 phases of compilers are explained in Detail in this video.
50 Easy GK questions & Answers for kids & students. kids GK Questions Part II: https://www.youtube.com/watch?v=isbeMMk-DtE Kids GK Part 3 : https://www.youtube.com/watch?v=ZGS7cIKek5Q kids Riddles:https://www.youtube.com/watch?v=V_C2t1Cbfwk
Data Mining   KDD Process
KDD - knowledge discovery in Database. short introduction on Data cleaning,Data integration, Data selection,Data mining,pattern evaluation and knowledge representation.
Web Mining - Tutorial
Web Mining Web Mining is the use of Data mining techniques to automatically discover and extract information from World Wide Web. There are 3 areas of web Mining Web content Mining. Web usage Mining Web structure Mining. Web content Mining Web content Mining is the process of extracting useful information from content of web document.it may consists of text images,audio,video or structured record such as list & tables. screen scaper,Mozenda,Automation Anywhere,Web content Extractor, Web info extractor are the tools used to extract essential information that one needs. Web Usage Mining Web usage Mining is the process of identifying browsing patterns by analysing the users Navigational behaviour. Techniques for discovery & pattern analysis are two types. They are Pattern Analysis Tool. Pattern Discovery Tool. Data pre processing,Path Analysis,Grouping,filtering,Statistical Analysis, Association Rules,Clustering,Sequential Pattterns,classification are the Analysis done to analyse the patterns. Web structure Mining Web structure Mining is a tool, used to extract patterns from hyperlinks in the web. Web structure Mining is also called link Mining. HITS & PAGE RANK Algorithm are the Popular Web structure Mining Algorithm. By applying Web content mining,web structure Mining & Web usage Mining knowledge is extracted from web data.
Data Mining - Clustering
What is clustering Partitioning a data into subclasses. Grouping similar objects. Partitioning the data based on similarity. Eg:Library. Clustering Types Partitioning Method Hierarchical Method Agglomerative Method Divisive Method Density Based Method Model based Method Constraint based Method These are clustering Methods or types. Clustering Algorithms,Clustering Applications and Examples are also Explained.
What is Inheritance?
The inheritance is the ability to create new class by extending the existing class. Let us consider an example : rectangle, triangle, circle, polygan are derived classes, which inherits the properties from base class shapes. Base class is also called Parent class or super class. Derived class is also called subclass.There are two ways to achieve inheritance. 1. simply add a method to derived class. 2.Change the behaviour of existing base class function.This is also referred to as overriding the function. Advantage of Inheritance 1. Reusability. 2.Extensibility. 3.Saves Developers Time. 4.Avoid Duplicate Code. 5.Ease Maintanence.
Data Mining - Decision tree
Decision tree represents decisions and decision Making. Root Node,Internal Node,Branch Node and leaf Node are the Parts of Decision tree Decision tree is also called Classification tree. Examples & Advantages for decision tree is explained. Data mining,text Mining,information Extraction,Machine Learning and Pattern Recognition are the fileds were decision tree is used. ID3,c4.5,CART,CHAID, MARS are some of the decision tree algorithms. when Decision tree is used for classification task, it is also called classification tree.
A Network can be classified based on their Size, Capabilities & Geographical distance. Different types of Networks provide different services. Network Types are: Local Area Network(LAN) Wide Area Network(WAN) Metropolitan Area Network(WAN) Wireless Area Network(WLAN) Personal Area Network(PAN) Storage Area Network (SAN) These Network types are Explained in Detailed.
What is Network Topologies. Network topology is the arrangement with which computer systems or network devices are connected to Each other. Types of Network Topology 1. Bus Topology. 2.Ring Topology 3.Star Topology. 4.Mesh Topology. 5. Tree Topology. 6.Hybrid Topology . These topologies are Explained shortly in this video.
Space science & universe question & answers for students & amateur astronomers. Also check 50 science Question & answers:https://www.youtube.com/watch?v=x3OAZUdGmi0&t=58s 50 kids GK question & answers Part 1: https://www.youtube.com/watch?v=5O7FFpmCVIg&t=5s&pbjreload=10
What is Data Mining
Small introduction on Data Mining - What is Data Mining Data Mining is a tool to Extract Hidden data.
Lexical Analysis :   Introduction - Tokens,Patterns,Lexeme
Lexical analysis is the first phase of compiler. It is a process of taking Input string of characters and producing sequence of symbols called tokens are lexeme, which may be handled more easily by parser. Interaction of lexical analysis with parser is explained. Tokens Tokens are sequence of character that can be treated as a single logical unit, tokens may be a) identifiers b)keywords c)operators d)special symbols e)constants. Lexemes A lexeme is a sequence of characters, in a source program that is matched by a pattern for token. Pattern Rule of description is a pattern. Attribute for token when more than one pattern, matches a lexeme, lexical analyzer must provide additional information about particular lexeme,that is matched to subsequent phase of compiler. Examples for Patterns,lexemes & tokens are explained.
Data Mining Classification - Basic Concepts
Classification in Data Mining with classification algorithms. Explanation on classification algorithm the decision tree technique with Example.
Introduction to HDFS, description of Name node and data Node. HDFS architecture,advantages of HDFS.
Based on cloud location we can classify cloud as Public Private & Hybrid Cloud Public Cloud Public Cloud means the whole computing infrastructure is located on the premises of a cloud computing company that offers the cloud service.The location remains seperate from the customer & has no physical control over the infrastructure. Private cloud Private cloud means cloud infrastructure is used solely by one customer or organization.Private cloud is dedicated to the needs & Goals of a single organization. Hybrid Cloud Hybrid Cloud is a Computing Environment which combines public & Private cloud by allowing data & applications to be shared between them. Most organization use a combination of private computing resources & Public services. Example: Public cloud can be used to interact with customers, while keeping their data secured through Private Cloud.
kids GK Part 1:: https://www.youtube.com/watch?v=5O7FFpmCVIg. Part 3: https://www.youtube.com/watch?v=ZGS7cIKek5Q&t=3s
What is Blue tooth Technology & its Topologies
Blue tooth is a wireless technology,that allows devices to communicate or transmit data or voice wirelessly over a short distance. It replaces cables with wireless connectivity,maintaining high level of security. it uses radio range of 2.5 Ghz. There are 2 types of blue tooth network topologies. They are 1.Piconet 2. Scatternet. Piconet has 8 stations,one being master & other seven being slaves. scatternet is made up of atleast 2 piconets.it allows more efficient use of available bluetooth channel bandwidth.
Data Ware Housing : Data Mart  Tutorial
Plz visit this link for introduction to Data Ware house:https://www.youtube.com/watch?v=Hmx8dX29LrQ Data Marts are the subset of Data warehouse, which focuses on Particular subject or department, such as sales, finance or marketing. 3 types of Data Mart Independent Data Mart Dependent Data Mart Hybrid Data Mart Independent Data mart depends on operational data source or external data source for data. Dependent Data mart depends on Enterprise Data ware house for data. Hybrid Data Mart depends on both data warehouse and operational, external data ware house for data. Goals of Data Mart Ease to Access frequently needed data. improves End user respose time. Significant cost saving by eliminating redundant data. Focuses on Data Eligibility. Data marts are created much faster. Difference between data mart & Data ware house is explained. Top down & Bottom Up approach of Data ware house is also explained.
Introduction on Hash Tables ,Hash function,collision,collision resolving strategies are explained. Popular Hash function Division method is explained. Also collision resolving technique, Open Addressing & chaining are explained with examples. properties of hash function is also Explained.
General Knowledge Question & Answers for all Competitive Exams, Interviews & Quiz. Also Everyone can listen to improve their Knowledge. link for kids GK Questions & Answers - Part- 1: https://www.youtube.com/watch?v=5O7FFpmCVIg&t=136s Part2: https://www.youtube.com/watch?v=isbeMMk-DtE&t=203s
Data structures : Linked List - Easy Introduction
what is linked list Linked list is a linear data structure, consists of group of node in a sequence. Each node has 2 parts a)Own Data b)Address or reference to next node. Linked list is explained with Easy Example. Linked list, Overcomes limitations of arrays. for arrays plz click:https://www.youtube.com/watch?v=PJc59KYe5Ok Advantages of linked list Dynamic Data structure Insertion & deletion operation are easily implemented. Efficient memory utilization operations of linked list creation Insertion Deletion Traversing Concatenation Operations of linked are explained briefly. Types of Linked list Single Linked list Double Linked list Circular Linked list Circularly doubled linked list, here the 4 types of linked list,which is explained with pictures.
Big Data - What is Big Data
What is Big data ? Big data is a Collection of large data sets,that were difficult to process using traditional system and software technique. Data Sets Data sets might be structured or unstructured Data. Structured Data are traditional data in terms of rows & columns. Unstructured data is data in unstructured form might be audio,video,financial transaction,photos, digitized documents and so on. Example Good Example is Facebook. Facebook deals with huge amount of Data, which contains both structured and Unstructured Data. 4 v's of Big Data. They are 1. volume - How Big? 2.velocity - How fast? 3.veracity - How many Varieties ? 4.variety - Is it trustworthy. Technologies Data mining,Machine learning, Distributed file system,Internet,Genetic Algorithm, Distributed Data base,Simulation,Integration,Distributed file system are some of the technologies that go in hand with big Data. Applications Social Media. Science & Research. Aircraft. Banking. E- Commerce. Retailers. These are the applications where they deal with large amount of Data.
Data structures: Easy Introduction on Trees
What is Tree Trees are Non Linear Data structure,where each item is connected to several other item in a hierarchical format. Terminologies of trees Root Node - Top Most Node in a tree. Parent Node - if a Node has child it is called parent Node. child Node - Child is a Node extended from another Node. Leaf - Node with No child. siblings - siblings are the node,belong to same parent. Internal Node - Internal Node is a node with at least one child. External Node - External node is a node with no child. level of Node - is defined by 1 + No of connections between Node x & root. Ancestars are like our parents,grand parents relationship. descendants are like child,grand child relation ship Internal Node is a node with atleast one child. External Node is a node with no child. subtree is a tree,where child belong to same parent. Properties of a Node Depth of a Node Height of a Node N= N -1 are explained. Example for a tree is a binary tree. Binary tree is a tree with 2 children. Applications of tree are also explained.
Data structures : Arrays - Tutorial
what is an Array An array is a data structure,that contains group of similar elements.These elements are of same type,such as strings or integers. Arrays saves memory space and commonly used in computer programs to organize data. Creating,declaring & initializing an arrays are explained using java syntax. Multi dimentional Arrays creation of Arrays with rows & columns is known as multidimentional Arrays. Creation, delcaration, and initialization of multidimesional arrays are explained, using Java Program.
What is Polymorphism
description about polymorphism, polymorphism in java, Examples of polymorphism,method overloading,method overriding.
In sliding window method,multiple frames are sent by the sender at a time, before it gets acknowledgement. Multiple frames sent by the source are acknowledged by receiver using a single acknowledgement frame.
Error Detection Methods(Parity Check,Check Sum,CRC)
Error detection is a detection of Errors caused by cross talk,noise or other impairments during transmission from transmitter to receiver. 2 Types of Errors Single Bit Error In single bit Error one bit of given data unit is changed from 1 to 0 or 0 to 1. In burst Error more than one bit of data is changed from 0 to 1 or 1 to 0. 4 Error detecting Codes Simple parity check. Two dimensional Parity check. check sum & Cyclic Redundancy Check. These 4 Error detecting Methods are explained in detail.
Neural Networks - Tutorial
Neural network is a technology that mimics,neurons in human brains and its interconnections. It is also called Artificial Neural Network,becoz it is a man made network. Neurons are individual elements of neural network.They read an input,process it and generate an output.Artifical Neural network has collection of Neurons grouped in Layers.They are input layer,intermediate Layer and output Layer. Neural Network architecture is explained.characteristics and Applications of Neural Networks is explained.Back propagation is also explained.
Introduction on hive,hive primitive data types, hive inbuilt functions,Hive DDL,Hive DML, Features of Hive,Hive Query statements.
Symbol Table: Introduction
Symbol Tables is a Major Data structure used in Compiler or Interpreter. Identifier & its relevant information are store in Symbol Table. symbol table operations like Insert() Lookup() Free() allocate() & delete() are explained. Implentation of sym
Data Structures & Algorithms - Introduction
What is a Data structure? Data structure is a specialized format for organizing & storing Data. What is an algorithm Algorithm is a step by step instruction to solve the problem. What is a Program Program is implementing the algorithm using programming language. Characteristics of Good Algorithm Less Run time. Less Memory. Classification of Algorithm 2 types 1. Linear structures. 2. Hierarchical Structures. Arrays,linked list,stacks & queues are linear structures,while trees,graphs,heaps etc are hierarchical structures.
50 basic science General knowledge Question & answers for Competitive Exams, Interviews & also to improve IQ. General Knowledge Question & Answers for all Competitive Exams, Interviews & Quiz. Also Everyone can listen to improve their Knowledge. Also check link for GK Question & Answers for Competitive Exams:https://www.youtube.com/watch?v=6PiB4k6q2sk&t=22s Kids GK Questions Part 1: https://www.youtube.com/watch?v=5O7FFpmCVIg kids GK Questions Part 2: https://www.youtube.com/watch?v=isbeMMk-DtE&t=52s
There are 2 types of Routing Algorithm a)Adaptive b)Non Adaptive. Adaptive Routing Algorithm These algorithm change their Routing decisions to reflect the changes in topology & traffic. This algorithm is also called dynamic Routing. This algorithm is classified into a)Centralized b) Isolated c) Distributed. Non Adaptive Routing Algorithm These algorithm do not change their Routing decisions on measurement & estimates of current traffic & topology. These routing decisions are made in advance & off line. They can be classified into a)flooding b)Random walk.
cloud computing allows the user to access computing resources,software & web services online over the internet,on demand through web based tools & applications. cloud provides services like Servers,storage,databases,networking,software analytics & much more over the Internet.It offers online data storage,Infrastructure & Applications. Applications such as EMail, Web Conferencing,CRM all Run in cloud computing. Goals of Cloud Computing Cost Speed Productivity availability security & reliablity. characteristics of cloud computing On demand self service Broad network access Resource pooling
Easy and simple description about pig,pig scripts,pig latin and run time environment
Data structures: Easy Queues Tutorial
What is queues in Data structure Queues follows FIFO order,where element first entered is removed first. 2 Main Operations of Queue. Enqueue - Insert/Push. Dequeue - Deletion/Pop. Operations of a queue is explained. Few more Operations of Queue peek() − it returns front item. isfull() − checks if queue is full. isempty() − checks if queue is empty. Algorithm for queue insert & queue delete are explained. Representation of Arrays. Arrays. Linked list Applications of Queue Shared resource Management. I/o buffering. Message queues in windows. Keyboard buffer Job scheduling.
Hadoop for Beginners
Introduction to Hadoop and Map reduce with Easy Examples and Simple Explanation. Hadoop is a java based frame work which supports storing and processing the big data. HDFS and map reduce are the two main components of hadoop. Map reduce is explained in this video with Word count example
Insertion sort - Data Structure & Algorithms
Insertion Sort is a Sorting Algorithm,which sorts the array by shifting the elements one by one. Real time Example :playing Cards How insertion Sort works & its examples are Explained briefly. Algorithm of Insertion sort is explained with Example. Advantages & dis advantages of Insertion sort is also Explained.
what is cloud computing Cloud computing allows the user to access computing resources,software & web services online over the internet, on demand through web based applciations.It refers to manipulating,configuring & accessing the applications online. Based on service that the cloud is offering,we can classify them as IaaS (Infrasructure as a Service) Paas(Platform as a Service) SaaS(Software as a Service) IaaS(Infrastructure as a Service Model) IaaS are self service models for accessing,monitoring & Managing remote data center infrastructures such as storage,networking,servers & other computing resources in the cloud.In IaaS providers manage virtualization,servers,hard drives,storage & Networking. SaaS (software as a Service) Saas providers host an application & make it available to users through the Internet. Users do not install application on their local devices.Instead the users subscribe to the software & access it via the web or Vendors API.In SaaS vendors mange applications, runtime,data,middleware,os,virtualization,servers,storage & Networking. PaaS (platform as a Service) cloud delivers a platform to users from which they can develop,initialize & Manage applications.In addition to storage & other computing resources, users are able to use a suite of prebuilt tools to develop,customize & test their own application.Paas is sometimes called 'Middleware' referring to how it conceptually sits between SaaS & IaaS. Thus cloud computing service models is explained shortly.
Binary Tree :Data structures
For introduction on trees plz click the link:https://www.youtube.com/watch?v=LoXIOm32yfk What is a binary tree? examples of binary tree,types of binary tree such as Full Binary tree,Complete Binary Tree,Perfect Binary Tree,Balanced Binary Tree are explained. Properties of Binary tree,Tree traversals such as Pre order traversal,post order traversal & inorder traversal are explained with Example. Implementation of Binary trees using a) Arrays b)Linked list are explained with Example. Applications of Binary tree are Explained. plz like us on : https://www.facebook.com/Gayathriitminer/?ref=hl
Dijkstra Shortest path Algorithm - An Easy Method
Dijkstra algorithm is an algorithm which help us find shortest path between two nodes. Ex: To find the shortest distance between two cities. Rules of Dijkstra Algorithm From starting node, visit the vertex with smallest known distance. Once we moved to vertex with smallest distance value, calculate the distance value for each of its neighbour node, if shortest value found, proceed with that vertex & repeat the process. By summing the distance of edges leading from start vertex, then find the shortest distance. It is illustrated with Example.
Object Oriented Programming -  Encapsulation & data hiding
Description about encapsulation and data hiding with example.
Introduction to Operating System: Definition,Objectives & Functions
What is Operating System Operating system is a Program that acts as an interface between the user & the Computer hardware & controls the execution of all kinds of Programs. It enables the computer hardware to communicate & operate with the computer Software. Functions of Operating System Memory Management Processor Management Device Management File Management Input Output Management Security Job Accounting Error Detecting Aids These functions are explained shortly in this Video.
Linear & Binary Search: Data Structures & Algorithms
Searching is the algorithmic process of finding a particular item from a collection of item. 2 types of searching 1. Linear Searching. 2.Binary Searching. Linear search searches the items in sequential order. Binary search is a fast search algorithm. This algorithm works on a principle of divide & conquer.In binary search, target list is sorted before searching. what is binary search binary search searches a item,by first comparing the middle position in a list,if match occurs,index is returned, else if middle position is lesser than the item to be searched, upper portion of array is searched,else lower portion of array is searching.Process continues until the index reaches 0, or desired item is found. Examples of Linear & binary search are explained. Algorithm for Linear & binary search is also explained.
I have already explained, Error detection techniques in this video.click the link. https://www.youtube.com/watch?v=km2jSCos5f0 Hamming code is an Easy Error detection & Correction Technique,developed by R.W.Hamming. Hamming Code is used to detect Exact Error Bit Position. To find redundant bits, following rule has to be satisfied. 2^r should be greater than or equal to d + r + 1. Where, d is data bits r ? redundant bits If d is 7, value of r should be 4, to satisfy rule. So totally 11 bits are transmitted. It is well explained with example. before sending the data bits,parity bits are calculated, then data is sent . After receiving the data, parity bits are recalculated.if value of parity bits are changed on receiver side, those parity bit numbers are added to find the exact position of error location.
OSI stands for Open System Inter Connection,Which defines Networking in terms of Vertical stack of seven Layers. OSI is Maintained as a stack by International Standard Organization. All the data that goes over a network connection Passes through each of seven Layers. Application Layer:Its Responsibilities are simply it implements the functions that are needed by users of the network. Presentation layer:it formats the data to be presented to application layer.presentation layer provides character code translation,data Conversion,data Compression & data Encryption. Session Layer: it allows two application processes on different machine to establish,use & terminate a connection called session.It provides services like dialog control & synchronization. Transport Layer: it is Responsible for delivering Messages between host.Services Provided by it are Creating End to End Connection,Segmentation & Reassembling,Error Recovery & Flow Control. Network Layer:it takes the responsibilities of Routing the Packets from Source to destination within or outside subnet,mapping different addressing schemes & Protocols.Connection less Service,Connection Oriented Service & Congestion Control are some of the Services Provided by it. Data Link Layer:It provides Services like framing,flow Control,Error Detection & Handling,Medium Access Control. Physical Layer:Physical layer gets frames from data Link layer & Converts them into electrical Pulses which represent Binary data. The binary data is sent over wired or wireless media.It provides services like Representation of bits,Data Rate,Transmission Mode,Synchronization & Line Configuration. Thus ISO/OSI Model is Explained Shortly.
Data Structures : Stack Tutorial
What is Data structures Stack is a container of objects that are inserted and removed according to Last in First Out Principle. Example for stack: Books of stack, coins of stack. Operations Performed on Stack Push & PoP. Push - It is used to insert items into the stack. PoP - It is used to delete items from stack. Top represents last item that was added in stack. Algorithm for insertion in stack, Deletion in Stack & Display in stack are explained. Application of stack To Reverse a string. Conversion of Post fix to prefix Recursive function calling function parsing are some of the applications of stack.