Home / MCQ Bank / Computer
Computer Html Multimedia Difficulty: Medium

The . . . . . . . . element must reference either an 'altGlyphDef' element or a 'glyph' element.

Select the correct option to test your answer:

More Computer Questions

What will be output for the given code? #include<bits/stdc++.h> using namespace std; string encrypter(string keyword) { string encoded = ""; bool arr[26] = {0}; for (int i=0; i<keyword.size(); i++) { if(keyword[i] >= 'A' && keyword[i] <= 'Z') { if (arr[keyword[i]-65] == 0) { encoded += keyword[i]; arr[keyword[i]-65] = 1; } } else if (keyword[i] >= 'a' && keyword[i] <= 'z') { if (arr[keyword[i]-97] == 0) { encoded += keyword[i] - 32; alpha[keyword[i]-97] = 1; } } } for (int i=0; i<26; i++) { if(arr[i] == 0) { arr[i]=1; encoded += char(i + 65); } } return encoded; } string ciphertxt(string msg, string encoded) { string cipher=""; for (int i=0; i<msg.size(); i++) { if (msg[i] >='a' && msg[i] <='z') { int pos = msg[i] - 97; cipher += encoded[pos]; } else if (msg[i] >='A' && msg[i] <='Z') { int pos = msg[i] - 65; cipher += encoded[pos]; } else { cipher += msg[i]; } } return cipher; } int main() { string keyword; keyword = "cipher"; string encoded = encrypter(keyword); string message = "hello"; cout << ciphertxt(message,encoded) << endl; return 0; } . . . . . . is a class which can only be instantiated once. You can effectively only have one object per . . . . . class in an application. What will be the output of the following C# code? static void Main(string[] args) { int i = 5; int j = 6; add(ref i); add(6); Console.WriteLine(i); Console.ReadLine(); } static void add(ref int x) { x = x * x; } static void add(int x) { Console.WriteLine(x * x * x); } Chukwa . . . . . . . . are responsible for accepting incoming data from Agents, and storing the data. How many times is the function recursive_get_len() called when the following code is executed? #include<stdio.h> #include<stdlib.h> struct Node { int val; struct Node *next; }*head; int recursive_get_len(struct Node *current_node) { if(current_node == 0) return 0; return 1 + recursive_get_len(current_node->next); } int main() { int arr[10] = {-1,2,3,-3,4,5}, n = 6, i; struct Node *temp, *newNode; head = (struct Node*)malloc(sizeof(struct Node)); head->next = 0; temp = head; for(i=0; i<n; i++) { newNode = (struct Node*)malloc(sizeof(struct Node)); newNode->val = arr[i]; newNode->next = 0; temp->next = newNode; temp = temp->next; } int len = recursive_get_len(head->next); printf("%d",len); return 0; }