AjayKrP

#include<iostream>
#include<string>
#include<exception>
#include<queue>
#define NULL __null
using namespace std;

class node{
public:
	node* create_node(string key, string meaning);

AjayKrP

#include<iostream>
#include<string>
#include<queue>
#include<stack>
#define NULL __null
using namespace std;

class node{
public:
	node* create_node(int data);

AjayKrP

#include<iostream>
#include<queue>
#define NULL __null
using namespace std;
bool found = false;
class node{
public:
    node* create_node(string key, string meaning);
    node* insert_node(node* root, string key, string meaning);
    void print_node(node* root);

AjayKrP

#include <iostream>
#include <vector>
#include <algorithm>
int graph[5][5];
int find_minimum(int row, int n){
    std::vector<int >vec(n);
    for(int i = 0;i<n;++i){
        if(graph[row][i] != 0) {
            vec.push_back(graph[row][i]);
        }

AjayKrP

#include <iostream>
#include <vector>
#include <algorithm>
int graph[5][5];
int find_minimum(int row, int n){
    std::vector<int >vec(n);
    for(int i = 0;i<n;++i){
        if(graph[row][i] != 0) {
            vec.push_back(graph[row][i]);
        }

AjayKrP

#include <stdio.h>
#include <math.h>
#include <GL/glut.h>

double X1, Y1, X2, Y2;

float round_value(float v)
{
  return floor(v + 0.5);
}

AjayKrP

#include<stdio.h>
#include<GL/glut.h>
#include<iostream>
using outcode = int;

class Clipping{
public:
   Clipping():RIGHT(8), LEFT(2), TOP(4), BOTTOM(1){
    xmin = 50;
    ymin = 50;

AjayKrP

;give input in the range of -2147483648 to 2147483647 to the array.

section    .data
nline        db    0xa
nline_len:    equ    $-nline

arr32        dd    -11111111H, -11111112H, 01111113H, -01111111H, 11111112H, 11111112H, -11111112H, 11141112H,-11115112H, 11111412H
n:        equ    10
pmsg        db    0xa,'The no. of Positive elements in 32-bit array :    '

AjayKrP

 section .data
            nline                db        10,10
            nline_len:         equ      $-nline
            msg                  db        10,10," Hex to BCD & BCD to Hex conversion"
                                    db        10,"---------------------------------------------"
            msg_len:          equ      $-msg
            menu               db        10,"-----------Menu----------"
                                    db        10,"1. Hex to BCD "
                                    db        10,"2. BCD to Hex"
                                    db        10,"3. Exit "

AjayKrP

;****************************************************************************
;Write X86/64 ALP to perform non-overlapped and overlapped block transfer
;(with and without string specific instructions).
;Block containing data can be defined in the data segment.
;Macro Deffination
;****************************************************************************


%macro exit 0
mov eax,1