Skip to content
  • General
  • Programming
  • DS & Algo
  • System Design
  • Interview Questions
  • Home
  • YouTube
  • About
  • Contact
Learn to Code and Code to Learn

Learn to Code and Code to Learn

Your Journey to Code Mastery

  • General
    • Setup
  • Programming
    • C++
    • C++-11
    • c++-14
    • Python
  • DS & Algo
    • DS
    • Algo
      • Competitive Programming
        • Leetcode Problems
  • System Design
    • Design Pattern
    • SOLID Principle
  • Interview Questions
    • C++
    • Company Wise
  • Toggle search form

Socket Programming

Posted on October 31, 2021November 14, 2021 By thecodepathshala 8 Comments on Socket Programming

What is socket programming?

Socket programming is a way of connecting two nodes on a network to communicate with each other. One node(socket) listens on a particular port at an IP, while other socket reaches out to the other to form a connection. Server forms the listener socket while client reaches out to the server.

In real life, socket is a medium to connect two devices or systems. It can be either a phone charger plugging into the socket or a USB cable into our laptop. In the same way, Sockets let applications attach to the local network at different ports. Every time a socket is created, the program has to specify the socket type as well as the domain address.

diagram for server and client model(System calls)

State diagram :

Stages for server:

Socket creation:

int sockfd = socket(domain, type, protocol)

sockfd: socket descriptor, an integer (like a file-handle)
domain: integer, communication domain e.g., AF_INET (IPv4 protocol) , AF_INET6 (IPv6 protocol)
type: communication type
SOCK_STREAM: TCP(reliable, connection oriented)
SOCK_DGRAM: UDP(unreliable, connection less)
protocol: Protocol value for Internet Protocol(IP), which is 0. This is the same number which appears on protocol field in the IP header of a packet.

Setsockopt:

int setsockopt(int sockfd, int level, int optname,
 
               const void *optval, socklen_t optlen);

This helps in manipulating options for the socket referred by the file descriptor sockfd. This is completely optional, but it helps in reuse of address and port. Prevents error such as: “address already in use”.

Bind:

int bind(int sockfd, const struct sockaddr *addr, socklen_t addrlen);

After creation of the socket, bind function binds the socket to the address and port number specified in addr(custom data structure). In the example code, we bind the server to the localhost, hence we use INADDR_ANY to specify the IP address.

Listen:

int listen(int sockfd, int backlog);

It puts the server socket in a passive mode, where it waits for the client to approach the server to make a connection. The backlog, defines the maximum length to which the queue of pending connections for sockfd may grow. If a connection request arrives when the queue is full, the client may receive an error with an indication of ECONNREFUSED.

Accept:

int new_socket= accept(int sockfd, struct sockaddr *addr, socklen_t *addrlen);

It extracts the first connection request on the queue of pending connections for the listening socket, sockfd, creates a new connected socket, and returns a new file descriptor referring to that socket. At this point, connection is established between client and server, and they are ready to transfer data.

Stages for client:

Socket connection:

Same as Server socket creation.

Connect:

int connect(int sockfd, const struct sockaddr *addr, socklen_t addrlen);

The connect() system call connects the socket referred to by the file descriptor sockfd to the address specified by address. Server’s address and port is specified in address.

Send/Receive:

The send() and recv() calls specify:

  • The sockets on which to communicate
  • The address in the storage of the buffer that contains, or will contain, the data (addr_of_data, addr_of_buffer)
  • The size of this buffer (len_of_data, len_of_buffer)
  • A flag that tells how the data is to be sent
The steps involved in establishing a socket on the client side are as follows:
  • Create a socket with the socket() system call
  • Connect the socket to the address of the server using the connect() system call
  • Send and receive data. There are a number of ways to do this, but the simplest is to use the read() and write() system calls
The steps involved in establishing a socket on the server side are as follows:
  • Create a socket with the socket() system call
  • Bind the socket to an address using the bind() system call. For a server socket on the Internet, an address consists of a port number on the host machine
  • Listen for connections with the listen() system call
  • Accept a connection with the accept() system call. This call typically blocks until a client connects with the server
  • Send and receive data

Implementation(code) for client and server:

Simple example: github link

Connecting Multiple Clients Without Multithreading:

Now, we see is how a single client is connected to a socket in a server. But, we have multiple clients connected to a server and each has a different socket.

One way to achieve this feat is by using multithreading. But only someone who has done multithread programming knows it can lead to madness. They are very difficult to code and debug. Even if you end up programming them neatly, the results can be unpredictable. Not to mention the fact that they are not scalable for a large number of clients and there is also a chance of deadlocks occurring.

To tackle these issues, we try to support multiple clients on a network without using multithreading. To help us with this, we have a special function known as select(). 

select() function:

Select is a Linux command which uses fd_set data structure and allows us to monitor multiple file descriptors. It gets activated as soon as any file descriptor sends data. Hence it works like an interrupt handler. If some data is there that is to be read on one of the sockets then it is select() that provides that information. It then returns the total number of socket handles that are ready and contained in the fd_set structures.

There are four macros that are associated with the select function, used for manipulating and checking the descriptor sets.

  • *FD_ZERO(set) – Initializes the set to an empty set. A set should always be cleared before using.
  • *FD_CLR(s, set) – Removes socket s from set.
  • *FD_ISSET(s, set) – Check to see if s is a member of set and returns TRUE if so.
  • *FD_SET(s, set) – Adds a socket s to set.

Using these four macros and the select function, one can handle multiple clients using a single thread.

fd_set readfds;

// Clear an fd_set
FD_ZERO(&readfds);  

// Add a descriptor to an fd_set
FD_SET(master_sock, &readfds);   

// Remove a descriptor from an fd_set
FD_CLR(master_sock, &readfds); 

//If something happened on the master socket , then its an incoming connection  
FD_ISSET(master_sock, &readfds); 

Activating select: Please read the man page for select to check all the arguments for select command.

activity = select( max_fd + 1 , &readfds , NULL , NULL , NULL);

Code for select :

//Example code: A simple server side code, which echos back the received message.
//Handle multiple socket connections with select and fd_set on Linux
#include <stdio.h>
#include <string.h> //strlen
#include <stdlib.h>
#include <errno.h>
#include <unistd.h> //close
#include <arpa/inet.h> //close
#include <sys/types.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <sys/time.h> //FD_SET, FD_ISSET, FD_ZERO macros
	
#define TRUE 1
#define FALSE 0
#define PORT 8888
	
int main(int argc , char *argv[])
{
	int opt = TRUE;
	int master_socket , addrlen , new_socket , client_socket[30] ,
		max_clients = 30 , activity, i , valread , sd;
	int max_sd;
	struct sockaddr_in address;
		
	char buffer[1025]; //data buffer of 1K
		
	//set of socket descriptors
	fd_set readfds;
		
	//a message
	char *message = "ECHO Daemon v1.0 \r\n";
	
	//initialise all client_socket[] to 0 so not checked
	for (i = 0; i < max_clients; i++)
	{
		client_socket[i] = 0;
	}
		
	//create a master socket
	if( (master_socket = socket(AF_INET , SOCK_STREAM , 0)) == 0)
	{
		perror("socket failed");
		exit(EXIT_FAILURE);
	}
	
	//set master socket to allow multiple connections ,
	//this is just a good habit, it will work without this
	if( setsockopt(master_socket, SOL_SOCKET, SO_REUSEADDR, (char *)&opt,
		sizeof(opt)) < 0 )
	{
		perror("setsockopt");
		exit(EXIT_FAILURE);
	}
	
	//type of socket created
	address.sin_family = AF_INET;
	address.sin_addr.s_addr = INADDR_ANY;
	address.sin_port = htons( PORT );
		
	//bind the socket to localhost port 8888
	if (bind(master_socket, (struct sockaddr *)&address, sizeof(address))<0)
	{
		perror("bind failed");
		exit(EXIT_FAILURE);
	}
	printf("Listener on port %d \n", PORT);
		
	//try to specify maximum of 3 pending connections for the master socket
	if (listen(master_socket, 3) < 0)
	{
		perror("listen");
		exit(EXIT_FAILURE);
	}
		
	//accept the incoming connection
	addrlen = sizeof(address);
	puts("Waiting for connections ...");
		
	while(TRUE)
	{
		//clear the socket set
		FD_ZERO(&readfds);
	
		//add master socket to set
		FD_SET(master_socket, &readfds);
		max_sd = master_socket;
			
		//add child sockets to set
		for ( i = 0 ; i < max_clients ; i++)
		{
			//socket descriptor
			sd = client_socket[i];
				
			//if valid socket descriptor then add to read list
			if(sd > 0)
				FD_SET( sd , &readfds);
				
			//highest file descriptor number, need it for the select function
			if(sd > max_sd)
				max_sd = sd;
		}
	
		//wait for an activity on one of the sockets , timeout is NULL ,
		//so wait indefinitely
		activity = select( max_sd + 1 , &readfds , NULL , NULL , NULL);
	
		if ((activity < 0) && (errno!=EINTR))
		{
			printf("select error");
		}
			
		//If something happened on the master socket ,
		//then its an incoming connection
		if (FD_ISSET(master_socket, &readfds))
		{
			if ((new_socket = accept(master_socket,
					(struct sockaddr *)&address, (socklen_t*)&addrlen))<0)
			{
				perror("accept");
				exit(EXIT_FAILURE);
			}
			
			//inform user of socket number - used in send and receive commands
			printf("New connection , socket fd is %d , ip is : %s , port : %d
				\n" , new_socket , inet_ntoa(address.sin_addr) , ntohs
				(address.sin_port));
		
			//send new connection greeting message
			if( send(new_socket, message, strlen(message), 0) != strlen(message) )
			{
				perror("send");
			}
				
			puts("Welcome message sent successfully");
				
			//add new socket to array of sockets
			for (i = 0; i < max_clients; i++)
			{
				//if position is empty
				if( client_socket[i] == 0 )
				{
					client_socket[i] = new_socket;
					printf("Adding to list of sockets as %d\n" , i);
						
					break;
				}
			}
		}
			
		//else its some IO operation on some other socket
		for (i = 0; i < max_clients; i++)
		{
			sd = client_socket[i];
				
			if (FD_ISSET( sd , &readfds))
			{
				//Check if it was for closing , and also read the
				//incoming message
				if ((valread = read( sd , buffer, 1024)) == 0)
				{
					//Somebody disconnected , get his details and print
					getpeername(sd , (struct sockaddr*)&address , \
						(socklen_t*)&addrlen);
					printf("Host disconnected , ip %s , port %d \n" ,
						inet_ntoa(address.sin_addr) , ntohs(address.sin_port));
						
					//Close the socket and mark as 0 in list for reuse
					close( sd );
					client_socket[i] = 0;
				}
					
				//Echo back the message that came in
				else
				{
					//set the string terminating NULL byte on the end
					//of the data read
					buffer[valread] = '\0';
					send(sd , buffer , strlen(buffer) , 0 );
				}
			}
		}
	}
		
	return 0;
}

Compile the file and run the server.
Use telnet to connect the server as a client.

Try running on different machines using following command:

telnet localhost 8888
Code explanation:
  • We have created a fd_set variable readfds, which will monitor all the active file descriptors of the clients plus that of the main server listening socket.
  • Whenever a new client will connect, master_socket will be activated and a new fd will be open for that client. We will store its fd in our client_list and in the next iteration we will add it to the readfds to monitor for activity from this client.
  • Similarly, if an old client sends some data, readfds will be activated and we will check from the list of existing client to see which client has send the data.

Frequently Asked Questions:

What is TCP socket programming?
Socket Programming is used to establish communication between two network nodes.

Is socket programming still used?
Yes, socket programming is still widely used.

What is the best language for socket programming?
Java and C#/C++ are the best languages for socket Programming.

What is a socket HTTP? Why is socket programming used?
Socket programming is used to create endpoints to establish communication between network nodes.

Can socket programming be done in Windows?
Yes, socket programming can be done in Windows using Winsock.

Chat-room application for multiple client with multithreading:

Chatroom-application GitHub link

C++, Programming

Post navigation

Previous Post: SOLID Design Principles in C++
Next Post: Function Templates with Multiple Parameters of different types

More Related Articles

C program to count number of digits in an integer C Programming
C program to create calculator using switch case and functions C Programming
C program to convert Octal to Hexadecimal number system C Programming
Deque in C++ STL C++
C program to find twos complement of a binary number C Programming
C program to check whether a character is alphabet, digit or special character C Programming

Comments (8) on “Socket Programming”

  1. ijeusupo says:
    June 12, 2022 at 4:51 pm

    http://slkjfdf.net/ – Egajiri Itnelocep zrq.ubnf.thecodepathshala.com.obl.iz http://slkjfdf.net/

    Reply
  2. eyfidoriki says:
    June 12, 2022 at 5:13 pm

    http://slkjfdf.net/ – Esoabu Asfufox bwv.owsj.thecodepathshala.com.euo.vy http://slkjfdf.net/

    Reply
  3. iikoiku says:
    August 8, 2022 at 11:34 pm

    http://slkjfdf.net/ – Itisibrar Ucujuy dtv.lhdo.thecodepathshala.com.oke.ct http://slkjfdf.net/

    Reply
  4. eqordopisu says:
    August 9, 2022 at 12:27 am

    http://slkjfdf.net/ – Epazufuce Irnisumoo ksp.ufze.thecodepathshala.com.oij.tg http://slkjfdf.net/

    Reply
  5. uzapoubaes says:
    August 9, 2022 at 1:31 am

    http://slkjfdf.net/ – Uweguji Enazocebe woy.zdkr.thecodepathshala.com.svh.tk http://slkjfdf.net/

    Reply
  6. ezifoteniqal says:
    August 9, 2022 at 10:42 am

    http://slkjfdf.net/ – Izijnupal Ucibetova wsq.obex.thecodepathshala.com.avw.kn http://slkjfdf.net/

    Reply
  7. vps says:
    September 17, 2022 at 6:28 pm

    you’re iin poont off faqct a excellent webmaster.
    The wweb site loading velocoty iss incredible. It seems that you’re ddoing any unjique trick.
    In addition, Thhe contents are masterwork. yyou have done
    a excellent preocess on this matter!

    Reply
  8. aqosexipovin says:
    October 4, 2022 at 12:28 am

    http://slkjfdf.net/ – Wotehn Oquwoyu osd.gcsj.thecodepathshala.com.gnb.ua http://slkjfdf.net/

    Reply

Leave a Reply to iikoiku Cancel reply

Your email address will not be published. Required fields are marked *

Archives

  • August 2025
  • March 2025
  • February 2025
  • January 2025
  • December 2024
  • August 2024
  • April 2024
  • March 2024
  • February 2024
  • January 2024
  • December 2023
  • November 2023
  • September 2023
  • February 2023
  • February 2022
  • January 2022
  • December 2021
  • November 2021
  • October 2021

Categories

  • Algo
  • Array in C
  • C Programming
  • C++
  • C++
  • Company Wise
  • Competitive Programming
  • Design Pattern
  • DS
  • DS & Algo
  • Fast and Slow Pointer
  • fixed size sliding window
  • General
  • GFG
  • GFG PTOD
  • Interview Questions
  • Leetcode Problems
  • Leetcode PTOD
  • Leetcode Top Interview 150
  • LLD
  • Low-level design
  • Mastering in C programming (Crash Course)
  • Programming
  • Roadmap
  • Setup
  • Setup
  • sliding window
  • SOLID Principle
  • STL
  • string in c
  • System Design
  • Top X

Tags

algorithm array bactracking basic c++ coding interview C Programming Crash Course data structure and algorithm design pattern dsa easy Fixed size sliding window fubctions GFD gfg GFG PTOD hard jump game LC PTOD leetcode Leetcode PTOD Leetcode Top Interview 150 LLD loop loops Low-level design Mastering C Programming in 15 Days matrix medium recursion rotate array searching&sorting sliding window solid STL string string in c sunction in c system design Template in C++ Top Top 20 coding patterns to master MAANG Interview Top interview 150

Want to clearly understand Time Complexity and Space Complexity of Queue for DSA and coding interviews? 🤔
In this video, we explain Queue Data Structure Complexity using simple examples, Big-O notation, and interview-focused concepts.

🚀 What You’ll Learn in This Video:

What is a Queue in Data Structures?

Queue Principle: FIFO (First In First Out)

Types of Queue (Simple, Circular, Priority, Deque)

Time Complexity of Queue Operations

Enqueue → O(1)

Dequeue → O(1)

Front / Peek → O(1)

Rear → O(1)

Search → O(n)

Space Complexity of Queue

Queue Implementation (Array vs Linked List)

Real-World Applications of Queue

Most Asked Queue Interview Questions

🎯 Why Watch This Video?
✔ Easy explanation of Big O Notation
✔ Important for Coding Interviews & Exams
✔ Useful for C, C++, Java, Python learners
✔ Beginner-friendly & exam-oriented

📌 Who Should Watch?

DSA Beginners

Computer Science Students

Coding Interview Aspirants

Competitive Programmers

📈 Master DSA Concepts Step-by-Step!

👍 Like | 💬 Comment | 🔔 Subscribe for more Data Structures & Algorithms content


🔖 Tags:
time complexity of queue
space complexity of queue
queue data structure
queue operations time complexity
big o notation queue
queue using array
queue using linked list
circular queue time complexity
queue interview questions
dsa queue tutorial
time and space complexity of queue,
time and space complexity problems,
time and space complexity python,
time and space complexity in ds,
time and space complexity of algorithm,
time and space complexity data structure,
calculating time and space complexity,
time and space complexity examples,
time and space complexity of dfs,
time and space complexity of an algorithm,
time and space complexity in c,
time and space complexity in c++,
finding time complexity and space complexity,
data structures time and space complexity,
data structure time and space complexity,
time and space complexity in dsa,
time and space complexity explained,
calculate space and time complexity,
space and time complexity in dsa,
time and space complexity of algorithms,
space and time complexity dsa,
time and space complexity algorithm,
calculate time and space complexity,
how to find time and space complexity of algorithms


🔖 Hashtags:

#QueueDataStructure
#TimeComplexity
#SpaceComplexity
#BigONotation
#DSA
#CodingInterview
#LearnDSA
#Programming
#ComputerScience
🔥 Time & Space Complexity of Queue | Queue Data Structure | Big-O Explained
Want to master Time Complexity and Space Complexity of Stack for DSA and coding interviews? 🤔
In this video, we explain Stack Data Structure Complexity using simple examples, Big-O notation, and interview-oriented explanations.

🚀 What You’ll Learn in This Video:

What is a Stack in Data Structures?

Stack Principle: LIFO (Last In First Out)

Time Complexity of Stack Operations

Push → O(1)

Pop → O(1)

Peek / Top → O(1)

Search → O(n)

Space Complexity of Stack

Stack Implementation (Array vs Linked List)

Real-World Applications of Stack

Common Stack Interview Questions

🎯 Why Watch This Video?
✔ Clear explanation of Big O Notation
✔ Essential for DSA Interviews & Exams
✔ Helpful for C, C++, Java, Python learners
✔ Beginner-friendly & concept-focused

📌 Who Should Watch?

DSA Beginners

Computer Science Students

Coding Interview Aspirants

Competitive Programmers

📈 Build Strong DSA Foundations – One Concept at a Time!

👍 Like | 💬 Comment | 🔔 Subscribe for more Data Structures & Algorithms videos


🔖 Tags:
time complexity of stack
space complexity of stack
stack data structure
stack operations time complexity
big o notation stack
stack using array
stack using linked list
stack interview questions
dsa stack tutorial
time and space complexity of stack,
time and space complexity dsa,
time and space complexity problems,
time and space complexity javascript,
time and space complexity in ds,
space and time complexity dsa,
time and space complexity of the algorithm,
space complexity and time complexity,
space and time complexity explained,
time complexity and space complexity explained,
time complexity and space complexity dsa,
time and space complexity in c++,
dsa space and time complexity,
time and space complexity explained,
time and space complexity of an algorithm,
time and space complexity in c,
finding time complexity and space complexity,
dfs time and space complexity,
space and time complexity java,
time and space complexity js,
data structures time and space complexity,
time and space complexity in dsa,
time and space complexity of dfs,
time and space complexity of recursion,
space and time complexity of algorithm,
space and time complexity in dsa,
time and space complexity of algorithms,
time and space complexity of algorithm,
calculating space and time complexity

🔖 Hashtags:
#StackDataStructure
#TimeComplexity
#SpaceComplexity
#BigONotation
#DSA
#CodingInterview
#LearnDSA
#Programming
#ComputerScience
🔥 Time & Space Complexity of Stack | Stack Data Structure | Big-O Explained
Linked list operations and time complexity | BigO notation #education #scaling #codinginterview
📌 Array Part-5 : Time and Space Complexity of Array | Data Structures & Algorithms

Tags:
time complexity of array
space complexity of array
array data structure time complexity
big o notation array
array operations time complexity
dsa array tutorial
array interview questions
data structures and algorithms

time and space complexity of array,
time and space complexity python,
time and space complexity dsa,
time and space complexity examples,
time and space complexity in recursion,
time and space complexity of algorithm,
data structures time and space complexity,
space and time complexity java,
time complexity and space complexity examples,
calculate time complexity and space complexity,
time complexity and space complexity python,
time complexity and space complexity explained,
calculate space and time complexity,
time and space complexity in c++,
time and space complexity in ds,
time and space complexity problems,
finding time complexity and space complexity,
algorithms time and space complexity,
time complexity of array,
space and time complexity dsa,
data structure time and space complexity,
time and space complexity js,
big o notation time and space complexity,
time and space complexity explained,
space and time complexity in dsa,
space and time complexity python,
time complexity and space complexity dsa,
calculate time and space complexity,
time and space complexity algorithm,
time and space complexity java

🔖 Hashtags:
#Array #TimeComplexity #SpaceComplexity #DSA #BigONotation #DataStructures #CodingInterview #ProgrammingBasics
#ArrayDataStructure
#TimeComplexity
#SpaceComplexity
#BigONotation
#DSA
#CodingInterview
#LearnDSA
#Programming
#ComputerScience
📌 Array Part-5 : Time and Space Complexity of Array | Data Structures & Algorithms
Struggling to understand Time Complexity and Space Complexity of Linked Lists? 🤔
This video explains Linked List Data Structure Complexity in a simple, interview-focused, and beginner-friendly way using Big-O notation and real examples.

🚀 What You’ll Learn in This Video:

What is a Linked List in Data Structures?

Types of Linked List (Singly, Doubly, Circular)

Time Complexity of Linked List Operations

Accessing Elements → O(n)

Searching → O(n)

Insertion → O(1) / O(n)

Deletion → O(1) / O(n)

Space Complexity of Linked List

Linked List vs Array (Complexity Comparison)

Most Asked DSA Interview Questions on Linked List

🎯 Why Watch This Video?
✔ Clear explanation of Big O Notation
✔ Perfect for Coding Interviews & Exams
✔ Useful for C, C++, Java, Python learners
✔ Beginner to Intermediate friendly

📌 Who Should Watch?

DSA Beginners

Computer Science Students

Coding Interview Aspirants

Competitive Programmers

📈 Master DSA Step-by-Step – Build Strong Foundations!

👍 Like | 💬 Comment | 🔔 Subscribe for more DSA & Programming videos

📌 Tags:
time complexity of linked list
space complexity of linked list
linked list data structure
linked list operations time complexity
big o notation linked list
linked list vs array
dsa linked list tutorial
linked list interview questions
linked list, time complexity, space complexity, data structures, algorithm analysis, big o notation, linked list operations, runtime efficiency, algorithm optimization, programming interviews, coding algorithms, data structure efficiency, linked list implementation, computational complexity, linked list design, performance analysis
time and space complexity of linked list,
time complexity of linked list,
time and space complexity of dfs,
time and space complexity of recursion,
time and space complexity in ds


🔖 Hashtags:
#Array #TimeComplexity #SpaceComplexity #DSA #BigONotation #DataStructures #CodingInterview #ProgrammingBasics
#ArrayDataStructure
#TimeComplexity
#SpaceComplexity
#BigONotation
#DSA
#CodingInterview
#LearnDSA
#Programming
#ComputerScience
#LinkedList
#TimeComplexity
#SpaceComplexity
#BigONotation
#DSA
#CodingInterview
#LearnDSA
#DataStructures
#Programming
🔥 Time & Space Complexity of Linked List | DSA Made Easy | Big-O Explained
📌 Array Part-4 : Time and Space Complexity of Array | Data Structures & Algorithms

Tags:
time complexity of array
space complexity of array
array data structure time complexity
big o notation array
array operations time complexity
dsa array tutorial
array interview questions
data structures and algorithms

time and space complexity of array,
time and space complexity python,
time and space complexity dsa,
time and space complexity examples,
time and space complexity in recursion,
time and space complexity of algorithm,
data structures time and space complexity,
space and time complexity java,
time complexity and space complexity examples,
calculate time complexity and space complexity,
time complexity and space complexity python,
time complexity and space complexity explained,
calculate space and time complexity,
time and space complexity in c++,
time and space complexity in ds,
time and space complexity problems,
finding time complexity and space complexity,
algorithms time and space complexity,
time complexity of array,
space and time complexity dsa,
data structure time and space complexity,
time and space complexity js,
big o notation time and space complexity,
time and space complexity explained,
space and time complexity in dsa,
space and time complexity python,
time complexity and space complexity dsa,
calculate time and space complexity,
time and space complexity algorithm,
time and space complexity java

🔖 Hashtags:
#Array #TimeComplexity #SpaceComplexity #DSA #BigONotation #DataStructures #CodingInterview #ProgrammingBasics
#ArrayDataStructure
#TimeComplexity
#SpaceComplexity
#BigONotation
#DSA
#CodingInterview
#LearnDSA
#Programming
#ComputerScience
📌 Array Part-4 : Time and Space Complexity of Array | Data Structures & Algorithms
when to use SQL and When NoSQL? #shorts #codinginterview #education #scaling #tranding
Confused between SQL and NoSQL databases? 🤔
In this video, we explain SQL vs NoSQL in detail, covering differences, use cases, real-world examples, and interview questions to help you choose the right database for your application.

🚀 What You’ll Learn in This Video:

What is SQL Database?

What is NoSQL Database?

SQL vs NoSQL – Key Differences

Structure & Schema

Data Model

Scalability

Performance

Consistency vs Availability

When to Use SQL Databases

When to Use NoSQL Databases

Real-World Use Cases & Examples

SQL vs NoSQL for Interviews & System Design

🎯 When to Use SQL?
✔ Structured data
✔ ACID transactions
✔ Banking & financial systems
✔ Complex queries & joins

🎯 When to Use NoSQL?
✔ Large-scale distributed systems
✔ Flexible / unstructured data
✔ High scalability & performance
✔ Real-time apps (Chat, Social Media, IoT)

📌 Who Should Watch?

Database & Backend Beginners

Full Stack Developers

System Design Learners

Coding Interview Aspirants

📈 Understand Databases Clearly – Choose the Right One!

👍 Like | 💬 Comment | 🔔 Subscribe for more Database & DSA Concepts

🔖 Tags:
sql vs nosql
difference between sql and nosql
when to use sql vs nosql
sql vs nosql interview questions
nosql vs sql use cases
sql database vs nosql database
mongodb vs mysql
database system design
sql vs nosql,
sql vs nosql system design,
sql vs nosql database,
sql vs nosql tradeoffs,
sql vs nosql difference,
sql vs nosql examples,
sql vs nosql bytebytego,
sql vs nosql or mysql vs mongodb,
sql vs nosql fireship,
sql vs nosql vs postgresql,
sql vs nosql arpit bhayani,
sql vs nosql academind,
sql and nosql apna college,
sql vs nosql what's the difference,
sql vs nosql db,
arpit bhayani sql vs nosql,
difference between sql vs nosql,
base de datos sql vs nosql,
bytebytego sql vs nosql,
bases de datos sql vs nosql,
sql vs nosql performance,
sql and nosql course,
sql and nosql full course,
sql vs nosql which one to choose,
compare sql vs nosql databases,
choosing database sql vs nosql in system design,
when to choose sql vs nosql,
sql vs nosql database system design,
sql vs nosql database hindi,
sql vs nosql deutsch,
sql vs nosql database tamil,
sql and nosql difference,
sql and nosql difference in hindi,
sql and nosql difference in tamil,
database sql vs nosql,
sql vs nosql ventajas y desventajas,
sql vs nosql explained,
sql vs mysql vs nosql,
sql vs nosql for mongodb,
t-sql vs sql,
when to use sql vs nosql,
sql vs nosql gaurav sen,
gaurav sen sql vs nosql,
sql database vs nosql database,
sql vs nosql hindi,
hello interview sql vs nosql,
sql vs nosql in hindi,
sql vs nosql interview questions,
sql vs nosql in tamil,
sql and nosql interview questions,
sql vs nosql what is the difference,
sql vs nosql use cases,
sql vs nosql vs newsql,
pl sql vs sql,
pl sql vs mysql,
sql vs nosql shreyansh,
sql vs nosql telugu,
sql vs nosql tamil,
sql and nosql tutorial,
sql vs mongodb tamil,
sql vs nosql when to use,
sql and nosql in tamil,
what is the difference between sql and nosql,
what is sql and nosql

🔖 Hashtags:

#SQLvsNoSQL
#Databases
#BackendDevelopment
#SystemDesign
#MongoDB
#MySQL
#Programming
#CodingInterview
🔥 SQL vs NoSQL | Differences | When & Where to Use? | Database Explained
📌 Array Part-3 : Time and Space Complexity of Array | Data Structures & Algorithms

Tags:
time complexity of array
space complexity of array
array data structure time complexity
big o notation array
array operations time complexity
dsa array tutorial
array interview questions
data structures and algorithms

time and space complexity of array,
time and space complexity python,
time and space complexity dsa,
time and space complexity examples,
time and space complexity in recursion,
time and space complexity of algorithm,
data structures time and space complexity,
space and time complexity java,
time complexity and space complexity examples,
calculate time complexity and space complexity,
time complexity and space complexity python,
time complexity and space complexity explained,
calculate space and time complexity,
time and space complexity in c++,
time and space complexity in ds,
time and space complexity problems,
finding time complexity and space complexity,
algorithms time and space complexity,
time complexity of array,
space and time complexity dsa,
data structure time and space complexity,
time and space complexity js,
big o notation time and space complexity,
time and space complexity explained,
space and time complexity in dsa,
space and time complexity python,
time complexity and space complexity dsa,
calculate time and space complexity,
time and space complexity algorithm,
time and space complexity java

🔖 Hashtags:
#Array #TimeComplexity #SpaceComplexity #DSA #BigONotation #DataStructures #CodingInterview #ProgrammingBasics
#ArrayDataStructure
#TimeComplexity
#SpaceComplexity
#BigONotation
#DSA
#CodingInterview
#LearnDSA
#Programming
#ComputerScience
📌 Array Part-3 : Time and Space Complexity of Array | Data Structures & Algorithms
Load More... Subscribe

Recent Posts

  • Palindrome Linked List
  • Find the Duplicate Number
  • Remove Nth Node From End of List
  • Linked List Cycle II
  • Decode the string | GFG PTOD | 01 Mar| Medium level | STACK

    Recent Comments

    1. Ozie Drumgole on C program to print multiplication table of a given number
    2. Denis Rojo on C program to print multiplication table of a given number
    3. Stephania Craze on C program to print multiplication table of a given number
    4. Glayds Sharp on C program to print multiplication table of a given number
    5. Oscar Langshaw on C program to print multiplication table of a given number

    Copyright © 2026 Learn to Code and Code to Learn.

    Powered by PressBook Blog WordPress theme