Technical Test | Synoriq | Campus Recruitment Drive

Approved & Edited by ProProfs Editorial Team

The editorial team at ProProfs Quizzes consists of a select group of subject experts, trivia writers, and quiz masters who have authored over 10,000 quizzes taken by more than 100 million users. This team includes our in-house seasoned quiz moderators and subject matter experts. Our editorial experts, spread across the world, are rigorously trained using our comprehensive guidelines to ensure that you receive the highest quality quizzes.

Learn about Our Editorial Process

| By Astateofchaos

Astateofchaos

Community Contributor

Quizzes Created: 1 | Total Attempts: 430

Questions: 15 | Attempts: 430 | Updated: Mar 21, 2023

Questions

Settings

Create your own Quiz

Technical Test | Synoriq | Campus Recruitment Drive - Quiz

Questions and Answers

Quiz Review Timeline +

Our quizzes are rigorously reviewed, monitored and continuously updated by our expert board to maintain accuracy, relevance, and timeliness.

Current Version
Mar 21, 2023

Quiz Edited by
ProProfs Editorial Team
Nov 25, 2018

Quiz Created by
Astateofchaos

Technical Test | Synoriq | Campus Recruitment Drive

Find the error: f(int a, int b) { int a, a=20; return a; }

#include int main() { void fun(int, int[]); int arr[]= {1, 2, 3, 4}; int i; fun (4, arr); for(i= 0; i<4; i++) printf(“%d,”, arr[i]); return 0; } void fun(int n, int arr[]) { int *p=0; int i=0; while(i++

Int main() { int color=2; switch(color) { case 0 : printf(“black”); case 1 : printf(“blue”); case 2 : printf(“green”); case 3 : printf(“aqua”); case 4 : printf(“other”); } return 0; }

#include int main() { struct node { int a, b, c; }; struct node num = {3, 5, 6}; struct node ptr = & num; printf("%d\n", ((int*)ptr + 1 + (3-2))); return 0; }

#include //Assuming int size is 4 bytes //64 bit compiler int main() { printf("%d", sizeof(void *)); return 0; }

Int a=0, b=0; for(i=0; i<N; i++) { a= a+rand(); } for(j=0; j<M; j++) { b= b+rand(); }

The number of comparisons done by sequential search is

In C programming, if we need to store word “INDIA” then syntax is as below:

Which of the following is not included in a style sheet?

What resolution do you keep while creating a website mockup in Adobe Photoshop?

What is the name of design language standards as described by Apple?

Which of the following is not a relational database?

In general which of these joins will return the maximum number of records?

Which command is used to give privileges to database users in RDBMS:

Which is a CSS framework just like Bootstrap?

Technical Test | Synoriq | Campus Recruitment Drive

Find the error: f(int a, int b) { int a, a=20; return a; }

#include int main() { void fun(int, int[]); int arr[]= {1, 2, 3, 4}; int i; fun (4, arr); for(i= 0; i<4; i++) printf(“%d,”, arr[i]); return 0; } void fun(int n, int arr[]) { int *p=0; int i=0; while(i++

Int main() { int color=2; switch(color) { case 0 : printf(“black”); case 1 : printf(“blue”); case 2 : printf(“green”); case 3 : printf(“aqua”); case 4 : printf(“other”); } return 0; }

#include int main() { struct node { int a, b, c; }; struct node num = {3, 5, 6}; struct node *ptr = & num; printf("%d\n", *((int*)ptr + 1 + (3-2))); return 0; }

#include //Assuming int size is 4 bytes //64 bit compiler int main() { printf("%d", sizeof(void *)); return 0; }

Int a=0, b=0; for(i=0; i<N; i++) { a= a+rand(); } for(j=0; j<M; j++) { b= b+rand(); }

The number of comparisons done by sequential search is

In C programming, if we need to store word “INDIA” then syntax is as below:

Which of the following is not included in a style sheet?

What resolution do you keep while creating a website mockup in Adobe Photoshop?

What is the name of design language standards as described by Apple?

Which of the following is not a relational database?

In general which of these joins will return the maximum number of records?

Which command is used to give privileges to database users in RDBMS:

Which is a CSS framework just like Bootstrap?

#include int main() { struct node { int a, b, c; }; struct node num = {3, 5, 6}; struct node ptr = & num; printf("%d\n", ((int*)ptr + 1 + (3-2))); return 0; }