Hey welcome to HemChandraLive.blogspot.com
The Crowley Book PPT
https://drive.google.com/open?id=15QvA2ijE40ivcfms2YoOmF2L9olF94mk
The Crowley Book PPT
https://drive.google.com/open?id=15QvA2ijE40ivcfms2YoOmF2L9olF94mk
Wednesday, August 29, 2018
Monday, August 27, 2018
AICTE Scholarship : Step By Step Procedure to Register Yourself in AICTE Portal For Gate Scholarship
Hey , welcome in HemChandraLive.blogspot.com
Get your AICTE student ID From Your College .
Step 1: First go to below link
https://www.aicte-india.org/schemes/students-development-schemes/PG-Scholarship-Scheme/General-instruction
And scroll down and click on red circle Link .
Step 2 :You will get Below Screen
Choose State : (Your University State)
Institute Permanent ID : 1-1313XXX821
(If you don't know get it from https://drive.google.com/open?id=1UTLDWNUl3H4UkhF9DJCSXotgT4bwvK4R )
Student Id :
Date Of Birth :
Submit it . Below Screen will appear .
Step 3: Please fill all the details . And Don't forget to Upload Attested Documents . Read Below Instructions Carefully
Instructions for attachments
Get your AICTE student ID From Your College .
Step 1: First go to below link
https://www.aicte-india.org/schemes/students-development-schemes/PG-Scholarship-Scheme/General-instruction
And scroll down and click on red circle Link .
Choose State : (Your University State)
Institute Permanent ID : 1-1313XXX821
(If you don't know get it from https://drive.google.com/open?id=1UTLDWNUl3H4UkhF9DJCSXotgT4bwvK4R )
Student Id :
Date Of Birth :
Submit it . Below Screen will appear .
Step 3: Please fill all the details . And Don't forget to Upload Attested Documents . Read Below Instructions Carefully
Instructions for attachments
2. Documents in support of SC/ST/OBC (NCL)/Physically Handicapped certificate shall be attested by the institute principal or gazetted officer
3. SC/ST/OBC (NCL)/Physically Handicapped certificate should be in Hindi/English otherwise it should be translated and verified in Hindi/English by notary officer or by the principal in institute letter head. Student shall upload both original and translated certificate
4. All other attachments shall be self-attested by the candidate
Only clear and readable attachments shall be accepted
Fill permanent address and all others stuffs .
For Document upload .
Step 1: Click on attachment name it will ask for file location , Select it
Step 2: Choose Document Type (e.g. Bank Passbook , Gate Score Card etc )
Step 3: Click on + icon , and repeat Step 1 , 2 ,3 .
And at last Submit it .
Congratulations , you will receive stipend Soon😃.
--------------------------
Be careful of below things
1. Your bank account should be linked by Aadhar .
2. Bank Account should not be minor .
3. Your name , bank account name , aadhar name should be matched .
-----------
Important Links :
FAQ on Scholarship
https://www.aicte-india.org/sites/default/files/detailed%20advertisement%20-%20PG%20scholarship.pdf
http://www.aicte-india.org/sites/default/files/pg-process.pdf
Sunday, August 26, 2018
Find minimum number of currency notes and values that sum to given amount
Objective : This program will find the minimum number of currency notes and values that sum to given amount .
UOH Student Protest For Chappati
Python Code1 :
def demonitisation(amount):
notes=[2000,500,200,100,50,20,10,5,2,1]
while amount>0:
for i in range(0,len(notes)):
if amount>=notes[i]:
print("RS",notes[i]," , ",int(amount/notes[i])," Notes Requires")
amount=amount%notes[i];
amount=int(input("Enter the amount :: "));
#invalid entry condition check
if(amount<0):
print("Invalid Entry")
else:
demonitisation(amount)
Python Code 2:
amount=int(input("Enter amount :: "));
print("==================")
if amount >= 2000:
print("2000 ",int(amount/2000)," Rupee Note ");
amount=amount%2000;
if amount >=500:
print("500 ",int(amount/500)," Rupee Note");
amount=amount%500;
if amount>=200:
print("200 ",int(amount/200)," Rupee Note");
amount=amount%200;
if amount>=100:
print("100 ",int(amount/100)," Rupee Note");
amount=amount%100;
if amount>=50:
print("50 ",int(amount/50)," Rupee Note");
amount=amount%50;
if amount>=20:
print("20 ",int(amount/20)," Rupee Note")
amount=amount%20;
if amount>=10:
print("10 ",int(amount/10)," Rupee Note")
amount=amount%10;
if amount>=5:
print("5 ",int(amount/5)," Rupee Note")
amount=amount%5;
if amount>=2:
print("2 ",int(amount/2)," Rupee Note")
amount=amount%2;
if amount>=1:
print("1 ",amount," Rupee Note")
UOH Student Protest For Chappati
Python Code1 :
def demonitisation(amount):
notes=[2000,500,200,100,50,20,10,5,2,1]
while amount>0:
for i in range(0,len(notes)):
if amount>=notes[i]:
print("RS",notes[i]," , ",int(amount/notes[i])," Notes Requires")
amount=amount%notes[i];
amount=int(input("Enter the amount :: "));
#invalid entry condition check
if(amount<0):
print("Invalid Entry")
else:
demonitisation(amount)
Python Code 2:
amount=int(input("Enter amount :: "));
print("==================")
if amount >= 2000:
print("2000 ",int(amount/2000)," Rupee Note ");
amount=amount%2000;
if amount >=500:
print("500 ",int(amount/500)," Rupee Note");
amount=amount%500;
if amount>=200:
print("200 ",int(amount/200)," Rupee Note");
amount=amount%200;
if amount>=100:
print("100 ",int(amount/100)," Rupee Note");
amount=amount%100;
if amount>=50:
print("50 ",int(amount/50)," Rupee Note");
amount=amount%50;
if amount>=20:
print("20 ",int(amount/20)," Rupee Note")
amount=amount%20;
if amount>=10:
print("10 ",int(amount/10)," Rupee Note")
amount=amount%10;
if amount>=5:
print("5 ",int(amount/5)," Rupee Note")
amount=amount%5;
if amount>=2:
print("2 ",int(amount/2)," Rupee Note")
amount=amount%2;
if amount>=1:
print("1 ",amount," Rupee Note")
Friday, August 24, 2018
Tower Of Hanoi Code DSP Lab Problem
Hey welcome to HemChandraLive.blogspot.com
Tower of Hanoi is a mathematical puzzle. It consists of three poles and a number of disks of different sizes which can slide onto any poles.
The puzzle starts with the disk in a neat stack in ascending order of size in one pole, the smallest at the top thus making a conical shape.
The objective of the puzzle is to move all the disks from one pole (say ‘source pole’) to another pole (say ‘destination pole’) with the help of third pole (say auxiliary pole).
The puzzle has the following two rules:
1. You can’t place a larger disk onto smaller disk
2. Only one disk can be moved at a time
For n disks, total 2n – 1 moves are required.
Iterative Algorithm:
Code is below :
// C Program for Iterative Tower of Hanoi
#include <stdio.h>
#include <math.h>
#include <stdlib.h>
#include <limits.h>
// A structure to represent a stack
struct Stack
{
unsigned capacity;
int top;
int *array;
};
void moveDisk(char , char , int );
// function to create a stack of given capacity.
struct Stack* createStack(unsigned capacity)
{
struct Stack* stack =
(struct Stack*) malloc(sizeof(struct Stack));
stack -> capacity = capacity;
stack -> top = -1;
stack -> array =
(int*) malloc(stack -> capacity * sizeof(int));
return stack;
}
// Stack is full when top is equal to the last index
int isFull(struct Stack* stack)
{
return (stack->top == stack->capacity - 1);
}
// Stack is empty when top is equal to -1
int isEmpty(struct Stack* stack)
{
return (stack->top == -1);
}
// Function to add an item to stack. It increases
// top by 1
void push(struct Stack *stack, int item)
{
if (isFull(stack))
return;
stack -> array[++stack -> top] = item;
}
// Function to remove an item from stack. It
// decreases top by 1
int pop(struct Stack* stack)
{
if (isEmpty(stack))
return INT_MIN;
return stack -> array[stack -> top--];
}
// Function to implement legal movement between
// two poles
void moveDisksBetweenTwoPoles(struct Stack *src,
struct Stack *dest, char s, char d)
{
int pole1TopDisk = pop(src);
int pole2TopDisk = pop(dest);
// When pole 1 is empty
if (pole1TopDisk == INT_MIN)
{
push(src, pole2TopDisk);
moveDisk(d, s, pole2TopDisk);
}
// When pole2 pole is empty
else if (pole2TopDisk == INT_MIN)
{
push(dest, pole1TopDisk);
moveDisk(s, d, pole1TopDisk);
}
// When top disk of pole1 > top disk of pole2
else if (pole1TopDisk > pole2TopDisk)
{
push(src, pole1TopDisk);
push(src, pole2TopDisk);
moveDisk(d, s, pole2TopDisk);
}
// When top disk of pole1 < top disk of pole2
else
{
push(dest, pole2TopDisk);
push(dest, pole1TopDisk);
moveDisk(s, d, pole1TopDisk);
}
}
//Function to show the movement of disks
void moveDisk(char fromPeg, char toPeg, int disk)
{
printf("Move the disk %d from \'%c\' to \'%c\'\n",
disk, fromPeg, toPeg);
}
//Function to implement TOH puzzle
void tohIterative(int num_of_disks, struct Stack
*src, struct Stack *aux,
struct Stack *dest)
{
int i, total_num_of_moves;
char s = 'S', d = 'D', a = 'A';
//If number of disks is even, then interchange
//destination pole and auxiliary pole
if (num_of_disks % 2 == 0)
{
char temp = d;
d = a;
a = temp;
}
total_num_of_moves = pow(2, num_of_disks) - 1;
//Larger disks will be pushed first
for (i = num_of_disks; i >= 1; i--)
push(src, i);
for (i = 1; i <= total_num_of_moves; i++)
{
if (i % 3 == 1)
moveDisksBetweenTwoPoles(src, dest, s, d);
else if (i % 3 == 2)
moveDisksBetweenTwoPoles(src, aux, s, a);
else if (i % 3 == 0)
moveDisksBetweenTwoPoles(aux, dest, a, d);
}
}
// Driver Program
int main()
{
// Input: number of disks
unsigned num_of_disks = 8;
struct Stack *src, *dest, *aux;
// Create three stacks of size 'num_of_disks'
// to hold the disks
src = createStack(num_of_disks);
aux = createStack(num_of_disks);
dest = createStack(num_of_disks);
tohIterative(num_of_disks, src, aux, dest);
return 0;
}
#Solution has taken from Google and GeeksForGeeks
Iterative Method (Stack is implemented here ,using Linked List )
The puzzle starts with the disk in a neat stack in ascending order of size in one pole, the smallest at the top thus making a conical shape.
The objective of the puzzle is to move all the disks from one pole (say ‘source pole’) to another pole (say ‘destination pole’) with the help of third pole (say auxiliary pole).
The puzzle has the following two rules:
1. You can’t place a larger disk onto smaller disk
2. Only one disk can be moved at a time
For n disks, total 2n – 1 moves are required.
Iterative Algorithm:
1. Calculate the total number of moves required i.e. "pow(2, n) - 1" here
n is number of disks.
2. If number of disks (i.e. n) is even then interchange destination
pole and auxiliary pole.
3. for i = 1 to total number of moves:
if i%3 == 1:
legal movement of top disk between source pole and
destination pole
if i%3 == 2:
legal movement top disk between source pole and
auxiliary pole
if i%3 == 0:
legal movement top disk between auxiliary pole
and destination pole
Code is below :
// C Program for Iterative Tower of Hanoi
#include <stdio.h>
#include <math.h>
#include <stdlib.h>
#include <limits.h>
// A structure to represent a stack
struct Stack
{
unsigned capacity;
int top;
int *array;
};
void moveDisk(char , char , int );
// function to create a stack of given capacity.
struct Stack* createStack(unsigned capacity)
{
struct Stack* stack =
(struct Stack*) malloc(sizeof(struct Stack));
stack -> capacity = capacity;
stack -> top = -1;
stack -> array =
(int*) malloc(stack -> capacity * sizeof(int));
return stack;
}
// Stack is full when top is equal to the last index
int isFull(struct Stack* stack)
{
return (stack->top == stack->capacity - 1);
}
// Stack is empty when top is equal to -1
int isEmpty(struct Stack* stack)
{
return (stack->top == -1);
}
// Function to add an item to stack. It increases
// top by 1
void push(struct Stack *stack, int item)
{
if (isFull(stack))
return;
stack -> array[++stack -> top] = item;
}
// Function to remove an item from stack. It
// decreases top by 1
int pop(struct Stack* stack)
{
if (isEmpty(stack))
return INT_MIN;
return stack -> array[stack -> top--];
}
// Function to implement legal movement between
// two poles
void moveDisksBetweenTwoPoles(struct Stack *src,
struct Stack *dest, char s, char d)
{
int pole1TopDisk = pop(src);
int pole2TopDisk = pop(dest);
// When pole 1 is empty
if (pole1TopDisk == INT_MIN)
{
push(src, pole2TopDisk);
moveDisk(d, s, pole2TopDisk);
}
// When pole2 pole is empty
else if (pole2TopDisk == INT_MIN)
{
push(dest, pole1TopDisk);
moveDisk(s, d, pole1TopDisk);
}
// When top disk of pole1 > top disk of pole2
else if (pole1TopDisk > pole2TopDisk)
{
push(src, pole1TopDisk);
push(src, pole2TopDisk);
moveDisk(d, s, pole2TopDisk);
}
// When top disk of pole1 < top disk of pole2
else
{
push(dest, pole2TopDisk);
push(dest, pole1TopDisk);
moveDisk(s, d, pole1TopDisk);
}
}
//Function to show the movement of disks
void moveDisk(char fromPeg, char toPeg, int disk)
{
printf("Move the disk %d from \'%c\' to \'%c\'\n",
disk, fromPeg, toPeg);
}
//Function to implement TOH puzzle
void tohIterative(int num_of_disks, struct Stack
*src, struct Stack *aux,
struct Stack *dest)
{
int i, total_num_of_moves;
char s = 'S', d = 'D', a = 'A';
//If number of disks is even, then interchange
//destination pole and auxiliary pole
if (num_of_disks % 2 == 0)
{
char temp = d;
d = a;
a = temp;
}
total_num_of_moves = pow(2, num_of_disks) - 1;
//Larger disks will be pushed first
for (i = num_of_disks; i >= 1; i--)
push(src, i);
for (i = 1; i <= total_num_of_moves; i++)
{
if (i % 3 == 1)
moveDisksBetweenTwoPoles(src, dest, s, d);
else if (i % 3 == 2)
moveDisksBetweenTwoPoles(src, aux, s, a);
else if (i % 3 == 0)
moveDisksBetweenTwoPoles(aux, dest, a, d);
}
}
// Driver Program
int main()
{
// Input: number of disks
unsigned num_of_disks = 8;
struct Stack *src, *dest, *aux;
// Create three stacks of size 'num_of_disks'
// to hold the disks
src = createStack(num_of_disks);
aux = createStack(num_of_disks);
dest = createStack(num_of_disks);
tohIterative(num_of_disks, src, aux, dest);
return 0;
}
#Solution has taken from Google and GeeksForGeeks
Thursday, August 16, 2018
Is machine dominant the world ?
As I think , Yes.
The machine will dominant this world one day . Human nature is curious ,always search for something .
He does the experiment and in experiment he knows his objective but in ML not outcome .
Human has limitation , he has an emotion . Emotion puts always big effect in taking decision . While in the case of machine , emotion is absent . Human brain works as a parallel computing , we compute lot of data at a time .
a. Data of thoughts
b. Data of conclusion
Tuesday, August 7, 2018
Advance Operating System Problems
Problem1 : Write a script in shell or in python , which is able to store 50 commands which you have previous entered through terminal and execute each command .
Problem 2: Execute the program that will read the file content and print those content adding with line number and arranged in the alphabetical order
Problem 3: Read a file of 20 lines , information then print with line number and another file print only word list with their frequency of occurance and character counts in each word as another description of the word into the third file .
=========
Solutions
=========
Solution 1: Shell script
Step 1:Open terminal type Step 2 Code .
Step 2: ( We assume you have typed 50 commands through terminal )
fc -ln -50 > abc.sh
Description : The fc command is a command line utility for listing, editing and re-executing commands previously entered into an interactive shell.
Above command will save 50 previous commands into abc.sh
Step 3: chmod +x abc.sh
//give execute permission
Step 4: ./abc.sh
//execute command
Solution 2 : Please visit below url for file operation in Python
https://www.digitalocean.com/community/tutorials/how-to-handle-plain-text-files-in-python-3#step-1-%E2%80%94-creating-a-text-file
https://stackoverflow.com/questions/19001402/how-to-count-the-total-number-of-lines-in-a-text-file-using-python
https://www.programiz.com/python-programming/examples/alphabetical-order
#open file
days_file = open("hem.txt",'r')
num_lines = sum(1 for line in open('hem.txt'))
#print(num_lines)
count=1
#make a list of item
lines=list(days_file)
for lin in lines:
String=sorted(lin.split(), key=str.lower)
str1 = ' '.join(String)
print(count,str1)
count=count+1
days_file.close();
Solution 3:
Please go below link for more
https://www.pitt.edu/~naraehan/python2/split_join.html
https://developers.google.com/edu/python/strings
from collections import Counter
#open the file
filepath =open('xyz.txt')
#code 1
#store all file in lines
lines=filepath.readlines()
list=[]
#call till 20 values
for i in range(20):
#retrieve each line
String=lines[i]
print(i+1,":",String)
#split each word
words = String.split()
list.extend(words)
#print(words)
#print(list)
c=Counter(list)
c.values()
print("Word Frequency Count")
for key,value in c.items():
string=key
print(key,value,len(string)-string.count(' '))
3 Files in a zip .
I have used python 2.7+ .
https://drive.google.com/file/d/1Nn_K7hzge5nIhWX32xNeDNklo53CVsln/view?usp=sharing
Sunday, August 5, 2018
Part 6 Android Vs IOS , Simplified Version
Previous
https://hemchandralive.blogspot.com/2018/08/assignment-2-part-5-android-vs-ios.html
b. Features of ios
https://hemchandralive.blogspot.com/2018/08/assignment-2-part-5-android-vs-ios.html
b. Features of ios
Apple’s mobile operating system, iOS, contains a number of different features developed over its many versions and iterations since 2007. Many such features were, when first developed and introduced by Apple, lauded as innovative, even groundbreaking advances. The following sections detail the features introduced with the various iOS versions.
i) iPhone OS (iOS 1)
- Touchscreen: Apple includes a screen that responds to finger presses and swipes
- Pinch-to-Zoom: User can pinch the screen to zoom the view in or out
- Apple Safari web browser: A mobile version of Apple’s Web browser
- Itunes compatibility: USB connection to iTunes enabled computerTouchscreen keyboard: A touchscreen keyboard replaces physical buttons, allowing a much larger screen without sacrificing device compactness
- Hidden file system: Unlike with a computer, the user cannot directly access the files present on the device
- Home button: A button present on the front of the device allows user to return there from any app at any time
- Home screen web snippets: A quick view of the web is present on the home screen
- Multitouch keyboard: Keyboard can accept more than a single button press at a time
- Re-arrange home screen icons
- Wi-fi iTunes purchases: The user can make purchases from the device
ii) iPhone OS 2 (iOS 2)
- App store: The user can purchase apps from Apple
- Support for 3rd party apps: Users and companies can develop apps
- iOS Developer Kit: Code used to develop apps for third party support is available
- Contact search: Can search contacts by name
- Microsoft Exchange support: Push email and other features have support
- iTunes Genius support: Playlists created by iTunes based on past music
- Podcast downloads: Audio files downloadable from 3rd parties (audio books, web shows, etc.)
- Google Street View: Can view streets and maps from iPhone
iii) iPhone OS 3 (iOS 3)
- Copy/Paste capability: Text selectable to copy and paste
- Spotlight search: Can search a web page with keywords
- USB/Bluetooth tethering: Other mobile device scan access internet through iPhone
- Landscape keyboard: iPhone can be turned horizontally to make a two-fingered keyboard
- Find my iPhone: iPhone can be located and shutdown or wiped clean
- Voice control: iPhone can respond to voice commands such as call or send message (pre-Siri)
- Voice control over Bluetooth: User can use
- Bluetooth device to input voice commands
- Downloadable ringtones: New ringtones available for the iPhone
- Remote lock: Device can be shut off using mobile.me
iv) iphone iOS 4
- Multitasking: iPhone cannot run background apps, but can receive certain notifications from apps
- VideoChat: Can communicate through videos using iPhone
- Retina Display: iPhone display enhanced
- Threaded email: Email similar to text message threads in their display
- Game center: An organization app used to place all games in one place
- TV show rentals: iPhone can now display TV shows
- iTunes Ping: Social network specifically tailored to music
- Verion availability: iPhone now available to Verizon users
- 3G tethering: iPhone becomes hotspot for Wi-Fi enabled devices
v) iphone iOS 5
- Siri: Enhanced and interactive voice control
- PC-free: Device can be activated without a computer
- Notification center: A drop down notification center for organizing app actions
- iTunes Wi-Fi Sync: iPhone can share data back and forth with iTunes
- iCloud: A network the user can setup to connect all their Apple devices
- iMessage: Apple’s texting app
vi) iphone iOS 6
- Updates to Siri, FaceTime over cellular
- Photo Stream over iCloud
- Better sharing options throughout iOS
- Remodelling of the App Stores enhanced Safari with iCloud tabs
- VIP mail on the native Mail app and more emoji
- New calling features, allowing you to set a reminder to call back or reply with a text message.
vii) iphone iOS7
- New design
- IOS camera app
- Itunes Radio
- Apple control centre
- Notification bar
- Smart multi-tasking
- Air Drop.
viii) iphone iOS 8
- Elegant and intuitive interface.
- Built-in features and apps that make your device –and you – more capable.
- With the App Store, there’s almost no limit to what your iOS device can do.
- iCloud. Everything you need.Anywhere you need it.
- Easy to update.
- Safety and security come standard.
- Accessibility built in.
- Switch languages on the fly.
IV Software upgrades
Although Google does update Android frequently, some users may find that they do not receive the updates on their phone, or even purchase phones with out-of-date software.
Phone manufacturers decide whether and when to offer software upgrades. They may not offer an upgrade to the latest version of Android for all the phones and tablets in their product line. Even when an upgrade is offered, it is usually several months after the new version of Android has been released.
This is one area where iOS users have an advantage. iOS upgrades are generally available to all iOS devices.There could be exceptions for devices older than three years, or for certain features like Siri, which was available for iPhone 4S users but not for older versions of iPhone. Apple cites hardware capability as the reason some older devices may not receive all new features inan upgrade.V Building and Publishing Apps for iOS vs. Android .
Android apps are programmed using C, C++ and Java.It is an "open" platform; anyone can download the Android source code and Android SDK for free.Anyone can create and distribute Android apps for free;users are free to download apps from outside the official Google Play store. There is, however, a onetime $25 registration fee for developers who want to publish their apps (whether free or paid apps) on the official Google Play store. Apps published on Google Play undergo a review by Google. TheAndroid SDK is available for all platforms - Mac, PC and Linux.
iOS apps are programmed using Objective-C.Developers must pay $99 every year for access to the iOS SDK and the right to publish in Apple's app store. The iOS SDK is only available for the Mac platform. Some app development platforms - such as TitaniumAppcelerator and PhoneGap - offer a way to code once(say in JavaScript and/or HTML) and have the platformconvert it into "native" code for both Android and iOSplatforms.
Subscribe to:
Posts (Atom)
Behavior Recognition System Based on Convolutional Neural Network
Our this article is on this research paper . Credit : Bo YU What we will do ? We build a set of human behavior recognition syste...
-
Cloud Computing is today need of an Industry . Do you know where your data is stored when you upload data in gmail , dropbox etc . They al... -
Our this article is on this research paper . Credit : Bo YU What we will do ? We build a set of human behavior recognition syste... -
Following Link Contains Following CC Chapters 1. Intro 2. Distributed 3. XML 4. XML Schema 5. Web Services 6. Mod WebServices 7. F...