tanayseven

#include<stdio.h>
#include<iostream>
#include<malloc.h>
struct stack      
{
	int info;
	struct stack *next;
};

//typedef struct stack *s;

tanayseven

#include<stdio.h>
#include<malloc.h>
struct stack      
{
	int info;
	struct stack *next;
};
typedef struct stack *s;

void push(s sptr ,int p)

tanayseven

#include<stdio.h>
#include<iostream>
#include<malloc.h>
struct stack      
{
	int info;
	struct stack *next;
};

//typedef struct stack *s;

tanayseven

#include <unistd.h>
#include <sys/types.h>
#include <stdio.h>
#include <stdlib.h>
int main()
{
        pid_t pid, p;
        int n, *num, i, j, temp;
        pid = getpid();
        printf("Parent process executing\n");

tanayseven

//to implement NFA for language L={aba^n U abab^n | n >= 0 }
import java.io.*;
class LanguageNFA
{
        static void checkLang(String str)
        {
                char foo;
                int state = 0;
                for(int i = 0 ; i < str.length() ; i++)
                {

tanayseven

        include io.h

        cr equ 0dh
        lf equ 0ah

        stack   SEGMENT STACK
                DW 100h dup(?)
        stack   ends

        data    SEGMENT

tanayseven

include io.h

cr equ 0dh
lf equ 0ah

stack   SEGMENT STACK
        DW 100h dup(?)
stack   ends

data    SEGMENT

tanayseven

;program to find the sum of 3 numbers and also its average
INCLUDE io.h

Cr EQU 0ah
Lf EQU 0dh


data SEGMENT
p_a DB cr, lf, 'Enter a: ',0
p_b DB lf, 'Enter b: ',0

tanayseven

;program to find the value of the foll. exp. (a+b)-(c+d)
INCLUDE io.h

Cr EQU 0ah
Lf EQU 0dh


data SEGMENT
p_a DB cr, lf, 'Enter a: ',0
p_b DB lf, 'Enter b: ',0

tanayseven

;program to enter 2 nos. and check the largest of the two
INCLUDE io.h

Cr EQU 0ah
Lf EQU 0dh


data SEGMENT
p_n1 DB cr, lf, 'Enter n1: ',0
p_n2 DB lf, 'Enter n2: ',0