I m beginner . Can anyone help me

Anyone please??

I m beginner . Can anyone help me

What's up?

I m good bro

Can you help me?? Talpa😇

so hello

admin u have channel c/c++

?

if u have can u throw the link

Lol

Speak in russ?

Can anyone teach me dynamic programming?

Can anyone teach me dynamic programming?

Or give some tutorial videos link🙂

can i somehow remove #define with g++ compilation flags?

this doesn't work for some reason

can i somehow remove #define with g++ compilation flags?

#undef

can i somehow remove #define with g++ compilation flags?

compilation flags cannot remove #define definitions because the preprocessor will run after the flags are processed

oh k thanks :D

In c++ using new keyword we use dynamic memory allocation, but in that case I used array with index size 3 and when I use above 3 index their is (array index out of bound I expect) but no error found

Refer above code

Remove it

Or you will get a warning from admin

In c++ using new keyword we use dynamic memory allocation, but in that case I used array with index size 3 and when I use above 3 index their is (array index out of bound I expect) but no error found

This is because while declaring array size momory gets flow . This is the drawback of array in c/c++

/warn install telegram desktop and make a normal screenshot or use pastebin.com for your code.

Okay

This is because while declaring array size momory gets flow . This is the drawback of array in c/c++

Explain me in detail

This happens because you have enough memory available on your ram

Explain me in detail

Due to this when you try to access next index which is not declared it allows bcs the mory is free

As you know array stores element in a contigious way

This happens because you have enough memory available on your ram

Same code not excute in java

Same code not excute in java

Ya

It's drawback of c

Named as memory flow

Named as memory flow

don't invent terminology

Same code not excute in java

C doesn't check for array bounds. the job is delegated to the programmers. either you can use the array properly and make sure that there are no out of bounds accesses, or take a performance hit and use a library that implements a container with bounds checking.

it's all about trade-offs

https://github.com/stephenrkell/libcrunch The medium-term goal is ... performs usably well (hopefully no worse than half native speed, usually better).

Or just use C++

In c++ using new keyword we use dynamic memory allocation, but in that case I used array with index size 3 and when I use above 3 index their is (array index out of bound I expect) but no error found

that's an undefined behavior and you MUST always prevent such behaviors (say by checking array range)

Or just use C++

well, they were already using Java

well, they were already using Java

🤢

In c++ using new keyword we use dynamic memory allocation, but in that case I used array with index size 3 and when I use above 3 index their is (array index out of bound I expect) but no error found

i just noticed that you were already talking about C++. C++ already has libraries such as smart pointers that hide the new/delete calls, std::array and std::vector that implement arrays with optional bounds checking. std::vector<int> arr; // dynamic array with 0 elements at the moment arr[2] = 4; // undefined behaviour, use carefully. no performance loss arr.at(2) = 4; // throws exception for array out of bounds. performance hit PS - both of the above styles are kinda sorta bad. iterators are almost always the best way to access library containers, not indices.

Can anyone guide me as to how I can write a program in C that cns apply a subnet mask on an IP address?

That can*

I know and understand how to use htonl and ntohl, and the inet_pton, inet_ntop functions to manipulate the string IP address and the binary form of IP address

But I can't think of how to manipulate the bits of binary for of IP, so as to apply any subnet mask

Basically, I can't figure out "what" to AND with the binary IP address

Can anyone guide me as to how I can write a program in C that cns apply a subnet mask on an IP address?

Could you specify it a little and give some examples of input and output?

Could you specify it a little and give some examples of input and output?

For example, if the input IP address (given as a char string) 192.168.1.154, and a given subnet mask of 24 (CIDR form), then the output string will store 192.168.1.0

*actually ignore the word CIDR

So, you would give it 192.168.1.154/24, and it would give you 192.168.1.0?

So, you would give it 192.168.1.154/24, and it would give you 192.168.1.0?

In string format, yes

So, you would give it 192.168.1.154/24, and it would give you 192.168.1.0?

Actually, the input would simply be the IP address 192.168.1.154, not the /24

Is it always 24?

Is it always 24?

Not. It's ranging from 16 to 30

16 for the subnet mask of 255.255.0.0, up till 30, which is 255.255.255.0

We'll be given "char mask" in the arguments

Char means it would be character type.

Is it always 24?

Shall I send the image of the problem statement for better clarity? (If allowed)

Here's pseudocode to do the ANDing: ip_address & ((pow(2, mask) - 1) << (32 - mask))

Where ip_address is a uint32_t with the IP address arranged in big endian (192.168.1.154 would, in hexadecimal, be 0xc0 0xa8 0x01 0x9a).

Where ip_address is a uint32_t with the IP address arranged in big endian (192.168.1.154 would, in hexadecimal, be 0xc0 0xa8 0x01 0x9a).

Correct

Here's pseudocode to do the ANDing: ip_address & ((pow(2, mask) - 1) << (32 - mask))

You just made this up right now? It did you use some resources?

You just made this up right now? It did you use some resources?

I just made it up, it's just some simple math.

I just made it up, it's just some simple math.

Right x(

does stackoverflow occur if I call a function that calls another function and continues so on... ? it is not a recursion btw, just calling a function inside another one

Suggest a beginner project apart from game

does stackoverflow occur if I call a function that calls another function and continues so on... ? it is not a recursion btw, just calling a function inside another one

A function calling function is called recursion and stack will overflow if complier isn't optimising tail recursion.

ahh i forgot

i am doing GUI thing. There are multiple functions that contain Main Event Loops of different pages... For example, if the user presses CONTINUE, the program proceeds and another Main Event Loop function of different page will be called. The process continues until the user presses SAVE or something similar... Doesn't this lead to stackoverflow or it is better to change the architecture of the program?

Suggest a beginner project apart from game

network stuff, distributed systems

simplified distributed systems*

network stuff, distributed systems

Anything else?

A game server

Anything else?

TCP/IP stack implementation?

Suggest a beginner project apart from game

Hello world

TCP/IP stack implementation?

I think I have to go with this

Hello world

Funny

I think I have to go with this

Start with imitating the network as a graph. Then add networking properties like IP, MAC, subnet. Then implement a CLI to this. And keep going.

May I suggest a Udemy course for this project?