Follow me on Linkdin:

Hello Guys you can Follow me on Linkdin here.
Amit yadav

Comments

Post a Comment

Popular posts from this blog

Image
Why should you reverse-engineer the brain? Great thing about the Reverse engineering While some of thinking machines have mastered specific narrow skills — playing chess, for instance — general-purpose artificial intelligence (AI) has remained elusive. Part of the problem, some experts now believe, is that artificial brains have been designed without much attention to real ones. Pioneers of artificial intelligence approached thinking the way that aeronautical engineers approached flying without much learning from birds. It has turned out, though, that the secrets about how living brains work may offer the best guide to engineering the artificial variety. Discovering those secrets by reverse-engineering the brain promises enormous opportunities for reproducing intelligence the way assembly lines spit out cars or computers. Figuring out how the brain works will offer rewards beyond building smarter computers. Advances gained from studying the brain may in return pay dividen...
Read more
Program of Inserting a number in a sorted linked list #include <stdio.h> #include<stdio.h> #define NULL 0 struct linked_list { int number; struct linked-list *next; }; typedef struct linked_lit node; main() { int n; node *head; void create(node *p); node *insert(node *p, int n); void print(node *p); head = (node *)malloc( sizeof (node)); create(head); printf(“\n”); printf(“Original list: “); print(head); printf(“\n\n”); printf(“Input number to be inserted: “); scanf(“%d”, &n); head = inert(head,n); printf(“\n”); printf(“New list: “); print(head); } void create(node *list) { printf(“Input a number \n”); printf(“(type –999 at end): “); scanf(“%d”, &list->number); if (list->number == -999) { list->next = NULL; } else /* create next node */ { list->next = (node *)malloc( sizeof (node)); create(list->next); ...
Read more