GATE CS 2014 Set 1 | Question: 50 Let S denote the set of all functions f:{0,1}4→{0,1}. Denote by N

preview_player
Показать описание
GATE CS 2014 Set 1 | Question: 50
Let S denote the set of all functions f:{0,1}4→{0,1}. Denote by N the number of functions from S to the set {0,1}. The value of log2⁡log2⁡N is _______.

Ans :16

0:00 Question
0:23 Solution
----------------------------------------------------
----------------------------------------------
----------------------------------------------------------------
----------------------------------------------------------------
----------------------------------------------------------------------
-------------------------------------------------------------------
-----------------------------------------------------------------------
#gate_cs #gate #maths #mathmatics #discretemathematicsgate #discrete_mathematics #discretemathematics #gate2024 #monalisacs #logic #proof #settheory #set #subset #venndiagram #onetoone #onto #function #functions #
  1. Monalisa CS
Рекомендации по теме
GATE CS 2014 0:04:11

GATE CS 2014 Set 1 | Question: 51 Consider an undirected graph G where self-loops are not allowed.

GATE CS 2014 0:02:41

GATE CS 2014 Set 1 | Question: 50 Let S denote the set of all functions f:{0,1}4→{0,1}. Denote by N...

GATE CS 2014 0:03:45

GATE CS 2014 Set 1 | Q1:Consider the statement  'Not all that glitters is gold”Predicate glitte...

GATE CS 2014,Set-1| 0:01:46

GATE CS 2014,Set-1| Q11:Let G be a graph with n vertices and m edges. What is the tightest upper ..

GATE CS PYQ 1:01:13

GATE CS PYQ Discussion (GATE – 2014 Set 1/2) | Computer Organization and Architecture

GATE CS 2014 0:01:50

GATE CS 2014 Set 1|Q14:Let P be quicksort program to sort numbers in ascending order using the first...

GATE CS 2014 0:03:47

GATE CS 2014 Set 1 | Question: 52 An ordered n−tuple (d1,d2,…,dn) with  d1 d2 dn  is called graphic...

GATE CS/IT 2014 0:05:23

GATE CS/IT 2014 set 1 | Seq no field

GATE CS 2014 0:07:07

GATE CS 2014 Set 1|Q53: Which one of the following propositional logic formulas is TRUE when exactly

GATE CS – 0:52:07

GATE CS – 2014 Set 1 & 2 DISCRETE MATHEMATICS (DM) PREVIOUS YEAR QUESTIONS (PYQs) Discussion

GATE CS 2014 0:01:07

GATE CS 2014 | Set 1, Question 44 | GATE CS Solution | GATE CS PYQs | Compiler Design

GATE CS 2014 0:01:16

GATE CS 2014 Set 1| Q39:The minimum number of comparisons required to find the minimum and the maxim

Programming: GATE 2014 0:05:59

Programming: GATE 2014 Set-1 CS/IT PREVIOUS YEAR SOLUTION

GATE CS 2014,Set-1,Q13:Consider 0:06:15

GATE CS 2014,Set-1,Q13:Consider the directed graph given below. Which one of the following is TRUE?

GATE CS 2014 0:03:31

GATE CS 2014 | Set 1 - Question 27 | GATE CS Solutions | GATE CS PYQs | Compiler Design

GATE CS PYQs 1:01:30

GATE CS PYQs Discussion (GATE – 2014 Set 1/2) | DATABASE MANAGMENT SYSTEM (DBMS)

GATE CS 2014 0:03:29

GATE CS 2014 | Set 1 - Question 49 | GATE CS MCQs | GATE CS PYQs | Algorithms and Design Analysis

Gate CS question 0:00:41

Gate CS question Set 1

GATE CS 2014 0:04:52

GATE CS 2014 Set 3 | Question: 49 Consider the set of all functions f:{0,1,…,2014}→{0,1,…,2014} such...

GATE CS 2015 0:03:10

GATE CS 2015 Set 1 | Question: 5 If g(x)=1-x and h(x)=𝑥/(𝑥−1) then g(ℎ(𝜘))/ℎ(g(𝑥)) is :...

GATE CS 2014 0:05:29

GATE CS 2014 Set 2 | Question: 50 Consider the following relation on subsets of the set S of integer...

GATE CS 2017 0:02:12

GATE CS 2017 Set 1 | Q 48: Let A be an array of 31 numbers consisting of a sequence of 0's foll...

GATE CS 2014 0:03:04

GATE CS 2014 - Set 2 - Que 15 | TOC | Regular Language | GATE CS PYQs | GATE CS Solutions

GATE CS 2014 0:03:48

GATE CS 2014 Set 1 | Q 40:Consider a hash table with 9 slots. The hash function is h(k)=k mod 9.