![Computer Panthulu](/img/default-banner.jpg)
- 205
- 419 671
Computer Panthulu
India
Registrace 29. 11. 2020
This channel contains educational videos in the Telugu language, which helps students to improve their learning.
TOC(FLAT) in Telugu || DFA Substring Problems || 4 Examples || ab || bab || 00 || 0 || as substring
TOC(FLAT) in Telugu || DFA Substring Problems || 4 Examples || ab || bab || 00 || 0 || as substring
zhlédnutí: 85
Video
DAA in Telugu | Multistage Graph in Telugu || Ex2 | Forward Approach || Dynamic Programming | Telugu
zhlédnutí 170Před dnem
DAA in Telugu | Multistage Graph in Telugu || Ex2 | Forward Approach || Dynamic Programming | Telugu
DAA in Telugu | Multistage Graph in Telugu | Backward Approach | Ex1 | Dynamic Programming in Telugu
zhlédnutí 149Před 14 dny
DAA in Telugu | Multistage Graph in Telugu | Backward Approach | Ex1 | Dynamic Programming in Telugu
OS in Telugu || SCAN & CSCAN Disk Scheduling Algorithms in Telugu || Operating System in Telugu
zhlédnutí 165Před 14 dny
OS in Telugu || SCAN & CSCAN Disk Scheduling Algorithms in Telugu || Operating System in Telugu
DAA in Telugu | Multistage Graph in Telugu || Ex1 | Forward Approach || Dynamic Programming | Telugu
zhlédnutí 375Před 14 dny
DAA in Telugu | Multistage Graph in Telugu || Ex1 | Forward Approach || Dynamic Programming | Telugu
DAA In Telugu || Strassen's Matrix Multiplication in Telugu - Concept, Algorithm, Time Complexity
zhlédnutí 403Před 21 dnem
DAA In Telugu || Strassen's Matrix Multiplication in Telugu - Concept, Algorithm, Time Complexity
OS in Telugu || SSTF Disk Scheduling Algorithm || Operating Systems in Telugu || Shortest Seek Time
zhlédnutí 124Před 21 dnem
OS in Telugu || SSTF Disk Scheduling Algorithm || Operating Systems in Telugu || Shortest Seek Time
OS in Telugu | Base and Limit Registers | Hardware Address Protection in Memory Management in Telugu
zhlédnutí 113Před 21 dnem
OS in Telugu | Base and Limit Registers | Hardware Address Protection in Memory Management in Telugu
OS in Telugu || FCFS Disk Scheduling Algorithm in Telugu || Operating Systems in Telugu
zhlédnutí 159Před měsícem
OS in Telugu || FCFS Disk Scheduling Algorithm in Telugu || Operating Systems in Telugu
DAA in Telugu || Binary Search using Divide and Conquer in Telugu || Algorithm || Program || Example
zhlédnutí 213Před měsícem
DAA in Telugu || Binary Search using Divide and Conquer in Telugu || Algorithm || Program || Example
OS In Telugu || LRU(LEAST RECENTLY USED) PAGE REPLACEMENT ALGORITHM in Telugu || OPERATING SYSTEMS
zhlédnutí 293Před měsícem
OS In Telugu || LRU(LEAST RECENTLY USED) PAGE REPLACEMENT ALGORITHM in Telugu || OPERATING SYSTEMS
DAA in Telugu || 0/1 Knapsack Problem Using Backtracking || Backtracking Algorithm || DAA
zhlédnutí 415Před měsícem
DAA in Telugu || 0/1 Knapsack Problem Using Backtracking || Backtracking Algorithm || DAA
OS in Telugu || Optimal Page Replacement algorithm(OPT) in Telugu | Operating Systems in Telugu
zhlédnutí 412Před měsícem
OS in Telugu || Optimal Page Replacement algorithm(OPT) in Telugu | Operating Systems in Telugu
OS in Telugu || Belady's Anomaly in FIFO page Replacement in Telugu || Operating System in Telugu
zhlédnutí 123Před měsícem
OS in Telugu || Belady's Anomaly in FIFO page Replacement in Telugu || Operating System in Telugu
OS in Telugu || FIFO Page Replacement Algorithm in Telugu || Operating Systems in Telugu
zhlédnutí 352Před měsícem
OS in Telugu || FIFO Page Replacement Algorithm in Telugu || Operating Systems in Telugu
OS in Telugu || Methods for Handling Deadlocks || Prevention || Avoidance || Detection || Recovery
zhlédnutí 124Před měsícem
OS in Telugu || Methods for Handling Deadlocks || Prevention || Avoidance || Detection || Recovery
OS in Telugu || Deadlock Recovery in Telugu || Deadlocks in Telugu || Operating Systems in Telugu
zhlédnutí 200Před měsícem
OS in Telugu || Deadlock Recovery in Telugu || Deadlocks in Telugu || Operating Systems in Telugu
DAA in Telugu | Introduction to Greedy Method | General Method | Control Abstraction | Applications
zhlédnutí 323Před měsícem
DAA in Telugu | Introduction to Greedy Method | General Method | Control Abstraction | Applications
DAA in Telugu || Introduction to Divide and Conquer Algorithm | General Method | Control Abstraction
zhlédnutí 397Před měsícem
DAA in Telugu || Introduction to Divide and Conquer Algorithm | General Method | Control Abstraction
DAA in Telugu || Travelling Salesman Problem using Least Cost Branch and Bound (LCBB) in Telugu
zhlédnutí 2,4KPřed měsícem
DAA in Telugu || Travelling Salesman Problem using Least Cost Branch and Bound (LCBB) in Telugu
DAA in Telugu || 0/1 Knapsack Problem using FIFO Branch and Bound in Telugu
zhlédnutí 2,9KPřed 2 měsíci
DAA in Telugu || 0/1 Knapsack Problem using FIFO Branch and Bound in Telugu
DAA in Telugu || 0/1 Knapsack Problem using Least Cost Branch and Bound(LCBB) in Telugu
zhlédnutí 4,1KPřed 2 měsíci
DAA in Telugu || 0/1 Knapsack Problem using Least Cost Branch and Bound(LCBB) in Telugu
OS in Telugu || Deadlock Detection || Bankers algorithm || Deadlocks in Telugu || Operating Systems
zhlédnutí 295Před 2 měsíci
OS in Telugu || Deadlock Detection || Bankers algorithm || Deadlocks in Telugu || Operating Systems
OS in Telugu || Deadlock Detection || wait for graph || Resource allocation graph |Operating Systems
zhlédnutí 320Před 2 měsíci
OS in Telugu || Deadlock Detection || wait for graph || Resource allocation graph |Operating Systems
OS in Telugu | Deadlock Avoidance: Bankers(Resource Request Algorithm) with example|Operating System
zhlédnutí 558Před 2 měsíci
OS in Telugu | Deadlock Avoidance: Bankers(Resource Request Algorithm) with example|Operating System
OS in Telugu || Deadlock Avoidance: Banker's Algorithm with example || Safety Algorithm || in Telugu
zhlédnutí 1,7KPřed 2 měsíci
OS in Telugu || Deadlock Avoidance: Banker's Algorithm with example || Safety Algorithm || in Telugu
OS in Telugu | Deadlock Avoidance Algorithm | Resource Allocation Graph Algorithm | Operating System
zhlédnutí 768Před 2 měsíci
OS in Telugu | Deadlock Avoidance Algorithm | Resource Allocation Graph Algorithm | Operating System
OS in Telugu || Deadlock Prevention in Telugu || Operating Systems in Telugu || Deadlocks in Telugu
zhlédnutí 906Před 3 měsíci
OS in Telugu || Deadlock Prevention in Telugu || Operating Systems in Telugu || Deadlocks in Telugu
OS in Telugu | Deadlock Characterization || Necessary conditions || Resource Allocation Graph
zhlédnutí 353Před 3 měsíci
OS in Telugu | Deadlock Characterization || Necessary conditions || Resource Allocation Graph
OS in Telugu || What is a deadlock || Introduction to Deadlock || System Model || define deadlock
zhlédnutí 342Před 3 měsíci
OS in Telugu || What is a deadlock || Introduction to Deadlock || System Model || define deadlock
Helped Me A Lot Sir, Thank You Sir
Nice Telugu explanation
Sir your telugu lecture 😮 i were watch so many videos in English what ever it may be iam very excited your way of teaching sir😊
Thanku sir
Thank you sir❤
Thanks
Ur mailid ?? Sir I will send my daa syllabus sir
Sir please post the operating system notes of R22 Regulation 🙏
Sir please🙏🙏 forward the notes of operating system...R22 regulation
Tq sir tqs alot 😊
What is your name
Notes ekkada sir discription lo vuntundhi annar
Super explanation sir
Good information sir🎉
Sir 8 queen s problem sir
First view sir
N7ce explanation sir
implimentations of ADT
❤❤❤
Thank you so much sir🎉
Sir mekku Telugu vacha😮😮😮
Very Good sir 👍 Sir Your CSA lectures are very helpful for my exam great work sir
❤🎉
Sir me blog lo program chudamanaru bu t me description lo link evaledhu sir please share your link sir
Sir koncham program attach cheyandi sir
I came from ur @sudhakar Atchala channel , mee telugu youtube name chala bagundi keep going sir , we are with u ❤❤❤❤
Your videos are amazing sir
Anna pdf provide cheyara please 🙏
First like sir ❤
thank you sir 🙏
Sir u are god sir, only because of u iam able to understand ds
Thanks for explaining these topic sir
Your my teacher of my whole btech studies😊😊
Sir notes
#include <stdio.h> int BinarySearch(int [],int,int,int); int main() { int a[20],n,i,index,key; printf(" Enter size of the array"); scanf("%d",&n); printf(" Enter elements of the array"); for(i=0;i<n;i++) scanf("%d",&a[i]); printf(" Enter key element"); scanf("%d",&key); index=BinarySearch(a,0,n-1,key); if(index==-1) printf(" Key element is not found"); else printf(" Key element is found at %d index",index); return 0; } int BinarySearch(int a[],int low,int high,int key) { int mid; if(low<=high) { mid=(low+high)/2; if(key==a[mid]) return mid; else if(key<a[mid]) return BinarySearch(a,low,mid-1,key); else if(key>a[mid]) return BinarySearch(a,mid+1,high,key); } return -1; }
Sir super explanation 🎉
Thanks sir 🫂
Super bro and degree e e subjects cheptav
Thanks for the explanation sir 💥❤️
Super sir
First View!😂❤ But i have completed my 4th semester 5 days ago in which i had OS paper!! For semester preparation i was watching your English channel sir. Though I don't know telugu I'm commenting here because you help us in understanding the concepts clearly!! Thank you sir! Keep teaching...💫
Sir e code kavali sir koncham reply ivandi
Sir e program kavali sir
Thanks ❤
Sir miru anni subjectlu ela chepthunnaru, asalu btech enni sarlu chadivaru..😅😅
Thank you sir 🙏🏻.
Comment lo notes ledu🥹
Sir A star algorithm problem cheppara 🤌
Good Explanation sir
Nice video 🎉❤❤❤