Sithija's Scribbles

   What is Cyber-Security? Cyber security or information technology security are the techniques of protecting computers, networks, programs and data from unauthorized access or attacks. A successful cyber security approach has multiple layers of protection spread across the computers, networks, programs, or data that one intends to keep safe. In an organization, the people, processes, and technology must all complement one another to create an effective defense from cyber attacks. Elements of Cyber-Security Ensuring cybersecurity requires the coordination of efforts throughout an information system, which includes: Network security includes activities to protect the usability, reliability, integrity and safety of the network. Effective network security targets a variety of threats and stops them from entering or spreading on the network. Application security  focuses on keeping software and devices free of threats. A compromised application c...

     Ethernet is a certain type of a local area network (LAN) which was developed in 1972 in the renowned PARC-research facility of Xerox in Palo Alto by Robert Metcalfe.  Ethernet is a standard communications protocol used to connect devices including computers, routers, and switches in a wired or wireless network. As a  data-link layer  protocol in the TCP/IP stack, Ethernet describes how network devices can format and transmit data packets so other devices on the same local or campus area network segment can recognize , receive and process them.         Ethernet was originally standardized as IEEE 802.3 with a data transmission rate of 10 Mb/s. Newer versions of Ethernet were introduced lately to offer higher data rates.  In  today's Gigabit Ethernet supports speeds of up to 1,000 Mbps. Though it's currently limited to businesses on the cutting edge of the tech world, 10 Gigabit Ethernet with speeds of up to 10,00...

/*This is a programme to implement a binary search tree*/ #include<stdio.h> #include<stdlib.h> typedef struct treeNode {         int data;         struct treeNode *left;         struct treeNode *right; }treeNode; treeNode* FindMin(treeNode *node) {         if(node==NULL)         {                 /* There is no element in the tree */                 return NULL;         }         if(node->left) /* Go to the left sub tree to find the min element */                 return FindMin(node->left);         else                 return node; } treeNode* FindMax(treeNode *node) {         if(node==NULL)     ...