EmbLogic » bidlan.sourav91 https://www.emblogic.com/blog Embedded System and ARM Training Tue, 03 Mar 2020 13:00:06 +0000 en-US hourly 1 http://wordpress.org/?v=3.9.1 Sigaction https://www.emblogic.com/blog/05/sigaction/ https://www.emblogic.com/blog/05/sigaction/#comments Tue, 13 May 2014 11:09:29 +0000 http://www.emblogic.com/blog/?p=10082 Continue reading →]]> The sigaction system call is used to change the action taken by process on

receipt of a specific signal….It is used in program as:

sigaction(int,struct sigaction *new,struct sigaction *old);

Various macros used for sigaction are:

sigismember

sigaddset

sigdelset

sigemptyset

sigfillset

sigorset

sigandset

sigproemask

]]> https://www.emblogic.com/blog/05/sigaction/feed/ 0 Difference b/w character array and string array https://www.emblogic.com/blog/03/difference-bw-character-array-and-string-array/ https://www.emblogic.com/blog/03/difference-bw-character-array-and-string-array/#comments Thu, 27 Mar 2014 10:49:47 +0000 http://www.emblogic.com/blog/?p=9555 At the end, string array return a null character

but in case of character array it will not happen

]]> https://www.emblogic.com/blog/03/difference-bw-character-array-and-string-array/feed/ 0 linklist https://www.emblogic.com/blog/03/linklist-4/ https://www.emblogic.com/blog/03/linklist-4/#comments Tue, 25 Mar 2014 09:41:41 +0000 http://www.emblogic.com/blog/?p=9379 Continue reading →]]> In computer science, a linked list is a data structure consisting of a group of nodes which together represent a sequence. Under the simplest form, each node is composed of a datum and a reference (in other words, a link) to the next node in the sequence; more complex variants add additional links. This structure allows for efficient insertion or removal of elements from any position in the sequence.
Singly-linked-list.svg
A linked list whose nodes contain two fields: an integer value and a link to the next node. The last node is linked to a terminator used to signify the end of the list.

Linked lists are among the simplest and most common data structures. They can be used to implement several other common abstract data types, including lists (the abstract data type), stacks, queues, associative arrays, and S-expressions, though it is not uncommon to implement the other data structures directly without using a list as the basis of implementation.

]]> https://www.emblogic.com/blog/03/linklist-4/feed/ 0