Article Categories
- All Categories
-
Data Structure
-
Networking
-
RDBMS
-
Operating System
-
Java
-
MS Excel
-
iOS
-
HTML
-
CSS
-
Android
-
Python
-
C Programming
-
C++
-
C#
-
MongoDB
-
MySQL
-
Javascript
-
PHP
-
Economics & Finance
Data Structure Articles
Page 2 of 164
Transmission mode
Communication is defined as the transfer or sharing of data between any two individuals through a medium and the medium can be wired or wireless. In a computer network, the OSI (Open System Interconnection) model has seven layers for the communication networks. The first layer of OSI is the Physical layer that uses the Transmission mode for transferring the raw data to other devices using a physical medium. Transmission mode refers to the process of transferring data from one point to another over a particular network. The channel between the two devices can be buses or networks, and communication ...
Read MoreBasic Frame Structure of HDLC
HDLC stands for High-level Data Link Control which is a collection of protocols that ensures communication purposes among nodes or network points. It was developed by the International Organization for Standardization (ISO). The data to be transmitted is organized in the form of frames which when transferred to the destination is acknowledged for its appropriate arrival. It can be applied to both point-to-point connections and multipoint connections as it is a bit-oriented protocol. The system of Automatic Repeat Request is implemented via HDLC and also full-duplex communications could be done with the help of HDLC. Due to its high ...
Read MoreTrusted Systems in Network Security
A Trusted System is a computer system that provides users with assurance that no malicious or harmful software can compromise system security. In network security, trusted systems implement multi-layered security (MLS) approaches to protect data and infrastructure from cyberattacks, malware, and unauthorized access. With organizations increasingly adopting cloud storage, wireless networks, and remote applications, the challenges of protecting network resources have grown significantly. Trusted systems address these challenges by enforcing strict security policies that cannot be altered by applications or unauthorized users. Network Security and Multilayered Defense Network Security encompasses the protection of data, network infrastructure, and ...
Read MoreWhy does Youtube use TCP not UDP?
YouTube, the world's largest video streaming platform, uses TCP (Transmission Control Protocol) instead of UDP (User Datagram Protocol) for delivering video content to ensure reliable, high-quality streaming experiences for billions of users worldwide. While both protocols have their strengths, YouTube's choice of TCP is driven by specific requirements for video-on-demand services where data integrity and complete delivery take priority over minimal latency. TCP vs UDP for Video Streaming Feature TCP UDP Reliability Guaranteed delivery with error correction No delivery guarantee Connection Connection-oriented (3-way handshake) Connectionless Data ...
Read MoreWhat do you mean by interfaces and services?
In networking, interfaces and services define how different layers communicate and interact within a network protocol stack. Understanding these concepts is fundamental to grasping how data flows through layered network architectures. A network service is functionality provided by one layer to the layer above it. Services define what operations are available, while interfaces specify how these services are accessed. Each layer acts as a service provider to the layer above and a service user of the layer below. Key Components of Interfaces and Services Entities and Peer Entities An entity is an active element within each ...
Read MoreJavaScript Program to Find Longest Common Prefix Using Word by Word Matching
Prefixes are substrings that start from the zeroth index of a string and can be of any size from 1 to the complete length of the string. We are given a set of strings and need to find the longest common prefix among all of them using JavaScript. We'll implement word-by-word matching approach where we compare characters at the same position across all strings. Input arr = ["zefkefgh", "zefkdefij", "zeffdzy", "zefkdabacd"]; Output zef Explanation From all the given strings, the first three ...
Read MoreJavaScript Program to Find Minimum Insertions to Form a Palindrome
We are given a string and we have to find the minimum number of characters that we need to insert at any position to make the string a palindrome. A palindrome is a string that reads the same forwards and backwards. This problem can be solved using dynamic programming - we'll explore three approaches: recursive, memoization, and tabulation. Understanding the Problem For example, to make "abc" a palindrome, we need to insert 2 characters to get "abcba" or "cbabc". The key insight is that if characters at both ends match, we can focus on the substring between them. ...
Read MoreJavascript Program to Minimize Characters to be Changed to make the Left and Right Rotation of a String Same
In this problem, we need to find the minimum number of character changes required to make a string's left and right rotations identical. This involves understanding how rotations work and finding patterns in character positioning. Understanding Rotations The left rotation moves characters left by one position, while right rotation moves them right. For rotations to be identical, specific character patterns must exist: Odd length strings: All characters must be the same Even length strings: Characters at even positions must be identical, and characters at odd positions must be identical Problem Analysis Given a ...
Read MoreMaximum count of characters that can replace ? by at most A 0s and B 1s with no adjacent duplicates
In this problem, we need to replace '?' characters in a string with '0's and '1's such that no two adjacent characters are the same, while maximizing the number of replacements using at most A zeros and B ones. Syntax int maximumChar(char *str, int aCount, int bCount); Problem Statement Given a string containing '*' and '?' characters, and two integers A and B representing available 0s and 1s, find the maximum number of '?' characters that can be replaced without creating adjacent duplicates. Algorithm The approach involves the following steps − ...
Read MorePosition of the leftmost set bit in a given binary string where all 1s appear at the end
The aim of this article is to implement a program to find the position of the leftmost set bit in a given binary string where all 1s appear at the end. A binary string is a sequence of bits (0s and 1s) used to represent data in binary format. In this problem, we are given a binary string where all the 1s are grouped together at the rightmost positions, and we need to find the leftmost position where the first '1' appears. Syntax int findFirstBit(char* str, int length); Problem Statement Given a binary ...
Read More