Infovision Labs


Process synchronization like pipe, fifo, fork, mmap , vfork etc.

Producer- consumer problem (coding)

#include <mutex>
#include <memory>
#include <iostream>
#include <thread>
#include <string>
using namespace std;
#define NA -128
int queue[50] = {NA};
int index = 0;
int front_index =0;
std::mutex m;
void consumer()
{

  while(1)
  {
   unique_lock<std::mutex> lck(m);  
    
    if(front_index >= 0)  
    {
      // then consume
      front_index++;
      std::cout << queue[front_index] <<endl;
      queue[front_index] = NA;
       
    }
     else
    {
        break;
    }
  } 
}

void producer()
{
  while(1)
  {
    unique_lock<std::mutex> lck(m);
    // wait for input
          // then produce
    for(int i=0; i < 10; i++)
    {
        cin >> data;
        if(front_index <= index && index <50)
        {
          index++;
          queue[index] = data;
        }
        else
        {
          front_index =0;
          index= 0;
          break;
        }
    }
    // index = 10
  }  
}

int main()
{
 
 
  thread th1(consumer);
  thread th2(producer);
 
    return 0;
}
 

Comments

Post a Comment

Popular posts from this blog

GlobalLogic Interview

 Toplevel traversal in a BST Class with parent virtual function defined (program) Virtual destructor copy constructor, copy constructor why do we give reference Polymorphism Frequency of characters in "globallogic" If we declare a constructor as private, can we create an object ? Ans: we can't create object on stack but we can create on heap using new  Even or odd using Thread coding question #include <thread> #include <iostream> using namespace std; void even_func(int n) {     if(n%2 == 0)     {         cout << "Number is even" <<endl;     }      } void odd_func(int n) {     if(n%2 != 0)     {         cout << "Number is odd" <<endl;     }      } int main() {      for(int i=0; i< 100; i++)      {         thread th1(even_func, i);         thre...
Read more

Motorola(Dynamic Technologies) Kolkata

 #include <stdio.h> #define MAX_SIZE 30 int stack[30]; static int size; int push(int a) {    if(size >= MAX_SIZE)    {        printf("overflow\n");        return 0;    }   else {       stack[size++] = a;       return 1;   } } int pop() {     if(size < 0)     {         printf("underflow\n");         return -1;     }     else {          return stack[size--];     } } int main() {     char *c = "(((5+7)*6)/2)";     while(*c != '\0')     {          switch(*c)          {              case '1':              case '2':case '3':case '4':case '5':case '6': case '7':case '8':case '9':case '0':case '+':case '-':cas...
Read more

Euronet interview questions

Some questions were from test4geeks  void GetSomeVariable(int **i) {    if(*i == NULL)    {       *i = new int;    }   **i = 20;   } int main() {    int someValue = 10;    GetSomeVariable(&someValue);    cout << someValue <<endl;        int *ptr = nullptr;    GetSomeVariable(&ptr);    cout << *ptr <<endl; } How to make the code compilable without changing GetSomeVariable? Solution: Use Function overloading or Type traits #include <iostream> #include <type_traits> void g(int*) { std::cout << 'L'; } void g(int**) { std::cout << 'R'; } template<typename T> void f(T t) {     if (std::is_same_v<T, int>) { std::cout << 1; }      if (std::is_same_v<T, int*>) { std::cout << 2; }      if (std::is_same_v<T, int**>) { std::cout <...
Read more