Poco F1 Price in India, Specifications and Special features
POCO F1 Specifications !!
POCO F1 is a very powerful phone manufactured by POCO.
After the launch, the hype for this phone was going crazy.
People also loved this phone and many units were sold of POCO F1.
 |
| Poco F1 | |
|---|---|
| Network | GSM / HSPA / LTE |
| 2G bands | GSM 850 / 900 / 1800 / 1900 - SIM 1 & SIM 2 |
| 3G bands | HSDPA 850 / 900 / 1900 / 2100 |
| 4G bands | 1, 3, 5, 7, 8, 20, 38, 40, 41 |
| Speed | HSPA 42.2/5.76 Mbps, LTE-A (4CA) Cat16 1024/150 Mbps |
| OS and Hardware |
|
|---|---|
| OS | Android 8.1, upgradable to Android 9 MIUI 11 |
| Processor | Octa-core (4x2.8 GHz Kryo 385 Gold & 4x1.8 GHz Kryo 385 Silver) |
| Chipset | Qualcomm Snapdragon 845 |
| GPU | Adreno 630 |
| General | |
|---|---|
| Brand | Poco |
| Released Date | 22nd August 2018 |
| Launched in India | Yes |
| Model | Poco F1 |
| Custom UI | MIUI 11 |
| Charger Speed | 18W charger in the box |
| Sim size | Nano (both slots) |
| Body |
|
|---|---|
| Dimensions | 155.5 x 75.3 x 8.8 mm (6.12 x 2.96 x 0.35 in) |
| Weight | 182 g |
| Colors | Graphite Black, Steel Blue, Rosso Red, Armored Edition with Kevlar |
| Build | Glass front (Gorilla Glass), plastic back, plastic frame |
| Sim | Hybrid Dual sim slots |
| Protection | Gorilla Glass |
| Display |
|
|---|---|
| Type | IPS LCD capacitive touchscreen, 16M colours |
| Screen Size | 6.18 inches, 96.2 cm2 (~82.2% screen-to-body ratio) |
| Resolution | 1080 x 2246 pixels, 18.7:9 ratio (~403 ppi density) |
| Multitouch | Yes |
| Storage | |
|---|---|
| Memory Card slot | Yes |
| Variants | 6/64 GB, 6/128 GB, and 8/256 GB |
| Internal storage type | UFS 2.1 |
| RAM | 6 GB and 8 GB |
| Camera |
|
|---|---|
| Rare camera |
-12 MP, f/1.9, 1/2.55", 1.4µm, dual pixel PDAF, -5 MP, f/2.0, (depth) |
| Video quality | 4K@30/60fps, 1080p@30fps (gyro-EIS), 1080p@240fps, 720p@960fps |
| Front camera | -20 MP, f/2.0, (wide), 1/3", 0.9µm |
| Video quality | 1080p@30fps |
| Battery and Power | |
|---|---|
| Type | Non-removable Li-Po 4000 mAh battery |
| Charger Speed | 18W |
| Charging speed supported | 27W |
| Connectivity | |
|---|---|
| WiFi | Yes, Wi-Fi 802.11 a/b/g/n/ac |
| Bluetooth | Yes, Version 5.0 |
| GPS | Yes |
| Radio | Yes |
| USB | Yes, Type C |
| Loudspeaker | Yes |
| 3.5mm jack | Yes |
| Special Features | |
|---|---|
| Fingerprint sensor | Yes |
| Fingerprint sensor position | Rear-mounted |
| Other sensors | Accelerometer, Gyro, Compass, Proximity, Infrared face recognition |
| Price | |
|---|---|
| Indian Rs. |
6/64: Rs.19,999 6/128: Rs.18,999 8/256: Rs.22,999 |
| US Dollar |
6/64: $267 6/128: $256 8/256: $307 |
So what do you think about this phone?
Practical 1:
#sum of elements of array
arr=[1,2,3,4,5]
ans=sum(arr)
print("Sum of the array is",ans)
#searching an element in array
mylist=[]
print("Enter 5 elements for the list:")
for i in range(5):
val=int(input())
mylist.append(val)
print("Enter an element to be search:")
elem=int(input())
for i in range(5):
if elem==mylist[i]:
print("\n Element found at index:",i)
print("\n Element found at position:",i+1)
output:
Enter 5 elements for the list:
10
20
30
40
50
Enter an element to be search:
20
Element found at index: 1
Element found at position: 2
#finding minimum and maximum element in array
# Naive solution to find the minimum and maximum number in a list
def findMinAndMax(nums):
# initialize minimum and maximum element with the first element
max = min = nums[0]
# do for each element in the list
for i in range(1, len(nums)):
# if the current element is greater than the maximum found so far
if nums[i] > max:
max = nums[i]
# if the current element is smaller than the minimum found so far
elif nums[i] < min:
min = nums[i]
print('The minimum element in the list is', min)
print('The maximum element in the list is', max)
if __name__ == '__main__':
nums = [5, 7, 2, 4, 9, 6]
# find the minimum and maximum element, respectively
findMinAndMax(nums)
output:
The minimum element in the list is 2
The maximum element in the list is 9
#count the number of even and odd numbers in array
arr = [1, 7, 8, 4, 5, 16, 8]
n = len(arr)
countEven = 0
countodd = 0
for i in range(0, n):
if arr[i]%2==0 :
countEven += 1
else:
countodd += 1
print("Even Elements count : " )
print(countEven)
print("Odd Elements count : ")
print(countodd)
output:
Even Elements count :
4
Odd Elements count :
3
def BinarySearch(arr, k, low, high):
if high >= low:
mid = low + (high - low)//2
if arr[mid] == k:
return mid
elif arr[mid] > k:
return BinarySearch(arr, k, low, mid-1)
else:
return BinarySearch(arr, k, mid + 1, high)
else:
return -1
arr = [1, 3, 5, 7, 9]
k = 5
result = BinarySearch(arr, k, 0, len(arr)-1)
if result != -1:
print("Element is present at index " + str(result))
else:
print("Not found")
Prac Linear
def LinearSearch(array, n, k):
for j in range(0, n):
if (array[j] == k):
return j
return -1
array = [1, 3, 5, 7, 9]
k = 7
n = len(array)
result = LinearSearch(array, n, k)
if(result == -1):
print("Element not found")
else:
print("Element found at index: ", result)
Prac Bubble
def bubble_sort(nums):
# We set swapped to True so the loop looks runs at least once
swapped = True
while swapped:
swapped = False
for i in range(len(nums) - 1):
if nums[i] > nums[i + 1]:
# Swap the elements
nums[i], nums[i + 1] = nums[i + 1], nums[i]
# Set the flag to True so we'll loop again
swapped = True
# Verify it works
random_list_of_nums = [5, 2, 1, 8, 4]
bubble_sort(random_list_of_nums)
print(random_list_of_nums)
Selection sort prac
def selection_sort(nums):
# This value of i corresponds to how many values were sorted
for i in range(len(nums)):
# We assume that the first item of the unsorted segment is the smallest
lowest_value_index = i
# This loop iterates over the unsorted items
for j in range(i + 1, len(nums)):
if nums[j] < nums[lowest_value_index]:
lowest_value_index = j
# Swap values of the lowest unsorted element with the first unsorted
# element
nums[i], nums[lowest_value_index] = nums[lowest_value_index], nums[i]
# Verify it works
random_list_of_nums = [12, 8, 3, 20, 11]
selection_sort(random_list_of_nums)
print(random_list_of_nums)
Small large prac
arr = []
num = int(input("How many numbers: "))
for n in range(num):
numbers = int(input("Enter numbers "))
arr.append(numbers)
print("Maximum element : ", max(arr), "\nMinimum element : ", min(arr))
Fact prac
def factorial(x):
"""This is a recursive function
to find the factorial of an integer"""
if x == 1:
return 1
else:
# recursive call to the function
return (x * factorial(x-1))
# change the value for a different result
#num = 7
# to take input from the user
num = int(input("Enter a number: "))
# call the factorial function
result = factorial(num)
print("The factorial of", num, "is", result)
def recur_fibo(n):
if n <= 1:
return n
else:
return(recur_fibo(n-1) + recur_fibo(n-2))
# take input from the user
nterms = int(input("How many terms? "))
# check if the number of terms is valid
if nterms <= 0:
print("Plese enter a positive integer")
else:
print("Fibonacci sequence:")
for i in range(nterms):
print(recur_fibo(i))
