- 40
- 354 897
Shahid Nihal
India
Registrace 22. 08. 2014
Introduction to Brute Force Technique: What It Is and How It Works
This is an introduction to brute force algorithm design strategy. We look at the pros and cons of brute force method with the following example problems:
Selection sort, Bubble sort, Sequential search, Convex Hull, Closest Pair, Exhaustive search (traveling salesman problem, knapsack problem, assignment problem), Depth First Search, Breadth First Search
Selection sort, Bubble sort, Sequential search, Convex Hull, Closest Pair, Exhaustive search (traveling salesman problem, knapsack problem, assignment problem), Depth First Search, Breadth First Search
zhlédnutí: 1 175
Video
Algorithm Design Strategies
zhlédnutí 289Před rokem
Common algorithm design strategies include Brute Force method, Decrease and conquer method, Divide and conquer method, Transform and conquer method, Dynamic Programming method, Greedy method, Iterative Improvement method, Backtracking method and Branch and bound method.
Asymptotic Notations Explained: Understanding Big O, Big Omega, and Big Theta
zhlédnutí 64Před rokem
Asymptotic Notations are an essential concept for anyone studying algorithms and data structures. In this video, we provide a comprehensive guide to understanding Asymptotic Notations, including Big O, Big Omega, and Big Theta. We explain how to analyze and compare the efficiency of different algorithms, based on their running time, and how to identify the best algorithm for a given problem. Th...
Message Passing Interprocess Communication Mechanism in Operating Systems
zhlédnutí 584Před rokem
Message Passing in operating system in one of the inter process communication mechanisms where the 2 communicating processes talk to each other via a communication link. In this video, we discuss on how the logical implementation of this communication link is done. We discuss the concepts of Direct communication, Indirect communication, Synchronous and Asynchronous communication, Explicit and A...
Shared Memory Interprocess Communication Model | Producer-Consumer Problem
zhlédnutí 741Před rokem
In shared memory model, the process wanting to talk to other processes creates a shared memory in its address space. The other processes wanting to talk to this process can attach this shared memory to their address space. 1 process writes the data to this shared memory while the other process can read it from the shared memory. Usually operating system does not allow 1 process to access the ad...
Interprocess Communication | Independant,Cooperating Processes | Shared Memory & Message Passing
zhlédnutí 1,1KPřed rokem
Interprocess communication is a mechanism which helps 2 processes to talk to each other. Once fork() creates 2 processes, we can have 2 types of processes: 1. Independant processes 2. Cooperating processes Independant processes are those which do not affect other processes or cannot get affected by other processes. These do not share data/info with other processes. Cooperating processes are tho...
How to analyze algorithm efficiency? Best, Worst and Average Case Efficiency?
zhlédnutí 49Před rokem
In this video, we will answer the following: 1. How to analyze algorithm efficiency? 2. What is time and space complexity? 3. How to measure algorithm's runtime? 4. What is order of growth of an algorithm? 5. What is Best Case, Worst Case and Average Case Efficiency?
Introduction to Non Linear Data Structures - Graphs and Trees
zhlédnutí 62Před rokem
Non Linear data structures are those where the data items are organized in a non-linear fashion unlike linear data structures where the data items are structured sequentially. Most common data structures are graphs and trees. Graphs are functions of 2 sets - V and E. V is the set of vertices and E is the set of Edges. There are different types of graphs - undirected graphs, directed graphs, spa...
Zombie Process and Orphan Process
zhlédnutí 14KPřed rokem
What are zombie and orphan processes? Answer: When a parent processes creates a child process using fork() but doesnt call wait() and the child process calls exit() and terminates, in such a case, the exit status returned by child will not be caught by parent and hence the entry of such child processes will not be removed from the process table. Such processes are termed ZOMBIE processes. If pa...
Introduction to Linear Data structures - Arrays, Linked Lists, Stacks and Queues
zhlédnutí 137Před rokem
Before digging deeper into designing and analyzing algorithms, we need to brush up on the important and most commonly used data structures. In this video, we check out on the important linear data structures like arrays, linked lists, stacks and queues. Arrays are data structures allocated in a contiguous memory region. If enough contiguous memory is not available, then we cannot create the arr...
Process creation and termination - fork(), exec(), wait() and exit()
zhlédnutí 24KPřed rokem
Process creation is done in UNIX system with the help of the fork() command. The process which creates another process is called the 'parent' process and the process which gets created is the 'child' process. - fork() creates a duplicate child process same as parent - the program and data is copied to child process and both these would run concurrently. - exec() is used to overlay a block of co...
Process schedulers, scheduling queues and queueing diagram
zhlédnutí 457Před rokem
Process scheduling is an important concept in the design of operating systems. In this video, we'll discuss the 3 types of Process Schedulers - long term scheduler, short term scheduler and medium term scheduler. We'll also discuss on the various scheduling queues available - Job Queue, ready Queue, device Queue/io Queue. All these queues will be learnt through the Queueing diagram.
Process Threads - Operating Systems
zhlédnutí 368Před rokem
This is a short introduction to Threads, a detailed discussion will be done in future videos.
Process Stack and Heap - Operating Systems
zhlédnutí 2,6KPřed 3 lety
Stack and Heap are the sections in memory which keep growing/reducing. In this video, we'll learn about the differences between the 2.
Process states, Process Control Block and Process Switching | Operating Systems
zhlédnutí 788Před 3 lety
'Process' is one of the most important topics of OS. In this video we look at the following: 1. What is a process? 1:03 2. Process v/s Program - how are these different? 2:39 3. How does process look in memory - what is the structure of process (text section, data section, heap section, stack section) - 3:38 4. What is a program counter? - 5:41 5. What are the various process states? - new, rea...
Bootloader and Boot Process - Operating System
zhlédnutí 1,6KPřed 3 lety
Bootloader and Boot Process - Operating System
OS Structures : Simple, Layered, Microkernels, Modular and Hybrid
zhlédnutí 5KPřed 3 lety
OS Structures : Simple, Layered, Microkernels, Modular and Hybrid
System Programs | Difference between System Call and System Program
zhlédnutí 1,1KPřed 3 lety
System Programs | Difference between System Call and System Program
Types Of System Calls - Operating Systems
zhlédnutí 1,1KPřed 3 lety
Types Of System Calls - Operating Systems
User and OS Interface - Operating Systems
zhlédnutí 6KPřed 3 lety
User and OS Interface - Operating Systems
Services provided by the Operating Systems
zhlédnutí 2,2KPřed 3 lety
Services provided by the Operating Systems
Strassen's Matrix Multiplication Trick PART 1
zhlédnutí 2,5KPřed 6 lety
Strassen's Matrix Multiplication Trick PART 1
Strassen's Matrix Multiplication Trick PART 2
zhlédnutí 1,1KPřed 6 lety
Strassen's Matrix Multiplication Trick PART 2
Types of Computing Environment - Operating Systems
zhlédnutí 34KPřed 6 lety
Types of Computing Environment - Operating Systems
Dual Mode Operation - Operating Systems
zhlédnutí 22KPřed 6 lety
Dual Mode Operation - Operating Systems
Clustered System | Types and advantages
zhlédnutí 23KPřed 6 lety
Clustered System | Types and advantages
Consecutive Integer Checking Algorithm and Prime Factor Method to find GCD of 2 numbers
zhlédnutí 1,3KPřed 6 lety
Consecutive Integer Checking Algorithm and Prime Factor Method to find GCD of 2 numbers
Euclid's Algorithm To Find GCD of 2 numbers
zhlédnutí 3,9KPřed 6 lety
Euclid's Algorithm To Find GCD of 2 numbers
Thank you for the time to share such a great concept.
Best explanation thanku❤
Amazing video sir! Thanks a lot :) When I was reading the textbook, I could make sense of only 50-60% of it. After watching your video on a particular topic, it makes complete sense! How were you able to grasp the topics from textbook so clearly? Like I couldn't think of diagrams as you draw here! You're visualization is great! If you could share some tips to better read CS textbooks, that'd help me a lot! Thanks sir!
Amazing explanation! Thanks a lot sir :)
Your voice is very pretty
Great explanation thank you, keep it up!!
thank you sharing your knowledge and nice teaching
Man your voice❤
thankyou🥺
after watching so many videos, I was scratching my head. but suddenly got this video. what a clear in-depth explanation....you got a new subscriber. Thanks for the video.!!!!
Glad it helped :)
thank you sir
thank you sir
just too gooddd...thnx sir
i guess wait() needs an argument to work properly
Clearly explained. Thank you
You are the best best bestt 💜💜💜💜
Sir i watch alot od videos out there on this Topic, But the way you teach is very affective. Thankyou So much. May God Bless You and your channel hits the 1 million Subscribers one day 🤗😊
Thank you! Glad it helped :)
World class explanation. Many thanks for your knowledge. And your amazing teaching skills.
Best explanation sp far👏🏻
best explanation so far👏🏻
mashaAllah such a nice explanation
Main be a voice actor man
Nice explanation🙏🙏
WooHooooo amazingggggggg!!!!!!
Thx sir
Voice 🗿🗿🗿🗿
🤍🤍🤍
Thank you so much for the video, made this concept very clear and easy to understand
absolutely nailed it !! What a beautiful explaination crisp and to the point !!
Thank you :)
Thank you Mr Shahid
Nailed it
very good vid, just one note; a child process should normally call _exit() and not exit()
minimize the boolean expression f(a, b, c, d) =m(1, 3,4,5,10,12,13,15) using quine mccluskey method sir can u give the ans of this question??
Really like the effort and presentation, Not to s Sound rude but focus on explanation and have more emphasis on precise teaching and precise points
Explanantion was so good
Good explanation
thanks❤
Much needed. Thanks
Please create tutorial for system programming in unix environment, Data science [ AI ML NN DL ] programming tutorials
Excellent explanation | Expert level
Thank you!!
Excellent Explanation💯
Amazing 😍❤
It's an amazing video
great explanation
Thank you so much for this video ❤
thank you so much, very clear explanation.
Hi..Is this common for java programming language also?
love from Pakistan <3
amazing explanation, thank you!
thank you!!