MAKAUT University

this is a very helpful notes on statistics chi- square test question and answers

There are some question written and edited by me and trust me you will find lot of common in your exam i personal got an b grade

I have a friend that wanted to build a PC So he approached me and asked '' Harry , can you give me a blueprint to build PC ? '' '' So that with that blueprint I can make someone build PC? '' '' I want to do gaming and streaming. '' So I gave him this blueprint. I told him all the main components of a PC. And even if he makes a mistake , It wo n't be a big deal. We will study array ADT. Array as an Abstract Data Type. Arrays as an abstract data type. In that , I will give you MRF. No...

basics of dynamic memory allocations and how memory can be allocated dynamically- using functions and everything with the help of programs. The Academy is conducting a combat on 6th of March at 11am and it is a live test. Memory would not be allocated at compile time, but see memory would be allocated in compile time. Memory would be located at run time and memory is fixed like for example, in a traditional compiler it's two bytes and in some machines it depends on what integer takes two bytes....

with a very good example i will show what is linked list and why would you like to use it. The name of linked list is the name of a linked list , if you 're listening for the very first time and it is possible that you 've read it before and did n't understand that i will start with and example to explain this thing and the example will be of a hospital. In every hospital each single bed was utilized utilized utilized them so this is linked list. The advantage we got here is that we could n'...

first of all we'll see common terminologies of tree. First of all, I will write terminology. First I will write root. Root is that node which has no upper node means It is linked to others but there is no other node linking to it. Then I will move to other terminology that is parent and child. Any node to which a node is connecting is its parent. Leaf node is the lowest node. Leaf or external node is that which can not be a parent. The depth of a node is number of edges from root to the node. I...

Hashing is basically what it is a searching technique and in searching of some data. If you use it. This hashing technique then the time taken is that is a constant time. THe main thing is in data processing is the main or the common paradigm is to store the data and after that to retrieve that data. IN this video I am going to discuss with you this chaining method. How to use this method to resolve the collision. In. The video I'll discuss all these techniques with the help of example. So in t...

File handling is what known as file handling simple you are handling files that 's it you are creating files. You are supposed to handle these files.. files are of two types, text and binary text means having note Txt extension that those files and binary dot bin dot pin are simple plain text files like notepad or wordpad or document you know microsoft word.. This is just an introductory part on files in c right and to handle these files. You will need a pointer that is file pointer. these are ...

The first primary operation is called traversal. It 's the easiest thing in array, it 's like 2x2=4. In traversal, every array element has to be visited once. If you want to print all the array elements or you may want to set this array. If you 're confused why 0, 1, 2, 3 etc. or similar doubts, then your situation is such that you need to write C language. At home, do C language, 15 hours sleep a little less one day and complete it. At about 11 at night, you 'll be done with it. I 'm kiddi...

What is Linear Search ? And what is binary search ? What is linear search? And what's binary search? We're going to code it here because it is asked a lot. Binary search is a smart algorithm named Binary Search what does binary search do. I will give you a real life example of binary search that when you will do binary search. The linear search is very simple , quite a straight forward algorithm to find all the elements of the array one by one : Where the element is found, it has to be said th...