Scribd
Upload
3 views6 pages

Interview Questions

The document outlines various technical topics related to computer science and programming, including interrupt handling, synchronization mechanisms like mutexes and semaphores, and data structures such as linked lists. It also covers concepts like endianness, process management, and algorithmic challenges like sorting and finding elements in arrays. Additionally, it touches on differences between programming languages and techniques for memory management and optimization.

Uploaded by

guavapoddam
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
3 views6 pages

Interview Questions

The document outlines various technical topics related to computer science and programming, including interrupt handling, synchronization mechanisms like mutexes and semaphores, and data structures such as linked lists. It also covers concepts like endianness, process management, and algorithmic challenges like sorting and finding elements in arrays. Additionally, it touches on differences between programming languages and techniques for memory management and optimization.

Uploaded by

guavapoddam
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
You are on page 1/ 6

Table 1

->Interrupt sub
routine
->Workqueue
->Stackoverflow
->count set bit
->Process and
thread
->Deadlock
->Linkedlist
->mutex vs spin
lock -
>Function pointer
->call back
function

1
->Mutex
->Semaphores
-> Spinlock
->Overloading and
overriding
->Loop in a linked
list
->Threads ,
Process
synchronisation
->IPC
->Process context
->Interupt context
->No of ones in a
number in binary
->Little endian to
big endian
convertion -
>Interrupts
->Exceptions
->Program address
-> register
character driver
-> can we use a
single module for
two different
devices
->demand
paging ->
Storage classes.
-> Stages of
compilation and
detailed description
->
direct memory
access
-> How
shecduler in OS
works how it knows
which processor will
start and end
-> what is
cross complier is
used for

->find the
number of ones in
binary
representation of
the number using
most optimal
bitwise operation
-> find
whether the
number is power of
2 or not
-> use power of
two to find number
of one’s in a
number
-> how do u take
care of number
overflow
-> check whether
a number is
palindrome or not
for any number
without using
strings and long int
->different
levels of cache
->find
the number of one’s
in binary
representation from
1 to n.
-> implement
power function
pow(x,n). X,n are
integers. n can be
negative. In most
optimized way.
-> print a number
by byte by byte
2
-> difference
between struct and
union
threads lo
programs, threads,
linked list, design
patterns, pointers,
memory leaks, tpc,
udp protocols, no
deadlocks, strings,
find length in place
of s.len(), use
google if you want.

Threads ela ,
ekada, lo mutex
lock, mutex unlock,
wait, sorting code
requirement

3
1. what is top half and bottom half and how this works 2. interrupt ha

4
1) Difference
between c vs
c++ 2)
Difference
between
references vs
pointers 3)
Difference
between
macro vs
inline 4) Code
to find
Endianness 5)
Mutex vs
spinlock

Merge Sort,
Height of a
binary tree
Finding no of
1s in a binary
number. A
quick sort
variant was
asked.
Finding single
number in a
array with
duplicates.
Threads vs
process
Deadlocks
definition and
how OS
handles it.
Find common
intersection in
2 linked list
Find loop in
linked list.

https://www.glassdoor.co.in/Interview/Qualcomm--Engineer-Interview

5
macros, scope
resolution
operators
Basics of
electronics
like working
of ADC etc.

You might also like