mahendrarathore1742

Kafka

Video Link: Apache Kafka Crash Course | What is Kafka?

Prerequisite

• Knowledge
  • Node.JS Intermediate level
  • Experience with designing distributed systems
• Tools
  • Node.js: Download Node.JS
  • Docker: Download Docker
  • VsCode: Download VSCode

mahendrarathore1742

def deletenode(self,remove):
        Head=self.head;

        if Head is not None:
            if Head.data==remove:
                self.head=Head.next;
                Head=None;
                return;
                
        while Head is not None:

mahendrarathore1742

 def insertlast(self,newnode):
        Newnode=node(newnode);
        Newnode.next=None;
        
        if self.head is None:
            Newnode.prev=None;
            self.head=Newnode;
            return;
        
        last=self.head;

mahendrarathore1742

 def insertmiddle(self,mid,newnode):
        Newnode=node(newnode);
        Newnode.next=mid.next;
        mid.next=Newnode;
        Newnode.prev=mid.next;
        
        if Newnode.prev:
            Newnode.next.prev=Newnode;

mahendrarathore1742

def insertdata(self,newnode):
        Newnode=node(newnode);
        Newnode.next=self.head;
        self.head=Newnode;
        if self.head is None:
            self.head.next.prev=Newnode;
        self.head=Newnode;

mahendrarathore1742

class node:
    def __init__(self,data=None):
        self.data=data;
        self.next=None;
        self.prev=None;
    
class DoublyLinked ():
    def __init__(self):
        self.head=None;
          

mahendrarathore1742

def search(arr,l,r,key):
    if l > r: 
        return -1  
    mid = (l + r) // 2
    if arr[mid] == key: 
        return mid 
    if arr[l] <= arr[mid]:  
        
        if key >= arr[l] and key <= arr[mid]: 
            return search(arr, l, mid-1, key) 

mahendrarathore1742

class node():
    def __init__(self,data=None):
        self.data=data;
        self.next=None;
    
class SinglyLinklist():
    def __init__(self):
        self.head=None;
        
    def Insert(self,newnode):

mahendrarathore1742

def delete(self,remove):
        Head=self.head;
        if Head is not None:
            if Head.data==remove:
                self.head=Head.next;
                Head=None;
                return True;
        while Head is not None:
            if Head.data==remove:
                break;

mahendrarathore1742

def endinsert(self,newnode):
        Newnode=node(newnode);
        if self.head is None:
            self.head=Newnode;
            return True;
        last=self.head;
        while last.next is not None:
            last=last.next;
        last.next=Newnode;