C

• 

  UNSOLVED Argument for getc to check for EOF is not working.
  • Rachel O  

  3
  3
  Posts
  12
  Views

  

  @avan
  The input was a text file that contained the following:
  The year 1866 was signalized by a remarkable incident, a mysterious and inexplicable phenomenon, which doubtless no one has yet forgotten.
  Not to mention rumours which agitated the maritime population and excited the public mind, even in the interior of continents, seafaring
  men were particularly excited. Merchants, common sailors, captains of vessels, skippers, both of Europe and America, naval officers of all
  countries, and the Governments of several States on the two continents, were deeply interested in the matter.

• 

  UNSOLVED DATA STRUCTURES IN C
  • KNV  

  1
  1
  Posts
  3
  Views

  No one has replied

• 

  SOLVED Write algorithms to add and delete elements from either end of the deque.
  • Shavy Gaming  

  2
  2
  Posts
  13
  Views

  

  Hey @Shavy-Gaming

  I don't know C but with a little bit of googling I was able to find a Java implementation of a deque using a one-dimensional array.

  Here is the link:

  https://codereview.stackexchange.com/questions/120722/array-based-deque-in-java

  Here is the solution found on the page. You might be able to understand it enough to implement a C version of it. Keep in mind the main method just tests the Deque in this case. Good luck!

  import java.util.NoSuchElementException; import java.util.Random; public class Deque { private final int arr[]; private int head; private int size; public Deque(int capacity) { arr = new int[capacity]; } public void addLast(int element) { checkCapacity(); arr[(head + size++) % arr.length] = element; } public void addFirst(int element) { checkCapacity(); if (head == 0) { arr[(head = arr.length - 1)] = element; } else { arr[(--head) % arr.length] = element; } size++; } public int removeFirst() { checkNotEmpty(); int ret = arr[head]; head = (head + 1) % arr.length; size--; return ret; } public int removeLast() { checkNotEmpty(); int ret = arr[(head + size - 1) % arr.length]; size--; return ret; } @Override public String toString() { StringBuilder sb = new StringBuilder("["); for (int i = 0; i < size; ++i) { sb.append(arr[(head + i) % arr.length]); if (i < size - 1) { sb.append(", "); } } return sb.append("]").toString(); } public int size() { return size; } private void checkCapacity() { if (arr.length == size) { throw new IllegalStateException("No more space is available."); } } private void checkNotEmpty() { if (size == 0) { throw new NoSuchElementException("Trying to pop an empty deque."); } } public static void main(String args[]) { Deque deque = new Deque(10); Random random = new Random(); for (int op = 0; op < 30; ++op) { if (deque.size() == 0) { int num = random.nextInt(100); System.out.print("Adding " + num + " to front: "); deque.addLast(num); System.out.println(deque); } else { boolean add = random.nextBoolean(); if (add) { boolean front = random.nextBoolean(); int num = random.nextInt(100); if (front) { System.out.print("Adding " + num + " to front: "); deque.addFirst(num); System.out.println(deque); } else { System.out.print("Adding " + num + " to back: "); deque.addLast(num); System.out.println(deque); } } else { boolean front = random.nextBoolean(); if (front) { System.out.print("Removing from front: "); deque.removeFirst(); System.out.println(deque); } else { System.out.print("Removing from back: "); deque.removeLast(); System.out.println(deque); } } } } } }
• 

  SOLVED why this code is not giving o/p as 3?
  • AshutoshxxTeotia  

  2
  2
  Posts
  4
  Views

  

  Hey @AshutoshxxTeotia

  How about something like this

  main(); int main() { printf("%d",tried(1,2)); } void tried(int a,int b) { int c=a+b; return c; }
• 

  UNSOLVED To write a C program that will add elements of array using 3 child processes and a parent
  c programming fork linux system calls unix • • darkpandawarrior  

  2
  2
  Posts
  8
  Views

  

  Hi @darkpandawarrior

  I have never done real programming in C but let's see if I can point you in the right direction. You are probably going to end up using global static variables

  static int *sum_10;

  So declare those outside of the main method.
  Then you will probably end up using mmap so something like

  sum_10 = mmap(NULL, sizeof *sum_10, PROT_READ | PROT_WRITE, MAP_SHARED | MAP_ANONYMOUS, -1, 0);

  Then initialize each global variable somewhere in main

  *sum_10 = 0;

  Now you you have a set of global variables that can be shared with all processes which is the real challenge in this assignment.

  Hope you figure it out. Let me know if you need more help.

• L

  SOLVED Function (split_string_at_index) given string & index , can't figure out how pass back to main after splitting into source_left and right
  • learntocode  

  7
  7
  Posts
  10
  Views

  L

  Thanks again and I will do that.