Iam3R

[CODE] #include <gst/gst.h> #include <stdbool.h> static GMainLoop *loop; static gbooleanbus_call (GstBus *bus,GstMessage *msg, gpointer user_data) { switch (GST_MESSAGE_TYPE (msg)) { case GST_MESSAGE_EOS: { g_message ("End-of-stream"); g_main_loop_quit (loop); break; } case GST_MESSAGE_ERROR: { gchar *debug; GError *err; gst_message_parse_error (msg, &err, &debug); g_free (debug); g_error ("%s", err->message); g_error_free (err); g_main_loop_quit (loop); break; …

i have just written a small program on DEV C++. i have been using it for couple of months but i never observed this error. [CODE] #include<stdio.h> int main() { printf("Welcome\n"); system("PAUSE"): return 0; } [/CODE] could not create makefile I/o error 32 any idea? what does that mean

please provide the free pdf link of k & R c prog lang. i spent lot of time in googling but couldnot get it. thanks in adv.

[QUOTE]which would make p1d the name of an array of 5 pointers to type int.[/QUOTE] this one [CODE] int *p1d[5];[/CODE]

foa i believe this is not a bubble sort . and [QUOTE]for(n=1;n<size1;n++)[/QUOTE] is worng because in the process all ready sorted ( in descending order ) elements again go up. when i =0 n goes from 1-4 n = 1 to 4 all are less than 8 no replacements when …

Dont know these types of questions are asked here or not but if any one has idea please help me. i just started started learning system programming and want to pursue a career in the sys prog area. below is the program that use a fork() call. i read in …

[QUOTE]I got my function to work somewhat but it only prints the number of occurrences of the first word of the last line in the last line only. [/QUOTE] because you are calling the function [ICODE]search_string(line); [/ICODE] after the statement [CODE]while ( fgets ( line, sizeof line, file ) != …

[QUOTE=miskeen;1035838]But, is there any proposed solution to what I'm looking for?[/QUOTE] you can also use function pointers to do same thing.

Hello , i have written the code for finding the middle element of the list with 0(n) complexity. please gurus, verify that and let me know if it needs any modifications and ofcourse i have question to ask when the no of elements are odd we can easily find the …

[QUOTE=kat_stephens;1034585]I'm currently working with a group of my classmates on a recipe measurement converter, and I'm currently on the most difficult code of the three that is my part of the project. The code is basically for getting the amount from the user, a fraction. I have based my algorithm …

written a code for finding nth last element but no idea how to caluculate complexity. how can i make this, of 0(n) complexity. [CODE]// p is position of element to find int nthlast(struct node *n, int p) { struct node *f, *s; if(n) { int cnt=0; f = n;// start …

I am very poor in calculating complexities. Please some one let me know what is the complexity of the below program. I actually want to write a program for finding the nth last element with 0(n) complexity. but unable write, please give me some idea. the below code works perfectly …

Hello every one, i have written the following program for testing getch function behaviour. but, as soon as i run the program i am getting segmentation fault. i dont understand the problem. i am using GCC compiler on Linux Environment. i want to test the key scan program. [CODE] #include<ncurses.h> …

if i use this in a program its keep on taking the return key the program not getting terminated, whats the problem? [CODE]scanf("%d\n",&j)[/CODE]