Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
49 changes: 49 additions & 0 deletions factorial-using-class.cpp
Original file line number Diff line number Diff line change
@@ -0,0 +1,49 @@
#include<iostream>
using namespace std;

class factorial
{
private:
int n,n1,f=1;
public:
void input();
void calc();
void display();
};

void factorial::input()
{
cout<<"\nEnter any number :: ";
cin>>n;
}

void factorial::calc()
{
n1=n;
if(n==0||n==1)
cout<<"\nFactorial of Number [ "<<n<<" ] is :: 1\n";
else
{
while(n>0)
{
f=f*n;
n--;
}
}

}

void factorial::display()
{
cout<<"\nFactorial of [ "<<n1<<" ] is :: "<<f<<"\n";
}

int main ()
{
factorial f;
f.input();
f.calc();
f.display();

return 0;
}
51 changes: 51 additions & 0 deletions queue-using-class.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,51 @@
class Queue(object):
def __init__(self, size):
self.queue = []
self.size = size

def __str__(self):
myString = ' '.join(str(i) for i in self.queue)
return myString

def enqueue(self, item):
if(self.isFull() != True):
self.queue.insert(0, item)
else:
print('Queue is Full!')

def dequeue(self):
if(self.isEmpty() != True):
return self.queue.pop()
else:
print('Queue is Empty!')

def isEmpty(self):
return self.queue == []

def isFull(self):
return len(self.queue) == self.size

def peek(self):
if(self.isEmpty() != True):
return self.queue[-1]
else:
print('Queue is Empty!')


if __name__ == '__main__':
myQueue = Queue(20)
myQueue.enqueue(41)
myQueue.enqueue(35)
myQueue.enqueue(62)

print(myQueue)

myQueue.enqueue(1)
myQueue.enqueue(2)
myQueue.enqueue(3)

print(myQueue)

myQueue.dequeue()

print(myQueue)